Abstract
Annotated constraint logic programming (ACLP) combines constraint logic programming (CLP) and generalized annotated programming (GAP). With ACL we propose a first order logic with constraints where formulas can be annotated. ACL comes with inference rules for annotated formulas and a constraint theory for handling annotations. We describe an implementation based on the standard interpreter for logic programs. The inference rules of ACL are turned into clauses of the interpreter, and the constraints on annotations are solved by a suitable constraint solver. Then we optimize the interpreter.
We also introduce an instance of ACLP for reasoning about time. Temporal ACLP is conceptually simple while covering substantial parts of temporal logic. Temporal annotations avoid the proliferation of variables and quantifiers of standard first-order approaches. In TACLP, the model of time can be freely chosen since it is represented in the constraint theory. Both qualitative and quantitative (metric) temporal reasoning with time points (instants) and periods (temporal intervals) are supported. TACLP is implemented as an instance of the generic interpreter. An example, the “Workshop Murder Mystery”, forms a guideline through the paper.
Part of this work is supported by ESPRIT Project 5291 CHIC
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
M. Abadi and Z. Manna, Temporal Logic Programming, Journal of Symbolic Computation (1989) 8, pp 277–295.
J. F. Allen, Towards a General Theory of Action and Time, Artificial Intelligence, Vol. 23, 1984, pp 123–154.
J.F.A.K. van Benthem, The Logic of Time, Synthese Library, Vol. 156, D. Reidel Pub., Holland, 1983.
K. A. Bowen and R. A. Kowalski, Amalgamating Language and Metalanguage in Logic Programming, In Logic Programming, K.A. Clark and S.A. Tarnlund (eds), pp. 153–173, Academic Press, 1982.
Ch. Brzoska, Temporal Logic Programming with Bounded Universal Goals, 10th ICLP, Budapest, Hungary, MIT Press, 1993.
R. Dechter, I. Meiri and J. Pearl, Temporal Constraint Networks, Artificial Intelligence, Vol. 49, pp. 61–95, 1991.
M. Fisher and R. Owens, From the Past to the Future: Executing Temporal Logic Programs, LPAR 92, St. Petersburg, Russia, Springer LNCS 624, July 1992, pp 369–380.
A. M. Frisch and R. B. Scherl, A General framework for Modal Deduction, 2nd KR '91, pp. 196–207, Cambridge, Mass., Morgan Kaufmann, 1991.
T. Frühwirth, Temporal Annotated Constraint Logic Programming, Workshop on Executable Modal and Temporal Logics at IJCAI 93, Chambery, France, August 1993.
T. Frühwirth, Temporal Reasoning with Constraint Handling Rules, Technical Report ECRC-94-05, ECRC Munich, Germany, January 1994.
T. Frühwirth, Annotating Formulas with Temporal Information, Workshop on Logic and Change at ECAI 94, Amsterdam, The Netherlands, August 1994.
A. Galton (ed), Temporal Logics and Their Applications, Academic Press, 1987.
A. Galton, A Critical Examination of Allen's Theory of Action and Time, Artificial Intelligence, Vol. 42, 1990, pp. 159–188.
J. Jaffar and M. J. Maher, Constraint Logic Programming: A Survey, Journal of Logic Programming, to appear.
M. Kifer and V.S. Subrahmanian, Theory of Generalized Annotated Logic Programming and its Applications, Journal of Logic Programming, April 1992.
S. M. Leach and J. J. Lu, Computing Annotated Logic Programs: Theory and Implementation, 11th ICLP, Santa Margherita Ligure, Italy, MIT Press, 1994.
M. Meier, J. Schimpf et al., ECLiPSe 3.4 User Manual and Extensions User Manual, ECRC Munich, Germany, January 1994.
D. McDermot, A Temporal Logic for Reasoning about Processes and Plans, Cognitive Science 6:101–155, 1982.
I. Meiri, Combining Qualitative and Quantitative Constraints in Temporal Reasoning, AAAI 91, July 1991, pp 260–267.
B. Moszkowski, Executing Temporal Logic Programs, Cambridge University Press, 1986.
L. Sterling and E. Shapiro, “Interpreters”, Chapter 17, The Art of Prolog, Second Edition, MIT Press, 1994.
P. van Hentenryck, Constraint Logic Programming, The Knowledge Engineering Review, Vol 6:3, 1991, pp 151–194.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1994 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Frühwirth, T. (1994). Annotated constraint logic programming applied to temporal reasoning. In: Hermenegildo, M., Penjam, J. (eds) Programming Language Implementation and Logic Programming. PLILP 1994. Lecture Notes in Computer Science, vol 844. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-58402-1_17
Download citation
DOI: https://doi.org/10.1007/3-540-58402-1_17
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-58402-5
Online ISBN: 978-3-540-48695-4
eBook Packages: Springer Book Archive