Cactus: A branching-time logic programming language

  • P. Rondogiannis
  • M. Gergatsoulis
  • T. Panayiotopoulos
Accepted Papers
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1244)


Temporal programming languages are recognized as natural and expressive formalisms for describing dynamic systems. However, most such languages are based on linear flow of time, a fact that makes them unsuitable for certain types of applications. In this paper we introduce the new temporal logic programming language Cactus, which is based on a branching notion of time. In Cactus, the truth value of a predicate depends on a hidden time parameter which has a tree-like structure. As a result, Cactus appears to be especially appropriate for expressing non-deterministic computations or generally algorithms that involve the manipulation of tree data structures.


Logic Programming Temporal Logic Programming Branching Time 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [BAPM83]
    M. Ben-Ari, A. Pnueli, and Z. Manna. The Temporal Logic of Branching Time. Informatica, pages 207–226, 1983.Google Scholar
  2. [Bau93]
    M. Baudinet. A simple proof of the completeness of temporal logic programming. In L. Farinas del Cerro and M. Penttonen, editors, International Logics for Programming, pages 51–83. Oxford University Press, 1993.Google Scholar
  3. [Brz91]
    C. Brzoska. Temporal logic programming and its relation to constraint logic programming. In Proc. of the Logic Programming Symposium, pages 661–677. MIT Press, 1991.Google Scholar
  4. [Brz93]
    C. Brzoska. Temporal logic programming with bounded universal modality goals. In D. S. Warren, editor, Proc. of the Tenth International Conference on Logic Programming, pages 239–256. MIT Press, 1993.Google Scholar
  5. [DW90]
    W. Du and W.W.Wadge. A 3D Spreadsheet Based on Intensional Logic. IEEE Software, pages 78–89, July 1990.Google Scholar
  6. [EAAJ91]
    A. A. Faustini E. A. Ashcroft and R. Jagannathan. An Intensional Language for Parallel Applications Programming. In B.K.Szymanski, editor, Parallel Functional Languages and Compilers, pages 11–49. ACM Press, 1991.Google Scholar
  7. [Gab87]
    Dov Gabbay. Modal and temporal logic programming. In A. Galton, editor, Temporal Logics and their applications, pages 197–237. Academic Press, London, 1987.Google Scholar
  8. [GHR94]
    D. M. Gabbay, I. Hodkinson, and M. Reynolds. Temporal Logic: Mathematical Foundations and Computational Aspects. Clarendon Press-Oxford, 1994.Google Scholar
  9. [GRP96]
    M. Gergatsoulis, P. Rondogiannis, and T. Panayiotopoulos. Disjunctive Chronolog. In M. Chacravarty, Y. Guo, and T. Ida, editors, Proceedings of the JICSLP'96 Post-Conference Workshop “Multi-Paradigm Logic Programming”, pages 129–136, Bonn, 5–6 Sept. 1996.Google Scholar
  10. [Hry93]
    T. Hrycej. A temporal extension of Prolog. The Journal of Logic Programming, 15:113–145, 1993.Google Scholar
  11. [Llo87]
    J. W. Lloyd. Foundations of Logic Programming. Springer-Verlag, 1987.Google Scholar
  12. [LP81]
    H. R. Lewis and C. H. Papadimitriou. Elements of the Theory of Computation. Prentice-Hall, Inc., 1981.Google Scholar
  13. [OM94]
    M. A. Orgun and W. Ma. An overview of temporal and modal logic programming. In Proc. of the First International Conference on Temporal Logics (ICTL'94), pages 445–479. Springer Verlag, 1994. LNCS No 827.Google Scholar
  14. [Org91]
    M. A. Orgun. Intensional Logic Programming. PhD thesis, Dept. of Computer Science, University of Victoria, Canada, December 1991.Google Scholar
  15. [OW92]
    M. A. Orgun and W. W. Wadge. Towards a unified theory of intensional logic programming. The Journal of Logic Programming, 13(4):113–145, August 1992.Google Scholar
  16. [OW93]
    M. A. Orgun and W. W. Wadge. Chronolog admits a complete proof procedure. In Proc. of the Sixth International Symposium on Lucid and Intensional Programming (ISLIP'93), pages 120–135, 1993.Google Scholar
  17. [OWD93]
    M. A. Orgun, W. W. Wadge, and W. Du. Chronolog(Z): Linear-time logic programming. In O. Abou-Rabia, C. K. Chang, and W. W. Koczkodaj, editors, Proc. of the fifth International Conference on Computing and Information, pages 545–549. IEEE Computer Society Press, 1993.Google Scholar
  18. [PG95]
    T. Panayiotopoulos and M. Gergatsoulis. Intelligent information processing using TRLi. In 6th International Conference and Workshop on Data Base and Expert Systems Applications (DEXA' 95), (Workshop Proceedings) London, UK, 4th–8th September, pages 494–501, 1995.Google Scholar
  19. [RGP97]
    P. Rondogiannis, M. Gergatsoulis, and T. Panayiotopoulos. Theoretical foundations of Branching-Time Logic Programming. 1997. In preparation.Google Scholar
  20. [Ron94]
    P. Rondogiannis. Higher-Order Functional Languages and Intensional Logic. PhD thesis, Dept. of Computer Science, University of Victoria, Canada, December 1994.Google Scholar
  21. [RW97]
    P. Rondogiannis and W. W. Wadge. First-order functional languages and intensional logic. Journal of Functional Programming, 1997. (to appear).Google Scholar
  22. [Tao94]
    S. Tao. Indexical Attribute Grammars. PhD thesis, Dept. of Computer Science, University of Victoria, Canada, 1994.Google Scholar
  23. [WA85]
    W. W. Wadge and E. A. Ashcroft. Lucid, the dataflow Programming Language. Academic Press, 1985.Google Scholar
  24. [Wad88]
    W. W. Wadge. Tense logic programming: A respectable alternative. In Proc. of the 1988 International Symposium on Lucid and Intensional Programming, pages 26–32, 1988.Google Scholar
  25. [Yag84]
    A. Yaghi. The Intensional Implementation Technique for Functional Languages. PhD thesis, Dept. of Computer Science, University of Warwick, Coventry, UK, 1984.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1997

Authors and Affiliations

  • P. Rondogiannis
    • 1
  • M. Gergatsoulis
    • 2
  • T. Panayiotopoulos
    • 3
  1. 1.Dept. of Computer ScienceUniversity of IoanninaIoanninaGreece
  2. 2.Inst. of Informatics & Telecom.N.C.S.R. ‘Demokritos’A. Paraskevi AttikisGreece
  3. 3.Dept. of InformaticsUniversity of PiraeusPiraeusGreece

Personalised recommendations