Branching-time logic programming: the language Cactus and its applications

Orgun MA, Ma W. An overview of temporal and modal logic programming. In: Proc. of the First International Conference on Temporal Logics (ICTL'94), Lecture Notes in Computer Science (LNCS) 827. Berlin: Springer-Verlag, 1994. p. 445–479 Fisher M, Owens R. An introduction to executable modal and temporal logics. Lecture Notes in Artificial Intelligence (LNAI) 897. Berlin: Springer-Verlag, 1995 Orgun MA. Intensional logic programming. Ph.D. Thesis, Department of Computer Science, University of Victoria, Canada, 1991 Wadge WW. Tense logic programming: a respectable alternative. In: Proc. of the 1988 International Symposium on Lucid and Intensional Programming, 1988. pp 26–32 Hrycej, 1993, A temporal extension of Prolog, The Journal of Logic Programming, 15, 113, 10.1016/0743-1066(93)90016-A Orgun MA, Wadge WW, Du W. Chronolog(Z): Linear-time logic programming. In: Abou-Rabia O, Chang CK, Koczkodaj WW, editors. Proc. of the Fifth International Conference on Computing and Information. IEEE Computer Society Press, 1993. p. 545–549 Baudinet M. A simple proof of the completeness of temporal logic programming. In: Farinas del Cerro L, Penttonen M, editors. Intensional Logics for Programming. Oxford University Press, 1993. p. 51–83 Brzoska C. Temporal logic programming and its relation to constraint logic programming. In: Proc. of the Logic Programming Symposium. Cambridge, MA: MIT Press, 1991. p. 661–677 Brzoska C. Temporal logic programming with bounded universal modality goals. In: Warren DS, editor. Proc. of the Tenth International Conference on Logic Programming. Cambridge, MA: MIT Press, 1993. p. 239–256 Gergatsoulis M, Rondogiannis P, Panayiotopoulos T. Disjunctive Chronolog. In: Chacravarty M, Guo Y, Ida T, editors. Proceedings of the JICSLP'96 Post-Conference Workshop “Multi-Paradigm Logic Programming”, Bonn, 1996. p. 129–136 Ben-Ari, 1983, The temporal logic of branching time, Informatica, 20, 207, 10.1007/BF01257083 Wooldridge M, Fisher M. A first-order branching time logic of multi-agent systems. In: Proc. of the European Conference of Artificial Intelligence (ECAI), Vienna, Austria. Chichester, Wiley, 1992 Rondogiannis P, Gergatsoulis M, Panayiotopoulos T. Cactus: a branching-time logic programming language. In: Proc. of the First International Joint Conference on Qualitative and Quantitative Practical Reasoning, ECSQARU-FAPR'97, Bad Honnef, Germany, Lecture Notes in Artificial Intelligence (LNAI) 1244. Berlin: Springer, 1997. p. 511–524 Gabbay DM. Modal and temporal logic programming. In: Galton A, editor. Temporal logics and their applications. London: Academic Press, 1987. p. 197–237 Gabbay DM, Hodkinson I, Reynolds M. Temporal logic: mathematical foundations and computational aspects. Oxford: Clarendon Press, 1994 Lloyd JW. Foundations of logic programming. Berlin: Springer-Verlag, 1987 Lewis HR, Papadimitriou CH. Elements of the theory of computation. New York: Prentice-Hall, 1981 Sterling L, Shapiro E. The art of Prolog. Cambridge: MIT Press, 1986 Yaghi A. The intensional implementation technique for functional languages. Ph.D. Thesis, Department of Computer Science, University of Warwick, Coventry, UK, 1984 Rondogiannis P. Higher-order functional languages and intensional logic. Ph.D. Thesis, Department of Computer Science, University of Victoria, Canada, December 1994 Rondogiannis, 1997, First-order functional languages and intensional logic, Journal of Functional Programming, 7, 73, 10.1017/S0956796897002633 Rondogiannis P, Wadge WW. Compiling higher-order functions for tagged dataflow. In: Proceedings of the IFIP International Conference on Parallel Architectures and Compilation Techniques. Amsterdam: North Holland, 1994. p. 269–278 Rondogiannis P, Gergatsoulis M. The intensional implementation technique for chain datalog programs. In: Proc. of the 11th International Symposium on Languages for Intensional Programming (ISLIP'98), 7–9 May, Palo Alto, CA, USA, 1998 Emerson, 1985, Decision procedures and expressiveness in the temporal logic of branching time, Journal of Computer and System Sciences, 30, 1, 10.1016/0022-0000(85)90001-7 Emerson, 1986, “Sometimes” and “Not Never” revisited: on branching versus linear time temporal logic, Journal of the ACM, 33, 151, 10.1145/4904.4999 Orgun MA, Wadge WW. Chronolog admits a complete proof procedure. In: Proc. of the Sixth International Symposium on Lucid and Intensional Programming (ISLIP'93), 1993. p. 120–135 Wadge WW, Ashcroft EA. Lucid, the dataflow programming language. London: Academic Press, 1985 Gergatsoulis M, Rondogiannis P, Panayiotopoulos T. Proof procedures for branching-time logic programs. In: Wadge WW, editor. Proc. of the Tenth International Symposium on Languages for Intensional Programming (ISLIP'97), 15–17 May, Victoria BC, Canada, 1997. p. 12–26 Fruehwirth T. Annotated constraint logic programming applied to temporal reasoning. In: Proc. of the International Symposium on Programming Language Implementation and Logic Programming (PLILP'94), Lecture Notes in Computer Science (LNCS) 844. Berlin: Springer-Verlag, 1994. p. 230–243 Orgun, 1997, Multi-dimensional logic programming: theoretical foundations, Theoretical Computer Science, 158, 319, 10.1016/S0304-3975(97)00048-0 Ashcroft EA, Faustini AA, Jagannathan R, Wadge WW. Multidimensional programming. New York: Oxford University Press, 1995 Rondogiannis P. Negation in Chronolog. In: Proc. of the 11th International Symposium on Languages for Intensional Programming (ISLIP'98), 7–9 May, Palo Alto, CA, USA, 1998 Panayiotopoulos T, Gergatsoulis M. Intelligent information processing using TRLi. In: 6th International Conference and Workshop on Data Base and Expert Systems Applications (DEXA' 95) (Workshop Proceedings), London, UK, 4–8 September, 1995. p. 494–501 Tao S. Indexical attribute grammars. Ph.D. Thesis, Department of Computer Science, University of Victoria, Canada, 1994