Constraint Answer Set Programming (2012)
Constraint answer set programming (CASP) is a novel, promising direction of research whose roots go back to propositional satisfiability (SAT): it integrates answer set programming with constraint processing. This new area has already demonstrated promising results, including the development of the solvers such as Acsolver, Clingcon, Ezcsp, IDP, Mingo. This article provides a brief overview of the area.
View:
PDF
Citation:
ALP newsletter feautured article (2012).
Bibtex:

Yuliya Lierler Ph.D. Alumni ylierler [at] unomaha edu