Computation of renameable Horn backdoors

Authors:
Stephan Kottler;Michael Kaufmann;Carsten Sinz
Affiliations:
Eberhard Karls Universität Tübingen, Wilhelm-Schickard-Institute, Tübingen, Germany;Eberhard Karls Universität Tübingen, Wilhelm-Schickard-Institute, Tübingen, Germany;Eberhard Karls Universität Tübingen, Wilhelm-Schickard-Institute, Tübingen, Germany
Venue:
SAT'08 Proceedings of the 11th international conference on Theory and applications of satisfiability testing
Year:
2008

Citing 12
Cited 2

A Computing Procedure for Quantification Theory

Journal of the ACM (JACM)
Renaming a Set of Clauses as a Horn Set

Journal of the ACM (JACM)
A machine program for theorem-proving

Communications of the ACM
Combinatorial algorithms for feedback problems in directed graphs

Information Processing Letters
Backdoor Sets for DLL Subsolvers

Journal of Automated Reasoning
Computing Horn Strong Backdoor Sets Thanks to Local Search

ICTAI '06 Proceedings of the 18th IEEE International Conference on Tools with Artificial Intelligence
Solving #SAT using vertex covers

Acta Informatica
The backdoor key: a path to understanding problem hardness

AAAI'04 Proceedings of the 19th national conference on Artifical intelligence
Backdoors to typical case complexity

IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
Matched formulas and backdoor sets

SAT'07 Proceedings of the 10th international conference on Theory and applications of satisfiability testing
Tradeoffs in the complexity of backdoor detection

CP'07 Proceedings of the 13th international conference on Principles and practice of constraint programming
Minimum witnesses for unsatisfiable 2CNFs

SAT'06 Proceedings of the 9th international conference on Theory and Applications of Satisfiability Testing

Beyond unit propagation in SAT solving

SEA'11 Proceedings of the 10th international conference on Experimental algorithms
Finding small backdoors in SAT instances

Canadian AI'11 Proceedings of the 24th Canadian conference on Advances in artificial intelligence

Quantified Score

Hi-index	0.00

Visualization

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.