Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

10

CSCLP
2003
Springer

favoriteEmaildiscussreport

85views Artificial Intelligence» more CSCLP 2003»

Implementing Propagators for Tabular Constraints

13 years 9 months ago

Implementing Propagators for Tabular Constraints

Download kti.ms.mff.cuni.cz

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.

Roman Barták, Roman Mecl

Real-time Traffic

Constraint Domain | Constraint Satisfaction Packages | CSCLP 2003 | Many Real-life Constraints |

claim paper

Related Content

» Optimization of Simple Tabular Reduction for Table Constraints

» Propagator Groups

» Watched Literals for Constraint Propagation in Minion

» Speeding Up Constraint Propagation

» Weakly Monotonic Propagators

» Finite Domain Bounds Consistency Revisited

» Soft constraint propagation and solving in CHRs

» Soft Constraint Propagation and Solving in Constraint Handling Rules

» The Range Constraint Algorithms and Implementation

Post Info
More Details (n/a)

Added	06 Jul 2010
Updated	06 Jul 2010
Type	Conference
Year	2003
Where	CSCLP
Authors	Roman Barták, Roman Mecl

Comments (0)