Theorem proving modulo (Q1431339): Difference between revisions

From MaRDI portal
ReferenceBot (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q6488530 / rank
 
Normal rank

Latest revision as of 10:00, 4 December 2024

scientific article
Language Label Description Also known as
English
Theorem proving modulo
scientific article

    Statements

    Theorem proving modulo (English)
    0 references
    0 references
    0 references
    0 references
    27 May 2004
    0 references
    The authors argue that theorem proving can be divided into a computation part and a deduction part. Deduction modulo is a method to remove the computational arguments from proofs. A proof search method is presented based on extended narrowing and resolution which is sound and complete with respect to the sequent calculus modulo, for a large class of congruences.
    0 references
    automated theorem proving
    0 references
    term rewriting
    0 references
    resolution
    0 references
    narrowing
    0 references
    higher-order logic
    0 references
    cut elimination
    0 references
    deduction modulo
    0 references
    sequent calculus modulo
    0 references
    Skolemization
    0 references
    combinators
    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
    0 references

    Identifiers