On the declarative and procedual semantics of logic programs
Journal of Automated Reasoning
Weakly stratified logic programs
Fundamenta Informaticae - Special issue on LOGIC PROGRAMMING
Negation by default and unstratifiable logic programs
Selected papers of the workshop on Deductive database theory
Modular stratification and magic sets for Datalog programs with negation
Journal of the ACM (JACM)
The limits of fixed-order computation
Theoretical Computer Science
Omega-Restricted Logic Programs
LPNMR '01 Proceedings of the 6th International Conference on Logic Programming and Nonmonotonic Reasoning
Data exchange: semantics and query answering
Theoretical Computer Science - Database theory
The DLV system for knowledge representation and reasoning
ACM Transactions on Computational Logic (TOCL)
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
Representing ontologies using description logics, description graphs, and rules
Artificial Intelligence
FDNC: Decidable nonmonotonic disjunctive logic programs with function symbols
ACM Transactions on Computational Logic (TOCL)
Reconciling description logics and rules
Journal of the ACM (JACM)
On rules with existential variables: Walking the decidability line
Artificial Intelligence
Towards farsighted dependencies for existential rules
RR'11 Proceedings of the 5th international conference on Web reasoning and rule systems
Uniform evaluation of nonmonotonic DL-Programs
FoIKS'12 Proceedings of the 7th international conference on Foundations of Information and Knowledge Systems
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
Modelling structured domains using description graphs and logic programming
ESWC'12 Proceedings of the 9th international conference on The Semantic Web: research and applications
The Complexity Of Local Stratification
Fundamenta Informaticae
Towards more expressive ontology languages: The query answering problem
Artificial Intelligence
Acyclicity notions for existential rules and their application to query answering in ontologies
Journal of Artificial Intelligence Research
| Hi-index | 0.00 |
In this work, we consider function-free existential rules extended with nonmonotonic negation under a stable model semantics. We present new acyclicity and stratification conditions that identify a large class of rule sets having finite, unique stable models, and we show how the addition of constraints on the input facts can further extend this class. Checking these conditions is computationally feasible, and we provide tight complexity bounds. Finally, we demonstrate how these new methods allowed us to solve relevant reasoning problems over a real-world knowledge base from biochemistry using an off-the-shelf answer set programming engine.