{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T21:15:49Z","timestamp":1725484549581},"publisher-location":"Berlin, Heidelberg","reference-count":25,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540439158"},{"type":"electronic","value":"9783540456070"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-45607-4_2","type":"book-chapter","created":{"date-parts":[[2007,5,22]],"date-time":"2007-05-22T19:08:20Z","timestamp":1179860900000},"page":"25-45","source":"Crossref","is-referenced-by-count":1,"title":["A Transformation Technique for Datalog Programs Based on Non-deterministic Constructs"],"prefix":"10.1007","author":[{"given":"Petros","family":"Potikas","sequence":"first","affiliation":[]},{"given":"Panos","family":"Rondogiannis","sequence":"additional","affiliation":[]},{"given":"Manolis","family":"Gergatsoulis","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2002,7,4]]},"reference":[{"key":"2_CR1","doi-asserted-by":"crossref","unstructured":"F. Afrati and S. Cosmadakis. Expressiveness of restricted recursive queries. In Proc. 21st ACM Symp. on Theory of Computing, pages 113\u2013126, 1989.","DOI":"10.1145\/73007.73018"},{"key":"2_CR2","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"433","DOI":"10.1007\/3-540-62064-8_36","volume-title":"Perspectives of Systems Informatics (PSI\u201996), Proceedings","author":"F. Afrati","year":"1996","unstructured":"F. Afrati, M. Gergatsoulis, and M. Katzouraki. On transformations into linear database logic programs. In D. Bj\u00f8rner, M. Broy, and I. Pottosin, editors, Perspectives of Systems Informatics (PSI\u201996), Proceedings, Lecture Notes in Computer Science (LNCS) 1181, pages 433\u2013444. Springer-Verlag, 1996."},{"issue":"123 & 4","key":"2_CR3","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1016\/0743-1066(91)90038-Q","volume":"10","author":"C. Beeri","year":"1991","unstructured":"C. Beeri and R. Ramakrishnan. On the power of magic. The Journal of Logic Programming, 10(1,2,3 & 4):255\u2013299, 1991.","journal-title":"The Journal of Logic Programming"},{"issue":"1","key":"2_CR4","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0743-1066(94)00030-A","volume":"25","author":"Jan Chomicki","year":"1995","unstructured":"Jan Chomicki. Depth-bounded bottom-up evaluation of logic programs. The Journal of Logic Programming, 25(1):1\u201331, 1995.","journal-title":"The Journal of Logic Programming"},{"issue":"2","key":"2_CR5","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1145\/151634.151635","volume":"18","author":"J. Chomicki","year":"1993","unstructured":"J. Chomicki and T. Imielnski. Finite representation of infinite query answers. ACM Transaction of Database Systems, 18(2):181\u2013223, June 1993.","journal-title":"ACM Transaction of Database Systems"},{"issue":"1\u20132","key":"2_CR6","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1023\/A:1018999404360","volume":"19","author":"F. Giannotti","year":"1997","unstructured":"F. Giannotti, S. Greco, D. Sacc\u00e0, and C. Zaniolo. Programming with non-determinism in deductive databases. Annals of Mathematics and Artificial Intelligence, 19(1\u20132):97\u2013125, 1997.","journal-title":"Annals of Mathematics and Artificial Intelligence"},{"key":"2_CR7","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"340","DOI":"10.1007\/3-540-58402-1_24","volume-title":"Programming Language Implementation and Logic Programming (PLILP\u201994), Proceedings","author":"M. Gergatsoulis","year":"1994","unstructured":"M. Gergatsoulis and M. Katzouraki. Unfold\/fold transformations for definite clause programs. In M. Hermenegildo and J. Penjam, editors, Programming Language Implementation and Logic Programming (PLILP\u201994), Proceedings, Lecture Notes in Computer Science (LNCS) 844, pages 340\u2013354. Springer-Verlag, 1994."},{"issue":"1","key":"2_CR8","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1006\/jcss.1999.1699","volume":"62","author":"F. Giannotti","year":"2001","unstructured":"F. Giannotti, D. Pedreschi, and C. Zaniolo. Semantics and expressive power of non-deterministic constructs in deductive databases. Journal of Computer and Systems Sciences, 62(1):15\u201342, 2001.","journal-title":"Journal of Computer and Systems Sciences"},{"issue":"3","key":"2_CR9","doi-asserted-by":"publisher","first-page":"349","DOI":"10.1142\/S0129054199000253","volume":"10","author":"S. Greco","year":"1999","unstructured":"S. Greco, D. Sacc\u00e0, and C. Zaniolo. Grammars and automata to optimize chain logic queries. International Journal on Foundations of Computer Science, 10(3):349\u2013372, 1999.","journal-title":"International Journal on Foundations of Computer Science"},{"key":"2_CR10","doi-asserted-by":"crossref","unstructured":"R. W. Haddad and J. F. Naughton. Counting methods for cyclic relations. In Proc. 7th ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, pages 333\u2013340. ACM Press, 1988.","DOI":"10.1145\/308386.308469"},{"key":"2_CR11","doi-asserted-by":"crossref","unstructured":"J. W. Lloyd. Foundations of Logic Programming. Springer-Verlag, 1987.","DOI":"10.1007\/978-3-642-83189-8"},{"issue":"4","key":"2_CR12","doi-asserted-by":"publisher","first-page":"413","DOI":"10.1016\/0743-1066(92)90055-8","volume":"13","author":"M. A. Orgun","year":"1992","unstructured":"M. A. Orgun and W. W. Wadge. Towards a unified theory of intensional logic programming. The Journal of Logic Programming, 13(4):413\u2013440, 1992.","journal-title":"The Journal of Logic Programming"},{"issue":"6","key":"2_CR13","doi-asserted-by":"publisher","first-page":"877","DOI":"10.1093\/logcom\/4.6.877","volume":"4","author":"M. A. Orgun","year":"1994","unstructured":"M. A. Orgun and W. W. Wadge. Extending temporal logic programming with choice predicates non-determinism. Journal of Logic and Computation, 4(6):877\u2013903, 1994.","journal-title":"Journal of Logic and Computation"},{"key":"2_CR14","doi-asserted-by":"crossref","unstructured":"A. Pettorossi and M. Proietti. Transformation of logic programs. In D. M. Gabbay, C. J. Hogger, and J. A. Robinson, editors, Handbook of Logic in Artificial Intelligence and Logic Programming, volume 5, pages 697\u2013787. Oxford University Press, 1997.","DOI":"10.1093\/oso\/9780198537922.003.0013"},{"key":"2_CR15","unstructured":"P. Rondogiannis and M. Gergatsoulis. The intensional implementation technique for chain datalog programs. In Proc. of the 11th International Symposium on Languages for Intensional Programming (ISLIP\u201998), May 7\u20139, Palo Alto, California, USA, pages 55\u201364, 1998."},{"issue":"1","key":"2_CR16","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1023\/A:1012502800961","volume":"17","author":"P. Rondogiannis","year":"2001","unstructured":"Panos Rondogiannis and Manolis Gergatsoulis. The branching-time transformation technique for chain datalog programs. Journal of Intelligent Information Systems, 17(1):71\u201394, 2001.","journal-title":"Journal of Intelligent Information Systems"},{"issue":"3","key":"2_CR17","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1016\/S0096-0551(98)00009-5","volume":"24","author":"P. Rondogiannis","year":"1998","unstructured":"P. Rondogiannis, M. Gergatsoulis, and T. Panayiotopoulos. Branching-time logic programming: The language Cactus and its applications. Computer Languages, 24(3):155\u2013178, October 1998.","journal-title":"Computer Languages"},{"issue":"1","key":"2_CR18","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1017\/S0956796897002633","volume":"7","author":"P. Rondogiannis","year":"1997","unstructured":"P. Rondogiannis and W. W. Wadge. First-order functional languages and intensional logic. Journal of Functional Programming, 7(1):73\u2013101, 1997.","journal-title":"Journal of Functional Programming"},{"issue":"5","key":"2_CR19","doi-asserted-by":"publisher","first-page":"527","DOI":"10.1017\/S0956796899003445","volume":"9","author":"P. Rondogiannis","year":"1999","unstructured":"P. Rondogiannis and W. W. Wadge. Higher-Order Functional Languages and Intensional Logic. Journal of Functional Programming, 9(5):527\u2013564, 1999.","journal-title":"Journal of Functional Programming"},{"issue":"6","key":"2_CR20","doi-asserted-by":"publisher","first-page":"1046","DOI":"10.1145\/235809.235814","volume":"43","author":"S. Sippu","year":"1996","unstructured":"S. Sippu and E. Soisalon-Soininen. An analysis of magic sets and related optimization strategies for logic queries. Journal of the ACM, 43(6):1046\u20131088, 1996.","journal-title":"Journal of the ACM"},{"issue":"4","key":"2_CR21","first-page":"187","volume":"4","author":"D. Sacc\u00e0","year":"1988","unstructured":"D. Sacc\u00e0 and C. Zaniolo. The generalized counting method for recursive logic queries. Theoretical Computer Science, 4(4):187\u2013220, 1988.","journal-title":"Theoretical Computer Science"},{"key":"2_CR22","unstructured":"H. Tamaki and T. Sato. Unfold\/fold transformations of logic programs. In Sten-\u00c5ke Tarnlund, editor, Proc. of the Second International Conference on Logic Programming, pages 127\u2013138, 1984."},{"key":"2_CR23","unstructured":"Jeffrey D. Ullman. Principles of Database and Knowledge-Base Systems, volume I & II. Computer Science Press, 1989."},{"key":"2_CR24","unstructured":"W. W. Wadge. Higher-Order Lucid. In Proceedings of the Fourth International Symposium on Lucid and Intensional Programming, 1991."},{"key":"2_CR25","series-title":"PhD thesis","volume-title":"The intensional implementation technique for functional languages","author":"A. Yaghi","year":"1984","unstructured":"A. Yaghi. The intensional implementation technique for functional languages. PhD thesis, Dept. of Computer Science, University of Warwick, Coventry, UK, 1984."}],"container-title":["Lecture Notes in Computer Science","Logic Based Program Synthesis and Transformation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45607-4_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,11]],"date-time":"2023-05-11T23:12:10Z","timestamp":1683846730000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45607-4_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540439158","9783540456070"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/3-540-45607-4_2","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2002]]}}}