---
title: "Constraint Answer Set Programming versus Satisfiability Modulo Theories"
authors:
  - "Yuliya Lierler"
  - "Benjamin Susman"
doi: ""
url: "https://ijcai.org/proceedings/2016/171"
pdf: "https://ijcai.org/proceedings/2016/0171.pdf"
venue: "Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence"
year: 2016
pages: "1181-1186"
track: ""
keywords:
---

# Constraint Answer Set Programming versus Satisfiability Modulo Theories

Yuliya Lierler, Benjamin Susman

*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.