On the complexity of ontological reasoning under disjunctive existential rules

Authors:
Georg Gottlob;Marco Manna;Michael Morak;Andreas Pieris
Affiliations:
Department of Computer Science, University of Oxford, UK,Oxford-Man Institute of Quantitative Finance, University of Oxford, UK,Institute for the Future of Computing, Oxford Martin School, UK;Department of Computer Science, University of Oxford, UK,Department of Mathematics, University of Calabria, Italy;Department of Computer Science, University of Oxford, UK;Department of Computer Science, University of Oxford, UK
Venue:
MFCS'12 Proceedings of the 37th international conference on Mathematical Foundations of Computer Science
Year:
2012

Citing 25
Cited 3

On the complexity of bounded-variable queries (extended abstract)

PODS '95 Proceedings of the fourteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Disjunctive datalog

ACM Transactions on Database Systems (TODS)
The expressive power of stratified logic programs with value invention

Information and Computation
The entity-relationship model—toward a unified view of data

ACM Transactions on Database Systems (TODS) - Special issue: papers from the international conference on very large data bases: September 22–24, 1975, Framingham, MA
Foundations of Databases: The Logical Level

Foundations of Databases: The Logical Level
The Implication Problem for Data Dependencies

Proceedings of the 8th Colloquium on Automata, Languages and Programming
The complexity of relational query languages (Extended Abstract)

STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
The description logic handbook: theory, implementation, and applications

The description logic handbook: theory, implementation, and applications
Data exchange: semantics and query answering

Theoretical Computer Science - Database theory
Tractable Reasoning and Efficient Query Answering in Description Logics: The DL-Lite Family

Journal of Automated Reasoning
A comparison of two modelling paradigms in the Semantic Web

Web Semantics: Science, Services and Agents on the World Wide Web
The chase revisited

Proceedings of the twenty-seventh ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Generalized schema-mappings: from termination to tractability

Proceedings of the twenty-eighth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
A general datalog-based framework for tractable query answering over ontologies

Proceedings of the twenty-eighth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Least common subsumers and most specific concepts in a description logic with existential restrictions and terminological cycles

IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
Pushing the EL envelope

IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
Reasoning on UML class diagrams

Artificial Intelligence
Linking data to ontologies

Journal on data semantics X
Query answering under non-guarded rules in datalog+/-

RR'10 Proceedings of the Fourth international conference on Web reasoning and rule systems
Querying the Guarded Fragment

LICS '10 Proceedings of the 2010 25th Annual IEEE Symposium on Logic in Computer Science
Datalog+/-: A Family of Logical Knowledge Representation and Query Languages for New Applications

LICS '10 Proceedings of the 2010 25th Annual IEEE Symposium on Logic in Computer Science
Advanced processing for ontological queries

Proceedings of the VLDB Endowment
On rules with existential variables: Walking the decidability line

Artificial Intelligence
Extending decidable existential rules by joining acyclicity and guardedness

IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume Two
Disjunctive datalog with existential quantifiers: Semantics, decidability, and complexity issues

Theory and Practice of Logic Programming

Querying the guarded fragment with transitivity

ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part II
Answer set programming

RW'13 Proceedings of the 9th international conference on Reasoning Web: semantic technologies for intelligent data access
The impact of disjunction on query answering under guarded-based existential rules

IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence

Quantified Score

Hi-index	0.00

Visualization

Abstract

Ontology-based data access is an emerging yet powerful technology that allows to enhance a classical relational database with an ontology in order to infer new intensional knowledge. Recently, Datalog+/- was introduced with the purpose of providing tractable reasoning algorithms for expressive ontology languages. In this framework, Datalog is extended by features such as existential quantification in rule heads, and at the same time the rule syntax is restricted to guarantee decidability, and also tractability, of relevant reasoning tasks. In this paper, we enrich Datalog even more by allowing not only existential quantification but also disjunction in rule heads, and we investigate the complexity of reasoning under the obtained formalism.