{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,8,26]],"date-time":"2023-08-26T17:18:14Z","timestamp":1693070294925},"reference-count":14,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1992,7,1]],"date-time":"1992-07-01T00:00:00Z","timestamp":709948800000},"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":["Operations Research Letters"],"published-print":{"date-parts":[[1992,7]]},"DOI":"10.1016\/0167-6377(92)90019-y","type":"journal-article","created":{"date-parts":[[2003,6,30]],"date-time":"2003-06-30T18:40:45Z","timestamp":1056998445000},"page":"29-36","source":"Crossref","is-referenced-by-count":11,"title":["An efficient algorithm for the 3-satisfiability problem"],"prefix":"10.1016","volume":"12","author":[{"given":"Alain","family":"Billionnet","sequence":"first","affiliation":[]},{"given":"Alain","family":"Sutter","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0167-6377(92)90019-Y_BIB1","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1016\/0020-0190(79)90002-4","article-title":"A linear time algorithm for testing the truth of certain quantified Boolean formulas","volume":"8","author":"Aspvall","year":"1979","journal-title":"Information Processing Letters"},{"issue":"5","key":"10.1016\/0167-6377(92)90019-Y_BIB2","doi-asserted-by":"crossref","first-page":"633","DOI":"10.1016\/0305-0548(86)90056-0","article-title":"Some results and experiments in programming techniques for propositional logic","volume":"13","author":"Blair","year":"1986","journal-title":"Comput. Oper. Res."},{"key":"10.1016\/0167-6377(92)90019-Y_BIB3","series-title":"Proc. 3rd Ann. ACM Symp. on Theory of Computing","first-page":"151","article-title":"The complexity of theorem-proving procedures","author":"Cook","year":"1971"},{"key":"10.1016\/0167-6377(92)90019-Y_BIB4","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1145\/321033.321034","article-title":"A computing procedure for quantification theory","volume":"7","author":"Davis","year":"1960","journal-title":"J. ACM"},{"key":"10.1016\/0167-6377(92)90019-Y_BIB5","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1016\/0743-1066(84)90014-1","article-title":"Linear time algorithms for testing the satisfiability of propositional horn formulae","volume":"3","author":"Dowling","year":"1984","journal-title":"Journal of Logic Programming"},{"key":"10.1016\/0167-6377(92)90019-Y_BIB6","doi-asserted-by":"crossref","first-page":"691","DOI":"10.1137\/0205048","article-title":"On the complexity of timetable and multicommodity flow problems","volume":"5","author":"Even","year":"1976","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0167-6377(92)90019-Y_BIB7","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1016\/0743-1066(89)90009-5","article-title":"Algorithms for testing the satisfiability of propositional formulae","volume":"7\/1","author":"Gallo","year":"1989","journal-title":"J. Logic Programming"},{"key":"10.1016\/0167-6377(92)90019-Y_BIB8","series-title":"\u00c9tude du probl\u00e8me de satisfaisabilit\u00e9 d'une expression logique","author":"Le Bars","year":"1987"},{"key":"10.1016\/0167-6377(92)90019-Y_BIB9","series-title":"Automated Theorem-Proving: a Logical Basis","author":"Loveland","year":"1978"},{"key":"10.1016\/0167-6377(92)90019-Y_BIB10","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1016\/0166-218X(85)90050-2","article-title":"Solving satisfiability in less than 2n steps","volume":"10","author":"Monien","year":"1985","journal-title":"Discrete Applied Mathematics"},{"key":"10.1016\/0167-6377(92)90019-Y_BIB11","volume":"20\/2","author":"Nelson","year":"1954","journal-title":"Journal of Symbolic Logic"},{"key":"10.1016\/0167-6377(92)90019-Y_BIB12","doi-asserted-by":"crossref","first-page":"510","DOI":"10.1109\/TPAMI.1984.4767555","article-title":"Solving satisfiability with less searching","volume":"6\/4","author":"Purdom","year":"1984","journal-title":"IEEE Trans. Pattern. Anal. Machine Intell."},{"key":"10.1016\/0167-6377(92)90019-Y_BIB13","doi-asserted-by":"crossref","first-page":"521","DOI":"10.2307\/2308219","article-title":"The problem of simplifying truth functions","volume":"59","author":"Quine","year":"1952","journal-title":"American Mathematical Monthly"},{"key":"10.1016\/0167-6377(92)90019-Y_BIB14","article-title":"Recherche des termes premiers d'une fonction Bool\u00e9enne","volume":"9\/1","author":"Tison","year":"1964","journal-title":"Automatismes"}],"container-title":["Operations Research Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:016763779290019Y?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:016763779290019Y?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,18]],"date-time":"2019-03-18T09:50:27Z","timestamp":1552902627000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/016763779290019Y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992,7]]},"references-count":14,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1992,7]]}},"alternative-id":["016763779290019Y"],"URL":"https:\/\/doi.org\/10.1016\/0167-6377(92)90019-y","relation":{},"ISSN":["0167-6377"],"issn-type":[{"value":"0167-6377","type":"print"}],"subject":[],"published":{"date-parts":[[1992,7]]}}}