Improving Coq Propositional Reasoning Using a Lazy CNF Conversion Scheme (Q3655207): Difference between revisions

From MaRDI portal
Changed an 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: Coq / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: SIMPLIFY / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: Chaff / 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-04222-5_18 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2144407603 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automated proof construction in type theory using resolution / rank
 
Normal rank
Property / cites work
 
Property / cites work: Zenon: An Extensible Automated Theorem Prover Producing Checkable Proofs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automated Deduction – CADE-20 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Certification of Automated Termination Proofs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Structural Analysis of Narratives with the Coq Proof Assistant / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deciding Equality in the Constructor Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: A machine program for theorem-proving / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Computing Procedure for Quantification Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient E-Matching for SMT Solvers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simplify: a theorem prover for program checking / rank
 
Normal rank
Property / cites work
 
Property / cites work: Contraction-free sequent calculi for intuitionistic 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: Theorem Proving in Higher Order Logics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automation for interactive proof: first prototype / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4249904 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A structure-preserving clause form translation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficiently checking propositional refutations in HOL theorem provers / rank
 
Normal rank

Latest revision as of 08:52, 2 July 2024

scientific article
Language Label Description Also known as
English
Improving Coq Propositional Reasoning Using a Lazy CNF Conversion Scheme
scientific article

    Statements

    Improving Coq Propositional Reasoning Using a Lazy CNF Conversion Scheme (English)
    0 references
    0 references
    0 references
    7 January 2010
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers