{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,6]],"date-time":"2025-06-06T15:10:01Z","timestamp":1749222601324,"version":"3.41.0"},"reference-count":32,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2001,11,1]],"date-time":"2001-11-01T00:00:00Z","timestamp":1004572800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2001,11,1]],"date-time":"2001-11-01T00:00:00Z","timestamp":1004572800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Intelligent Information Systems"],"published-print":{"date-parts":[[2001,11]]},"DOI":"10.1023\/a:1012502800961","type":"journal-article","created":{"date-parts":[[2002,12,23]],"date-time":"2002-12-23T13:43:47Z","timestamp":1040651027000},"page":"71-94","source":"Crossref","is-referenced-by-count":3,"title":["The Branching-Time Transformation Technique for Chain Datalog Programs"],"prefix":"10.1007","volume":"17","author":[{"given":"Panos","family":"Rondogiannis","sequence":"first","affiliation":[]},{"given":"Manolis","family":"Gergatsoulis","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"381665_CR1","doi-asserted-by":"crossref","unstructured":"Afrati, F. and Cosmadakis, S. (1989). Expressiveness of Restricted Recursive Queries. In Proc. 21st ACM Symp. on Theory of Computing","DOI":"10.1145\/73007.73018"},{"key":"381665_CR2","doi-asserted-by":"crossref","unstructured":"Afrati, F., Gergatsoulis, M., and Katzouraki, M. (1996). On Transformations into Linear Database Logic Programs. In D. Bj\u00f8rner, M. Broy and I. Pottosin (Eds.), Perspectives of Systems Informatics (PSI'96), Proceedings (pp. 433-444).","DOI":"10.1007\/3-540-62064-8_36"},{"key":"381665_CR3","doi-asserted-by":"crossref","unstructured":"Afrati, F. and Papadimitriou, C.H. (1987). The Parallel Complexity of Simple Chain Queries. In Proc. 6th ACM Symposium on Principles of Database Systems (pp. 210-213).","DOI":"10.1145\/28659.28682"},{"issue":"3","key":"381665_CR4","doi-asserted-by":"crossref","first-page":"891","DOI":"10.1145\/153724.153752","volume":"40","author":"F. Afrati","year":"1993","unstructured":"Afrati, F. and Papadimitriou, C.H. (1993). Parallel Complexity of Simple Logic Programs, Journal of the ACM, 40(3), 891-916.","journal-title":"Journal of the ACM"},{"key":"381665_CR5","unstructured":"Baudinet, M., Chomicki, J., and Wolper, P. (1993). Temporal Deductive Databases. In L.F. del Cerro and M. Penttonen (Eds.), Temporal Databases: Theory, Design, and Implementation (pp. 294-320). The Benjamin\/Cummings Publishing Company, Inc."},{"issue":"1-4","key":"381665_CR6","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1016\/0743-1066(91)90038-Q","volume":"10","author":"C. Beeri","year":"1991","unstructured":"Beeri, C. and Ramakrishnan, R. (1991). On the power of magic, The Journal of Logic Programming, 10(1-4), 255-299.","journal-title":"The Journal of Logic Programming"},{"issue":"1","key":"381665_CR7","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0743-1066(94)00030-A","volume":"25","author":"J. Chomicki","year":"1995","unstructured":"Chomicki, J. (1995). Depth-Bounded Bottom-Up evaluation of Logic Programs, The Journal of Logic Programming, 25(1), 1-31.","journal-title":"The Journal of Logic Programming"},{"issue":"3","key":"381665_CR8","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1016\/0743-1066(94)00027-4","volume":"23","author":"G. Dong","year":"1995","unstructured":"Dong, G. and Ginsburg, S. (1995). On Decompositions of Chain Datalog Programs into \u03c1 (Left-)Linear 1-Rule Components, The Journal of Logic Programming, 23(3), 203-236.","journal-title":"The Journal of Logic Programming"},{"issue":"11","key":"381665_CR9","first-page":"1097","volume":"20","author":"W. Du","year":"1990","unstructured":"Du, W. and Wadge, W.W. (1990). The Eductive Implementation of a Three-dimensional Spreadsheet, Software-Practice and Experience, 20(11), 1097-1114.","journal-title":"Software-Practice and Experience"},{"issue":"7","key":"381665_CR10","doi-asserted-by":"crossref","first-page":"86","DOI":"10.1145\/960114.29659","volume":"22","author":"A. Faustini","year":"1987","unstructured":"Faustini, A. and Wadge, W. (1987). An Eductive Interpreter for the Language pLucid. In Proceedings of the SIGPLAN 87 Conference on Interpreters and Interpretive Techniques (SIGPLAN Notices 22(7)) (pp. 86-91).","journal-title":"SIGPLAN Notices"},{"key":"381665_CR11","unstructured":"Gergatsoulis, M. (2001). Temporal and Modal Logic Programming Languages. In A. Kent and J.G. Williams (Eds.), Encyclopedia of Microcomputers, Vol. 27, Suppl. 6. Marcel Decker, Inc., pp. 393-408."},{"key":"381665_CR12","doi-asserted-by":"crossref","unstructured":"Gergatsoulis, M. and Katzouraki, M. (1994). Unfold\/Fold Transformations for Definite Clause Programs. In M. Hermenegildo and J. Penjam (Eds.), Programming Language Implementation and Logic Programming (PLILP'94), Proceedings (pp. 340-354).","DOI":"10.1007\/3-540-58402-1_24"},{"key":"381665_CR13","unstructured":"Gergatsoulis, M. and Spyropoulos, C. (1998). Transformation Techniques for Branching-Time Logic Programs. In W.W. Wadge (Ed.), Proc. of the 11th International Symposium on Languages for Intensional Programming (ISLIP'98), May 7\u20139, Palo Alto, California, USA (pp. 48-63)."},{"issue":"3","key":"381665_CR14","doi-asserted-by":"crossref","first-page":"349","DOI":"10.1142\/S0129054199000253","volume":"10","author":"S. Greco","year":"1999","unstructured":"Greco, S., Sacc\u00e0, D., and Zaniolo, C. (1999). Grammars and Automata to Optimize Chain Logic Queries, International Journal on Foundations of Computer Science, 10(3), 349-372.","journal-title":"International Journal on Foundations of Computer Science"},{"key":"381665_CR15","doi-asserted-by":"crossref","unstructured":"Haddad, R.W. and Naughton, J.F. (1988). Counting Methods for Cyclic Relations. In Proc. 7th ACM SIGACTSIGMOD-SIGART Symposium on Principles of Database Systems (pp. 333-340).","DOI":"10.1145\/308386.308469"},{"key":"381665_CR16","unstructured":"Jones, S.L.P. (1987). The Implementation of Functional Programming Languages. Prentice-Hall."},{"key":"381665_CR17","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-83189-8","volume-title":"Foundations of Logic Programming","author":"J.W. Lloyd","year":"1987","unstructured":"Lloyd, J.W. (1987). Foundations of Logic Programming. Springer-Verlag, Germany."},{"key":"381665_CR18","unstructured":"Naughton, J.F. and Ramakrishnan, R. (1991). Bottom-Up Evaluation of Logic Programs. In J.L. Lasser and G. Plotkin (Eds.), Computational Logic. Essays in the Honor of Alan Robinson (pp. 640-699). MIT Press."},{"key":"381665_CR19","volume-title":"Intensional Logic Programming","author":"M.A. Orgun","year":"1991","unstructured":"Orgun, M.A. (1991). Intensional Logic Programming. Ph.D. Thesis, Dept. of Computer Science, University of Victoria, Canada."},{"issue":"2","key":"381665_CR20","doi-asserted-by":"crossref","first-page":"259","DOI":"10.1111\/j.1467-8640.1996.tb00261.x","volume":"12","author":"M.A. Orgun","year":"1996","unstructured":"Orgun, M.A. (1996). On Temporal Deductive Databases, Computational Intelligence, 12(2), 235-259.","journal-title":"Computational Intelligence"},{"key":"381665_CR21","doi-asserted-by":"crossref","unstructured":"Orgun, M.A. and Ma,W. (1994). An Overview of Temporal and Modal Logic Programming. In D.M. Gabbay and H.J. Ohlbach (Eds.), Proc. of the First International Conference on Temporal Logics (ICTL'94) (pp. 445-479).","DOI":"10.1007\/BFb0014004"},{"key":"381665_CR22","doi-asserted-by":"crossref","unstructured":"Proietti, M. and Pettorossi, A. (1990). Synthesis of Eureka Predicates for Developing Logic Programs. In Proc. of the 3rd European Symposium on Programming (pp. 306-325).","DOI":"10.1007\/3-540-52592-0_71"},{"issue":"3","key":"381665_CR23","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1016\/S0096-0551(98)00009-5","volume":"24","author":"P. Rondogiannis","year":"1998","unstructured":"Rondogiannis, P., Gergatsoulis, M., and Panayiotopoulos, T. (1998). Branching-Time Logic Programming: The Language Cactus and Its Applications, Computer Languages, 24(3), 155-178.","journal-title":"Computer Languages"},{"issue":"1","key":"381665_CR24","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1017\/S0956796897002633","volume":"7","author":"P. Rondogiannis","year":"1997","unstructured":"Rondogiannis, P. and Wadge, W.W. (1997). First-Order Functional Languages and Intensional Logic, Journal of Functional Programming, 7(1), 73-101.","journal-title":"Journal of Functional Programming"},{"issue":"5","key":"381665_CR25","doi-asserted-by":"crossref","first-page":"527","DOI":"10.1017\/S0956796899003445","volume":"9","author":"P. Rondogiannis","year":"1999","unstructured":"Rondogiannis, P. and Wadge, W.W. (1999). Higher-Order Functional Languages and Intensional Logic, Journal of Functional Programming, 9(5), 527-564.","journal-title":"Journal of Functional Programming"},{"issue":"4","key":"381665_CR26","first-page":"187","volume":"4","author":"D. Sacc\u00e0","year":"1988","unstructured":"Sacc\u00e0, D. and Zaniolo, C. (1988). The Generalized Counting Method for Recursive Logic Queries, Theoretical Computer Science, 4(4), 187-220.","journal-title":"Theoretical Computer Science"},{"issue":"6","key":"381665_CR27","doi-asserted-by":"crossref","first-page":"1046","DOI":"10.1145\/235809.235814","volume":"43","author":"S. Sippu","year":"1996","unstructured":"Sippu, S. and Soisalon-Soininen, E. (1996). An Analysis of Magic Sets and Related Optimization Strategies for Logic Queries, Journal of the ACM, 43(6), 1046-1088.","journal-title":"Journal of the ACM"},{"key":"381665_CR28","unstructured":"Tamaki, H. and Sato, T. (1984). Unfold\/Fold Transformations of Logic Programs. In S.-\u00c5. Tarnlund (Ed.), Proc. of the Second International Conference on Logic Programming (pp. 127-138)."},{"key":"381665_CR29","volume-title":"Principles of Database and Knowledge-Base Systems, Vols. I & II","author":"J.D. Ullman","year":"1989","unstructured":"Ullman, J.D. (1989). Principles of Database and Knowledge-Base Systems, Vols. I & II. Computer Science Press, USA."},{"key":"381665_CR30","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1007\/BF01762108","volume":"3","author":"J.D. Ullman","year":"1988","unstructured":"Ullman, J.D. and Gelder, A.V. (1988). Parallel Complexity of Logical Query Programs, Algorithmica, 3, 5-42.","journal-title":"Algorithmica"},{"key":"381665_CR31","unstructured":"Wadge, W.W. (1991). Higher-Order Lucid. In Proceedings of the Fourth International Symposium on Lucid and Intensional Programming."},{"key":"381665_CR32","volume-title":"The Intensional Implementation Technique for Functional Languages","author":"A. Yaghi","year":"1984","unstructured":"Yaghi, A. (1984). The Intensional Implementation Technique for Functional Languages. Ph.D. Thesis, Dept. of Computer Science, University of Warwick, Coventry, UK."}],"container-title":["Journal of Intelligent Information Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1012502800961.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1012502800961\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1012502800961.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,6]],"date-time":"2025-06-06T14:34:12Z","timestamp":1749220452000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1012502800961"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,11]]},"references-count":32,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2001,11]]}},"alternative-id":["381665"],"URL":"https:\/\/doi.org\/10.1023\/a:1012502800961","relation":{},"ISSN":["0925-9902","1573-7675"],"issn-type":[{"type":"print","value":"0925-9902"},{"type":"electronic","value":"1573-7675"}],"subject":[],"published":{"date-parts":[[2001,11]]}}}