Change search
ReferencesLink to record
Permanent link

Direct link
Deriving Filtering Algorithms from Constraint Checkers
Number of Authors: 3
2004 (English)Report (Refereed)
Abstract [en]

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.

Place, publisher, year, edition, pages
Swedish Institute of Computer Science , 2004, 1. , 42 p.
SICS Technical Report, ISSN 1100-3154 ; 2004:08
Keyword [en]
Constraint Programming, Global Constraints, Filtering Algorithms, Finite Automata, Relaxation
National Category
Computer and Information Science
URN: urn:nbn:se:ri:diva-14256OAI: diva2:1035544
Available from: 2016-10-13 Created: 2016-10-13

Open Access in DiVA

fulltext(286 kB)0 downloads
File information
File name FULLTEXT01.pdfFile size 286 kBChecksum SHA-512
Type fulltextMimetype application/pdf

Computer and Information Science

Search outside of DiVA

GoogleGoogle Scholar
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

ReferencesLink to record
Permanent link

Direct link