Digitala Vetenskapliga Arkivet

Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Deriving Filtering Algorithms from Constraint Checkers
RISE, Swedish ICT, SICS, Computer Systems Laboratory.ORCID iD: 0000-0003-3079-8095
2004 (English)Report (Other academic)
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. , p. 42
Series
SICS Technical Report, ISSN 1100-3154 ; 2004:08
Keywords [en]
Constraint Programming, Global Constraints, Filtering Algorithms, Finite Automata, Relaxation
National Category
Computer and Information Sciences
Identifiers
URN: urn:nbn:se:ri:diva-22068OAI: oai:DiVA.org:ri-22068DiVA, id: diva2:1041610
Available from: 2016-10-31 Created: 2016-10-31 Last updated: 2023-05-05Bibliographically approved

Open Access in DiVA

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

Search in DiVA

By author/editor
Carlsson, Mats
By organisation
Computer Systems Laboratory
Computer and Information Sciences

Search outside of DiVA

GoogleGoogle Scholar
Total: 244 downloads
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

urn-nbn

Altmetric score

urn-nbn
Total: 80 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf