An exponential lower bound for a constraint propagation proof system based on ordered binary decision diagrams.
Jan KrajícekPublished in: J. Symb. Log. (2008)
Keyphrases
- constraint propagation
- ordered binary decision diagrams
- lower bound
- constraint satisfaction problems
- np hard
- constraint satisfaction
- upper bound
- constraint problems
- constraint programming
- branch and bound algorithm
- constraint solving
- branch and bound
- np complete
- quantified boolean formulae
- arc consistency
- objective function
- propositional logic
- search space
- temporal constraints
- combinatorial problems
- worst case
- constraint solver
- model checking
- optimal solution
- tree search
- modal logic
- sat problem
- integer programming
- soft constraints
- max sat
- genetic algorithm