Computation of Renameable Horn Backdoors

  • Stephan Kottler
  • Michael Kaufmann
  • Carsten Sinz
Conference paper

DOI: 10.1007/978-3-540-79719-7_15

Part of the Lecture Notes in Computer Science book series (LNCS, volume 4996)
Cite this paper as:
Kottler S., Kaufmann M., Sinz C. (2008) Computation of Renameable Horn Backdoors. In: Kleine Büning H., Zhao X. (eds) Theory and Applications of Satisfiability Testing – SAT 2008. SAT 2008. Lecture Notes in Computer Science, vol 4996. Springer, Berlin, Heidelberg

Abstract

Satisfiability of real-world Sat instances can be often decided by focusing on a particular subset of variables - a so-called Backdoor Set. In this paper we suggest two algorithms to compute Renameable Horn deletion backdoors. Both methods are based on the idea to transform the computation into a graph problem. This approach could be used as a preprocessing to solve hard real-world Sat instances. We also give some experimental results of the computations of Renameable Horn backdoors for several real-world instances.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2008

Authors and Affiliations

  • Stephan Kottler
    • 1
  • Michael Kaufmann
    • 1
  • Carsten Sinz
    • 1
  1. 1.Wilhelm–Schickard–InstituteEberhard Karls Universität TübingenTübingenGermany

Personalised recommendations