"Constraint Answer Set Programming versus Satisfiability Modulo Theories Or Constraints versus Theories" by Yuliya Lierler

Selected Works of Yuliya Lierler

Follow Contact

Article

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

Workshop on Grounding, Transforming, and Modularizing Theories with Variables. (2015)

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

Download Find in your library

Abstract

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.

Disciplines

Publication Date

Fall 2015

Citation Information

Lierler, Yuliya, and Benjamin Susman. "Constraint Answer Set Programming vs Satisfiability Modulo Theories Or Constraints vs Theories." In Workshop on Grounding, Transforming, and Modularizing Theories with Variables. 2015.