Abstract
Different extensions to logic programming have recently been introduced to deal with abductive reasoning. In this work we address the issue of how to process abductive reasoning in the field of logic programming by following a compilation-based approach. In particular, we describe how an abductive reasoning system can be translated in Contextual Logic Programming, so we can use the efficiency of already existing compilebased implementation for contexts.
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
A. Brogi, E. Lamma, P. Mancarella, and P. Mello. Abduction in a multi-theory framework. In S. Gaglio, editor, Proceedings 2nd Congress AI*IA. Lecture Notes on Artificial Intelligence, Springer-Verlag, October 1991, Forthcoming.
W. Chen and D.H. Warren. Abductive logic programming. Technical report, State University of New York at Stony Brook, 1989.
K. Eshgi and R.A. Kowalski. Abduction compared with negation by failure. In G. Levi and M. Martelli, editors, Proc. Sixth International Conference on Logic Programming, page 234. The MIT Press, 1989.
A.C. Kakas and P. Mancarella. Generalized stable models: a semantics for abduction. In Proceedings of 9th European Conference on Artificial Intelligence. Pitman, 1990.
R.A. Kowalski. Problems and promises of computational logic. In Proceedings of Symposium on Computational Logic, pages 1–36. Springer-Verlag, November 1990.
E. Lamma, P. Mello, and A. Natali. The design of an abstract machine for efficient implementation of contexts in logic programming. In G. Levi and M. Martelli, editors, Proc. Sixth International Conference on Logic Programming, pages 303–317. The MIT Press, 1989.
E. Lamma, P. Mello, and A. Natali. An extended warren abstract machine for the execution of structured logic programs. To appear in Journal of Logic Programming, 1991.
E. Lamma, P. Mello, and G.F. Rossi. Parametric composable modules in a logic programming language. Technical report, Department of Computer Science, University of Udine and DEIS, University of Bologna, 1991.
P. Mello, A. Natali, and C. Ruggieri. Logic programming in a software engineering perspective. In L. Lusk and R.A. Overbeek, editors, Proc. NACLP, pages 451–458. The MIT Press, 1989.
L. Monteiro and A. Porto. Contextual logic programming. In G. Levi and M. Martelli, editors, Proc. Sixth International Conference on Logic Programming, pages 284–302. The MIT Press, 1989.
D.L. Poole. Representing knowledge for logic-based diagnosis. In Proc. Int'l Conf. FGCS, pages 1282–1290, 1988.
D.L. Poole. Compiling a default reasoning system into Prolog. New Generation Computing, 9:3–38, 1991.
D.H.D. Warren. An abstract Prolog instruction set. Technical Report TR 309, SRI International, 1983.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1991 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Lamma, E., Mello, P. (1991). Processing abductive reasoning via Contextual Logic Programming. In: Boley, H., Richter, M.M. (eds) Processing Declarative Knowledge. PDK 1991. Lecture Notes in Computer Science, vol 567. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0013542
Download citation
DOI: https://doi.org/10.1007/BFb0013542
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-55033-4
Online ISBN: 978-3-540-46667-3
eBook Packages: Springer Book Archive