Completeness issues in RUE-NRF deduction: The undecidability of viability (Q1311402): Difference between revisions

@@ Property / cites work @@
+Paraconsistent logic programming
@@ Property / cites work: Paraconsistent logic programming / rank @@
+Normal rank
@@ Property / cites work @@
+Q5679729
@@ Property / cites work: Q5679729 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3490993
@@ Property / cites work: Q3490993 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3992908
@@ Property / cites work: Q3992908 / rank @@
+Normal rank
@@ Property / cites work @@
+Complete logic programs with domain-closure axiom
@@ Property / cites work: Complete logic programs with domain-closure axiom / rank @@
+Normal rank
@@ Property / cites work @@
+Experiments with semantic paramodulation
@@ Property / cites work: Experiments with semantic paramodulation / rank @@
+Normal rank
@@ Property / cites work @@
+Q5624683
@@ Property / cites work: Q5624683 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3883568
@@ Property / cites work: Q3883568 / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1007/bf00881797
+Normal rank
@@ Property / OpenAlex ID @@
+W1992485981
@@ Property / OpenAlex ID: W1992485981 / rank @@
+Normal rank