What we can learn from conflicts in propositional satisfiability (Q2630816): Difference between revisions

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: MiniSat / 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/s10479-015-2028-9 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1531403982 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Resolution With Merging / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Generalized Framework for Conflict Analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Freezing and Reactivating Learnt Clauses / rank
 
Normal rank
Property / cites work
 
Property / cites work: GRASP: a search algorithm for propositional satisfiability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5503674 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Adaptive Restart Strategies for Conflict Driven SAT Solvers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4255462 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A machine program for theorem-proving / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving propositional satisfiability problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5687266 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theory and Applications of Satisfiability Testing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theory and Applications of Satisfiability Testing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Branch-and-cut solution of inference problems in propositional logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4386920 / 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: Forward reasoning and dependency-directed backtracking in a system for computer-aided circuit analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2786913 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3639756 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A linear-time transformation of linear inequalities into conjunctive normal form / rank
 
Normal rank
Property / cites work
 
Property / cites work: Learning from conflicts in propositional satisfiability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Clause Elimination Procedures for CNF Formulas / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient CNF Simplification Based on Binary Implication Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4523706 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Input Proofs and Rank One Cutting Planes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal speedup of Las Vegas algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Machine-Oriented Logic Based on the Resolution Principle / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Way to Simplify Truth Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theory and Applications of Satisfiability Testing / rank
 
Normal rank
Property / cites work
 
Property / cites work: SATO: An efficient propositional prover / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theory and Applications of Satisfiability Testing / rank
 
Normal rank

Latest revision as of 08:39, 12 July 2024

scientific article
Language Label Description Also known as
English
What we can learn from conflicts in propositional satisfiability
scientific article

    Statements

    What we can learn from conflicts in propositional satisfiability (English)
    0 references
    0 references
    0 references
    0 references
    22 July 2016
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    propositional satisfiability
    0 references
    constraint solving
    0 references
    reasoning
    0 references
    sat
    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