Constraint answer set solver EZCSP and why integration schemas matter

• Published in: Theory and practice of logic programming 2017-07, Vol.17 (4), p.462-515
• Main Authors: BALDUCCINI, MARCELLO, LIERLER, YULIYA
• Format: Article
• Language: English
• Subjects: Algorithms; Boolean algebra; Hybrid systems; Programming languages; Regular Papers; Solvers
• ISSN: 1471-0684; 1475-3081
• DOI: 10.1017/S1471068417000102

Researchers in answer set programming and constraint programming have spent significant efforts in the development of hybrid languages and solving algorithms combining the strengths of these traditionally separate fields. These efforts resulted in a new research area: constraint answer set programming. Constraint answer set programming languages and systems proved to be successful at providing declarative, yet efficient solutions to problems involving hybrid reasoning tasks. One of the main contributions of this paper is the first comprehensive account of the constraint answer set language and solver ezcsp, a mainstream representative of this research area that has been used in various successful applications. We also develop an extension of the transition systems proposed by Nieuwenhuis et al. in 2006 to capture Boolean satisfiability solvers. We use this extension to describe the ezcsp algorithm and prove formal claims about it. The design and algorithmic details behind ezcsp clearly demonstrate that the development of the hybrid systems of this kind is challenging. Many questions arise when one faces various design choices in an attempt to maximize system's benefits. One of the key decisions that a developer of a hybrid solver makes is settling on a particular integration schema within its implementation. Thus, another important contribution of this paper is a thorough case study based on ezcsp, focused on the various integration schemas that it provides.