Resolution proof transformation for compression and interpolation (Q479815): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / arXiv ID
 
Property / arXiv ID: 1307.2028 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solvable cases of the decision problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Compressing Propositional Refutations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Data compression for proof replay / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4417909 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Splitting on Demand in SAT Modulo Theories / rank
 
Normal rank
Property / cites work
 
Property / cites work: Compression of Propositional Resolution Proofs by Lowering Subproofs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computer Aided Verification / rank
 
Normal rank
Property / cites work
 
Property / cites work: SAT-Based Model Checking without Unrolling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3181652 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating minimal unsatisfiable subformulae by means of adaptive core search / rank
 
Normal rank
Property / cites work
 
Property / cites work: Resolution proof transformation for compression and interpolation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proof Tree Preserving Interpolation / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Simple and Flexible Way of Computing Small Unsatisfiable Cores in SAT Modulo Theories / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient Interpolant Generation in Satisfiability Modulo Theories / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two Techniques for Minimizing Resolution Proofs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Three uses of the Herbrand-Gentzen theorem in relating model theory and proof theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Scalable Algorithm for Minimal Unsatisfiable Core Extraction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Interpolant Strength / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tools and Algorithms for the Construction and Analysis of Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Compression of Propositional Resolution Proofs via Partial Regularization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Untersuchungen über das logische Schliessen. I / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ground Interpolation for Combined Theories / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3506045 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3184604 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Local-search extraction of mUSes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proof-guided underapproximation-widening for multi-process systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved Single Pass Algorithms for Resolution Proof Reduction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Abstractions from proofs / rank
 
Normal rank
Property / cites work
 
Property / cites work: DRAT-trim: Efficient Checking and Trimming Using Expressive Clausal Proofs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computer Aided Verification / rank
 
Normal rank
Property / cites work
 
Property / cites work: Interpolation theorems, lower bounds for proof systems, and independence results for bounded arithmetic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computer Aided Verification / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tools and Algorithms for the Construction and Analysis of Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computer Science Logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theory and Applications of Satisfiability Testing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simplification by Cooperating Decision Procedures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower bounds for resolution and cutting plane proofs and monotone computations / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Efficient and Flexible Approach to Resolution Proof Reduction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficiently checking propositional refutations in HOL theorem provers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automated Deduction – CADE-20 / rank
 
Normal rank

Latest revision as of 10:43, 9 July 2024

scientific article
Language Label Description Also known as
English
Resolution proof transformation for compression and interpolation
scientific article

    Statements

    Resolution proof transformation for compression and interpolation (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    5 December 2014
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    resolution system
    0 references
    Craig interpolation
    0 references
    proof compression
    0 references
    formal verification
    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
    0 references
    0 references
    0 references
    0 references