Abstract
This paper introduces a procedural approach to perform rule based abduction in a knowledge base. In this context a knowledge base is realised as a normal abductive logic program, and an observation can be either a literal or a rule. A SLDNF resolution based proof procedure is employed to achieve this rule based abduction. It is shown that using this algorithm, one can always find a minimal explanation for the observation if there exists such an explanation.
Preview
Unable to display preview. Download preview PDF.
References
A.C. Kakas, F. Toni and R.A. Kowalski, Abductive logic programming, Journal of Logic and Computation (1993) PP 719–770.
A.C. Kakas and P. Mancarella, Database updates through abduction. In Proceedings of the 16th VLDB Conference, pp 650–661, 1990.
S. Lakkaraju and Y. Zhang, A Procedural Approach for Rule Based Update In Proceedings of AI-99.
J.W. Lloyd, Foundations of Logic Programming, 2nd edition. Springer-Verlag, 1987.
C. Sakama and K. Inoue, Updating extended logic programs through abduction. In Proceedings of LPNMR-99, pp 147–161, 1999.
Y. Zhang and N.Y. Foo, Updating logic programs. In Proceedings of the 13th Europen Conference on Artificial Intelligence (ECAI’98), pp 403–407. John Wiley & Sons, Inc., 1998.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kiran Lakkaraju, S., Zhang, Y. (2000). Rule Based Abduction. In: RaÅ›, Z.W., Ohsuga, S. (eds) Foundations of Intelligent Systems. ISMIS 2000. Lecture Notes in Computer Science(), vol 1932. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-39963-1_55
Download citation
DOI: https://doi.org/10.1007/3-540-39963-1_55
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-41094-2
Online ISBN: 978-3-540-39963-6
eBook Packages: Computer ScienceComputer Science (R0)