A New Bound for an NP-Hard Subclass of 3-SAT Using Backdoors

  • Stephan Kottler
  • Michael Kaufmann
  • Carsten Sinz
Conference paper

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

Part of the Lecture Notes in Computer Science book series (LNCS, volume 4996)
Cite this paper as:
Kottler S., Kaufmann M., Sinz C. (2008) A New Bound for an NP-Hard Subclass of 3-SAT Using 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

Knowing a Backdoor SetB for a given Sat instance, satisfiability can be decided by only examining each of the 2|B| truth assignments of the variables in B. However, one problem is to efficiently find a small backdoor up to a particular size and, furthermore, if no backdoor of the desired size could be found, there is in general no chance to conclude anything about satisfiability.

In this paper we introduce a complete deterministic algorithm for an NP-hard subclass of 3-Sat, that is also a subclass of Mixed Horn Formulas (MHF). For an instance of the described class the absence of two particular kinds of backdoor sets can be used to prove unsatisfiability. The upper bound of this algorithm is O(p(n)*1.427n) which is less than the currently best upper bound for deterministic algorithms for 3-Sat and MHF.

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