Compression of Propositional Resolution Proofs via Partial Regularization (Q5200028): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 3 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: Scala / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: veriT / 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/978-3-642-22438-6_19 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W92083396 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5503674 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two Techniques for Minimizing Resolution Proofs / rank
 
Normal rank

Latest revision as of 09:09, 4 July 2024

scientific article; zbMATH DE number 5934354
Language Label Description Also known as
English
Compression of Propositional Resolution Proofs via Partial Regularization
scientific article; zbMATH DE number 5934354

    Statements

    Compression of Propositional Resolution Proofs via Partial Regularization (English)
    0 references
    0 references
    0 references
    29 July 2011
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references