Generalizing Boolean Satisfiability II: Theory

Details Generalizing Boolean Satisfiability II: Theory Generalizing Boolean Satisfiability II: Theory

2011-09-09

arxiv.org/abs/1109.2134v1

Journal Of Artificial Intelligence Research, Volume 22, pages 481-534, 2004

Computer Science

Artificial Intelligence

Scientific paper

10.1613/jair.1555

This is the second of three planned papers describing ZAP, a satisfiability engine that substantially generalizes existing tools while retaining the performance characteristics of modern high performance solvers. The fundamental idea underlying ZAP is that many problems passed to such engines contain rich internal structure that is obscured by the Boolean representation used; our goal is to define a representation in which this structure is apparent and can easily be exploited to improve computational performance. This paper presents the theoretical basis for the ideas underlying ZAP, arguing that existing ideas in this area exploit a single, recurring structure in that multiple database axioms can be obtained by operating on a single axiom using a subgroup of the group of permutations on the literals in the problem. We argue that the group structure precisely captures the general structure at which earlier approaches hinted, and give numerous examples of its use. We go on to extend the Davis-Putnam-Logemann-Loveland inference procedure to this broader setting, and show that earlier computational improvements are either subsumed or left intact by the new method. The third paper in this series discusses ZAPs implementation and presents experimental performance results.

Affiliated with

Also associated with

No associations

Rating

Generalizing Boolean Satisfiability II: Theory does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Generalizing Boolean Satisfiability II: Theory, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Generalizing Boolean Satisfiability II: Theory will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-38038