Propagation engine prototyping with a domain specific language

Authors:
Charles Prud'homme;Xavier Lorca;Rémi Douence;Narendra Jussien
Affiliations:
EMNantes, INRIA TASC, CNRS LINA, Nantes Cedex 3, France 44307;EMNantes, INRIA TASC, CNRS LINA, Nantes Cedex 3, France 44307;EMNantes, INRIA TASC, CNRS LINA, Nantes Cedex 3, France 44307;EMNantes, INRIA TASC, CNRS LINA, Nantes Cedex 3, France 44307
Venue:
Constraints
Year:
2014

Citing 12
Cited 0

Arc and path consistence revisited

Artificial Intelligence
A generic arc-consistency algorithm and its specializations

Artificial Intelligence
Domain-specific languages: an annotated bibliography

ACM SIGPLAN Notices
An Open-Ended Finite Domain Constraint Solver

PLILP '97 Proceedings of the9th International Symposium on Programming Languages: Implementations, Logics, and Programs: Including a Special Trach on Declarative Programming Languages in Education
Efficient constraint propagation engines

ACM Transactions on Programming Languages and Systems (TOPLAS)
Generalised arc consistency for the AllDifferent constraint: An empirical survey

Artificial Intelligence
MINION: A Fast, Scalable, Constraint Solver

Proceedings of the 2006 conference on ECAI 2006: 17th European Conference on Artificial Intelligence August 29 -- September 1, 2006, Riva del Garda, Italy
Advisors for incremental propagation

CP'07 Proceedings of the 13th international conference on Principles and practice of constraint programming
MiniZinc: towards a standard CP modelling language

CP'07 Proceedings of the 13th international conference on Principles and practice of constraint programming
Propagator groups

CP'09 Proceedings of the 15th international conference on Principles and practice of constraint programming
Watched literals for constraint propagation in minion

CP'06 Proceedings of the 12th international conference on Principles and Practice of Constraint Programming
Expected-Case analysis for delayed filtering

CPAIOR'06 Proceedings of the Third international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems

Quantified Score

Hi-index	0.00

Visualization

Abstract

Constraint propagation is at the heart of constraint solvers. Two main trends co-exist for its implementation: variable-oriented propagation engines and constraint-oriented propagation engines. Those two approaches ensure the same level of local consistency but their efficiency (computation time) can be quite different depending on the instance solved. However, it is usually accepted that there is no best approach in general, and modern constraint solvers implement only one. In this paper, we would like to go a step further providing a solver independent language at the modeling stage to enable the design of propagation engines. We validate our proposal with a reference implementation based on the Choco solver and the MiniZinc constraint modeling language.