Completion procedures as semidecision procedures (Q5881279): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Automated proofs of the Moufang identities in alternative rings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3809306 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On fairness of completion-based theorem proving strategies / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5679729 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proving termination with multiset orderings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing with rewrite systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Termination of rewriting / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3880309 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3674088 / 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: Q3786024 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rewrite method for theorem proving in first order theory with equality / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3028369 / 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: A complete proof of correctness of the Knuth-Bendix completion algorithm / 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: Completion of a Set of Rules Modulo a Set of Equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proof by consistency / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3783519 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5581665 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3798649 / 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: A Technique for Establishing Completeness Results in Theorem Proving with Equality / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semantic confluence tests and completion methods / 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: Q3789100 / rank
 
Normal rank

Latest revision as of 15:50, 31 July 2024

scientific article; zbMATH DE number 7661650
Language Label Description Also known as
English
Completion procedures as semidecision procedures
scientific article; zbMATH DE number 7661650

    Statements

    Completion procedures as semidecision procedures (English)
    0 references
    0 references
    0 references
    9 March 2023
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references