Abstract
In earlier work, we have shown that the formalism of abductive logic programs with FOL integrity constraints provides, under a completion semantics, the same declarative expressivity for representing incomplete information as full first order logic. We have shown how the combination of this formalism with a variant of the Event Calculus of Kowalski and Sergot results in a correct and very expressive framework for temporal reasoning and representation. In this paper we demonstrate how this Abductive Event Calculus formalism provides a general frame-work for the representation and use of temporal databases. On the declarative level, it is particularly convenient for the representation of incomplete knowledge. Complementary, on the procedural level, we are able to provide a number of simple algorithms using abduction and deduction to test the consistency of the base, answer queries, update the database, handle complex formulas and resolve inconsistency. Furthermore, the use of the database for general temporal problem solving is possible using the known Event Calculus and Logic Programming methods. In particular we show how planning is possible in this kind of temporal database.
Preview
Unable to display preview. Download preview PDF.
References
J. F. Allen. Maintaining Knowledge About Temporal Intervals. CACM, 26(11):832–843, 1983.
J. F. Allen. Towards a General Theory of Action and Time. Artifical Intelligence, 23(11):123, 1984.
K. Clark. Negation as failure. In H. Gallaire and J. Minker, editors, Logic and databases, pages 293–322. Plenum Press, 1978.
L. Console, D. Theseider Dupre, and P. Torasso. On the relationship between abduction and deduction. Journal of Logic and Computation, 1(5):661–690, 1991.
M. Denecker. Knowledge Representation and Reasoning in Incomplete Logic Programming. PhD thesis, Department of Computer Science, K.U.Leuven, 1993.
M. Denecker and D. De Schreye. SLDNFA; an abductive procedure for normal abductive programs. In K. Apt, editor, Proceedings of the International Joint Conference and Symposium on Logic Programming, Washington, 1992.
M. Denecker, L. Missiaen, and M. Bruynooghe. Temporal reasoning with abductive event calculus. In Proceedings of ECAI 92, Vienna, 1992.
K. Eshghi. Abductive planning with event calculus. In R. Kowalski and K. Bowen, editors, Proceedings of the 5th ICLP, 1988.
C. Evans. The Macro-Event Calculus: Representing Temporal Granularity. In Proceedings of PRICAI, Tokyo, 1990.
M. Gelfond and V. Lifschitz. Describing Action and Change by Logic Programs. In Proc. of the 9th Int. Joint Conf. and Symp. on Logic Programming, 1992.
A. Kakas and P. Mancarella. Constructive abduction in logic programming. Technical report, Dipartimento di Informatica, University of Pisa, 1993.
R. A. Kowalski. Logic for problem solving. Elsevier Science Publisher, 1976.
R. A. Kowalski. Database updates in the event calculus. Journal of Logic Programming, 1992, 1992.
R. A. Kowalski and M. Sergot. A logic-based calculus of events. New Generation Computing, 4(4):319–340, 1986.
J. Lloyd. Foundations of Logic Programming. Springer-Verlag, 1987.
J. Lloyd and R. Topor. Making prolog more expressive. Journal of logic programming, 1(3):225–240, 1984.
L. Missiaen. Localized abductive planning with the event calculus. PhD thesis, Department of Computer Science, K.U.Leuven, 1991.
A. Porto and C. Ribeiro. Temporal inference with a point-based interval algebra. In Proceedings of ECAI 92, Vienna, pages 374–378, 1992.
M. Shanahan. Prediction is deduction but explanation is abduction. In Proceedings of IJCAI 89, page 1055, 1989.
M. Shanahan. Representing continuous change in the event calculus. In Proceedings of the 9th ECAI, page 598, 1990.
S. Sripada. A metalogical programming approach to reasoning about time in knowledge bases. In Proceedings of IJCAI 93, 1993.
A. Weigel and R. Bleisinger. Support for resolving Contradictions in Time Interval Networks. In Proceedings of ECAI 92, Vienna, pages 379–383, 1992.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1994 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Van Belleghem, K., Denecker, M., De Schreye, D. (1994). The Abductive Event Calculus as a general framework for temporal databases. In: Gabbay, D.M., Ohlbach, H.J. (eds) Temporal Logic. ICTL 1994. Lecture Notes in Computer Science, vol 827. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0013995
Download citation
DOI: https://doi.org/10.1007/BFb0013995
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-58241-0
Online ISBN: 978-3-540-48585-8
eBook Packages: Springer Book Archive