Abstract
A multi-theory framework is presented where both abduction and dynamic theory composition are modelled in a logic programming setting. In this framework the evolution of knowledge can be modelled by means of theory composition, while a form of hypothetical reasoning is supported by abduction. The semantics is expressed in terms of the standard semantics of logic programming (Herbrand models), by defining a compositional model-theory. A proof-theory is given in terms of inference rules, and soundness and completeness results are stated.
Work partially supported by CNR, Progetto Finalizzato “Sistemi Informatici e Calcolo Parallelo” under grants n. 890004269 and n. 8900121
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
A. Brogi, E. Lamma, and P. Mello. Open Logic Theories. In L.-H. Eriksson, P. Krueger, and P. Schroeder-Heister, editors, Proceedings of Second Workshop on Extensions of Logic Programming, Lectures Notes in Artificial Intelligence. Springer-Verlag, Kista, January 1991. Forthcoming.
A. Brogi, P. Mancarella, D. Pedreschi, and F. Turini. Composition Operators for Logic Theories. In J.W. Lloyd, editor, Computational Logic, Symposium Proceedings, pages 117–134. Springer-Verlag, Brussels, November 1990.
L. Console, D. Theseider Duprè and P. Torasso. Abductive Reasoning Through Direct Deduction from Completed Domains Models. In Methodologies for Intelligent Systems, N. 4, page 175, North Holland,1989.
W. Chen and D.H. Warren. Abductive Logic Programming. TR, Dept. of Computer Science, State University of New York, October 1989.
P.T. Cox and T. Pietrzykowski. Causes for events: Their computation and applications. In Proceedings CADE-86, page 608, 1986.
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 Publishing, 1990.
R.A. Kowalski. Problems and promises of computational logic. In Proceedings of Symposium on Computational Logic. Springer-Verlag, November 1990.
D. Miller. A logical analysis of modules in logic programming. Journal of Logic Programming, 6:79–108, 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.
R. O'Keefe. Towards an algebra for constructing logic programs. In Proceedings of IEEE Symposium on Logic Programming, pages 152–160, 19856.
J. Pearl. Embracing causality in formal reasoning. Proc. National Conference on Artificial Intelligence, Seattle, WA, pages 369–373, 1987.
D.L. Poole. A logical framework for default reasoning. Artificial Intelligence, 36:27, 1988.
R. Reiter. On closed world data bases. In H. Gallaire and J.Minker, editors, Logic and Data Bases. Plenum, 1978.
M.H. van Emden and R.A. Kowalski. The semantics of predicate logic as a programming language. Journal of the ACM, 23(4):733–742, 1976.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1991 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Brogi, A., Lamma, E., Mancarella, P., Mello, P. (1991). Abductive reasoning in a multi-theory framework. In: Ardizzone, E., Gaglio, S., Sorbello, F. (eds) Trends in Artificial Intelligence. AI*IA 1991. Lecture Notes in Computer Science, vol 549. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-54712-6_226
Download citation
DOI: https://doi.org/10.1007/3-540-54712-6_226
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-54712-9
Online ISBN: 978-3-540-46443-3
eBook Packages: Springer Book Archive