Computation of Renameable Horn Backdoors

DOI10.1007/978-3-540-79719-7_15zbMath1138.68542OpenAlexW1553642186MaRDI QIDQ3502704

Carsten Sinz, Michael Kaufmann, Stephan Kottler

Publication date: 27 May 2008

Published in: Theory and Applications of Satisfiability Testing – SAT 2008 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-79719-7_15

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items (2)

Tradeoffs in the complexity of backdoors to satisfiability: dynamic sub-solvers and learning during search ⋮ Fixed-Parameter Algorithms in Analysis of Heuristics for Extracting Networks in Linear Programs

Cites Work

• Unnamed Item
• Backdoor sets for DLL subsolvers
• Combinatorial algorithms for feedback problems in directed graphs
• A linear-time algorithm for testing the truth of certain quantified Boolean formulas
• Solving \#SAT using vertex covers
• Tradeoffs in the Complexity of Backdoor Detection
• Matched Formulas and Backdoor Sets
• Renaming a Set of Clauses as a Horn Set
• A Computing Procedure for Quantification Theory
• A machine program for theorem-proving
• Minimum Witnesses for Unsatisfiable 2CNFs

This page was built for publication: Computation of Renameable Horn Backdoors