{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,1,11]],"date-time":"2023-01-11T22:56:27Z","timestamp":1673477787963},"reference-count":20,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[1996,6,1]],"date-time":"1996-06-01T00:00:00Z","timestamp":833587200000},"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":6255,"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":[[1996,6]]},"DOI":"10.1016\/0304-3975(95)00209-x","type":"journal-article","created":{"date-parts":[[2003,5,13]],"date-time":"2003-05-13T04:04:58Z","timestamp":1052798698000},"page":"365-380","source":"Crossref","is-referenced-by-count":6,"title":["Negative Boolean constraints"],"prefix":"10.1016","volume":"160","author":[{"given":"Kim","family":"Marriott","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Martin","family":"Odersky","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(95)00209-X_BIB1","series-title":"Proc. Fundamentals of Computation Theory (FCT, 79)","first-page":"64","article-title":"Complexity of the theory of atomless Boolean algebras","author":"Berman","year":"1979"},{"key":"10.1016\/0304-3975(95)00209-X_BIB2","series-title":"An Investigation of the Laws of Thought","author":"Boole","year":"1847"},{"key":"10.1016\/0304-3975(95)00209-X_BIB3","series-title":"Boolean Reasoning, The Logic of Boolean Equations","author":"Brown","year":"1990"},{"key":"10.1016\/0304-3975(95)00209-X_BIB4","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1016\/S0747-7171(87)80065-2","article-title":"Embedding Boolean expressions into logic programming","volume":"4","author":"Buttner","year":"1987","journal-title":"J. Symbolic Comput."},{"key":"10.1016\/0304-3975(95)00209-X_BIB5","series-title":"Proc. Internat. Conf. on 5th Generation Computer Systems","first-page":"85","article-title":"Equations and inequations on finite and infinite trees","author":"Colmerauer","year":"1984"},{"issue":"7","key":"10.1016\/0304-3975(95)00209-X_BIB6","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1145\/79204.79210","article-title":"An introduction to Prolog III","volume":"33","author":"Colmerauer","year":"1990","journal-title":"Comm. ACM"},{"key":"10.1016\/0304-3975(95)00209-X_BIB7","series-title":"Comput. Intractability","author":"Garey","year":"1979"},{"key":"10.1016\/0304-3975(95)00209-X_BIB8","series-title":"Proc. Symp. on Theoret. Aspects Comput. Sci.","first-page":"98","article-title":"Dominoe games with an application to the complexity of Boolean algebras with bounded quantifier alternations","volume":"Vol. 294","author":"Gr\u00e4del","year":"1988"},{"key":"10.1016\/0304-3975(95)00209-X_BIB9","series-title":"Proc. ACM Symp. on Principles of Database Systems","first-page":"181","article-title":"Constraint-based query optimization for spatial databases","author":"Helm","year":"1991"},{"key":"10.1016\/0304-3975(95)00209-X_BIB10","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1006\/jcss.1995.1061","article-title":"Spatial query optimization: From Boolean constraints to range queries","volume":"51","author":"Helm","year":"1995","journal-title":"J. Comput. Systems Sci."},{"key":"10.1016\/0304-3975(95)00209-X_BIB11","series-title":"ACM Symp. on Principles of Programming Languages","first-page":"111","article-title":"Constraint logic programming","author":"Jaffar","year":"1987"},{"key":"10.1016\/0304-3975(95)00209-X_BIB12","series-title":"Proc. ACM Symp. on Principles of Database Systems","first-page":"299","article-title":"Constraint query languages","author":"Kanellakis","year":"1990"},{"key":"10.1016\/0304-3975(95)00209-X_BIB13","volume":"Vol. I","author":"Koppelberg","year":"1989"},{"key":"10.1016\/0304-3975(95)00209-X_BIB14","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1016\/0304-3975(80)90048-1","article-title":"Complexity of Boolean algebras","volume":"10","author":"Kozen","year":"1980","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(95)00209-X_BIB15","series-title":"Proc. IEEE Symp. on Logic in Comput. Sci.","first-page":"52","article-title":"A constraint sequent calculus","author":"Lassez","year":"1990"},{"key":"10.1016\/0304-3975(95)00209-X_BIB16","doi-asserted-by":"crossref","first-page":"275","DOI":"10.1016\/S0747-7171(89)80013-6","article-title":"Boolean unification \u2014 the story so far","volume":"7","author":"Martin","year":"1989","journal-title":"J. Symbolic Comput."},{"key":"10.1016\/0304-3975(95)00209-X_BIB17","series-title":"Boolean Functions and Equations","author":"Rudeanu","year":"1974"},{"key":"10.1016\/0304-3975(95)00209-X_BIB18","series-title":"Proc. 2nd International Conference on Algebraic and Logic Programming","first-page":"189","article-title":"Prepositional calculus problems in CHIP","volume":"Vol. 490","author":"Simonis","year":"1990"},{"issue":"64","key":"10.1016\/0304-3975(95)00209-X_BIB19","first-page":"1192","article-title":"Arithmetical classes and types of Boolean algebras","volume":"55","author":"Tarski","year":"1949","journal-title":"Bull. Amer. Math. Soc."},{"key":"10.1016\/0304-3975(95)00209-X_BIB20","series-title":"Proc. ACM Symp. on Principles of Database Systems","first-page":"164","article-title":"Efficient processing of relational calculus using range query theory","author":"Willard","year":"1984"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030439759500209X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030439759500209X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,16]],"date-time":"2019-04-16T04:55:52Z","timestamp":1555390552000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/030439759500209X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996,6]]},"references-count":20,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[1996,6]]}},"alternative-id":["030439759500209X"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(95)00209-x","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1996,6]]}}}