Efficiently checking propositional refutations in HOL theorem provers (Q1006729): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q4809056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theorem Proving in Higher Order Logics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Compressing Propositional Refutations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computer Aided Verification / rank
 
Normal rank
Property / cites work
 
Property / cites work: Geometric Resolution: A Proof Procedure Based on Finite Model Search / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theory and Applications of Satisfiability Testing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theory and Applications of Satisfiability Testing / 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: Q5287513 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2749862 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4809048 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2848688 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2723444 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automated Reasoning / rank
 
Normal rank
Property / cites work
 
Property / cites work: Applying SAT solving in classification of finite algebras / rank
 
Normal rank
Property / cites work
 
Property / cites work: Isabelle/HOL. A proof assistant for higher-order logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4249904 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Isabelle. A generic theorem prover / rank
 
Normal rank
Property / cites work
 
Property / cites work: A SAT-Based Decision Procedure for the Subclass of Unrollable List Formulas in ACL2 (SULFA) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4790648 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4427902 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5604434 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2848690 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theory and Applications of Satisfiability Testing / rank
 
Normal rank

Latest revision as of 05:17, 29 June 2024

scientific article
Language Label Description Also known as
English
Efficiently checking propositional refutations in HOL theorem provers
scientific article

    Statements

    Efficiently checking propositional refutations in HOL theorem provers (English)
    0 references
    0 references
    0 references
    25 March 2009
    0 references
    0 references
    interactive theorem proving
    0 references
    propositional resolution
    0 references
    LCF-style proof checking
    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