{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,4]],"date-time":"2025-05-04T00:35:36Z","timestamp":1746318936555},"reference-count":21,"publisher":"Springer Science and Business Media LLC","issue":"3-4","license":[{"start":{"date-parts":[[1995,9,1]],"date-time":"1995-09-01T00:00:00Z","timestamp":809913600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Ann Math Artif Intell"],"published-print":{"date-parts":[[1995,9]]},"DOI":"10.1007\/bf01536403","type":"journal-article","created":{"date-parts":[[2005,4,19]],"date-time":"2005-04-19T06:38:02Z","timestamp":1113892682000},"page":"407-435","source":"Crossref","is-referenced-by-count":21,"title":["How expressive is stratified aggregation?"],"prefix":"10.1007","volume":"15","author":[{"given":"Inderpal Singh","family":"Mumick","sequence":"first","affiliation":[]},{"given":"Oded","family":"Shmueli","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"CR1","doi-asserted-by":"crossref","unstructured":"S. Abiteboul and V. Vianu, Generic computation and its complexity,Proceedings of the Twenty-Third Symposium on Theory of Computing, New Orleans, LA, 1991, pp. 154?163.","DOI":"10.1145\/103418.103444"},{"key":"CR2","unstructured":"K.R. Apt and H.A. Blair, Arithmetic classification of perfect models of stratified programs, in R.A. Kowalski and K.A. Bowen, editors,Proceedings of the Fifth International Conference and Symposium on Logic Programming, Seattle, WA (MIT Press, 1988) pp. 765?779."},{"issue":"2","key":"CR3","doi-asserted-by":"crossref","first-page":"156","DOI":"10.1016\/0022-0000(80)90032-X","volume":"21","author":"A.K. Chandra","year":"1980","unstructured":"A.K. Chandra and D. Harel, Computable queries for relational data bases, J. Comp. and Syst. Sci. 21(2) (1980) 156?178.","journal-title":"J. Comp. and Syst. Sci."},{"key":"CR4","doi-asserted-by":"crossref","unstructured":"M.P. Consens and A.O. Mendelzon, Low complexity aggregation in Graphlog and Datalog,Proceedings of the International Conference on Database Theory (ICDT), 1990.","DOI":"10.1007\/3-540-53507-1_90"},{"key":"CR5","doi-asserted-by":"crossref","unstructured":"S. Ganguly, S. Greco, and C. Zaniolo, Minimum and maximum predicates in logic programming,Proceedings of the Tenth Symposium on Principles of Database Systems (PODS), Denver, CO, 1991, pp. 154?163.","DOI":"10.1145\/113413.113427"},{"key":"CR6","doi-asserted-by":"crossref","unstructured":"F. Giannotti, D. Pedreschi, D. Sacca, and C. Zaniolo, Non-determinism in deductive databases, in C. Delobel, M. Kifer, and Y. Masunaga, editors,Proceedings of the Second International Conference on Deductive and Object-Oriented Databases (DOOD '91), LNCS 566, Munich, Germany, 1991, pp. 129?146.","DOI":"10.1007\/3-540-55015-1_7"},{"key":"CR7","unstructured":"J.E. Hopcroft and J.D. Ullman,Introduction to Automata Theory, Languages, and Computation (Addison-Wesley, 1979)."},{"key":"CR8","doi-asserted-by":"crossref","unstructured":"R. Hull and J. Su, Untyped sets, invention, and computable queries,Proceedings of the Eighth Symposium on Principles of Database Systems (PODS), Philadelphia, PA, 1989, pp. 347?359.","DOI":"10.1145\/73721.73755"},{"key":"CR9","unstructured":"D.B. Kemp and P.J. Stuckey, Semantics of logic programs with aggregates,Proceedings of the 1991 Symposium on Logic Programming, 1991, pp. 387?404."},{"key":"CR10","doi-asserted-by":"crossref","unstructured":"R. Krishnamurthy and S.A. Naqvi, Non-deterministic choice in datalog,Proceedings of the 3rd International Conference on Data and Knowledge Bases, 1988, pp. 416?424.","DOI":"10.1016\/B978-1-4832-1313-2.50038-X"},{"key":"CR11","doi-asserted-by":"crossref","unstructured":"J.W. Lloyd,Foundations of Logic Programming (Springer-Verlag, 1984).","DOI":"10.1007\/978-3-642-96826-6"},{"key":"CR12","series-title":"Technical Report No. STAN-CS-91-1400","volume-title":"PhD Thesis","author":"I.S. Mumick","year":"1991","unstructured":"I.S. Mumick, Query optimization in deductive and relational databases, PhD Thesis, Stanford University, Stanford, CA 94305, USA (1991). Technical Report No. STAN-CS-91-1400. Also available from University Microfilms International, 300 N. Zeeb Road, Ann Arbor, MI 48106. (313)761?4700."},{"key":"CR13","unstructured":"I.S. Mumick, H. Pirahesh, and R. Ramakrishnan, The magic of duplicates and aggregates,Proceedings of the Sixteenth International Conference on Very Large Databases (VLDB), Brisbane, Australia, 1990, pp. 264?277."},{"key":"CR14","unstructured":"I.S. Mumick, J.D. Ullman, and M. Vardi, Personal communications on summarized explosion query (1989)."},{"key":"CR15","doi-asserted-by":"crossref","unstructured":"K.A. Ross and Y. Sagiv, Monotonic aggregation in deductive databases,Proceedings of the Eleventh Symposium on Principles of Database Systems (PODS), San Diego, CA (1992).","DOI":"10.1145\/137097.137852"},{"key":"CR16","doi-asserted-by":"crossref","unstructured":"J.S. Schlipf, The expressive powers of the logic programming semantics,Proceedings of the Ninth Symposium on Principles of Database Systems (PODS), Nashville, TN, 1990, pp. 196?204.","DOI":"10.1145\/298514.298564"},{"key":"CR17","unstructured":"S. Sudarshan, D. Srivastava, and R. Ramakrishnan, Extending the well-founded and valid semantics for aggregation, Submitted for publication (1992)."},{"issue":"2","key":"CR18","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1007\/BF01932293","volume":"17","author":"S.-\ufffd. T\ufffdrnlund","year":"1977","unstructured":"S.-\ufffd. T\ufffdrnlund, Horn clause computability, BIT 17(2) (1977) 215?226.","journal-title":"BIT"},{"issue":"3","key":"CR19","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1145\/3979.3980","volume":"10","author":"J.D. Ullman","year":"1985","unstructured":"J.D. Ullman, Implementation of logical query languages for databases, ACM Trans. Database Syst. 10(3) (1985) 289?321.","journal-title":"ACM Trans. Database Syst."},{"key":"CR20","unstructured":"J.D. Ullman,Principles of Database and Knowledge-Base Systems, Vol. 1 (Computer Science Press, 1988)."},{"key":"CR21","doi-asserted-by":"crossref","unstructured":"A. Van Gelder, The well-founded semantics of aggregation,Proceedings of the Eleventh Symposium on Principles of Database Systems (PODS), San Diego, CA, 1992, pp. 127?138.","DOI":"10.1145\/137097.137854"}],"container-title":["Annals of Mathematics and Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01536403\/fulltext.html","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01536403.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01536403\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01536403","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,7]],"date-time":"2020-04-07T00:08:30Z","timestamp":1586218110000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01536403"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995,9]]},"references-count":21,"journal-issue":{"issue":"3-4","published-print":{"date-parts":[[1995,9]]}},"alternative-id":["BF01536403"],"URL":"https:\/\/doi.org\/10.1007\/bf01536403","relation":{},"ISSN":["1012-2443","1573-7470"],"issn-type":[{"value":"1012-2443","type":"print"},{"value":"1573-7470","type":"electronic"}],"subject":[],"published":{"date-parts":[[1995,9]]}}}