Search For:

Displaying 1-3 out of 3 total
Generation of Implied Constraints for Automaton-Induced Decompositions
Found in: 2013 IEEE 25th International Conference on Tools with Artificial Intelligence (ICTAI)
By Maria Andreina Francisco Rodriguez,Pierre Flener,Justin Pearson
Issue Date:November 2013
pp. 1076-1083
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 ...
 
Bounded Strings for Constraint Programming
Found in: 2013 IEEE 25th International Conference on Tools with Artificial Intelligence (ICTAI)
By Joseph D. Scott,Pierre Flener,Justin Pearson
Issue Date:November 2013
pp. 1036-1043
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 co...
 
Constraint Programming in Sweden
Found in: IEEE Intelligent Systems
By Pierre Flener, Mats Carlsson, Christian Schulte
Issue Date:March 2009
pp. 87-89
The authors survey the research and development in Sweden in constraint programming, which is rapidly becoming the method of choice for some kinds of constraint problems, such as scheduling and configuration.
 
 1