Foundations of logic programming
Foundations of logic programming
Handbook of theoretical computer science (vol. B)
Proceedings of the eleventh international conference on Logic programming
The Semantics of Predicate Logic as a Programming Language
Journal of the ACM (JACM)
Knowledge Representation, Reasoning, and Declarative Problem Solving
Knowledge Representation, Reasoning, and Declarative Problem Solving
Resolution for Skeptical Stable Model Semantics
Journal of Automated Reasoning
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
AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 1
Rules and Ontologies for the Semantic Web
Reasoning Web
LPAR '08 Proceedings of the 15th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning
Computable Functions in ASP: Theory and Implementation
ICLP '08 Proceedings of the 24th International Conference on Logic Programming
Composing Normal Programs with Function Symbols
ICLP '08 Proceedings of the 24th International Conference on Logic Programming
On finitely recursive programs1
Theory and Practice of Logic Programming
Weight Constraint Programs with Functions
LPNMR '09 Proceedings of the 10th International Conference on Logic Programming and Nonmonotonic Reasoning
FDNC: Decidable nonmonotonic disjunctive logic programs with function symbols
ACM Transactions on Computational Logic (TOCL)
Bidirectional answer set programs with function symbols
IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
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
Weight constraint programs with evaluable functions
Annals of Mathematics and Artificial Intelligence
Automata for infinite argumentation structures
Artificial Intelligence
| Hi-index | 0.00 |
Finitary programs are a class of logic programs admitting functions symbols and hence infinite domains. In this paper we prove that a larger class of programs, called finitely recursive programs, preserves most of the good properties of finitary programs under the stable model semantics, namely: (i) finitely recursive programs enjoy a compactness property; (ii) inconsistency check and skeptical reasoning are semidecidable; (iii) skeptical resolution is complete. Moreover, we show how to check inconsistency and answer skeptical queries using finite subsets of the ground program instantiation.