Consistency of Constraint Networks Induced by Automaton-Based Constraint Specifications
In this work we discuss the consistency of constraints for which the set of solutions can be recognised by a deterministic finite automaton. Such an automaton induces a decomposition of the constraint into a conjunction of constraints. Since the level of filtering for the conjunction of constraints...
| Main Author: | |
|---|---|
| Format: | Others |
| Language: | English |
| Published: |
Uppsala universitet, Institutionen för informationsteknologi
2011
|
| Online Access: | http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-156441 |