Abstract
In this paper we describe an approach for integrating CR-Prolog and constraint programming, in which CR-Prolog is viewed as a specification language for constraint satisfaction problems. Differently from other methods of integrating ASP and constraint programming, our approach has the advantage of allowing the use of off-the-shelf, unmodified ASP solvers and constraint solvers, and of global constraints, which substantially increases practical applicability. © 2009 Springer Berlin Heidelberg.
Cite
CITATION STYLE
Balduccini, M. (2009). CR-prolog as a specification language for constraint satisfaction problems. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5753 LNAI, pp. 402–408). https://doi.org/10.1007/978-3-642-04238-6_34
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
