SODA

Deriving Filtering Algorithms from Constraint Checkers

Beldiceanu, Nicolas and Carlsson, Mats and Petit, Thierry (2004) Deriving Filtering Algorithms from Constraint Checkers. [SICS Report]

[img]
Preview
PDF
286Kb
[img]Postscript
161Kb

Abstract

This report deals with global constraints for which the set of solutions can be recognized by an extended finite automaton whose size is bounded by a polynomial in $n$, where $n$ is the number of variables of the corresponding global constraint. By reformulating the automaton as a conjunction of signature and transition constraints we show how to systematically obtain a filtering algorithm. Under some restrictions on the signature and transition constraints this filtering algorithm achieves arc-consistency. An implementation based on some constraints as well as on the metaprogramming facilities of SICStus Prolog is available. For a restricted class of automata we provide a filtering algorithm for the relaxed case, where the violation cost is the minimum number of variables to unassign in order to get back to a solution.

Item Type:SICS Report
Uncontrolled Keywords:Constraint Programming, Global Constraints, Filtering Algorithms, Finite Automata, Relaxation
ID Code:2346
Deposited By:Vicki Carleson
Deposited On:29 Oct 2007
Last Modified:18 Nov 2009 16:06

Repository Staff Only: item control page