Abductive Logic Programming by Nonground Rewrite Systems

Fangzhen Lin, Jia-Huai You

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.

Subjects: 3.3 Nonmonotonic Reasoning; 3. Automated Reasoning

Submitted: Apr 9, 2008


This page is copyrighted by AAAI. All rights reserved. Your use of this site constitutes acceptance of all of AAAI's terms and conditions and privacy policy.