{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,14]],"date-time":"2025-07-14T02:28:11Z","timestamp":1752460091044},"reference-count":16,"publisher":"Springer Science and Business Media LLC","issue":"3-4","license":[{"start":{"date-parts":[[1993,9,1]],"date-time":"1993-09-01T00:00:00Z","timestamp":746841600000},"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":[[1993,9]]},"DOI":"10.1007\/bf01530796","type":"journal-article","created":{"date-parts":[[2005,4,19]],"date-time":"2005-04-19T00:24:51Z","timestamp":1113870291000},"page":"315-343","source":"Crossref","is-referenced-by-count":32,"title":["Subsumption and indexing in constraint query languages with linear arithmetic constraints"],"prefix":"10.1007","volume":"8","author":[{"given":"Divesh","family":"Srivastava","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"CR1","doi-asserted-by":"crossref","unstructured":"F. Bancilhon, Naive evaluation of recursively defined relations, in:On Knowledge Base Management Systems ? Integrating Database and AI Systems, ed. Brodie and Mylopoulos (Springer, 1985).","DOI":"10.1007\/978-1-4612-4980-1_17"},{"key":"CR2","unstructured":"M. Baudinet, M. Niezette and P. Wolper, On the representation of infinite temporal data and queries, in:Proc. 10th ACM Symp. on Principles of Database Systems, Denver, CO (1991) pp. 280?290."},{"key":"CR3","doi-asserted-by":"crossref","unstructured":"I. Balbin and K. Ramamohanarao, A generalization of the differential approach to recursive query evaluation, J. Logic. Progr. 4(3) (1987).","DOI":"10.1016\/0743-1066(87)90004-5"},{"key":"CR4","doi-asserted-by":"crossref","unstructured":"J. Chomicki, Polynomial time query processing in temporal deductive databases, in:Proc. 9th ACM Symp. on Principles of Database Systems, Nashville, TN (1990) pp. 379?391.","DOI":"10.1145\/298514.298589"},{"key":"CR5","unstructured":"M.R. Garey and D.S. Johnson,Computers and Intractability: A Guide to the Theory of NP-Completeness (Freeman, 1979)."},{"key":"CR6","doi-asserted-by":"crossref","unstructured":"A. Guttman, R-trees: A dynamic index structure for spatial searching, in:Proc. ACM SIGMOD Conf. on Management of Data (1984) pp. 47?57.","DOI":"10.1145\/602259.602266"},{"key":"CR7","doi-asserted-by":"crossref","unstructured":"J. Jaffar and J.-L. Lassez, Constraint logic programming, in:Proc. 14th ACM POPL, Munich (1987) pp. 111?119.","DOI":"10.1145\/41625.41635"},{"key":"CR8","unstructured":"J. Jaffar, S. Michaylov, P. Stuckey and R. Yap, The CLP(?) language and system, Technical Report, IBM, T.J. Watson Research Center (1990)."},{"key":"CR9","unstructured":"P.C. Kanellakis, G.M. Kuper and P.Z. Revesz, Constraint query languages, in:Proc. 9th ACM Symp. on Principles of Database Systems Nashville, TN (1990) pp. 299?313."},{"key":"CR10","unstructured":"C. Lassez and J.-L. Lassez, Quantifier elimination for conjunctions on linear constraints via a convex hull algorithm, submitted."},{"key":"CR11","unstructured":"J.-L. Lassez and M.J. Maher, On Fourier's algorithm for linear arithmetic constraints, Technical Report, IBM, T.J. Watson Research Center (1988)."},{"key":"CR12","unstructured":"R. Ramakrishnan, Magic templates: A spellbinding approach to logic programs, in:Proc. Int. Conf. on Logic Programming, Seattle, Washington (1988) pp. 140?159."},{"key":"CR13","doi-asserted-by":"crossref","unstructured":"P.Z. Revesz, A closed form for Datalog queries with integer order, in:Int. Conf. on Database Theory, France (1990) pp. 187?210.","DOI":"10.1007\/3-540-53507-1_77"},{"key":"CR14","unstructured":"A. Schrijver,Theory of Linear and Integer Programming, Discr. Math. Optim. (Wiley-Interscience, 1986)."},{"key":"CR15","doi-asserted-by":"crossref","unstructured":"D. Srivastava and R. Ramakrishnan, Pushing constraint selections, in:Proc. 11th ACM Symp. on Principles of Database Systems, San Diego, CA (1992).","DOI":"10.1145\/137097.137897"},{"key":"CR16","unstructured":"T. Sellis, N. Roussopoulos and C. Faloutsos, The R+-tree: A dynamic index for multi-dimensional objects, in:Proc. 13th Int. Conf. on Very Large Databases (1987) pp. 507?518."}],"container-title":["Annals of Mathematics and Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01530796\/fulltext.html","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01530796.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01530796\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01530796","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,7]],"date-time":"2020-04-07T00:00:51Z","timestamp":1586217651000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01530796"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993,9]]},"references-count":16,"journal-issue":{"issue":"3-4","published-print":{"date-parts":[[1993,9]]}},"alternative-id":["BF01530796"],"URL":"https:\/\/doi.org\/10.1007\/bf01530796","relation":{},"ISSN":["1012-2443","1573-7470"],"issn-type":[{"value":"1012-2443","type":"print"},{"value":"1573-7470","type":"electronic"}],"subject":[],"published":{"date-parts":[[1993,9]]}}}