Completion for rewriting modulo a congruence (Q1262752): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Critical pair criteria for completion / rank
 
Normal rank
Property / cites work
 
Property / cites work: Termination orderings for associative-commutative rewriting systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Termination of rewriting systems by polynomial interpretations and its implementation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proving termination with multiset orderings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3338216 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complete sets of unifiers and matchers in equational theories / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3782762 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Refutational theorem proving using term-rewriting systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3673071 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Completion of a Set of Rules Modulo a Set of Equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Only prime superpositions need be considered in the Knuth-Bendix completion procedure / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3993363 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5581665 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3993260 / rank
 
Normal rank
Property / cites work
 
Property / cites work: New decision algorithms for finitely presented commutative semigroups / 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: Q5678447 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3678694 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automated Theorem-Proving for Theories with Simplifiers Commutativity, and Associativity / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Unification Algorithm for Associative-Commutative Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3675515 / rank
 
Normal rank

Latest revision as of 11:40, 20 June 2024

scientific article
Language Label Description Also known as
English
Completion for rewriting modulo a congruence
scientific article

    Statements

    Completion for rewriting modulo a congruence (English)
    0 references
    0 references
    0 references
    1989
    0 references
    See the review in Zbl 0659.68114.
    0 references
    completion
    0 references
    rewriting modulo a congruence
    0 references
    equational inference
    0 references
    reasoning
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references