Constraint Answer Set Programming versus Satisfiability Modulo Theories Or Constraints versus Theories

Yuliya Lierler, University of Nebraska at Omaha
Benjamin Susman, University of Nebraska at Omaha


Constraint answer set programming is a promising research direction that integrates answer set programming with constraint processing. This research direction often informally relates itself to the field of Satisfiability Modulo Theory. Yet the exact formal link is obscured as the terminology and concepts used in these two research fields differ. The goal of this paper to make the link between these two fields precise.