CR-Prolog as a Specification Language for Constraint Satisfaction Problems

Authors:
Marcello Balduccini
Affiliations:
Intelligent Systems, OCTO, Eastman Kodak Company, Rochester, NY, USA 14650-2102
Venue:
LPNMR '09 Proceedings of the 10th International Conference on Logic Programming and Nonmonotonic Reasoning
Year:
2009

Citing 3
Cited 1

Integrating answer set programming and constraint logic programming

Annals of Mathematics and Artificial Intelligence
Constraint Answer Set Solving

ICLP '09 Proceedings of the 25th International Conference on Logic Programming
CR-MODELS: an inference engine for CR-Prolog

LPNMR'07 Proceedings of the 9th international conference on Logic programming and nonmonotonic reasoning

A translational approach to constraint answer set solving

Theory and Practice of Logic Programming

Quantified Score

Hi-index	0.00

Visualization

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.