An exponential lower bound for a constraint propagation proof system based on ordered binary decision diagrams.
Jan KrajícekPublished in: Electron. Colloquium Comput. Complex. (2007)
Keyphrases
- constraint propagation
- ordered binary decision diagrams
- lower bound
- constraint satisfaction problems
- np hard
- upper bound
- constraint problems
- constraint satisfaction
- constraint programming
- constraint solving
- branch and bound
- np complete
- branch and bound algorithm
- search space
- model checking
- objective function
- tree search
- arc consistency
- temporal constraints
- modal logic
- soft constraints
- combinatorial problems
- integer programming
- randomly generated
- linear programming
- optimal solution
- quantified boolean formulae
- propositional logic
- scheduling problem
- reinforcement learning
- integrity constraints