Implementing Propagators for Tabular Constraints

Many real-life constraints describing relations between the problem variables have complex semantics and the constraint domain is defined using a table of compatible tuples rather than using a formula. In the paper we study the implementation of filtering algorithms (propagators) for such tabular constraints. We concentrate on implementation aspects of these algorithms so the proposed propagators can be naturally integrated into existing constraint satisfaction packages like SICStus Prolog.

• Type: Conference
• Year: 2003
• Where: CSCLP
• Authors: Roman Barták, Roman Mecl
• Keywords: Constraint Domain, Constraint Satisfaction Packages, CSCLP 2003, Many Real-life Constraints