Automata-driven automated induction (Q1854445): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / OpenAlex ID
 
Property / OpenAlex ID: W2120053687 / 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: Specification and proof in membership equational logic / 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: Encompassment properties and automata with constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3805960 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inductive proofs by specification transformations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Equational formulae with membership constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: A methodological view of constraint solving / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5753923 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4385532 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A rationale for conditional equational programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3719824 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3883561 / 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: Conditional rewrite rules / rank
 
Normal rank
Property / cites work
 
Property / cites work: Positive and negative results for higher-order disunification / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tree automata help one to solve equational formulae in AC-theories / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4222853 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3805961 / rank
 
Normal rank

Latest revision as of 11:11, 5 June 2024

scientific article
Language Label Description Also known as
English
Automata-driven automated induction
scientific article

    Statements

    Automata-driven automated induction (English)
    0 references
    0 references
    0 references
    14 January 2003
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    inductive theorem proving
    0 references
    tree automata
    0 references
    complete axiomatization
    0 references
    finite trees
    0 references
    0 references
    0 references
    0 references
    0 references