{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,30]],"date-time":"2026-04-30T08:13:55Z","timestamp":1777536835235,"version":"3.51.4"},"reference-count":21,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[1995,6,1]],"date-time":"1995-06-01T00:00:00Z","timestamp":801964800000},"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":6621,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[1995,6]]},"DOI":"10.1016\/0166-218x(94)00048-i","type":"journal-article","created":{"date-parts":[[2003,4,23]],"date-time":"2003-04-23T20:16:34Z","timestamp":1051128994000},"page":"159-179","source":"Crossref","is-referenced-by-count":2,"title":["A new algorithm for the propositional satisfiability problem"],"prefix":"10.1016","volume":"60","author":[{"given":"G.","family":"Gallo","sequence":"first","affiliation":[]},{"given":"D.","family":"Pretolani","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0166-218X(94)00048-I_BIB1","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1016\/0196-6774(80)90007-3","article-title":"Recognizing disguised NR(1) instances of the satisfiability problem","volume":"1","author":"Aspvall","year":"1980","journal-title":"J. Algorithms"},{"key":"10.1016\/0166-218X(94)00048-I_BIB2","doi-asserted-by":"crossref","first-page":"112","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":"Inform. Process. Lett."},{"key":"10.1016\/0166-218X(94)00048-I_BIB3","series-title":"The Traveling Salesman Problem","article-title":"Branch and bound methods","author":"Balas","year":"1985"},{"key":"10.1016\/0166-218X(94)00048-I_BIB4_1","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1145\/102782.102789","article-title":"Extended Horn sets in propositional logic","volume":"38","author":"Chandru and Hooker","year":"1991","journal-title":"J. ACM"},{"key":"10.1016\/0166-218X(94)00048-I_BIB4_2","first-page":"221","article-title":"Extended Horn sets in propositional logic","volume":"38","author":"Chandru and Hooker","year":"1991","journal-title":"J. ACM"},{"key":"10.1016\/0166-218X(94)00048-I_BIB5","series-title":"Proceedings of the ACM Symposium on the Theory of Computing","first-page":"151","article-title":"The complexity of theorem proving procedures","author":"Cook","year":"1971"},{"key":"10.1016\/0166-218X(94)00048-I_BIB6","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":"1","author":"Dowling","year":"1984","journal-title":"J. Logic Programming"},{"key":"10.1016\/0166-218X(94)00048-I_BIB7","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1007\/BF01531074","article-title":"Branch and cut solution of inference problems in propositional logic","volume":"1","author":"Fedjki","year":"1990","journal-title":"Ann. Math. Artificial Intelligence"},{"key":"10.1016\/0166-218X(94)00048-I_BIB8","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1016\/0020-0190(86)90051-7","article-title":"On the probabilistic performance of algorithms for the satisfiability problem","volume":"23","author":"Franco","year":"1986","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0166-218X(94)00048-I_BIB9","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1016\/0166-218X(83)90017-3","article-title":"Probabilistic analysis of the Davis-Putnam procedure for solving the satisfiability problem","volume":"5","author":"Franco","year":"1983","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/0166-218X(94)00048-I_BIB10","series-title":"Computers and Intractability","author":"Garey","year":"1978"},{"key":"10.1016\/0166-218X(94)00048-I_BIB11","first-page":"177","article-title":"Directed hypergraphs and applications Discrete","volume":"42","author":"Gallo","year":"1993","journal-title":"Appl. Math."},{"key":"10.1016\/0166-218X(94)00048-I_BIB12","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1016\/0020-0190(88)90113-5","article-title":"Polinomially solvable satisfiability problems","volume":"29","author":"Gallo","year":"1988","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0166-218X(94)00048-I_BIB13","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1016\/0743-1066(89)90009-5","article-title":"Algorithms for testing satisfiability of propositional Horn Clauses","volume":"7","author":"Gallo","year":"1989","journal-title":"J. Logic Programming"},{"key":"10.1016\/0166-218X(94)00048-I_BIB14","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":"Theoret. Comput. Sci."},{"key":"10.1016\/0166-218X(94)00048-I_BIB15","series-title":"Working Paper 1991-27","article-title":"A computational study of satisfiability algorithms for propositional logic","author":"Harche","year":"1985"},{"key":"10.1016\/0166-218X(94)00048-I_BIB16","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1007\/BF01531077","article-title":"Solving propositional satisfiability problems","volume":"1","author":"Jeroslow","year":"1990","journal-title":"Ann. Math. Artificial Intelligence"},{"key":"10.1016\/0166-218X(94)00048-I_BIB17","series-title":"Automated Theorem-Proving: A Logical Basis","author":"Loveland","year":"1978"},{"key":"10.1016\/0166-218X(94)00048-I_BIB18","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1007\/BF01531031","article-title":"The unique Horn-satisfiability problem and quadratic Boolean equations","volume":"6","author":"Minoux","year":"1992","journal-title":"Ann. Math. Artificial Intelligence"},{"key":"10.1016\/0166-218X(94)00048-I_BIB19","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 Appl. Math."},{"key":"10.1016\/0166-218X(94)00048-I_BIB20","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. ACM"}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X9400048I?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X9400048I?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,15]],"date-time":"2019-04-15T03:55:14Z","timestamp":1555300514000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0166218X9400048I"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995,6]]},"references-count":21,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1995,6]]}},"alternative-id":["0166218X9400048I"],"URL":"https:\/\/doi.org\/10.1016\/0166-218x(94)00048-i","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[1995,6]]}}}