Ordered Completion for First-Order Logic Programs on Finite Structures
DOI:
https://doi.org/10.1609/aaai.v24i1.7595Keywords:
logic programming, answer set programming, ordered completion, finite structureAbstract
In this paper, we propose a translation from normal first-order logic programs under the answer set semantics to first-order theories on finite structures. Specifically, we introduce ordered completions which are modifications of Clark's completions with some extra predicates added to keep track of the derivation order, and show that on finite structures, classical models of the ordered-completion of a normal logic program correspond exactly to the answer sets (stable models) of the logic program.
Downloads
Published
2010-07-03
How to Cite
Asuncion, V., Lin, F., Zhang, Y., & Zhou, Y. (2010). Ordered Completion for First-Order Logic Programs on Finite Structures. Proceedings of the AAAI Conference on Artificial Intelligence, 24(1), 249-254. https://doi.org/10.1609/aaai.v24i1.7595
Issue
Section
Knowledge Representation and Reasoning