{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,1,5]],"date-time":"2023-01-05T22:18:34Z","timestamp":1672957114383},"reference-count":14,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1994,10,1]],"date-time":"1994-10-01T00:00:00Z","timestamp":780969600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":6864,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[1994,10]]},"DOI":"10.1016\/0304-3975(94)90196-1","type":"journal-article","created":{"date-parts":[[2002,10,10]],"date-time":"2002-10-10T17:44:32Z","timestamp":1034271872000},"page":"421-442","source":"Crossref","is-referenced-by-count":5,"title":["Aggregate operations in the information source tracking method"],"prefix":"10.1016","volume":"133","author":[{"given":"Fereidoon","family":"Sadri","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"issue":"4","key":"10.1016\/0304-3975(94)90196-1_BIB1","doi-asserted-by":"crossref","first-page":"608","DOI":"10.1145\/319996.320014","article-title":"A foundation of Codd's relational maybe operations","volume":"8","author":"Biskup","year":"1983","journal-title":"ACM Trans. Database Systems"},{"key":"10.1016\/0304-3975(94)90196-1_BIB2","first-page":"151","article-title":"The complexity of theorem proving procedures","author":"Cook","year":"1971","journal-title":"Proc. 3rd ACM Symp. Theory of Computing"},{"issue":"4","key":"10.1016\/0304-3975(94)90196-1_BIB3","doi-asserted-by":"crossref","first-page":"485","DOI":"10.1109\/69.43423","article-title":"Resolving database incompatibility: An approach to performing operations over mismatched domains","volume":"1","author":"DeMichiel","year":"1989","journal-title":"IEEE Trans. Knowledge Data Engrg."},{"key":"10.1016\/0304-3975(94)90196-1_BIB4","series-title":"Project Report","article-title":"Reliability of answers to an SQL query","author":"Doyon","year":"1990"},{"key":"10.1016\/0304-3975(94)90196-1_BIB5","series-title":"Computers and Intractability, A Guide to the Theory of NP-Completeness","author":"Garey","year":"1979"},{"issue":"7","key":"10.1016\/0304-3975(94)90196-1_BIB6","doi-asserted-by":"crossref","first-page":"620","DOI":"10.1109\/TSE.1985.232506","article-title":"On the use of an extended relational model to handle changing incomplete information","volume":"sE-11","author":"Keller","year":"1985","journal-title":"IEEE Trans. Software Engrg."},{"issue":"1","key":"10.1016\/0304-3975(94)90196-1_BIB7","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/77643.77644","article-title":"Indefinite and maybe information in relational databases","volume":"15","author":"Liu","year":"1990","journal-title":"ACM Trans. Database Systems"},{"issue":"1","key":"10.1016\/0304-3975(94)90196-1_BIB8","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1109\/69.75890","article-title":"A generalized relational model for indefinite and may be information","volume":"3","author":"Liu","year":"1991","journal-title":"IEEE Trans. Knowledge Data Engrg."},{"key":"10.1016\/0304-3975(94)90196-1_BIB9","series-title":"The Theory of Relational Databases","author":"Maier","year":"1983"},{"key":"10.1016\/0304-3975(94)90196-1_BIB10","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1016\/0004-3702(86)90031-7","article-title":"Probabilistic logic","volume":"28","author":"Nilsson","year":"1986","journal-title":"Artificial Intelligence"},{"issue":"2","key":"10.1016\/0304-3975(94)90196-1_BIB11","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1109\/69.88004","article-title":"Reliability of answers to queries in relational databases","volume":"3","author":"Sadri","year":"1991","journal-title":"IEEE Trans. Knowledge Data Engrg."},{"key":"10.1016\/0304-3975(94)90196-1_BIB12","first-page":"122","article-title":"Modeling uncertainty in databases","author":"Sadri","year":"1991","journal-title":"IEEE Internat. Conf. Data Engrg."},{"key":"10.1016\/0304-3975(94)90196-1_BIB13","doi-asserted-by":"crossref","unstructured":"F. Sadri, Integrity constraints in the information source tracking method, IEEE Trans Knowledge Data Engrg., to appear.","DOI":"10.1109\/69.368515"},{"key":"10.1016\/0304-3975(94)90196-1_BIB14","unstructured":"F. Sadri, Information source tracking method: Efficiency issues, manuscript, submitted."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397594901961?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397594901961?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T18:21:34Z","timestamp":1555179694000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0304397594901961"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,10]]},"references-count":14,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1994,10]]}},"alternative-id":["0304397594901961"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(94)90196-1","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1994,10]]}}}