Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

10

AAAI
2008

favoriteEmaildiscussreport

173views Intelligent Agents» more AAAI 2008»

Abductive Logic Programming by Nonground Rewrite Systems

13 years 6 months ago

Abductive Logic Programming by Nonground Rewrite Systems

Download www.cs.ust.hk

Logic programming with negation offers a compelling approach to abductive reasoning. This paper shows a simple view of abduction in this context for the completion semantics, under which the problem of abduction becomes one of solving quantified equations and disequations. By this way of treating abduction, the problems with nonground negative queries in the previous approaches no longer exist. We show the soundness and completeness results for our approach.

Fangzhen Lin, Jia-Huai You

Real-time Traffic

AAAI 2008 | Abductive Reasoning | Compelling Approach | Intelligent Agents | Nonground Negative Queries |

claim paper

Related Content

» A Consequence Finding Approach for Full Clausal Abduction

» Recycling Computed Answers in Rewrite Systems for Abduction

» A System for Abductive Learning of Logic Programs

» Frame consistency computing with causal explanations

» Introducing Abduction into Extensional Inductive Logic Programming Systems

» The CIFF Proof Procedure for Abductive Logic Programming with Constraints

» Integrating Logic Programming and Production Systems in Abductive Logic Programming Agents

» Programming Applications in CIFF

» Credulous Resolution for Answer Set Programming

Post Info
More Details (n/a)

Added	02 Oct 2010
Updated	02 Oct 2010
Type	Conference
Year	2008
Where	AAAI
Authors	Fangzhen Lin, Jia-Huai You

Comments (0)