{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,5]],"date-time":"2022-04-05T15:54:20Z","timestamp":1649174060782},"reference-count":12,"publisher":"Elsevier BV","issue":"9","license":[{"start":{"date-parts":[[1991,11,1]],"date-time":"1991-11-01T00:00:00Z","timestamp":688953600000},"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":["Parallel Computing"],"published-print":{"date-parts":[[1991,11]]},"DOI":"10.1016\/s0167-8191(05)80043-2","type":"journal-article","created":{"date-parts":[[2005,7,19]],"date-time":"2005-07-19T14:20:40Z","timestamp":1121782840000},"page":"983-995","source":"Crossref","is-referenced-by-count":3,"title":["An efficient procedure for theorem proving in propositional logic on vector computers"],"prefix":"10.1016","volume":"17","author":[{"given":"Wen-Tsuen","family":"Chen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ming-Yi","family":"Fang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0167-8191(05)80043-2_bib1","series-title":"Proc. 10th Annual Allerteon Conf. on Circuit and System Theory","first-page":"20","article-title":"The decomposition principle for theorem proving system","author":"Chang","year":"1985"},{"key":"10.1016\/S0167-8191(05)80043-2_bib2","series-title":"Symbolic Logic and Mechanical Theorem Proving","author":"Chang","year":"1973"},{"key":"10.1016\/S0167-8191(05)80043-2_bib3","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1016\/0020-0255(87)90005-3","article-title":"Parallel approach for theorem proving in propositional logic","volume":"41","author":"Chen","year":"1987","journal-title":"Inform. Sci."},{"key":"10.1016\/S0167-8191(05)80043-2_bib4","series-title":"Proc. 3rd ACM Symp. on Theory of Computing","first-page":"151","article-title":"The complexity of theorem proving procedures","author":"Cook","year":"1971"},{"key":"10.1016\/S0167-8191(05)80043-2_bib5","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1016\/0020-0190(88)90069-5","article-title":"A simple parallel algorithm for finding a satisfying truth assignment to a 2-CNF formula","volume":"27","author":"Cook","year":"1988","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/S0167-8191(05)80043-2_bib6","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. Ass. Comput. Mach."},{"key":"10.1016\/S0167-8191(05)80043-2_bib7","series-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"Garey","year":"1979"},{"key":"10.1016\/S0167-8191(05)80043-2_bib8","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1016\/0304-3975(85)90144-6","article-title":"The intractability of resolution","volume":"39","author":"Haken","year":"1985","journal-title":"Theor. Comp. Sci."},{"key":"10.1016\/S0167-8191(05)80043-2_bib9","series-title":"Computer Architectures and Parallel Processing","author":"Hwang","year":"1984"},{"key":"10.1016\/S0167-8191(05)80043-2_bib10","series-title":"Proc. 16th ACM Symp. on Theory of Computing","first-page":"266","article-title":"A fast parallel algorithm for the maximal independent set problem","author":"Karp","year":"1984"},{"key":"10.1016\/S0167-8191(05)80043-2_bib11","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1090\/conm\/029\/749237","article-title":"Automated theorem proving: a quarter century review","volume":"29","author":"Loveland","year":"1983","journal-title":"Contemp. Math."},{"key":"10.1016\/S0167-8191(05)80043-2_bib12","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1145\/7531.8928","article-title":"Hard examples for resolution","volume":"34","author":"Urquhart","year":"1987","journal-title":"J. Ass. Comput. Mach."}],"container-title":["Parallel Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167819105800432?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167819105800432?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,1,24]],"date-time":"2019-01-24T11:26:24Z","timestamp":1548329184000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0167819105800432"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991,11]]},"references-count":12,"journal-issue":{"issue":"9","published-print":{"date-parts":[[1991,11]]}},"alternative-id":["S0167819105800432"],"URL":"https:\/\/doi.org\/10.1016\/s0167-8191(05)80043-2","relation":{},"ISSN":["0167-8191"],"issn-type":[{"value":"0167-8191","type":"print"}],"subject":[],"published":{"date-parts":[[1991,11]]}}}