Propositional reasoning by dimensional reduction: a preliminary report

Authors:
Robin Lohfer;James J. Lu
Affiliations:
Emory University, Atlanta, GA;Emory University, Atlanta, GA
Venue:
ACM-SE 45 Proceedings of the 45th annual southeast regional conference
Year:
2007

Citing 3
Cited 0

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

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.