A Prolog-like inference system for computing minimum-cost abductive explanations in natural-language interpretation

DOI10.1007/BF01531174zbMath1004.68552MaRDI QIDQ1354059

Mark E. Stickel

Publication date: 13 May 1997

Published in: Annals of Mathematics and Artificial Intelligence (Search for Journal in Brave)

Mathematics Subject Classification ID

Logic programming (68N17) Natural language processing (68T50)

Related Items (13)

Theory refinement combining analytical and empirical methods ⋮ Cost-based abduction and MAP explanation ⋮ The role of relevance in explanation. I: Irrelevance as statistical independence ⋮ Upside-down meta-interpretation of the model elimination theorem-proving procedure for deduction and abduction ⋮ Generating contrastive explanations for inductive logic programming based on a near miss approach ⋮ Abductive retrieval of structured documents ⋮ A Prolog technology theorem prover: A new exposition and implementation in Prolog ⋮ Logic programming, abduction and probability. A top-down anytime algorithm for estimating prior and posterior probabilities ⋮ An algorithm for finding MAPs for belief networks through cost-based abduction ⋮ Abductive Reasoning for Continual Dialogue Understanding ⋮ The role of relevance in explanation. II: Disjunctive assignments and approximate independence ⋮ Artificial explanations: The epistemological interpretation of explanation in AI ⋮ A linear constraint satisfaction approach to cost-based abduction

Cites Work

• A Prolog technology theorem prover: Implementation by an extended Prolog compiler
• Refutation graphs
• Cost-based abduction and MAP explanation
• Theorem Proving via General Matings
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A Prolog-like inference system for computing minimum-cost abductive explanations in natural-language interpretation