Document Type
Article
Publication Date
January 2016
Publication Title
Unpublished draft
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, by connecting these two areas, we begin the cross-fertilization of not only of the theoretical foundations of both areas but also of the existing solving technologies.
Recommended Citation
Lierler, Yuliya and Susman, Benjamin, "On Relation between Constraint Answer Set Programming and Satisfiability Modulo Theories" (2016). Computer Science Faculty Publications. 60.
https://digitalcommons.unomaha.edu/compscifacpub/60