Decidability and complexity analysis by basic paramodulation (Q1281494): Difference between revisions

@@ Property / DOI @@
-.1006/inco.1998.2730
@@ Property / DOI: 10.1006/inco.1998.2730 / rank @@
-Normal rank
@@ Property / cites work @@
+Rewrite-based Equational Theorem Proving with Selection and Simplification
+Normal rank
@@ Property / cites work @@
+Basic paramodulation
@@ Property / cites work: Basic paramodulation / rank @@
+Normal rank
@@ Property / cites work @@
+Q4282593
@@ Property / cites work: Q4282593 / rank @@
+Normal rank
@@ Property / cites work @@
+Syntacticness, cycle-syntacticness and shallow theories
+Normal rank
@@ Property / cites work @@
+Termination of rewriting
@@ Property / cites work: Termination of rewriting / rank @@
+Normal rank
@@ Property / cites work @@
+Q4385532
@@ Property / cites work: Q4385532 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4282510
@@ Property / cites work: Q4282510 / rank @@
+Normal rank
@@ Property / cites work @@
+On ground AC-completion
@@ Property / cites work: On ground AC-completion / rank @@
+Normal rank
@@ Property / cites work @@
+Any ground associative-commutative theory has a finite canonical system
+Normal rank
@@ Property / cites work @@
+On narrowing, refutation proofs and constraints
@@ Property / cites work: On narrowing, refutation proofs and constraints / rank @@
+Normal rank
@@ Property / cites work @@
+Theorem proving with ordering and equality constrained clauses
+Normal rank
@@ Property / DOI @@
+.1006/INCO.1998.2730
@@ Property / DOI: 10.1006/INCO.1998.2730 / rank @@
+Normal rank