ML Anthology

Constraint Answer Set Programming Versus Satisfiability Modulo Theories

Yuliya Lierler, Benjamin Susman
IJCAI 2016 pp. 1181-1187
/ijcai/2016/lierler2016ijcai-constraint/

Abstract

Constraint answer set programming is a promising research direction that integrates answer set programming with constraint processing. It is often informally related to the field of Satisfiability Modulo Theories. Yet, the exact formal link is obscured as the terminology and concepts used in these two research areas differ. In this paper, we make the link between these two areas precise. PDF

PDF IJCAI Semantic Scholar

Cite

Text

Lierler and Susman. "Constraint Answer Set Programming Versus Satisfiability Modulo Theories." International Joint Conference on Artificial Intelligence, 2016.

Markdown

[Lierler and Susman. "Constraint Answer Set Programming Versus Satisfiability Modulo Theories." International Joint Conference on Artificial Intelligence, 2016.](https://mlanthology.org/ijcai/2016/lierler2016ijcai-constraint/)

BibTeX

@inproceedings{lierler2016ijcai-constraint,
  title     = {{Constraint Answer Set Programming Versus Satisfiability Modulo Theories}},
  author    = {Lierler, Yuliya and Susman, Benjamin},
  booktitle = {International Joint Conference on Artificial Intelligence},
  year      = {2016},
  pages     = {1181-1187},
  url       = {https://mlanthology.org/ijcai/2016/lierler2016ijcai-constraint/}
}