Soundness of Inprocessing in Clause Sharing SAT Solvers

  • Norbert Manthey
  • Tobias Philipp
  • Christoph Wernhard
Conference paper

DOI: 10.1007/978-3-642-39071-5_4

Part of the Lecture Notes in Computer Science book series (LNCS, volume 7962)
Cite this paper as:
Manthey N., Philipp T., Wernhard C. (2013) Soundness of Inprocessing in Clause Sharing SAT Solvers. In: Järvisalo M., Van Gelder A. (eds) Theory and Applications of Satisfiability Testing – SAT 2013. SAT 2013. Lecture Notes in Computer Science, vol 7962. Springer, Berlin, Heidelberg

Abstract

We present a formalism that models the computation of clause sharing portfolio solvers with inprocessing. The soundness of these solvers is not a straightforward property since shared clauses can make a formula unsatisfiable. Therefore, we develop characterizations of simplification techniques and suggest various settings how clause sharing and inprocessing can be combined. Our formalization models most of the recent implemented portfolio systems and we indicate possibilities to improve these. A particular improvement is a novel way to combine clause addition techniques – like blocked clause addition – with clause deletion techniques – like blocked clause elimination or variable elimination.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2013

Authors and Affiliations

  • Norbert Manthey
    • 1
  • Tobias Philipp
    • 1
  • Christoph Wernhard
    • 1
  1. 1.Knowledge Representation and Reasoning GroupTechnische Universität DresdenGermany

Personalised recommendations