Tradeoffs in the complexity of backdoors to satisfiability: dynamic sub-solvers and learning during search
From MaRDI portal
(Redirected from Publication:457253)
Recommendations
Cites work
- scientific article; zbMATH DE number 3150484 (Why is no real title available?)
- scientific article; zbMATH DE number 67482 (Why is no real title available?)
- scientific article; zbMATH DE number 1161563 (Why is no real title available?)
- scientific article; zbMATH DE number 2084720 (Why is no real title available?)
- scientific article; zbMATH DE number 956843 (Why is no real title available?)
- scientific article; zbMATH DE number 2243370 (Why is no real title available?)
- A Computing Procedure for Quantification Theory
- A Sufficient Condition for Backtrack-Free Search
- A linear-time algorithm for testing the truth of certain quantified Boolean formulas
- A machine program for theorem-proving
- A sufficient condition for backtrack-bounded search
- Almost 2-SAT is fixed-parameter tractable
- Backdoor sets for DLL subsolvers
- Backdoor sets of quantified Boolean formulas
- Backdoors in the Context of Learning
- Backdoors to Combinatorial Optimization: Feasibility and Optimality
- Backdoors to normality for disjunctive logic programs
- Beyond Hypertree Width: Decomposition Methods Without Decompositions
- Boosting search with variable elimination in constraint optimization and constraint satisfaction problems
- Computation of Renameable Horn Backdoors
- Constraint Satisfaction with Bounded Treewidth Revisited
- Detecting embedded Horn structure in propositional logic
- Heavy-tailed phenomena in satisfiability and constraint satisfaction problems
- Linear-time algorithms for testing the satisfiability of propositional horn formulae
- Network-based heuristics for constraint-satisfaction problems
- Non-cooperative games
- On the minimality and global consistency of row-convex constraint networks
- Parametrized complexity theory.
- Recognizing disguised NR(1) instances of the satisfiability problem
- Renaming a Set of Clauses as a Horn Set
- SATLIB: An online resource for research on SAT
- Solving #SAT Using Vertex Covers
- Structure and Problem Hardness: Goal Asymmetry and DPLL Proofs in SAT-Based Planning
- Symbolic model checking: \(10^{20}\) states and beyond
- Theory and Applications of Satisfiability Testing
- Tradeoffs in the Complexity of Backdoor Detection
- Unit Refutations and Horn Sets
Cited in
(8)- Backdoors to Combinatorial Optimization: Feasibility and Optimality
- Answer set solver backdoors
- Backdoors in the Context of Learning
- Backdoors into heterogeneous classes of SAT and CSP
- Solving d-SAT via Backdoors to Small Treewidth
- Backdoor sets for DLL subsolvers
- The opacity of backbones
- Existence versus exploitation: the opacity of backdoors and backbones under a weak assumption
This page was built for publication: Tradeoffs in the complexity of backdoors to satisfiability: dynamic sub-solvers and learning during search
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q457253)
