Backdoor sets for DLL subsolvers

DOI10.1007/s10817-005-9007-9zbMath1109.68105OpenAlexW2027605646MaRDI QIDQ862400

Stefan Szeider

Publication date: 24 January 2007

Published in: Journal of Automated Reasoning (Search for Journal in Brave)

Full work available at URL: http://dro.dur.ac.uk/1911/1/1911.pdf

zbMATH Keywords

propositional satisfiability problem

Mathematics Subject Classification ID

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

Related Items

Data reductions, fixed parameter tractability, and random weighted \(d\)-CNF satisfiability ⋮ Backdoors to Satisfaction ⋮ Random Instances of W[2-Complete Problems: Thresholds, Complexity, and Algorithms] ⋮ Computation of Renameable Horn Backdoors ⋮ Tradeoffs in the Complexity of Backdoor Detection ⋮ Tradeoffs in the complexity of backdoors to satisfiability: dynamic sub-solvers and learning during search ⋮ DPLL: The Core of Modern Satisfiability Solvers ⋮ Solving \#SAT using vertex covers ⋮ The parameterized complexity of editing graphs for bounded degeneracy ⋮ Backdoors in the Context of Learning ⋮ Backdoor sets of quantified Boolean formulas

Cites Work

• Unnamed Item
• Unnamed Item
• Fixed-parameter tractability and completeness. IV: On completeness for W\([\) P\(\) and PSPACE analogues]
• Analysis of cyclic combinational circuits
• A Computing Procedure for Quantification Theory
• A machine program for theorem-proving