{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,3]],"date-time":"2024-09-03T12:48:47Z","timestamp":1725367727469},"reference-count":17,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[1986,12,1]],"date-time":"1986-12-01T00:00:00Z","timestamp":533779200000},"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":9725,"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":[[1986,12]]},"DOI":"10.1016\/0304-3975(86)90011-3","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T23:48:55Z","timestamp":1027640935000},"page":"39-65","source":"Crossref","is-referenced-by-count":9,"title":["Set containment inference and syllogisms"],"prefix":"10.1016","volume":"62","author":[{"given":"Paolo","family":"Atzeni","sequence":"first","affiliation":[]},{"given":"D.Stott","family":"Parker","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(86)90011-3_BIB1","first-page":"449","article-title":"On the properties of extended inclusion inference","author":"Arisawa","year":"1986","journal-title":"Proc. 12th Internat. Conf. on Very Large Data Bases"},{"key":"10.1016\/0304-3975(86)90011-3_BIB2","first-page":"504","article-title":"Consistency and completeness of OMEGA, a logic for knowledge representation","author":"Attardi","year":"1981","journal-title":"Proc. 7th IJCAI"},{"key":"10.1016\/0304-3975(86)90011-3_BIB3","first-page":"700","article-title":"Formal properties of net-based knowledge representation schemes","author":"Atzeni","year":"1986","journal-title":"Proc. 2nd Conf. on Data Engineering"},{"key":"10.1016\/0304-3975(86)90011-3_BIB4","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1016\/0304-3975(85)90046-5","article-title":"DAL\u2014a logic for data analysis","volume":"36","author":"del Cerro","year":"1985","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(86)90011-3_BIB5","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1007\/3-540-15976-2_5","article-title":"Two applications of equational theories to database theory","author":"Cosmadakis","year":"1985","journal-title":"Proc. Conf. on Rewriting Techniques and Applications"},{"key":"10.1016\/0304-3975(86)90011-3_BIB6","series-title":"Logic Machines and Diagrams","author":"Gardner","year":"1982"},{"key":"10.1016\/0304-3975(86)90011-3_BIB7","series-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"Garey","year":"1979"},{"key":"10.1016\/0304-3975(86)90011-3_BIB8","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0010-0277(84)90035-0","article-title":"Syllogistic inference","volume":"16","author":"Johnson-Laird","year":"1984","journal-title":"Cognition"},{"key":"10.1016\/0304-3975(86)90011-3_BIB9","first-page":"264","article-title":"Unary inclusion dependencies have polynomial time inference problems","author":"Kanellakis","year":"1983","journal-title":"Proc. 15th ACM Symp. on Theory of Computing"},{"key":"10.1016\/0304-3975(86)90011-3_BIB10","series-title":"The Theory of Relational Data Bases","author":"Maier","year":"1983"},{"key":"10.1016\/0304-3975(86)90011-3_BIB11","first-page":"304","article-title":"Parts inference: closed and semi-closed partitioning graphs","author":"Papalaskaris","year":"1981","journal-title":"Proc. 7th IJCAI"},{"key":"10.1016\/0304-3975(86)90011-3_BIB12","doi-asserted-by":"crossref","first-page":"341","DOI":"10.1007\/BF01001956","article-title":"Rough sets","volume":"11","author":"Pawlak","year":"1982","journal-title":"Internat. J. Comput. Inform. Sci."},{"key":"10.1016\/0304-3975(86)90011-3_BIB13","first-page":"778","article-title":"Problems with parts","author":"Schubert","year":"1979","journal-title":"Proc. 6th IJCAI"},{"key":"10.1016\/0304-3975(86)90011-3_BIB14","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1109\/MC.1983.1654198","article-title":"Determining type, part, color, and time relationships","author":"Schubert","year":"1983","journal-title":"IEEE Comput."},{"key":"10.1016\/0304-3975(86)90011-3_BIB15_1","series-title":"Report No. 286","first-page":"1","article-title":"The partition model: a deductive database model","author":"Spyratos","year":"1984"},{"key":"10.1016\/0304-3975(86)90011-3_BIB15_2","doi-asserted-by":"crossref","DOI":"10.1145\/12047.22718","article-title":"The partition model: a deductive database model","volume":"12","author":"Spyratos","year":"1987","journal-title":"ACM TODS"},{"key":"10.1016\/0304-3975(86)90011-3_BIB16","series-title":"Principles of Data Base Systems","author":"Ullman","year":"1984"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397586900113?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397586900113?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,12]],"date-time":"2019-04-12T23:54:57Z","timestamp":1555113297000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0304397586900113"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1986,12]]},"references-count":17,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[1986,12]]}},"alternative-id":["0304397586900113"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(86)90011-3","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1986,12]]}}}