A Prolog-like inference system for computing minimum-cost abductive explanations in natural-language interpretation (Q1354059): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
ReferenceBot (talk | contribs) Changed an Item |
||
(One intermediate revision by one other user not shown) | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Theorem Proving via General Matings / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Cost-based abduction and MAP explanation / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3786007 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4039734 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Refutation graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3675177 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A Prolog technology theorem prover: Implementation by an extended Prolog compiler / rank | |||
Normal rank |
Latest revision as of 11:26, 27 May 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | A Prolog-like inference system for computing minimum-cost abductive explanations in natural-language interpretation |
scientific article |
Statements
A Prolog-like inference system for computing minimum-cost abductive explanations in natural-language interpretation (English)
0 references
13 May 1997
0 references