ML Anthology

Ordered Completion for First-Order Logic Programs on Finite Structures

Vernon Asuncion, Fangzhen Lin, Yan Zhang, Yi Zhou
AAAI 2010 pp. 249-254
doi:10.1609/AAAI.V24I1.7595 /aaai/2010/asuncion2010aaai-ordered/

Abstract

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.

PDF AAAI Semantic Scholar

Cite

Text

Asuncion et al. "Ordered Completion for First-Order Logic Programs on Finite Structures." AAAI Conference on Artificial Intelligence, 2010. doi:10.1609/AAAI.V24I1.7595

Markdown

[Asuncion et al. "Ordered Completion for First-Order Logic Programs on Finite Structures." AAAI Conference on Artificial Intelligence, 2010.](https://mlanthology.org/aaai/2010/asuncion2010aaai-ordered/) doi:10.1609/AAAI.V24I1.7595

BibTeX

@inproceedings{asuncion2010aaai-ordered,
  title     = {{Ordered Completion for First-Order Logic Programs on Finite Structures}},
  author    = {Asuncion, Vernon and Lin, Fangzhen and Zhang, Yan and Zhou, Yi},
  booktitle = {AAAI Conference on Artificial Intelligence},
  year      = {2010},
  pages     = {249-254},
  doi       = {10.1609/AAAI.V24I1.7595},
  url       = {https://mlanthology.org/aaai/2010/asuncion2010aaai-ordered/}
}