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

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1007/3-540-54317-1_92
+Normal rank
@@ Property / OpenAlex ID @@
+W1595261588
@@ Property / OpenAlex ID: W1595261588 / rank @@
+Normal rank
@@ Property / cites work @@
+Automated proofs of the Moufang identities in alternative rings
+Normal rank
@@ Property / cites work @@
+Q3809306
@@ Property / cites work: Q3809306 / rank @@
+Normal rank
@@ Property / cites work @@
+On fairness of completion-based theorem proving strategies
+Normal rank
@@ Property / cites work @@
+Q5679729
@@ Property / cites work: Q5679729 / rank @@
+Normal rank
@@ Property / cites work @@
+Proving termination with multiset orderings
@@ Property / cites work: Proving termination with multiset orderings / rank @@
+Normal rank
@@ Property / cites work @@
+Computing with rewrite systems
@@ Property / cites work: Computing with rewrite systems / rank @@
+Normal rank
@@ Property / cites work @@
+Termination of rewriting
@@ Property / cites work: Termination of rewriting / rank @@
+Normal rank
@@ Property / cites work @@
+Q3880309
@@ Property / cites work: Q3880309 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3674088
@@ Property / cites work: Q3674088 / rank @@
+Normal rank
@@ Property / cites work @@
+Refutational theorem proving using term-rewriting systems
+Normal rank
@@ Property / cites work @@
+Q3786024
@@ Property / cites work: Q3786024 / rank @@
+Normal rank
@@ Property / cites work @@
+Rewrite method for theorem proving in first order theory with equality
+Normal rank
@@ Property / cites work @@
+Q3028369
@@ Property / cites work: Q3028369 / rank @@
+Normal rank
@@ Property / cites work @@
+Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems
+Normal rank
@@ Property / cites work @@
+A complete proof of correctness of the Knuth-Bendix completion algorithm
+Normal rank
@@ Property / cites work @@
+Proofs by induction in equational theories with constructors
+Normal rank
@@ Property / cites work @@
+Completion of a Set of Rules Modulo a Set of Equations
+Normal rank
@@ Property / cites work @@
+Proof by consistency
@@ Property / cites work: Proof by consistency / rank @@
+Normal rank
@@ Property / cites work @@
+Q3783519
@@ Property / cites work: Q3783519 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5581665
@@ Property / cites work: Q5581665 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3798649
@@ Property / cites work: Q3798649 / rank @@
+Normal rank
@@ Property / cites work @@
+Complete Sets of Reductions for Some Equational Theories
+Normal rank
@@ Property / cites work @@
+A Technique for Establishing Completeness Results in Theorem Proving with Equality
+Normal rank
@@ Property / cites work @@
+Semantic confluence tests and completion methods
@@ Property / cites work: Semantic confluence tests and completion methods / rank @@
+Normal rank
@@ Property / cites work @@
+A Unification Algorithm for Associative-Commutative Functions
+Normal rank
@@ Property / cites work @@
+Q3789100
@@ Property / cites work: Q3789100 / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:5881279