Tradeoffs in the complexity of backdoors to satisfiability: dynamic sub-solvers and learning during search (Q457253): Difference between revisions

@@ Property / describes a project that uses @@
+DIMACS
@@ Property / describes a project that uses: DIMACS / rank @@
+Normal rank
@@ Property / describes a project that uses @@
+Chaff
@@ Property / describes a project that uses: Chaff / rank @@
+Normal rank
@@ Property / describes a project that uses @@
+RSat
@@ Property / describes a project that uses: RSat / rank @@
+Normal rank
@@ Property / describes a project that uses @@
+MiniSat
@@ Property / describes a project that uses: MiniSat / rank @@
+Normal rank
@@ Property / describes a project that uses @@
+SATLIB
@@ Property / describes a project that uses: SATLIB / rank @@
+Normal rank
@@ Property / describes a project that uses @@
+CPLEX
@@ Property / describes a project that uses: CPLEX / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1007/s10472-014-9407-9
+Normal rank
@@ Property / OpenAlex ID @@
+W2086971834
@@ Property / OpenAlex ID: W2086971834 / rank @@
+Normal rank
@@ Property / cites work @@
+Recognizing disguised NR(1) instances of the satisfiability problem
+Normal rank
@@ Property / cites work @@
+A linear-time algorithm for testing the truth of certain quantified Boolean formulas
+Normal rank
@@ Property / cites work @@
+Q5715680
@@ Property / cites work: Q5715680 / rank @@
+Normal rank
@@ Property / cites work @@
+Network-based heuristics for constraint-satisfaction problems
+Normal rank
@@ Property / cites work @@
+Q5687250
@@ Property / cites work: Q5687250 / rank @@
+Normal rank
@@ Property / cites work @@
+Symbolic model checking: \(10^{20}\) states and beyond
+Normal rank
@@ Property / cites work @@
+Detecting embedded Horn structure in propositional logic
+Normal rank
@@ Property / cites work @@
+Beyond Hypertree Width: Decomposition Methods Without Decompositions
+Normal rank
@@ Property / cites work @@
+Q4475647
@@ Property / cites work: Q4475647 / rank @@
+Normal rank
@@ Property / cites work @@
+A Computing Procedure for Quantification Theory
@@ Property / cites work: A Computing Procedure for Quantification Theory / rank @@
+Normal rank
@@ Property / cites work @@
+A machine program for theorem-proving
@@ Property / cites work: A machine program for theorem-proving / rank @@
+Normal rank
@@ Property / cites work @@
+Boosting search with variable elimination in constraint optimization and constraint satisfaction problems
+Normal rank
@@ Property / cites work @@
+Q4012214
@@ Property / cites work: Q4012214 / rank @@
+Normal rank
@@ Property / cites work @@
+Tradeoffs in the Complexity of Backdoor Detection
@@ Property / cites work: Tradeoffs in the Complexity of Backdoor Detection / rank @@
+Normal rank
@@ Property / cites work @@
+Backdoor sets for DLL subsolvers
@@ Property / cites work: Backdoor sets for DLL subsolvers / rank @@
+Normal rank
@@ Property / cites work @@
+Backdoors to Combinatorial Optimization: Feasibility and Optimality
+Normal rank
@@ Property / cites work @@
+Backdoors in the Context of Learning
@@ Property / cites work: Backdoors in the Context of Learning / rank @@
+Normal rank
@@ Property / cites work @@
+Linear-time algorithms for testing the satisfiability of propositional horn formulae
+Normal rank
@@ Property / cites work @@
+Q4393480
@@ Property / cites work: Q4393480 / rank @@
+Normal rank
@@ Property / cites work @@
+Theory and Applications of Satisfiability Testing
@@ Property / cites work: Theory and Applications of Satisfiability Testing / rank @@
+Normal rank
@@ Property / cites work @@
+Q3267900
@@ Property / cites work: Q3267900 / rank @@
+Normal rank
@@ Property / cites work @@
+Backdoors to Normality for Disjunctive Logic Programs
+Normal rank
@@ Property / cites work @@
+Parametrized complexity theory.
@@ Property / cites work: Parametrized complexity theory. / rank @@
+Normal rank
@@ Property / cites work @@
+A Sufficient Condition for Backtrack-Free Search
@@ Property / cites work: A Sufficient Condition for Backtrack-Free Search / rank @@
+Normal rank
@@ Property / cites work @@
+A sufficient condition for backtrack-bounded search
+Normal rank
@@ Property / cites work @@
+Heavy-tailed phenomena in satisfiability and constraint satisfaction problems
+Normal rank
@@ Property / cites work @@
+Unit Refutations and Horn Sets
@@ Property / cites work: Unit Refutations and Horn Sets / rank @@
+Normal rank
@@ Property / cites work @@
+Structure and Problem Hardness: Goal Asymmetry and DPLL Proofs in SAT-Based Planning
+Normal rank
@@ Property / cites work @@
+Q2749862
@@ Property / cites work: Q2749862 / rank @@
+Normal rank
@@ Property / cites work @@
+Computation of Renameable Horn Backdoors
@@ Property / cites work: Computation of Renameable Horn Backdoors / rank @@
+Normal rank
@@ Property / cites work @@
+Renaming a Set of Clauses as a Horn Set
@@ Property / cites work: Renaming a Set of Clauses as a Horn Set / rank @@
+Normal rank
@@ Property / cites work @@
+Non-cooperative games
@@ Property / cites work: Non-cooperative games / rank @@
+Normal rank
@@ Property / cites work @@
+Solving #SAT Using Vertex Covers
@@ Property / cites work: Solving #SAT Using Vertex Covers / rank @@
+Normal rank
@@ Property / cites work @@
+Backdoor sets of quantified Boolean formulas
@@ Property / cites work: Backdoor sets of quantified Boolean formulas / rank @@
+Normal rank
@@ Property / cites work @@
+Almost 2-SAT is fixed-parameter tractable
@@ Property / cites work: Almost 2-SAT is fixed-parameter tractable / rank @@
+Normal rank
@@ Property / cites work @@
+Constraint Satisfaction with Bounded Treewidth Revisited
+Normal rank
@@ Property / cites work @@
+On the minimality and global consistency of row-convex constraint networks
+Normal rank