ML Anthology

Loop Formulas for Logic Programs with Arbitrary Constraint Atoms

Jia-Huai You, Guohua Liu
AAAI 2008 pp. 584-589
/aaai/2008/you2008aaai-loop/

Abstract

We formulate loop formulas for logic programs with arbitrary constraint atoms, for the semantics based on conditional satisfaction. This provides a method for answer set computation by computing models of completion. One particular attractive candidate for the latter task is pseudo-boolean constraint solvers. To strengthen this connection, we show examples of compact encoding of aggregates and global constraints by pseudo-boolean constraints.

PDF AAAI Semantic Scholar

Cite

Text

You and Liu. "Loop Formulas for Logic Programs with Arbitrary Constraint Atoms." AAAI Conference on Artificial Intelligence, 2008.

Markdown

[You and Liu. "Loop Formulas for Logic Programs with Arbitrary Constraint Atoms." AAAI Conference on Artificial Intelligence, 2008.](https://mlanthology.org/aaai/2008/you2008aaai-loop/)

BibTeX

@inproceedings{you2008aaai-loop,
  title     = {{Loop Formulas for Logic Programs with Arbitrary Constraint Atoms}},
  author    = {You, Jia-Huai and Liu, Guohua},
  booktitle = {AAAI Conference on Artificial Intelligence},
  year      = {2008},
  pages     = {584-589},
  url       = {https://mlanthology.org/aaai/2008/you2008aaai-loop/}
}