A Proof Procedure for Data Dependencies
Journal of the ACM (JACM)
Conceptual structures: information processing in mind and machine
Conceptual structures: information processing in mind and machine
The monadic second-order logic of graphs. I. recognizable sets of finite graphs
Information and Computation
The theory of joins in relational databases
ACM Transactions on Database Systems (TODS)
Testing implications of data dependencies
ACM Transactions on Database Systems (TODS)
Foundations of Databases: The Logical Level
Foundations of Databases: The Logical Level
Reformulation of XML Queries and Constraints
ICDT '03 Proceedings of the 9th International Conference on Database Theory
Data Exchange: Semantics and Query Answering
ICDT '03 Proceedings of the 9th International Conference on Database Theory
Sound and Complete Forward and backward Chainingd of Graph Rules
ICCS '96 Proceedings of the 4th International Conference on Conceptual Structures: Knowledge Representation as Interlingua
The Implication Problem for Data Dependencies
Proceedings of the 8th Colloquium on Automata, Languages and Programming
On the decidability and complexity of query answering over inconsistent and incomplete databases
Proceedings of the twenty-second ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Embedded implicational dependencies and their inference problem
STOC '81 Proceedings of the thirteenth annual ACM symposium on Theory of computing
Optimal implementation of conjunctive queries in relational data bases
STOC '77 Proceedings of the ninth annual ACM symposium on Theory of computing
Data exchange: semantics and query answering
Theoretical Computer Science - Database theory
Containment of conjunctive object meta-queries
VLDB '06 Proceedings of the 32nd international conference on Very large data bases
Tractable Reasoning and Efficient Query Answering in Description Logics: The DL-Lite Family
Journal of Automated Reasoning
Proceedings of the twenty-seventh 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
Extensions of simple conceptual graphs: the complexity of rules and constraints
Journal of Artificial Intelligence Research
Extending decidable cases for rules with existential variables
IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
Conjunctive query answering in the description logic EL using a relational database system
IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
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
Graph-based Knowledge Representation: Computational Foundations of Conceptual Graphs
Graph-based Knowledge Representation: Computational Foundations of Conceptual Graphs
Rules dependencies in backward chaining of conceptual graphs rules
ICCS'06 Proceedings of the 14th international conference on Conceptual Structures: inspiration and Application
Ontological query answering with existential rules
RR'11 Proceedings of the 5th international conference on Web reasoning and rule systems
Towards farsighted dependencies for existential rules
RR'11 Proceedings of the 5th international conference on Web reasoning and rule systems
Ontological query answering via rewriting
ADBIS'11 Proceedings of the 15th international conference on Advances in databases and information systems
A logical toolbox for ontological reasoning
ACM SIGMOD Record
Knowledge representation and reasoning for qualitative spatial change
Knowledge-Based Systems
FOSSACS'12 Proceedings of the 15th international conference on Foundations of Software Science and Computational Structures
A general Datalog-based framework for tractable query answering over ontologies
Web Semantics: Science, Services and Agents on the World Wide Web
Modelling structured domains using description graphs and logic programming
ESWC'12 Proceedings of the 9th international conference on The Semantic Web: research and applications
Proceedings of the VLDB Endowment
On the complexity of ontological reasoning under disjunctive existential rules
MFCS'12 Proceedings of the 37th international conference on Mathematical Foundations of Computer Science
Knowledge-based support in Non-Destructive Testing for health monitoring of aircraft structures
Advanced Engineering Informatics
Towards more expressive ontology languages: The query answering problem
Artificial Intelligence
Existential rules: a graph-based view
Datalog 2.0'12 Proceedings of the Second international conference on Datalog in Academia and Industry
A broad class of first-order rewritable tuple-generating dependencies
Datalog 2.0'12 Proceedings of the Second international conference on Datalog in Academia and Industry
Query patterns for existential rules
RR'12 Proceedings of the 6th international conference on Web Reasoning and Rule Systems
A sound and complete backward chaining algorithm for existential rules
RR'12 Proceedings of the 6th international conference on Web Reasoning and Rule Systems
Query rewriting under ontology contraction
RR'12 Proceedings of the 6th international conference on Web Reasoning and Rule Systems
Research summary: datalog-based data access
RR'12 Proceedings of the 6th international conference on Web Reasoning and Rule Systems
Data complexity of query answering in description logics
Artificial Intelligence
Flag & check: data access with monadically defined queries
Proceedings of the 32nd symposium on Principles of database systems
On the exploration of the query rewriting space with existential rules
RR'13 Proceedings of the 7th international conference on Web Reasoning and Rule Systems
Kiabora: an analyzer of existential rule bases
RR'13 Proceedings of the 7th international conference on Web Reasoning and Rule Systems
Graph-based reasoning in collaborative knowledge management for industrial maintenance
Computers in Industry
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
Computing stable models for nonmonotonic existential rules
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
Compact rewritings for existential rules
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
Sound, complete, and minimal query rewriting for existential rules
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
Ontology based query answering with existential rules
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
Acyclicity notions for existential rules and their application to query answering in ontologies
Journal of Artificial Intelligence Research
Query rewriting under query refinements
Knowledge-Based Systems
Taming the infinite chase: query answering under expressive relational constraints
Journal of Artificial Intelligence Research
Hi-index | 0.00 |
We consider positive rules in which the conclusion may contain existentially quantified variables, which makes reasoning tasks (such as conjunctive query answering or entailment) undecidable. These rules, called @?@?-rules, have the same logical form as tuple-generating dependencies in databases and as conceptual graph rules. The aim of this paper is to provide a clearer picture of the frontier between decidability and non-decidability of reasoning with these rules. Previous known decidable classes were based on forward chaining. On the one hand we extend these classes, on the other hand we introduce decidable classes based on backward chaining. A side result is the definition of a backward mechanism that takes the complex structure of @?@?-rule conclusions into account. We classify all known decidable classes by inclusion. Then, we study the question of whether the union of two decidable classes remains decidable and show that the answer is negative, except for one class and a still open case. This highlights the interest of studying interactions between rules. We give a constructive definition of dependencies between rules and widen the landscape of decidable classes with conditions on rule dependencies and a mixed forward/backward chaining mechanism. Finally, we integrate rules with equality and negative constraints to our framework.