Q3700828 (Q3700828): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: REVE / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: Publication / rank
 
Normal rank
Property / cites work
 
Property / cites work: Orderings for term-rewriting systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing with rewrite systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proving termination with multiset orderings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Programming with Equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: A complete proof of correctness of the Knuth-Bendix completion algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3659124 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On multiset orderings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3667939 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5581665 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing in systems described by equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complete Sets of Reductions for Some Equational Theories / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tree-Manipulating Systems and Church-Rosser Theorems / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 19:34, 14 June 2024

scientific article
Language Label Description Also known as
English
No label defined
scientific article

    Statements

    0 references
    1985
    0 references
    automatic inference method
    0 references
    minimal partial ordering
    0 references
    function symbols
    0 references
    term-rewriting rules
    0 references
    Prolog program
    0 references
    complete automation of the Knuth- Bendix method
    0 references
    termination-proving program
    0 references

    Identifiers