Constraint Answer Set Programming versus Satisfiability Modulo Theories

Lierler, Yuliya; Susman, Benjamin

Constraint Answer Set Programming versus Satisfiability Modulo Theories

Download BibTeX Cite

Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence. Pages 1181-1186.

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.

Yuliya Lierler, and Benjamin Susman. 2016. Constraint Answer Set Programming versus Satisfiability Modulo Theories. In Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence, IJCAI-16. IJCAI, 1181–1186. https://ijcai.org/proceedings/2016/171

@inproceedings{ijcai2016p171,
  title     = {Constraint Answer Set Programming versus Satisfiability Modulo Theories},
  author    = {Lierler, Yuliya and Susman, Benjamin},
  booktitle = {Proceedings of the Twenty-Fifth International Joint Conference on
               Artificial Intelligence, {IJCAI-16}},
  publisher = {AAAI Press / International Joint Conferences on Artificial Intelligence},
  editor    = {Subbarao Kambhampati},
  pages     = {1181--1186},
  year      = {2016},
  month     = {7},
  url       = {https://ijcai.org/proceedings/2016/171},
}

TY  - CPAPER
TI  - Constraint Answer Set Programming versus Satisfiability Modulo Theories
AU  - Lierler, Yuliya
AU  - Susman, Benjamin
T2  - Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence, IJCAI-16
PB  - AAAI Press / International Joint Conferences on Artificial Intelligence
PY  - 2016
SP  - 1181
EP  - 1186
UR  - https://ijcai.org/proceedings/2016/171
ER  -