A fixpoint characterization of abductive logic programs
نویسندگان
چکیده
منابع مشابه
A Fixpoint Characterization of Abductive Logic Programs
This is a revised and extended version of the paper [19] which was presented at the Tenth International Conference on Logic Programming, Budapest, June 21{25, 1993. Address correspondence to Katsumi Inoue, Department of Information and Computer Sciences, Toyohashi University of Technology, Tempaku-cho, Toyohashi 441, Japan. E-mail: [email protected] y Chiaki Sakama, Department of Computer ...
متن کاملBayesian Abductive Logic Programs: A Probabilistic Logic for Abductive Reasoning
In this proposal, we introduce Bayesian Abductive Logic Programs (BALP), a probabilistic logic that adapts Bayesian Logic Programs (BLPs) for abductive reasoning. Like BLPs, BALPs also combine first-order logic and Bayes nets. However, unlike BLPs, which use deduction to construct Bayes nets, BALPs employ logical abduction. As a result, BALPs are more suited for problems like plan/activity reco...
متن کاملA Fixpoint Semantics for Disjunctive Logic Programs
D We present a fixpoint semantics for disjunctive logic programs. We extend the concept of the Herbrand base of a logic program to consist of all positive clauses that may be formed using the atoms in the Herbrand base. A monotonic closure operator is defined, operating on the lattice formed by the power set of the extended Herbrand base. The closure operator is shown to achieve a least fixpoin...
متن کاملThe Differential Fixpoint of General Logic Programs
We present a version of the alternating xpoint procedure that is fully incremental. Using ideas of partial evaluation techniques we can compute the well-founded model of logic programs with negation bottom-up without any recomputations. Further extensions of the semantics, e.g. to stable models or disjunctive programs are possible this way. We show how to implement the algorithm eeciently using...
متن کاملReduction of Abductive Logic Programs to Normal Logic Programs
In this paper we study a form of abductive logic programming which combines default and non-default abducibles and employs retractibles in integrity constraints. We also present a transformation from abductive to normal logic programs, which is correct and complete with respect to many semantics. These are all the semantics that can be formulated in an argumentation framework. A simpliied form ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Journal of Logic Programming
سال: 1996
ISSN: 0743-1066
DOI: 10.1016/0743-1066(95)00119-0