A machine program for theorem-proving
Communications of the ACM
Chaff: engineering an efficient SAT solver
Proceedings of the 38th annual Design Automation Conference
Strongly equivalent logic programs
ACM Transactions on Computational Logic (TOCL) - Special issue devoted to Robert A. Kowalski
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
Theory and Practice of Logic Programming
ASSAT: computing answer sets of a logic program by SAT solvers
Artificial Intelligence - Special issue on nonmonotonic reasoning
Why are there so many loop formulas?
ACM Transactions on Computational Logic (TOCL)
A generalization of the Lin-Zhao theorem
Annals of Mathematics and Artificial Intelligence
Strong and uniform equivalence of nonmonotonic theories: an algebraic approach
Annals of Mathematics and Artificial Intelligence
Twelve Definitions of a Stable Model
ICLP '08 Proceedings of the 24th International Conference on Logic Programming
| Hi-index | 0.00 |
We investigate a proof system based on a guarded resolution rule and show its adequacy for the stable semantics of normal logic programs. As a consequence, we show that Gelfond–Lifschitz operator can be viewed as a proof-theoretic concept. As an application, we find a propositional theory EP whose models are precisely stable models of programs. We also find a class of propositional theories 𝓒P with the following properties. Propositional models of theories in 𝓒P are precisely stable models of P, and the theories in 𝓒T are of the size linear in the size of P.