Encoding First Order Proofs in SMT (Q2864408): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Theorem Proving via General Matings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5570212 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5679729 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A machine program for theorem-proving / rank
 
Normal rank
Property / cites work
 
Property / cites work: Protocol Verification Via Rigid/Flexible Resolution / rank
 
Normal rank
Property / cites work
 
Property / cites work: Encoding First Order Proofs in SAT / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4942635 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2751354 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2751380 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving SAT and SAT Modulo Theories / rank
 
Normal rank
Property / cites work
 
Property / cites work: The TPTP problem library. CNF release v1. 2. 1 / rank
 
Normal rank

Revision as of 03:01, 7 July 2024

scientific article
Language Label Description Also known as
English
Encoding First Order Proofs in SMT
scientific article

    Statements

    Encoding First Order Proofs in SMT (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    6 December 2013
    0 references
    SMT
    0 references
    first-order logic
    0 references
    tableau
    0 references
    Yices
    0 references
    0 references
    0 references
    0 references

    Identifiers