An Application of Proof-Theory in Answer Set Programming

2009/05/02 by Marek, V. W., Remmel, J. B.
#Artificial Intelligence (cs.AI) #FOS: Computer and information sciences

paper · doi:10.48550/arxiv.0905.0197

Abstract

We apply proof-theoretic techniques in answer Set Programming. The main results include: 1. A characterization of continuity properties of Gelfond-Lifschitz operator for logic program. 2. A propositional characterization of stable models of logic programs (without referring to loop formulas.

Related

• Answer Sets and the Language of Answer Set Programming
• Set Based Logic Programming
• Guarded resolution for answer set programming
• Refining Gelfond Rationality Principle Towards More Comprehensive Foundational Principles for Answer Set Semantics
• Propositional satisfiability in answer-set programming