Simulating strong practical proof systems with extended resolution (Q2209554): Difference between revisions

From MaRDI portal
Added link to MaRDI 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: Chaff / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: SaDiCaL / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: DRAT-trim / 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/s10817-020-09554-z / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3046591311 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mutilated chessboard problem is exponentially hard for resolution / rank
 
Normal rank
Property / cites work
 
Property / cites work: Methods of cut-elimination / rank
 
Normal rank
Property / cites work
 
Property / cites work: The relative efficiency of propositional proof systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient certified RAT verification / rank
 
Normal rank
Property / cites work
 
Property / cites work: The intractability of resolution / rank
 
Normal rank
Property / cites work
 
Property / cites work: What a difference a variable makes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving and Verifying the Boolean Pythagorean Triples Problem via Cube-and-Conquer / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient, verified checking of propositional proofs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Short proofs without new variables / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strong extension-free proof systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Blocked Clause Elimination / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inprocessing Rules / 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: Extended resolution simulates \({\mathsf{DRAT}}\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computer-aided proof of Erdős discrepancy properties / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a generalization of extended resolution / 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: Towards a Semantics of Unsatisfiability Proofs with Inprocessing / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Theory of Satisfiability-Preserving Proofs in SAT Solving / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extended Resolution Proofs for Conjoining BDDs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5604434 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hard examples for resolution / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of Propositional Proofs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Producing and verifying extremely large propositional refutations / 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 23:41, 23 July 2024

scientific article
Language Label Description Also known as
English
Simulating strong practical proof systems with extended resolution
scientific article

    Statements

    Simulating strong practical proof systems with extended resolution (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    2 November 2020
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    propositional logic
    0 references
    SAT
    0 references
    SAT solving
    0 references
    proof complexity
    0 references
    resolution
    0 references
    DRAT
    0 references
    DPR
    0 references
    blocked clauses
    0 references
    0 references
    0 references
    0 references
    0 references