The Impact of Branching Heuristics in Propositional Satisfiability Algorithms

  • João Marques-Silva
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1695)


This paper studies the practical impact of the branching heuristics used in Propositional Satisfiability (SAT) algorithms, when applied to solving real-world instances of SAT. In addition, different SAT algorithms are experimentally evaluated. The main conclusion of this study is that even though branching heuristics are crucial for solving SAT, other aspects of the organization of SAT algorithms are also essential. Moreover, we provide empirical evidence that for practical instances of SAT, the search pruning techniques included in the most competitive SAT algorithms may be of more fundamental significance than branching heuristics.


Propositional Satisfiability Backtrack Search Branching Heuristics 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 1999

Authors and Affiliations

  • João Marques-Silva
    • 1
  1. 1.IST/INESCTechnical University of LisbonLisbonPortugal

Personalised recommendations