Foundations of logic programming
Foundations of logic programming
Semantical considerations on nonmonotonic logic
Artificial Intelligence
All I know: a study in autoepistemic logic
Artificial Intelligence
Proceedings of the eleventh international conference on Logic programming
Is intractability of nonmonotonic reasoning a real drawback?
Artificial Intelligence
ACM Transactions on Database Systems (TODS)
Verifying security protocols as planning in logic programming
ACM Transactions on Computational Logic (TOCL) - Special issue devoted to Robert A. Kowalski
Complexity and expressive power of logic programming
ACM Computing Surveys (CSUR)
Extending and implementing the stable model semantics
Artificial Intelligence
Knowledge Representation, Reasoning, and Declarative Problem Solving
Knowledge Representation, Reasoning, and Declarative Problem Solving
Computing Circumscription Revisited: A Reduction Algorithm
Journal of Automated Reasoning
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
Combining Norms to Prove Termination
VMCAI '02 Revised Papers from the Third International Workshop on Verification, Model Checking, and Abstract Interpretation
A Sequent Calculus for Skeptical Default Logic
TABLEAUX '97 Proceedings of the International Conference on Automated Reasoning with Analytic Tableaux and Related Methods
Encoding Planning Problems in Nonmonotonic Logic Programs
ECP '97 Proceedings of the 4th European Conference on Planning: Recent Advances in AI Planning
JELIA '02 Proceedings of the European Conference on Logics in Artificial Intelligence
Nonmonotonic logic: a monotonic approach
Nonmonotonic logic: a monotonic approach
Fast planning through planning graph analysis
IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 2
Precise widening operators for convex polyhedra
SAS'03 Proceedings of the 10th international conference on Static analysis
A Classification Theory Of Semantics Of Normal Logic Programs: Ii. Weak Properties
Fundamenta Informaticae
Sequent calculi for skeptical reasoning in predicate default logic and other nonmonotonic logics
Annals of Mathematics and Artificial Intelligence
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
Rules and Ontologies for the Semantic Web
Reasoning Web
On the Continuity of Gelfond-Lifschitz Operator and Other Applications of Proof-Theory in ASP
ICLP '08 Proceedings of the 24th International Conference on Logic Programming
Partial Functions and Equality in Answer Set Programming
ICLP '08 Proceedings of the 24th International Conference on Logic Programming
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
Fusion of Logic Programming and Description Logics
ICLP '09 Proceedings of the 25th International Conference on Logic Programming
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
Credulous resolution for answer set programming
AAAI'08 Proceedings of the 23rd national conference on Artificial intelligence - Volume 1
Magic sets for data integration
AAAI'08 Proceedings of the 23rd national conference on Artificial intelligence - Volume 3
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
Decidability under the well-founded semantics
RR'07 Proceedings of the 1st international conference on Web reasoning and rule systems
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
Hybrid reasoning with rules and ontologies
Semantic techniques for the web
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
Knowledge representation and non-monotonic reasoning
A 25-year perspective on logic programming
A 25-year perspective on logic programming
Functional answer set programming
Theory and Practice of Logic Programming
ASP at work: spin-off and applications of the DLV system
Logic programming, knowledge representation, and nonmonotonic reasoning
Weight constraint programs with evaluable functions
Annals of Mathematics and Artificial Intelligence
External sources of computation for answer set solvers
LPNMR'05 Proceedings of the 8th international conference on Logic Programming and Nonmonotonic Reasoning
Effective integration of declarative rules with external evaluations for semantic-web reasoning
ESWC'06 Proceedings of the 3rd European conference on The Semantic Web: research and applications
Consistent query answers in virtual data integration systems
Inconsistency Tolerance
First-order stable model semantics and first-order loop formulas
Journal of Artificial Intelligence Research
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
Automata for infinite argumentation structures
Artificial Intelligence
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.00 |
This paper illustrates extensively the theoretical properties, the implementation issues, and the programming style underlying finitary programs. They are a class of normal logic programs whose consequences under the stable model semantics can be effectively computed, despite the fact that finitary programs admit function symbols (hence infinite domains) and recursion. From a theoretical point of view, finitary programs are interesting because they enjoy properties that are extremely unusual for a nonmonotonic formalism, such as compactness. From the application point of view, the theory of finitary programs shows how the existing technology for answer set programming can be extended from problem solving below the second level of the polynomial hierarchy to all semidecidable problems. Moreover, finitary programs allow a more natural encoding of recursive data structures and may increase the performance of credulous reasoners.