Computer Science – Logic in Computer Science
Scientific paper
2003-12-24
Computer Science
Logic in Computer Science
48 pages; To appear in Theory and Practice in Logic Programming
Scientific paper
Abductive logic programming offers a formalism to declaratively express and solve problems in areas such as diagnosis, planning, belief revision and hypothetical reasoning. Tabled logic programming offers a computational mechanism that provides a level of declarativity superior to that of Prolog, and which has supported successful applications in fields such as parsing, program analysis, and model checking. In this paper we show how to use tabled logic programming to evaluate queries to abductive frameworks with integrity constraints when these frameworks contain both default and explicit negation. The result is the ability to compute abduction over well-founded semantics with explicit negation and answer sets. Our approach consists of a transformation and an evaluation method. The transformation adjoins to each objective literal $O$ in a program, an objective literal $not(O)$ along with rules that ensure that $not(O)$ will be true if and only if $O$ is false. We call the resulting program a {\em dual} program. The evaluation method, \wfsmeth, then operates on the dual program. \wfsmeth{} is sound and complete for evaluating queries to abductive frameworks whose entailment method is based on either the well-founded semantics with explicit negation, or on answer sets. Further, \wfsmeth{} is asymptotically as efficient as any known method for either class of problems. In addition, when abduction is not desired, \wfsmeth{} operating on a dual program provides a novel tabling method for evaluating queries to ground extended programs whose complexity and termination properties are similar to those of the best tabling methods for the well-founded semantics. A publicly available meta-interpreter has been developed for \wfsmeth{} using the XSB system.
Alferes José Júlio
Pereira Lu\'ıs Moniz
Swift Terrance
No associations
LandOfFree
Abduction in Well-Founded Semantics and Generalized Stable Models does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Abduction in Well-Founded Semantics and Generalized Stable Models, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Abduction in Well-Founded Semantics and Generalized Stable Models will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-640755