Complexity and expressive power of logic programming
ACM Computing Surveys (CSUR)
ICDE '05 Proceedings of the 21st International Conference on Data Engineering
Dual Labeling: Answering Graph Reachability Queries in Constant Time
ICDE '06 Proceedings of the 22nd International Conference on Data Engineering
ELP: Tractable Rules for OWL 2
ISWC '08 Proceedings of the 7th International Conference on The Semantic Web
DL-Lite: tractable description logics for ontologies
AAAI'05 Proceedings of the 20th national conference on Artificial intelligence - Volume 2
Web Semantics: Science, Services and Agents on the World Wide Web
Combining RDF and part of OWL with rules: semantics, decidability, complexity
ISWC'05 Proceedings of the 4th international conference on The Semantic Web
A survey of the web ontology landscape
ISWC'06 Proceedings of the 5th international conference on The Semantic Web
Applicability assessment of Semantic Web technologies
Information Processing and Management: an International Journal
RDFS and OWL reasoning for linked data
RW'13 Proceedings of the 9th international conference on Reasoning Web: semantic technologies for intelligent data access
Hi-index | 0.00 |
A basic cornerstone of the Semantic Web are formal languages for describing resources in a clear and unambiguous way. Logical underpinnings facilitate automated reasoning about distributed knowledge on the Web and thus make it possible to derive only implicitly available information. Much research is geared to advancing very expressive formalisms that add increasingly complex modelling constructs. However, this increase in language expressivity is often intrinsically linked to higher computational cost and often leads to formalisms that have high theoretical complexity and that are difficult to implement efficiently. In contrast, reasoning in the context of the Web has a distinct set of requirements, namely inference systems that can scale to planetary-size datasets. A reduced level of expressivity is often sufficient for many practical scenarios and crucially, absolutely necessary when reasoning with such massive datasets. These requirements have been acknowledged by active research towards more lightweight formalisms and also by industrial implementations that often implement only tractable subsets of existing standards. In this paper we aim to explore this trend and formulate a basic language, called L2, layered upon RDF as the data-model, that is inherently tractable, easy to implement on common rule engines and motivated by pragmatic considerations concerning the use of language constructs and the means to implement them.