Enforcing Arc Consistency on Global Constraints by Solving Subproblems on the Fly
CP '99 Proceedings of the 5th International Conference on Principles and Practice of Constraint Programming
SATO: An Efficient Propositional Prover
CADE-14 Proceedings of the 14th International Conference on Automated Deduction
Guiding Real-World SAT Solving with Dynamic Hypergraph Separator Decomposition
ICTAI '04 Proceedings of the 16th IEEE International Conference on Tools with Artificial Intelligence
Hi-index | 0.00 |
Divide-and-conquer is an effective general problem solving strategy, and has been applied to improve to the performance of search procedures. The challenge in applying the strategy is to find an appropriate decomposition of the problem into subproblems. In this paper, a decomposition is presented for n-dimensional propositional satisfiability problems. Experiments with timetable scheduling show the potential for the technique.