Generating extended resolution proofs with a BDD-based SAT solver (Q2044191): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Mutilated chessboard problem is exponentially hard for resolution / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph-Based Algorithms for Boolean Function Manipulation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Binary Decision Diagrams / 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: Efficient certified RAT verification / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Computing Procedure for Quantification Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bucket elimination: A unifying framework for reasoning / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theory and Applications of Satisfiability Testing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Resolution and binary decision diagrams cannot simulate each other polynomially / rank
 
Normal rank
Property / cites work
 
Property / cites work: The intractability of resolution / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5219922 / rank
 
Normal rank
Property / cites work
 
Property / cites work: What a difference a variable makes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient, verified checking of propositional proofs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extended Resolution Proofs for Symbolic SAT Solving with Quantification / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a generalization of extended resolution / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient verified (UN)SAT certificate checking / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theory and Applications of Satisfiability Testing / 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: Towards an Optimal CNF Encoding of Boolean Cardinality Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extended Resolution Proofs for Conjoining BDDs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3682462 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ordered Binary Decision Diagrams and the Davis-Putnam procedure / rank
 
Normal rank
Property / cites work
 
Property / cites work: DRAT-trim: Efficient Checking and Trimming Using Expressive Clausal Proofs / rank
 
Normal rank

Latest revision as of 07:35, 26 July 2024

scientific article
Language Label Description Also known as
English
Generating extended resolution proofs with a BDD-based SAT solver
scientific article

    Statements

    Generating extended resolution proofs with a BDD-based SAT solver (English)
    0 references
    0 references
    0 references
    4 August 2021
    0 references
    extended resolution
    0 references
    binary decision diagrams
    0 references
    mutilated chessboard
    0 references
    pigeonhole problem
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references