A Prolog-like inference system for computing minimum-cost abductive explanations in natural-language interpretation (Q1354059): Difference between revisions

@@ Property / cites work @@
+Theorem Proving via General Matings
@@ Property / cites work: Theorem Proving via General Matings / rank @@
+Normal rank
@@ Property / cites work @@
+Cost-based abduction and MAP explanation
@@ Property / cites work: Cost-based abduction and MAP explanation / rank @@
+Normal rank
@@ Property / cites work @@
+Q3786007
@@ Property / cites work: Q3786007 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4039734
@@ Property / cites work: Q4039734 / rank @@
+Normal rank
@@ Property / cites work @@
+Refutation graphs
@@ Property / cites work: Refutation graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q3675177
@@ Property / cites work: Q3675177 / rank @@
+Normal rank
@@ Property / cites work @@
+A Prolog technology theorem prover: Implementation by an extended Prolog compiler
+Normal rank