{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T16:35:38Z","timestamp":1725467738376},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540650829"},{"type":"electronic","value":"9783540496557"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1998]]},"DOI":"10.1007\/bfb0056001","type":"book-chapter","created":{"date-parts":[[2006,7,30]],"date-time":"2006-07-30T04:28:08Z","timestamp":1154233688000},"page":"188-202","source":"Crossref","is-referenced-by-count":3,"title":["Optimization of logic queries with MIN and MAX predicates"],"prefix":"10.1007","author":[{"given":"Sergio","family":"Greco","sequence":"first","affiliation":[]},{"given":"Carlo","family":"Zaniolo","sequence":"additional","affiliation":[]},{"given":"Sumit","family":"Ganguly","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2006,5,31]]},"reference":[{"key":"15_CR1","doi-asserted-by":"crossref","unstructured":"K. Apt, H. Blair, and A. Walker. Towards a theory of declarative programming. In Foundations of Deductive Databases and Logic Programming (Minker, ed.), 1988.","DOI":"10.1016\/B978-0-934613-40-8.50006-3"},{"key":"15_CR2","doi-asserted-by":"crossref","unstructured":"M.P. Consens and A.O. Mendelzon. Low complexity aggregation in graphlog and Datalog. Theoretical Computer Science, 1993.","DOI":"10.1016\/0304-3975(93)90221-E"},{"issue":"2","key":"15_CR3","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1145\/151333.151377","volume":"1","author":"S. W. Dietrich","year":"1992","unstructured":"S. W. Dietrich. Shortest Path by Approximation in Logic Programs. ACM Letters on Programming Languages and Systems Vol 1, No, 2, pages 119\u2013137, June 1992,.","journal-title":"ACM Letters on Programming Languages and Systems"},{"key":"15_CR4","unstructured":"S. J. Finkelstein, N. Mattos, I.S. Mumick and H. Pirahesh. Expressing Recursive Queries in SQL. ISO \u2014 IEC JTC1\/SC21 WG3 DBL MCI Tec. Rep., March, 1996."},{"key":"15_CR5","doi-asserted-by":"crossref","unstructured":"S. Ganguly, S. Greco, and C. Zaniolo. Extrema predicates in deductive databases. J. Computer and System Science, 1995.","DOI":"10.1006\/jcss.1995.1064"},{"key":"15_CR6","unstructured":"M. Gelfond and V. Lifschitz. The stable model semantics of logic programming. In Proc. of the Fifth Intern. Conf. on Logic Programming, pages 1070\u20131080, 1988."},{"key":"15_CR7","doi-asserted-by":"crossref","unstructured":"S. Greco, S. Ganguly, and C. Zaniolo. Greedy by Choice. Proc. Eleventh ACM PODS Conf., pages 109\u2013118, 1991.","DOI":"10.1145\/137097.137836"},{"key":"15_CR8","unstructured":"S. Greco, D. Sacc\u00e0, and C. Zaniolo. Dynamic Programming optimization for Logic Programs with Aggregates. Proc. Int. Logic Progr. Symp., pages 109\u2013118, 1993."},{"key":"15_CR9","unstructured":"D. Kemp and P. Stuckey. Semantics of Logic Programs with Aggregates. In Proc. of the 1991 Intern. Symposium on Logic Programming, pages 387\u2013341, 1991."},{"key":"15_CR10","unstructured":"I.S. Mumick, H. Pirahesh, and R. Ramakrishnan. The magic of duplicates and aggregates. In Proc. 16th Conf. on Very Large Data Bases, pages 264\u2013277, 1990."},{"key":"15_CR11","doi-asserted-by":"crossref","unstructured":"I.S. Mumick, and O. Shmueli. How Expressive is Stratified Aggregation. In Annals of Mathematics and Artificial Intelligence, 1995.","DOI":"10.1007\/BF01536403"},{"key":"15_CR12","unstructured":"H. Przymusinska and T.C. Przymusinski. Weakly perfect model semantics for logic programs. In Proc. Fifth Intern. Conf. on Logic Progr., pages 1106\u20131120, 1988."},{"key":"15_CR13","doi-asserted-by":"crossref","unstructured":"K. Ross. A Procedural Semantics for the Well-Founded Negation in Logic Programs. In Proc. ACM Symp. on Principles of Database Systems, pages 22\u201333, 1989.","DOI":"10.1145\/73721.73724"},{"key":"15_CR14","doi-asserted-by":"crossref","unstructured":"K. Ross and Y. Sagiv. Monotonic Aggregation in Deductive Databases. Proc. Eleventh ACM PODS Conf., 1992.","DOI":"10.1145\/137097.137852"},{"key":"15_CR15","doi-asserted-by":"crossref","unstructured":"D. Sacc\u00e0 and C. Zaniolo. Stable models and non-determinism in logic programs with negation. In Proc. of the Ninth ACM PODS Conf., pages 205\u2013217, 1990.","DOI":"10.1145\/298514.298572"},{"key":"15_CR16","unstructured":"S. Sudarshan and R. Ramakrishnan. Aggregation and relevance in deductive databases. In Proc. of the 17th Conf. on Very Large Data Bases, 1991."},{"key":"15_CR17","unstructured":"R. Ramakrishnan, D. Srivastava, and S. Sudarshan. CORAL: Control, Relations and Logic. In Proc. of Intl. Conf. on Very Large Data Bases, 1992."},{"key":"15_CR18","unstructured":"S. Sudarshan, D. Srivastava, R. Ramakrishnan and C. Beeri, Extending Well-Founded and Valid Semantics for Aggregation, In Proc. of the Int. Logic Programming Symposium, pages 591\u2013608, 1992."},{"key":"15_CR19","volume-title":"Principles of Data and Knowledge-Base Systems, volume 1 and 2","author":"J. Ullman","year":"1988","unstructured":"J. Ullman. Principles of Data and Knowledge-Base Systems, volume 1 and 2. Computer Science Press, New York, 1988."},{"issue":"3","key":"15_CR20","doi-asserted-by":"crossref","first-page":"620","DOI":"10.1145\/116825.116838","volume":"38","author":"A. Gelder Van","year":"1991","unstructured":"A. Van Gelder, K.A. Ross, and J.S. Schlipf. The well-founded semantics for general logic programs. Journal of ACM, 38(3):620\u2013650, 1991.","journal-title":"Journal of ACM"},{"key":"15_CR21","doi-asserted-by":"crossref","unstructured":"A. Van Gelder. Foundation of Aggregation in Deductive Databases In Proceedings of the Third Int. Conf. on Deductive and 0-0 Databases, Phoenix, AZ, 1993.","DOI":"10.1007\/3-540-57530-8_2"},{"key":"15_CR22","doi-asserted-by":"crossref","unstructured":"C. Zaniolo, N. Arni, and K. Ong. Negation and aggregates in recursive rules: the LDL++ approach, In Proc. Int. Conf. od Deductive and Object Oriented Databases, pp. 204\u2013221, 1993.","DOI":"10.1007\/3-540-57530-8_13"}],"container-title":["Lecture Notes in Computer Science","Flexible Query Answering Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0056001","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,20]],"date-time":"2019-04-20T07:41:20Z","timestamp":1555746080000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0056001"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998]]},"ISBN":["9783540650829","9783540496557"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/bfb0056001","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1998]]}}}