DocumentCode :
3229716
Title :
Generation of Implied Constraints for Automaton-Induced Decompositions
Author :
Rodriguez, Maria Andreina Francisco ; Flener, P. ; Pearson, James
Author_Institution :
Dept. of Inf. Technol., Uppsala Univ., Uppsala, Sweden
fYear :
2013
fDate :
4-6 Nov. 2013
Firstpage :
1076
Lastpage :
1083
Abstract :
Automata, possibly with counters, allow many constraints to be expressed in a simple and high-level way. An automaton induces a decomposition into a conjunction of already implemented constraints. Generalised arc consistency is not generally maintained on decompositions induced by counter automata with more than one state or counter. To improve propagation of automaton-induced constraint decompositions, we use automated tools to derive loop invariants from the constraint checker corresponding to the given automaton. These loop invariants correspond to implied constraints, which can be added to the decomposition. We consider two global constraints and derive implied constraints to improve propagation even to the point of maintaining generalised arc consistency.
Keywords :
automata theory; constraint handling; automaton-induced constraint decompositions; constraint checker; counter automata; global constraints; implied constraints; Automata; Generators; Inference algorithms; Personnel; Programming; Radiation detectors; Standards; automata; constraint programming; generalised arc consistency; global constraints; implied constraints; invariants;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Tools with Artificial Intelligence (ICTAI), 2013 IEEE 25th International Conference on
Conference_Location :
Herndon, VA
ISSN :
1082-3409
Print_ISBN :
978-1-4799-2971-9
Type :
conf
DOI :
10.1109/ICTAI.2013.160
Filename :
6735371
Link To Document :
بازگشت