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

@inproceedings{Kottler2008ANB,
  title={A New Bound for an NP-Hard Subclass of 3-SAT Using Backdoors},
  author={Stephan Kottler and M. Kaufmann and C. Sinz},
  booktitle={SAT},
  year={2008}
}
Knowing a Backdoor Set B 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… Expand
Backdoors into heterogeneous classes of SAT and CSP
Backdoors to Tractable Answer-Set Programming
Backdoors to tractable answer set programming
Backdoors for Linear Temporal Logic
On Some Aspects of Mixed Horn Formulas
Backdoors for Linear Temporal Logic
Probabilistic Analysis of Random Mixed Horn Formulas
...
1
2
...

References

SHOWING 1-10 OF 20 REFERENCES
Detecting Backdoor Sets with Respect to Horn and Binary Clauses
Worst Case Bounds for some NP-Complete Modified Horn-SAT Problems
Solving #SAT Using Vertex Covers
Matched Formulas and Backdoor Sets
On good algorithms for determining unsatisfiability of propositional formulas
Backdoors To Typical Case Complexity
Satisfiability of mixed Horn formulas
The Backdoor Key: A Path to Understanding Problem Hardness
A Linear-Time Algorithm for Testing the Truth of Certain Quantified Boolean Formulas
...
1
2
...