Constraint Answer Set Programming versus Satisfiability Modulo Theories

Yuliya Lierler, Benjamin Susman. Constraint Answer Set Programming versus Satisfiability Modulo Theories. In Subbarao Kambhampati, editor, Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence, IJCAI 2016, New York, NY, USA, 9-15 July 2016. pages 1181-1187, IJCAI/AAAI Press, 2016. [doi]

@inproceedings{LierlerS16,
  title = {Constraint Answer Set Programming versus Satisfiability Modulo Theories},
  author = {Yuliya Lierler and Benjamin Susman},
  year = {2016},
  url = {http://www.ijcai.org/Abstract/16/171},
  researchr = {https://researchr.org/publication/LierlerS16},
  cites = {0},
  citedby = {0},
  pages = {1181-1187},
  booktitle = {Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence, IJCAI 2016, New York, NY, USA, 9-15 July 2016},
  editor = {Subbarao Kambhampati},
  publisher = {IJCAI/AAAI Press},
  isbn = {978-1-57735-771-1},
}