The well-founded semantics for general logic programs
Journal of the ACM (JACM)
Approximations, stable operators, well-founded fixpoints and applications in nonmonotonic reasoning
Logic-based artificial intelligence
From Logic to Logic Programming
From Logic to Logic Programming
Logic programs with stable model semantics as a constraint programming paradigm
Annals of Mathematics and Artificial Intelligence
Representing Knowledge in A-Prolog
Computational Logic: Logic Programming and Beyond, Essays in Honour of Robert A. Kowalski, Part II
The Well-Founded Semantics Is the Principle of Inductive Definition
JELIA '98 Proceedings of the European Workshop on Logics in Artificial Intelligence
A New Logical Characterisation of Stable Models and Answer Sets
NMELP '96 Selected papers from the Non-Monotonic Extensions of Logic Programming
Extending Classical Logic with Inductive Definitions
CL '00 Proceedings of the First International Conference on Computational Logic
A logic of nonmonotone inductive definitions
ACM Transactions on Computational Logic (TOCL)
Quantified Equilibrium Logic and Foundations for Answer Set Programs
ICLP '08 Proceedings of the 24th International Conference on Logic Programming
Achieving compositionality of the stable model semantics for smodels programs1
Theory and Practice of Logic Programming
SAT(ID): satisfiability of propositional logic extended with inductive definitions
SAT'08 Proceedings of the 11th international conference on Theory and applications of satisfiability testing
Stable models and circumscription
Artificial Intelligence
Answer sets for propositional theories
LPNMR'05 Proceedings of the 8th international conference on Logic Programming and Nonmonotonic Reasoning
Functional stable model semantics and answer set programming modulo theories
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
| Hi-index | 0.00 |
Recently, an answer-set programming (ASP) formalism of logic programing with the answer-set semantics has been extended to the full first-order setting. Earlier an extension of first-order logic with inductive definitions, the logic FO(ID), was proposed as a knowledge representation formalism and developed as an alternative ASP language. We present characterizations of these formalisms in terms of concepts of infinitary propositional logic. We use them to find a direct connection between the first-order ASP and the logic FO(ID) under some restrictions on the form of theories (programs) considered.