{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T01:10:34Z","timestamp":1759626634362,"version":"build-2065373602"},"reference-count":9,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[1998,2,1]],"date-time":"1998-02-01T00:00:00Z","timestamp":886291200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[1998,2,1]],"date-time":"1998-02-01T00:00:00Z","timestamp":886291200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[1998,6,18]],"date-time":"1998-06-18T00:00:00Z","timestamp":898128000000},"content-version":"vor","delay-in-days":137,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[1998,2]]},"DOI":"10.1016\/s0304-3975(97)00011-x","type":"journal-article","created":{"date-parts":[[2003,4,7]],"date-time":"2003-04-07T15:40:02Z","timestamp":1049730002000},"page":"149-179","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":30,"title":["Foundations of aggregation constraints"],"prefix":"10.1016","volume":"193","author":[{"given":"Kenneth A.","family":"Ross","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Divesh","family":"Srivastava","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Peter J.","family":"Stuckey","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"S.","family":"Sudarshan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(97)00011-X_BIB1","doi-asserted-by":"crossref","first-page":"339","DOI":"10.1145\/129393.129398","article-title":"The CLP language and system","volume":"14","author":"Jaffar","year":"1992","journal-title":"ACM Trans. Programming Languages Systems"},{"key":"10.1016\/S0304-3975(97)00011-X_BIB2","series-title":"Proc. Internat. Conf. on Very Large Databases","first-page":"96","article-title":"Query optimization by predicate move-around","author":"Levy","year":"1994"},{"key":"10.1016\/S0304-3975(97)00011-X_BIB3","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1145\/176454.176522","article-title":"Semantics of constraint logic programs with optimization","volume":"2","author":"Marriott","year":"1993","journal-title":"Lett. Programming Languages Systems"},{"year":"1993","series-title":"Understanding the New SQL: A Complete Guide","author":"Melton","key":"10.1016\/S0304-3975(97)00011-X_BIB4"},{"key":"10.1016\/S0304-3975(97)00011-X_BIB5","series-title":"Proc. 2nd Internat. Workshop on Principles and Practice of Constraint Programming","first-page":"193","article-title":"Foundations of aggregation constraints","volume":"Vol. 874","author":"Ross","year":"1994"},{"key":"10.1016\/S0304-3975(97)00011-X_BIB6","series-title":"Discrete Mathematics and Optimization","article-title":"Theory of Linear and Integer Programming","author":"Schrijver","year":"1986"},{"key":"10.1016\/S0304-3975(97)00011-X_BIB7","doi-asserted-by":"crossref","first-page":"361","DOI":"10.1016\/0743-1066(93)90048-L","article-title":"Pushing constraint selections","volume":"16","author":"Srivastava","year":"1993","journal-title":"J. Logic Programming"},{"key":"10.1016\/S0304-3975(97)00011-X_BIB8","series-title":"Proc. ACM Symp. on Principles of Database Systems","first-page":"56","article-title":"Compiling query constraints","author":"Stuckey","year":"1994"},{"key":"10.1016\/S0304-3975(97)00011-X_BIB9","series-title":"Proc. Internat. Conf. on Very Large Databases","first-page":"501","article-title":"Aggregation and relevance in deductive databases","author":"Sudarshan","year":"1991"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S030439759700011X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S030439759700011X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T00:51:19Z","timestamp":1759625479000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S030439759700011X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,2]]},"references-count":9,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[1998,2]]}},"alternative-id":["S030439759700011X"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(97)00011-x","relation":{},"ISSN":["0304-3975"],"issn-type":[{"type":"print","value":"0304-3975"}],"subject":[],"published":{"date-parts":[[1998,2]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Foundations of aggregation constraints","name":"articletitle","label":"Article Title"},{"value":"Theoretical Computer Science","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/S0304-3975(97)00011-X","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 1998 Published by Elsevier B.V.","name":"copyright","label":"Copyright"}]}}