Skip to main content
Article thumbnail
Location of Repository

Foundations of hierarchical sat-solving

By Yakov Novikov and Raik BrinkmannYakov Novikov and Raik Brinkmann

Abstract

The theory of hierarchical Boolean satisfiability (SAT) solving proposed in this paper is based on a strict axiomatic system and introduces a new important notion of implicativity. The theory makes evident that increasing implicativity is the core of SAT-solving. We provide a theoretical basis for increasing the implicativity of a given SAT instance and for organizing SAT-solving in a hierarchical way. The theory opens a new domain of research: SAT-model construction. Now quite different mathematical models can be used within practical SAT-solvers. The theory covers many advanced techniques such as circuit-oriented SAT-solving, mixed BDD/CNF SAT-solving, merging gates, using pseudo-Boolean constraints, using state machines for representation of Boolean functions, arithmetic reasoning, and managing don’t cares. We believe that hierarchical SAT-solving is a cardinal direction of research in practical SAT-solving

Topics: Hierarchical SAT-solving, implicativity
Year: 2013
OAI identifier: oai:CiteSeerX.psu:10.1.1.353.6039
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://citeseerx.ist.psu.edu/v... (external link)
  • http://www.zib.de/Publications... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.