Generalizing Boolean Satisfiability III: Implementation

Details Generalizing Boolean Satisfiability III: Implementation Generalizing Boolean Satisfiability III: Implementation

2011-09-09

arxiv.org/abs/1109.2142v1

Journal Of Artificial Intelligence Research, Volume 23, pages 441-531, 2005

Computer Science

Artificial Intelligence

Scientific paper

10.1613/jair.1656

This is the third of three 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 has been to define a representation in which this structure is apparent and can be exploited to improve computational performance. The first paper surveyed existing work that (knowingly or not) exploited problem structure to improve the performance of satisfiability engines, and the second paper showed that this structure could be understood in terms of groups of permutations acting on individual clauses in any particular Boolean theory. We conclude the series by discussing the techniques needed to implement our ideas, and by reporting on their performance on a variety of problem instances.

Affiliated with

Also associated with

No associations

Rating

Generalizing Boolean Satisfiability III: Implementation 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 III: Implementation, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Generalizing Boolean Satisfiability III: Implementation will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-38078