{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,27]],"date-time":"2025-10-27T20:25:00Z","timestamp":1761596700427},"reference-count":34,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1998,10,1]],"date-time":"1998-10-01T00:00:00Z","timestamp":907200000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Computer Languages"],"published-print":{"date-parts":[[1998,10]]},"DOI":"10.1016\/s0096-0551(98)00009-5","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T19:03:07Z","timestamp":1027623787000},"page":"155-178","source":"Crossref","is-referenced-by-count":13,"title":["Branching-time logic programming: the language Cactus and its applications"],"prefix":"10.1016","volume":"24","author":[{"given":"P.","family":"Rondogiannis","sequence":"first","affiliation":[]},{"given":"M.","family":"Gergatsoulis","sequence":"additional","affiliation":[]},{"given":"T.","family":"Panayiotopoulos","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0096-0551(98)00009-5_BIB1","doi-asserted-by":"crossref","unstructured":"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\u2013479","DOI":"10.1007\/BFb0014004"},{"key":"10.1016\/S0096-0551(98)00009-5_BIB2","doi-asserted-by":"crossref","unstructured":"Fisher M, Owens R. An introduction to executable modal and temporal logics. Lecture Notes in Artificial Intelligence (LNAI) 897. Berlin: Springer-Verlag, 1995","DOI":"10.1007\/3-540-58976-7"},{"key":"10.1016\/S0096-0551(98)00009-5_BIB3","unstructured":"Orgun MA. Intensional logic programming. Ph.D. Thesis, Department of Computer Science, University of Victoria, Canada, 1991"},{"key":"10.1016\/S0096-0551(98)00009-5_BIB4","unstructured":"Wadge WW. Tense logic programming: a respectable alternative. In: Proc. of the 1988 International Symposium on Lucid and Intensional Programming, 1988. pp 26\u201332"},{"key":"10.1016\/S0096-0551(98)00009-5_BIB5","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1016\/0743-1066(93)90016-A","article-title":"A temporal extension of Prolog","volume":"15","author":"Hrycej","year":"1993","journal-title":"The Journal of Logic Programming"},{"key":"10.1016\/S0096-0551(98)00009-5_BIB6","doi-asserted-by":"crossref","unstructured":"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\u2013549","DOI":"10.1109\/ICCI.1993.315313"},{"key":"10.1016\/S0096-0551(98)00009-5_BIB7","doi-asserted-by":"crossref","unstructured":"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\u201383","DOI":"10.1093\/oso\/9780198537755.003.0003"},{"key":"10.1016\/S0096-0551(98)00009-5_BIB8","unstructured":"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\u2013677"},{"key":"10.1016\/S0096-0551(98)00009-5_BIB9","unstructured":"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\u2013256"},{"key":"10.1016\/S0096-0551(98)00009-5_BIB10","unstructured":"Gergatsoulis M, Rondogiannis P, Panayiotopoulos T. Disjunctive Chronolog. In: Chacravarty M, Guo Y, Ida T, editors. Proceedings of the JICSLP'96 Post-Conference Workshop \u201cMulti-Paradigm Logic Programming\u201d, Bonn, 1996. p. 129\u2013136"},{"key":"10.1016\/S0096-0551(98)00009-5_BIB11","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1007\/BF01257083","article-title":"The temporal logic of branching time","volume":"20","author":"Ben-Ari","year":"1983","journal-title":"Informatica"},{"key":"10.1016\/S0096-0551(98)00009-5_BIB12","unstructured":"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"},{"key":"10.1016\/S0096-0551(98)00009-5_BIB13","doi-asserted-by":"crossref","unstructured":"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\u2013524","DOI":"10.1007\/BFb0035645"},{"key":"10.1016\/S0096-0551(98)00009-5_BIB14","unstructured":"Gabbay DM. Modal and temporal logic programming. In: Galton A, editor. Temporal logics and their applications. London: Academic Press, 1987. p. 197\u2013237"},{"key":"10.1016\/S0096-0551(98)00009-5_BIB15","doi-asserted-by":"crossref","unstructured":"Gabbay DM, Hodkinson I, Reynolds M. Temporal logic: mathematical foundations and computational aspects. Oxford: Clarendon Press, 1994","DOI":"10.1007\/BFb0013976"},{"key":"10.1016\/S0096-0551(98)00009-5_BIB16","doi-asserted-by":"crossref","unstructured":"Lloyd JW. Foundations of logic programming. Berlin: Springer-Verlag, 1987","DOI":"10.1007\/978-3-642-83189-8"},{"key":"10.1016\/S0096-0551(98)00009-5_BIB17","unstructured":"Lewis HR, Papadimitriou CH. Elements of the theory of computation. New York: Prentice-Hall, 1981"},{"key":"10.1016\/S0096-0551(98)00009-5_BIB18","unstructured":"Sterling L, Shapiro E. The art of Prolog. Cambridge: MIT Press, 1986"},{"key":"10.1016\/S0096-0551(98)00009-5_BIB19","unstructured":"Yaghi A. The intensional implementation technique for functional languages. Ph.D. Thesis, Department of Computer Science, University of Warwick, Coventry, UK, 1984"},{"key":"10.1016\/S0096-0551(98)00009-5_BIB20","unstructured":"Rondogiannis P. Higher-order functional languages and intensional logic. Ph.D. Thesis, Department of Computer Science, University of Victoria, Canada, December 1994"},{"issue":"1","key":"10.1016\/S0096-0551(98)00009-5_BIB21","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1017\/S0956796897002633","article-title":"First-order functional languages and intensional logic","volume":"7","author":"Rondogiannis","year":"1997","journal-title":"Journal of Functional Programming"},{"key":"10.1016\/S0096-0551(98)00009-5_BIB22","unstructured":"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\u2013278"},{"key":"10.1016\/S0096-0551(98)00009-5_BIB23","unstructured":"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\u20139 May, Palo Alto, CA, USA, 1998"},{"issue":"1","key":"10.1016\/S0096-0551(98)00009-5_BIB24","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0022-0000(85)90001-7","article-title":"Decision procedures and expressiveness in the temporal logic of branching time","volume":"30","author":"Emerson","year":"1985","journal-title":"Journal of Computer and System Sciences"},{"issue":"1","key":"10.1016\/S0096-0551(98)00009-5_BIB25","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1145\/4904.4999","article-title":"\u201cSometimes\u201d and \u201cNot Never\u201d revisited: on branching versus linear time temporal logic","volume":"33","author":"Emerson","year":"1986","journal-title":"Journal of the ACM"},{"key":"10.1016\/S0096-0551(98)00009-5_BIB26","unstructured":"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\u2013135"},{"key":"10.1016\/S0096-0551(98)00009-5_BIB27","unstructured":"Wadge WW, Ashcroft EA. Lucid, the dataflow programming language. London: Academic Press, 1985"},{"key":"10.1016\/S0096-0551(98)00009-5_BIB28","unstructured":"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\u201317 May, Victoria BC, Canada, 1997. p. 12\u201326"},{"key":"10.1016\/S0096-0551(98)00009-5_BIB29","doi-asserted-by":"crossref","unstructured":"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\u2013243","DOI":"10.1007\/3-540-58402-1_17"},{"issue":"2","key":"10.1016\/S0096-0551(98)00009-5_BIB30","doi-asserted-by":"crossref","first-page":"319","DOI":"10.1016\/S0304-3975(97)00048-0","article-title":"Multi-dimensional logic programming: theoretical foundations","volume":"158","author":"Orgun","year":"1997","journal-title":"Theoretical Computer Science"},{"key":"10.1016\/S0096-0551(98)00009-5_BIB31","doi-asserted-by":"crossref","unstructured":"Ashcroft EA, Faustini AA, Jagannathan R, Wadge WW. Multidimensional programming. New York: Oxford University Press, 1995","DOI":"10.1093\/oso\/9780195075977.001.0001"},{"key":"10.1016\/S0096-0551(98)00009-5_BIB32","unstructured":"Rondogiannis P. Negation in Chronolog. In: Proc. of the 11th International Symposium on Languages for Intensional Programming (ISLIP'98), 7\u20139 May, Palo Alto, CA, USA, 1998"},{"key":"10.1016\/S0096-0551(98)00009-5_BIB33","unstructured":"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\u20138 September, 1995. p. 494\u2013501"},{"key":"10.1016\/S0096-0551(98)00009-5_BIB34","unstructured":"Tao S. Indexical attribute grammars. Ph.D. Thesis, Department of Computer Science, University of Victoria, Canada, 1994"}],"container-title":["Computer Languages"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0096055198000095?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0096055198000095?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T04:26:17Z","timestamp":1704083177000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0096055198000095"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,10]]},"references-count":34,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1998,10]]}},"alternative-id":["S0096055198000095"],"URL":"https:\/\/doi.org\/10.1016\/s0096-0551(98)00009-5","relation":{},"ISSN":["0096-0551"],"issn-type":[{"value":"0096-0551","type":"print"}],"subject":[],"published":{"date-parts":[[1998,10]]}}}