Foundations of logic programming
Foundations of logic programming
Proceedings of the eleventh international conference on Logic programming
ILPS '94 Proceedings of the 1994 International Symposium on Logic programming
Knowledge Representation, Reasoning, and Declarative Problem Solving
Knowledge Representation, Reasoning, and Declarative Problem Solving
Logic programs with stable model semantics as a constraint programming paradigm
Annals of Mathematics and Artificial Intelligence
Resolution for Skeptical Stable Model Semantics
Journal of Automated Reasoning
Reasoning with Infinite Stable Models II: Disjunctive Programs
ICLP '02 Proceedings of the 18th International Conference on Logic Programming
A Deductive System for Non-Monotonic Reasoning
LPNMR '97 Proceedings of the 4th International Conference on Logic Programming and Nonmonotonic Reasoning
Smodels - An Implementation of the Stable Model and Well-Founded Semantics for Normal LP
LPNMR '97 Proceedings of the 4th International Conference on Logic Programming and Nonmonotonic Reasoning
Reasoning with infinite stable models
Artificial Intelligence
On finitely recursive programs
ICLP'07 Proceedings of the 23rd international conference on Logic programming
FDNC: decidable non-monotonic disjunctive logic programs with function symbols
LPAR'07 Proceedings of the 14th international conference on Logic for programming, artificial intelligence and reasoning
AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 1
Magic Sets for the Bottom-Up Evaluation of Finitely Recursive Programs
LPNMR '09 Proceedings of the 10th International Conference on Logic Programming and Nonmonotonic Reasoning
A decidable subclass of finitary programs
Theory and Practice of Logic Programming
Disjunctive asp with functions: Decidable queries and effective computation*
Theory and Practice of Logic Programming
A 25-year perspective on logic programming
ASP at work: spin-off and applications of the DLV system
Logic programming, knowledge representation, and nonmonotonic reasoning
Answer set programming at a glance
Communications of the ACM
Finitely recursive programs: Decidability and bottom-up computation
AI Communications
Detecting decidable classes of finitely ground logic programs with function symbols
Proceedings of the 15th Symposium on Principles and Practice of Declarative Programming
RW'13 Proceedings of the 9th international conference on Reasoning Web: semantic technologies for intelligent data access
Bounded programs: a new decidable class of logic programs with function symbols
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
Hi-index | 0.02 |
Disjunctive finitary programs are a class of logic programs admitting function symbols and hence infinite domains. They have very good computational properties; for example, ground queries are decidable, while in the general case the stable model semantics are Π11-hard. In this paper we prove that a larger class of programs, called finitely recursive programs, preserve most of the good properties of finitary programs under the stable model semantics, which are as follows: (i) finitely recursive programs enjoy a compactness property; (ii) inconsistency checking and skeptical reasoning are semidecidable; (iii) skeptical resolution is complete for normal finitely recursive programs. Moreover, we show how to check inconsistency and answer skeptical queries using finite subsets of the ground program instantiation. We achieve this by extending the splitting sequence theorem by Lifschitz and Turner: we prove that if the input program P is finitely recursive, then the partial stable models determined by any smooth splitting ω-sequence converge to a stable model of P.