Results 1 - 10
of
6,911
Extending XQuery for Semantic Web Reasoning
- In Procs of the International Conference on Applications of Declarative Programming and Knowledge Management, INAP’09
, 2009
"... Abstract. In this paper we investigate an extension of the XQuery language for querying and reasoning with OWL-style ontologies. The proposed extension incorporates new primitives (i.e. boolean operators) in XQuery for the querying and reasoning with OWL-style triples in such a way that XQuery can ..."
Abstract
-
Cited by 3 (2 self)
- Add to MetaCart
Abstract. In this paper we investigate an extension of the XQuery language for querying and reasoning with OWL-style ontologies. The proposed extension incorporates new primitives (i.e. boolean operators) in XQuery for the querying and reasoning with OWL-style triples in such a way that XQuery can
S.: Semantic web reasoning by swarm intelligence
- In: The 5th International Workshop on Scalable Semantic Web Knowledge Base Systems (SSWS2009
, 2009
"... Abstract. Semantic Web reasoning systems are confronted with the task to process growing amounts of distributed, dynamic resources. This paper presents a novel way of approaching the challenge by RDF graph traversal, exploiting the advantages of swarm intelligence. The natureinspired and index-free ..."
Abstract
-
Cited by 6 (2 self)
- Add to MetaCart
Abstract. Semantic Web reasoning systems are confronted with the task to process growing amounts of distributed, dynamic resources. This paper presents a novel way of approaching the challenge by RDF graph traversal, exploiting the advantages of swarm intelligence. The natureinspired and index
Semantic Web Reasoning for Analyzing Gene Expression Profiles
- Proc. PPSWR 2006, LNCS 4187
"... Abstract. We argue that Semantic Web reasoning is an ideal tool for analyzing gene expression profiles and the resulting sets of differentially expressed genes produced by high-throughput microarray experiments, especially since this involves combining not only very large, but also semantically and ..."
Abstract
-
Cited by 2 (2 self)
- Add to MetaCart
Abstract. We argue that Semantic Web reasoning is an ideal tool for analyzing gene expression profiles and the resulting sets of differentially expressed genes produced by high-throughput microarray experiments, especially since this involves combining not only very large, but also semantically
Pregel: A system for large-scale graph processing
- IN SIGMOD
, 2010
"... Many practical computing problems concern large graphs. Standard examples include the Web graph and various social networks. The scale of these graphs—in some cases billions of vertices, trillions of edges—poses challenges to their efficient processing. In this paper we present a computational model ..."
Abstract
-
Cited by 496 (0 self)
- Add to MetaCart
Many practical computing problems concern large graphs. Standard examples include the Web graph and various social networks. The scale of these graphs—in some cases billions of vertices, trillions of edges—poses challenges to their efficient processing. In this paper we present a computational
Tor: The secondgeneration onion router,”
- in 13th USENIX Security Symposium. Usenix,
, 2004
"... Abstract We present Tor, a circuit-based low-latency anonymous communication service. This second-generation Onion Routing system addresses limitations in the original design by adding perfect forward secrecy, congestion control, directory servers, integrity checking, configurable exit policies, an ..."
Abstract
-
Cited by 1229 (33 self)
- Add to MetaCart
, and a practical design for location-hidden services via rendezvous points. Tor works on the real-world Internet, requires no special privileges or kernel modifications, requires little synchronization or coordination between nodes, and provides a reasonable tradeoff between anonymity, usability
Parallelization Techniques for Semantic Web Reasoning Applications
"... Abstract. Performance is the most critical aspect towards achieving high scalability of Semantic Web reasoning applications, and considerably limits the application areas of them. There is still a deep mismatch between the requirements for reasoning on a Web scale and performance of the existing rea ..."
Abstract
- Add to MetaCart
Abstract. Performance is the most critical aspect towards achieving high scalability of Semantic Web reasoning applications, and considerably limits the application areas of them. There is still a deep mismatch between the requirements for reasoning on a Web scale and performance of the existing
Semantic Web reasoning for ontologybased integration of resources
- In: H.J. Ohlbach and S. Schaffert (Editors), Workshop on Principles and Practice of Semantic Web Reasoning LNCS. Springer-Verlag Berlin
, 2004
"... Abstract. The Semantic Web should enhance the current World Wide Web with reasoning capabilities for enabling automated processing of possibly distributed information. In this paper we describe an architecture for Semantic Web reasoning and query answering in a very general setting involving several ..."
Abstract
-
Cited by 4 (0 self)
- Add to MetaCart
Abstract. The Semantic Web should enhance the current World Wide Web with reasoning capabilities for enabling automated processing of possibly distributed information. In this paper we describe an architecture for Semantic Web reasoning and query answering in a very general setting involving
Approximating description logic classification for semantic web reasoning.
- Proc. 2nd European Semantic WebConf. (ESWC’05),
, 2005
"... Abstract. In many application scenarios, the use of the Web ontology language OWL is hampered by the complexity of the underlying logic that makes reasoning in OWL intractable in the worst case. In this paper, we address the question whether approximation techniques known from the knowledge represe ..."
Abstract
-
Cited by 23 (4 self)
- Add to MetaCart
Abstract. In many application scenarios, the use of the Web ontology language OWL is hampered by the complexity of the underlying logic that makes reasoning in OWL intractable in the worst case. In this paper, we address the question whether approximation techniques known from the knowledge
Semantic web reasoning with conceptual logic programs
- Proceedings of the Third International Workshop on Rules and Rule Markup Languages for the Semantic Web (RuleML 2004
, 2004
"... Abstract. We extend Answer Set Programming with, possibly infinite, open domains. Since this leads, in general, to undecidable reasoning, we restrict the syntax of programs, while carefully guarding useful knowledge representation mechanisms such as negation as failure and inequalities. Reasoning wi ..."
Abstract
-
Cited by 14 (6 self)
- Add to MetaCart
with the resulting Conceptual Logic Programs can be reduced to finite, normal Answer Set Programming, for which reasoners are available. We argue that Conceptual Logic Programming is a useful tool for uniformly representing and reasoning with both ontologies and rules on the Semantic Web, as they can capture a large
Integrating Semantic Web Reasoning and Answer Set Programming
- In Proc. ASP-2003
, 2003
"... We integrate an expressive class of description logics (DLs) and answer set programming by extending the latter to support inverted predicates and infinite domains, features that are present in most DLs. The extended language, conceptual logic programming (CLP) proves to be a viable alternative f ..."
Abstract
-
Cited by 13 (0 self)
- Add to MetaCart
for intuitively representing and reasoning nonmonotonically, in a decidable way, with possibly infinite knowledge. Not only can conceptual logic programs (CLPs) simulate finite answer set programming, they are also flexible enough to simulate reasoning in an expressive class of description logics, thus being
Results 1 - 10
of
6,911