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...

Full description

Bibliographic Details
Main Author: Francisco Rodriguez, Maria Andreina
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
id ndltd-UPSALLA1-oai-DiVA.org-uu-156441
record_format oai_dc
spelling ndltd-UPSALLA1-oai-DiVA.org-uu-1564412013-01-08T13:50:22ZConsistency of Constraint Networks Induced by Automaton-Based Constraint SpecificationsengFrancisco Rodriguez, Maria AndreinaUppsala universitet, Institutionen för informationsteknologi2011In 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 is not known, at any point during search there might be only one possible solution but, since all impossible values might not have yet been removed, we could be wasting time looking at impossible combinations of values. The so far most general result is that if the constraint hypergraph of such a decomposition is Berge-acyclic, then the decomposition provides hyper-arc consistency, which means that the decomposition achieves the best possible filtering. We focus our work on constraint networks that have alpha-acyclic, centred-cyclic or sliding-cyclic hypergraph representations. For each of these kinds of constraints networks we show systematically the necessary conditions to achieve hyper-arc consistency. Student thesisinfo:eu-repo/semantics/bachelorThesistexthttp://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-156441IT ; 11 049application/pdfinfo:eu-repo/semantics/openAccess
collection NDLTD
language English
format Others
sources NDLTD
description 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 is not known, at any point during search there might be only one possible solution but, since all impossible values might not have yet been removed, we could be wasting time looking at impossible combinations of values. The so far most general result is that if the constraint hypergraph of such a decomposition is Berge-acyclic, then the decomposition provides hyper-arc consistency, which means that the decomposition achieves the best possible filtering. We focus our work on constraint networks that have alpha-acyclic, centred-cyclic or sliding-cyclic hypergraph representations. For each of these kinds of constraints networks we show systematically the necessary conditions to achieve hyper-arc consistency.
author Francisco Rodriguez, Maria Andreina
spellingShingle Francisco Rodriguez, Maria Andreina
Consistency of Constraint Networks Induced by Automaton-Based Constraint Specifications
author_facet Francisco Rodriguez, Maria Andreina
author_sort Francisco Rodriguez, Maria Andreina
title Consistency of Constraint Networks Induced by Automaton-Based Constraint Specifications
title_short Consistency of Constraint Networks Induced by Automaton-Based Constraint Specifications
title_full Consistency of Constraint Networks Induced by Automaton-Based Constraint Specifications
title_fullStr Consistency of Constraint Networks Induced by Automaton-Based Constraint Specifications
title_full_unstemmed Consistency of Constraint Networks Induced by Automaton-Based Constraint Specifications
title_sort consistency of constraint networks induced by automaton-based constraint specifications
publisher Uppsala universitet, Institutionen för informationsteknologi
publishDate 2011
url http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-156441
work_keys_str_mv AT franciscorodriguezmariaandreina consistencyofconstraintnetworksinducedbyautomatonbasedconstraintspecifications
_version_ 1716530528744636416