{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,15]],"date-time":"2024-07-15T11:55:42Z","timestamp":1721044542894},"reference-count":6,"publisher":"Elsevier BV","issue":"4","license":[{"start":{"date-parts":[[1998,5,1]],"date-time":"1998-05-01T00:00:00Z","timestamp":893980800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information Processing Letters"],"published-print":{"date-parts":[[1998,5]]},"DOI":"10.1016\/s0020-0190(98)00067-2","type":"journal-article","created":{"date-parts":[[2003,4,23]],"date-time":"2003-04-23T20:36:00Z","timestamp":1051130160000},"page":"195-199","source":"Crossref","is-referenced-by-count":9,"title":["On the properties of combination set operations"],"prefix":"10.1016","volume":"66","author":[{"given":"Hiroshi G.","family":"Okuno","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shin-ichi","family":"Minato","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hideki","family":"Isozaki","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"issue":"5","key":"10.1016\/S0020-0190(98)00067-2_BIB1","doi-asserted-by":"crossref","first-page":"677","DOI":"10.1109\/TC.1986.1676819","article-title":"Graph-based algorithm for Boolean function manipulation","volume":"C-35","author":"Bryant","year":"1986","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/S0020-0190(98)00067-2_BIB2","series-title":"Proc. of 30th ACM\/IEEE Design Automation Conference","first-page":"625","article-title":"A new viewpoint on two-level logic minimization","author":"Coudert","year":"1993"},{"key":"10.1016\/S0020-0190(98)00067-2_BIB3","series-title":"Mental Models","author":"Johnson-Laird","year":"1983"},{"issue":"1","key":"10.1016\/S0020-0190(98)00067-2_BIB4","first-page":"32","article-title":"Algorithms for constraint-satisfaction problems: A survey","volume":"13","author":"Kumar","year":"1992","journal-title":"AI Magazine"},{"key":"10.1016\/S0020-0190(98)00067-2_BIB5","series-title":"Proc. of 30th ACM\/IEEE Design Automation Conference","first-page":"272","article-title":"Zero-Suppressed BDDs for set manipulation in combinatorial problems","author":"Minato","year":"1993"},{"issue":"8","key":"10.1016\/S0020-0190(98)00067-2_BIB6","first-page":"1789","article-title":"Solving constraint-satisfaction problems by binary decision diagrams","volume":"36","author":"Okuno","year":"1995","journal-title":"Trans. Information Processing Society of Japan"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019098000672?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019098000672?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,23]],"date-time":"2019-04-23T22:27:51Z","timestamp":1556058471000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0020019098000672"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,5]]},"references-count":6,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1998,5]]}},"alternative-id":["S0020019098000672"],"URL":"https:\/\/doi.org\/10.1016\/s0020-0190(98)00067-2","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1998,5]]}}}