A general framework to build contextual cover set induction provers (Q5950934): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Mechanizing structural induction. II: Strategies / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4336265 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Buchberger's algorithm: A constraint-based completion procedure / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4693774 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Behavioural approaches to algebraic specifications. A comparative study / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proof by consistency in conditional equational theories / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5762080 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Using induction and rewriting to verify and complete parameterized specifications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automated theorem proving by test set induction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automated Mathematical Induction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Implicit induction in conditional theories / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3490989 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Conditional rewriting in focus / rank
 
Normal rank
Property / cites work
 
Property / cites work: Induction using term orders / rank
 
Normal rank
Property / cites work
 
Property / cites work: Orderings for term-rewriting systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proving termination with multiset orderings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3221381 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A strong restriction of the inductive completion procedure / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3943975 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proofs by induction in equational theories with constructors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automatic proofs by induction in theories without constructors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automating inductionless induction using test sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proofs in parameterized specifications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5581665 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4712663 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3427354 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4139711 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3034806 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deduction and Declarative Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: On notions of inductive validity for first-order equational clauses / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3805961 / rank
 
Normal rank

Latest revision as of 21:54, 3 June 2024

scientific article; zbMATH DE number 1684880
Language Label Description Also known as
English
A general framework to build contextual cover set induction provers
scientific article; zbMATH DE number 1684880

    Statements

    A general framework to build contextual cover set induction provers (English)
    0 references
    0 references
    2 January 2002
    0 references
    0 references
    contextual cover set
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references