Skip to main content
SpringerLink
Log in

Semantics for Temporal Annotated Constraint Logic Programming

  • Chapter
Labelled Deduction

Part of the book series: Applied Logic Series ((APLS,volume 17))

Abstract

We investigate the semantics of a considerable subset of Temporal Annotated Constraint Logic Programming (TACLP), a class of languages that allows us to reason about qualitative and quantitative, definite and indefinite temporal information using time points and time periods as labels for atoms.

After illustrating the power of TACLP with some non-trivial examples, TACLP is given two different kinds of semantics, an operational one based on meta-logic (top-down semantics) and, for the first time, a fixpoint one based on an immediate consequence operator (bottom-up semantics). We prove the top-down semantics to be sound and complete with respect to the bottom-up semantics.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
eBook
USD 16.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 109.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. M. Abadi and Z. Manna. Temporal logic programming Journal of Symbolic Computation, 8:277–295, 1989.

    Article  Google Scholar 

  2. J.F. Allen. Towards a general theory of action and time. Artificial Intelligence, 23:123–154, 1984.

    Article  Google Scholar 

  3. K. Apt and R Turini, editors. Meta-logics and Logic Programming. MIT Press, London, 1995.

    Google Scholar 

  4. D. Basin, S. Matthews, and L. Viganó. Labelled Modal Logics: Quantifiers. Journal of Logic, Language, and Information, 7(3), 1998.

    Google Scholar 

  5. M. Baudinet, J. Chomicki, and P. Wolper. Temporal Deductive Databases. In [38], pages 294–320.

    Google Scholar 

  6. B. Beckert, R. Hähnle, and F. Manyá. The SAT Problem of Signed CNF Formulas. This volume.

    Google Scholar 

  7. M. Böhlen and R. Marti. On the Completeness of Temporal Database Query Languages. In Temporal Logic: Proceedings of the First International Conference, ICTL’94, volume 827 of Lecture Notes in Artificial Intelligence, pages 283–300, 1994.

    Google Scholar 

  8. A. Brogi and F. Turini. Meta-Logic for Program Composition: Semantics Issues. In [3], pages 83–109.

    Google Scholar 

  9. C. Brzoska. Temporal Logic Programming with Metric and Past Operators. In [11], pages 21–39.

    Google Scholar 

  10. J. Chomicki. Temporal Query Languages: A Survey. In Temporal Logic: Proceedings of the First International Conference, ICTL’94, volume 827 of Lecture Notes in Artificial Intelligence, pages 506–534. Springer Verlag, 1994.

    Google Scholar 

  11. M. Fisher and R. Owens, editors. Executable Modal and Temporal Logics, volume 897 of Lecture Notes in Artificial Intelligence. Springer Verlag, 1995.

    Google Scholar 

  12. A. M. Frisch and R. B. Scherl. A General framework for Modal Deduction. In Proceedings of the second KR ‘81, pages 196–207. Morgan Kaufmann, 1991.

    Google Scholar 

  13. T. Frühwirth. Temporal Logic and Annotated Constraint Logic Programming. In [11], pages 58–68.

    Google Scholar 

  14. T. Frühwirth. Annotated Constraint Logic Programming Applied to Temporal Reasoning. In Programming Language Implementation and Logic Programming (PLILP), volume 844 of Lecture Notes in Computer Science, pages 230–243. Springer Verlag, 1994.

    Google Scholar 

  15. T. Frühwirth. Temporal Annotated Constraint Logic Programming. Journal of Symbolic Computation, 22:555–583, 1996.

    Article  Google Scholar 

  16. T. Frühwirth and S. Abdennadher. Constraint-Programmierung: Grundlagen and Anwendungen. Springer, Berlin, 1997.

    Google Scholar 

  17. D. M. Gabbay, I. Hodkinson, and M. Reynolds. Temporal Logic. Clarendon Press, Oxford, 1994.

    Book  Google Scholar 

  18. D. M. Gabbay. Modal and temporal logic programming. In [21], pages 197–237.

    Google Scholar 

  19. D. M. Gabbay. Labelled deductive systems: volume 1, volume 33 of Oxford logic guides. Clarendon Press, Oxford, 1996.

    Google Scholar 

  20. D. M. Gabbay and P. McBrien. Temporal Logic & Historical Databases. In Proceedings of the Seventeenth International Conference on Very Large Databases, pages 423–430, September 1991.

    Google Scholar 

  21. A. Galton, editor. Temporal Logics and Their Applications. Academic Press, 1987.

    Google Scholar 

  22. A. Galton. A Critical Examination of Allen’s Theory of Action and Time. Artificial Intelligence, 42:159–188,1990.

    Article  Google Scholar 

  23. P. Hill and J. W. Lloyd. Analysis of Metaprograms. In H.D. Abramson and M.H. Rogers, editors, Metaprogramming in Logic Programming, pages 23–52. MIT Press, 1989.

    Google Scholar 

  24. J. Jaffar and J. L. Lassez. Constraint Logic Programming. In Proceedings of the Fourteenth Annual ACM Symposium on Principles of Programming Languages, pages 111–119, 1987.

    Google Scholar 

  25. J. Jaffar and M. J. Maher. Constraint Logic Programming: A Survey. Journal of Logic Programming, 19 & 20:503–582, May 1994.

    Article  Google Scholar 

  26. M. Kifer and V. S. Subrahmanian. Theory of Generalized Annotated Logic Programming and its Applications. Journal of Logic Programming, 12:335–367, 1992.

    Article  Google Scholar 

  27. S. M. Leach and J. J. Lu. Computing Annotated Logic Programs. In Proceedings of the eleventh ICLP, pages 257–271,1994.

    Google Scholar 

  28. P. Mancarella, A. Raffaetà, and F. Turini. Temporal Annotated Constraint Logic Programming with Multiple Theories. In Proceedings of the Tenth International Workshop on Database and Expert Systems Applications, pages 501–508, IEEE Computer Society Press, 1999.

    Google Scholar 

  29. K. Marriott, J. Jaffar, M. J. Maher, and P. J. Stuckey. The Semantics of Constraint Logic Programs. Journal of Logic Programming, 37(1–3):146, 1998.

    Google Scholar 

  30. K. Marriott and P. J. Stuckey. Programming with Constraints. MIT Press, USA, 1998.

    Google Scholar 

  31. B. Martens and D. De Schreye. Why Untyped Nonground Metaprogramming Is Not (Much Of) A Problem. Journal of Logic Programming, 22(1):47–99, January 1995.

    Article  Google Scholar 

  32. B. Moszkowski. Execution Temporal Logic Programs. Cambridge University Press, 1986.

    Google Scholar 

  33. M. A. Orgun. On temporal deductive databases. Computational Intelligence,12(2):235–259, May 1996.

    Article  Google Scholar 

  34. M. A. Orgun and W. Ma. An Overview of Temporal and Modal Logic Programming. In Temporal Logic: Proceedings of the First International Conference, ICTL’94, volume 827 of Lecture Notes in Artificial Intelligence, pages 445–479, 1994.

    Google Scholar 

  35. J. Singer. Constraint-Based Temporal Logic Programming. BSc. dissertation, Department of Artificial Intelligence, University of Edinburgh, May 1996.

    Google Scholar 

  36. R. Snodgrass. Temporal Databases. In Proceedings of the International Conference on GIS - From Space to Territory: Theories and Methods of Spatio-Temporal Reasoning in Geographic Space, pages 22–64, 1992.

    Book  Google Scholar 

  37. L. Sterling and E. Shapiro. The Art of Prolog. MIT Press, 1986.

    Google Scholar 

  38. A. Tansel, J. Clifford, S. Gadia, S. Jajodia, A. Segev, and R. Snodgrass editors. Temporal Databases: Theory, Design, and Implementation. Benjamin/Cummings, 1993.

    Google Scholar 

  39. J. F. A. K. van Benthem. The logic of time: a model-theoretic investigation into the varieties of temporal ontology and temporal discourse, volume 156 of Synthese Library. Reidel, Dordrecht, 1983.

    Google Scholar 

  40. W. W. Wadge. Tense Logic Programming: a Respectable Alternative. In Proceedings of the 1988 International Symposium on Lucid and Intensional Programming, pages 26–32, 1988.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dipartimento di Informatica, Università di Pisa, Corso Italia 40, Pisa, I-56125, Italy

    Alessandra Raffaetà

  2. Institut für Informatik, Ludwig-Maximilians-Universität (LMU), Oettingenstrasse 67, Munich, D-80538, Germany

    Thom Frühwirth

Authors
  1. Alessandra Raffaetà
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Thom Frühwirth
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Albert-Ludwigs-Universität Freiburg, Germany

    David Basin  & Luca Viganò  & 

  2. Università di Ferrara, Italy

    Marcello D’Agostino

  3. Department of Computer Science, King’s College, London, UK

    Dov M. Gabbay

  4. Logical GmbH, Frankfurt am Main, Germany

    Seán Matthews

Rights and permissions

Reprints and permissions

Copyright information

© 2000 Springer Science+Business Media Dordrecht

About this chapter

Cite this chapter

Raffaetà, A., Frühwirth, T. (2000). Semantics for Temporal Annotated Constraint Logic Programming. In: Basin, D., D’Agostino, M., Gabbay, D.M., Matthews, S., Viganò, L. (eds) Labelled Deduction. Applied Logic Series, vol 17. Springer, Dordrecht. https://doi.org/10.1007/978-94-011-4040-9_9

Download citation

  • DOI: https://doi.org/10.1007/978-94-011-4040-9_9

  • Publisher Name: Springer, Dordrecht

  • Print ISBN: 978-94-010-5781-3

  • Online ISBN: 978-94-011-4040-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation