Abstract
Logic programming has often been considered less than adequate for modelling the dynamics of knowledge changing over time. In this paper we describe a simple though quite powerful approach to modelling the updates of knowledge bases expressed by generalized logic programs, by means of a new language, hereby christened EVOLP (after EVOlving Logic Programs). The approach was first sparked by a critical analysis of previous efforts and results in this direction [1],[2],[7],[11], and aims to provide a simpler, and at once more general, formulation of logic program updating, which runs closer to traditional logic programming (LP) doctrine. From the syntactical point of view, evolving programs are just generalized logic programs (i.e. normal LPs plus default negation also in rule heads), extended with (possibly nested) assertions, whether in heads or bodies of rules. From the semantics viewpoint, a model-theoretic characterization is offered of the possible evolutions of such programs. These evolutions arise both from self (or internal) updating, and from external updating too, originating in the environment. This formulation sets evolving programs on a firm basis in which to express, implement, and reason about dynamic knowledge bases, and opens up a number of interesting research topics that we brush on.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
J. J. Alferes, J. A. Leite, L. M. Pereira, H. Przymusinska, and T. Przymusinski. Dynamic updates of non-monotonic knowledge bases. Journal of Logic Programming, 45(1–3):43–70, 2000.
J. J. Alferes, L. M. Pereira, H. Przymusinska, and T. Przymusinski. LUPS: A language for updating logic programs. Artificial Intelligence, 138(1–2), 2002. A short version appeared in M. Gelfond et al., LPNMR-99, LNAI 1730, Springer.
A. Bonner and M. Kifer. Transaction logic programming. In David S. Warren, editor, ICLP-93, pages 257–279. The MIT Press, 1993.
A. Brogi. Probabilistic behaviours of reactive agents. Electronic Notes in Theoretical Computer Science, 48 2001.
A. Brogi, V.S. Subrahmanian, and C. Zaniolo. The logic of totally and partially ordered plans: A deductive database approach. Annals of Mathematics and Artificial Intelligence, 19((1,2)):27–58, 1997.
J. Chomicki. Polynomial-time computable queries in temporal deductive databases. In PODS’90, 1990.
T. Eiter, M. Fink, G. Sabbatini, and H Tompits. A framework for declarative update specifications in logic programs. In IJCAI’01, pages 649–654. Morgan-Kaufmann, 2001.
M. Gelfond and V. Lifschitz. The stable semantics for logic programs. In R. Kowalski and K. Bowen, editors, ICLP’88, pages 1070–1080. MIT Press, 1988.
M. Gelfond and V. Lifschitz. Action languages. Linkoping Electronic Articles in Computer and Information Science, 3(16), 1998.
R. Kowalski and M. Sergot. A logic-based calculus of events. New Generation Computing, 4:67–95, 1986.
J. A. Leite. A modified semantics for LUPS. In P. Brazdil and A. Jorge, editors, EPIA-01, volume 2258 of LNAI, pages 261–275. Springer, 2001.
V. Lifschitz and T. Woo. Answer sets in general non-monotonic reasoning (preliminary report). In B. Nebel, C. Rich, and W. Swartout, editors, KR’92. Morgan-Kaufmann, 1992.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Alferes, J.J., Brogi, A., Leite, J.A., Pereira, L.M. (2002). Evolving Logic Programs. In: Flesca, S., Greco, S., Ianni, G., Leone, N. (eds) Logics in Artificial Intelligence. JELIA 2002. Lecture Notes in Computer Science(), vol 2424. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45757-7_5
Download citation
DOI: https://doi.org/10.1007/3-540-45757-7_5
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-44190-8
Online ISBN: 978-3-540-45757-2
eBook Packages: Springer Book Archive