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

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

Latest revision as of 01:54, 9 July 2024

scientific article
Language Label Description Also known as
English
Tradeoffs in the complexity of backdoors to satisfiability: dynamic sub-solvers and learning during search
scientific article

    Statements

    Tradeoffs in the complexity of backdoors to satisfiability: dynamic sub-solvers and learning during search (English)
    0 references
    0 references
    0 references
    0 references
    26 September 2014
    0 references
    Boolean satisfiability
    0 references
    backdoor sets
    0 references
    Horn
    0 references
    RHorn
    0 references
    clause learning
    0 references
    search
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers