Satisfiability testing for Boolean formulas using δ-trees

Studia Logica 72 (1):85 - 112 (2002)
  Copy   BIBTEX

Abstract

The tree-based data structure of -tree for propositional formulas is introduced in an improved and optimised form. The -trees allow a compact representation for negation normal forms as well as for a number of reduction strategies in order to consider only those occurrences of literals which are relevant for the satisfiability of the input formula. These reduction strategies are divided into two subsets (meaning- and satisfiability-preserving transformations) and can be used to decrease the size of a negation normal form A at (at most) quadratic cost. The reduction strategies are aimed at decreasing the number of required branchings and, therefore, these strategies allow to limit the size of the search space for the SAT problem.

Other Versions

original Gutiérrez, G.; Guzmán, I. P. De; Martínez, J.; Ojeda-Aciego, M.; Valverde, A. (2002) "Satisfiability Testing for Boolean Formulas Using Δ-Trees". Studia Logica 72(1):85 - 112

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 99,169

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Analytics

Added to PP
2009-01-28

Downloads
64 (#273,819)

6 months
11 (#263,140)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Jacob Martinez
University of Colorado, Boulder

Citations of this work

No citations found.

Add more citations

References found in this work

No references found.

Add more references