Chaff: engineering an efficient SAT solver
Proceedings of the 38th annual Design Automation Conference
Consistency restoriation and explanations in dynamic CSPs----application to configuration
Artificial Intelligence
Representing Arithmetic Constraints with Finite Automata: An Overview
ICLP '02 Proceedings of the 18th International Conference on Logic Programming
The theory of grammar constraints
CP'06 Proceedings of the 12th international conference on Principles and Practice of Constraint Programming
CP'06 Proceedings of the 12th international conference on Principles and Practice of Constraint Programming
Analyzing Context-Free Grammars Using an Incremental SAT Solver
ICALP '08 Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part II
Reformulating Global Grammar Constraints
CPAIOR '09 Proceedings of the 6th International Conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
The Polytope of Context-Free Grammar Constraints
CPAIOR '09 Proceedings of the 6th International Conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
The parameterized complexity of global constraints
AAAI'08 Proceedings of the 23rd national conference on Artificial intelligence - Volume 1
Efficient context-free grammar constraints
AAAI'08 Proceedings of the 23rd national conference on Artificial intelligence - Volume 1
Decompositions of grammar constraints
AAAI'08 Proceedings of the 23rd national conference on Artificial intelligence - Volume 3
Circuit complexity and decompositions of global constraints
IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
Decompositions of all different, global cardinality and related constraints
IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
Constraints
CP'07 Proceedings of the 13th international conference on Principles and practice of constraint programming
CPAIOR'08 Proceedings of the 5th international conference on Integration of AI and OR techniques in constraint programming for combinatorial optimization problems
Restricted global grammar constraints
CP'09 Proceedings of the 15th international conference on Principles and practice of constraint programming
A large neighbourhood search approach to the multi-activity shift scheduling problem
Journal of Heuristics
Decomposition of the NVALUE constraint
CP'10 Proceedings of the 16th international conference on Principles and practice of constraint programming
Grammar-Based Integer Programming Models for Multiactivity Shift Scheduling
Management Science
MDD propagators with explanation
Constraints
A hybrid MIP/CP approach for multi-activity shift scheduling
CP'12 Proceedings of the 18th international conference on Principles and Practice of Constraint Programming
On the violation of circuits in decomposable negation normal form
AI'12 Proceedings of the 25th Australasian joint conference on Advances in Artificial Intelligence
Grammar-Based Column Generation for Personalized Multi-Activity Shift Scheduling
INFORMS Journal on Computing
A branch-and-price algorithm for the multi-activity multi-task shift scheduling problem
Journal of Scheduling
| Hi-index | 0.00 |
A wide range of constraints can be specified using automata or formal languages. The GRAMMAR constraint restricts the values taken by a sequence of variables to be a string from a given context-free language. Based on an AND/OR decomposition, we show that this constraint can be converted into clauses in conjunctive normal form without hindering propagation. Using this decomposition, we can propagate the GRAMMAR constraint in O(n3) time. The decomposition also provides an efficient incremental propagator. Down a branch of the search tree of length k, we can enforce GAC k times in the same O(n3) time. On specialized languages, running time can be even better. For example, propagation of the decomposition requires just O(n|δ|) time for regular languages where |δ| is the size of the transition table of the automaton recognizing the regular language. Experiments on a shift scheduling problem with a constraint solver and a state of the art SAT solver show that we can solve problems using this decomposition that defeat existing constraint solvers.