A completion-based method for mixed universal and rigid E-unification (Q5210805): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1007/3-540-58156-1_49
+Normal rank
@@ Property / OpenAlex ID @@
+W1606566547
@@ Property / OpenAlex ID: W1606566547 / rank @@
+Normal rank
@@ Property / cites work @@
+Completion for rewriting modulo a congruence
@@ Property / cites work: Completion for rewriting modulo a congruence / rank @@
+Normal rank
@@ Property / cites work @@
+Termination of rewriting
@@ Property / cites work: Termination of rewriting / rank @@
+Normal rank
@@ Property / cites work @@
+Rigid E-unification: NP-completeness and applications to equational matings
+Normal rank
@@ Property / cites work @@
+Theorem proving using equational matings and rigid             <i>E</i>             -unification
+Normal rank
@@ Property / cites work @@
+Q5581665
@@ Property / cites work: Q5581665 / rank @@
+Normal rank
@@ Property / cites work @@
+Basic narrowing revisited
@@ Property / cites work: Basic narrowing revisited / rank @@
+Normal rank
@@ Property / cites work @@
+Q2914641
@@ Property / cites work: Q2914641 / rank @@
+Normal rank