Foundations of logic programming
Foundations of logic programming
All I know: a study in autoepistemic logic
Artificial Intelligence
On the relations between stable and well-founded semantics of logic programs
Theoretical Computer Science - Selected papers of the Second International Conference on algebraic and logic programming, Nancy, France, October 1–3, 1990
Complexity results for disjunctive logic programming and application to nonmonotonic logics
ILPS '93 Proceedings of the 1993 international symposium on Logic programming
Proceedings of the eleventh international conference on Logic programming
The expressive powers of the logic programming semantics
Selected papers of the 9th annual ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
A Sequent Calculus for Skeptical Default Logic
TABLEAUX '97 Proceedings of the International Conference on Automated Reasoning with Analytic Tableaux and Related Methods
Nonmonotonic logic: a monotonic approach
Nonmonotonic logic: a monotonic approach
Reasoning with Infinite Stable Models II: Disjunctive Programs
ICLP '02 Proceedings of the 18th International Conference on Logic Programming
Omega-Restricted Logic Programs
LPNMR '01 Proceedings of the 6th International Conference on Logic Programming and Nonmonotonic Reasoning
Prototypes for Reasoning with Infinite Stable Models and Function Symbols
LPNMR '01 Proceedings of the 6th International Conference on Logic Programming and Nonmonotonic Reasoning
Computing preferred answer sets by meta-interpretation in Answer Set Programming
Theory and Practice of Logic Programming
On the expressibility of stable logic programming
Theory and Practice of Logic Programming
Computing stable models: worst-case performance estimates
Theory and Practice of Logic Programming
Logic programming with infinite sets
Annals of Mathematics and Artificial Intelligence
External sources of knowledge and value invention in logic programming
Annals of Mathematics and Artificial Intelligence
A 25-year perspective on logic programming
Decidable fragments of logic programming with value invention
JELIA'06 Proceedings of the 10th European conference on Logics in Artificial Intelligence
| Hi-index | 0.00 |
The existing proof-theoretic and software tools for nonmonotonic reasoning can only handle finite domains. In this paper we introduce a class of normal logic programs, called finitary programs, whose domain may be infinite, and such that credulous and skeptical entailment under the stable model semantics are computable. Finitary programs-- that are characterized by two conditions on their dependency graph--are computationally complete (they can simulate arbitrary Turing machines). Further results include a compactness theorem and the proof that the two conditions defining finitary programs are, in some sense, "minimal". The existing methods for automated nonmonotonic reasoning are either complete for finitary programs, or can be easily extended to cover them.