DocumentCode :
3229625
Title :
Bounded Strings for Constraint Programming
Author :
Scott, Joseph D. ; Flener, P. ; Pearson, James
Author_Institution :
Dept. of Inf. Technol., Uppsala Univ., Uppsala, Sweden
fYear :
2013
fDate :
4-6 Nov. 2013
Firstpage :
1036
Lastpage :
1043
Abstract :
We present a domain for string decision variables of bounded length, combining features from fixed-length and unbounded-length string solvers to reason on an interval defined by languages of prefixes and suffixes. We provide a theoretical groundwork for constraint solving on this domain and describe propagation techniques for several common constraints.
Keywords :
computability; constraint handling; bounded strings; constraint programming; constraint solving; fixed-length solver; string decision variable; unbounded-length string solver; Automata; Cognition; Concrete; Decision feedback equalizers; Indexes; Programming; Upper bound; constraint programming; string constraints;
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.155
Filename :
6735366
Link To Document :
بازگشت