{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,5]],"date-time":"2025-06-05T11:47:01Z","timestamp":1749124021592},"reference-count":19,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[2000,2,1]],"date-time":"2000-02-01T00:00:00Z","timestamp":949363200000},"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":4915,"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":[[2000,2]]},"DOI":"10.1016\/s0166-218x(99)00135-3","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T08:12:16Z","timestamp":1027584736000},"page":"229-244","source":"Crossref","is-referenced-by-count":9,"title":["Recognition of tractable satisfiability problems through balanced polynomial representations"],"prefix":"10.1016","volume":"99","author":[{"given":"Joost P.","family":"Warners","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hans","family":"van Maaren","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"issue":"3","key":"10.1016\/S0166-218X(99)00135-3_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":"Inform. Process. Lett."},{"key":"10.1016\/S0166-218X(99)00135-3_BIB2","doi-asserted-by":"crossref","unstructured":"B. Benhamou, L. Sais, Theoretical study of symmetries in propositional calculus and applications, in: Proceedings of the 11th Conference on Automated Deduction, 1992, pp. 281\u2013294.","DOI":"10.1007\/3-540-55602-8_172"},{"key":"10.1016\/S0166-218X(99)00135-3_BIB3","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1137\/S0097539792228629","article-title":"A complexity index for satisfiability problems","volume":"23","author":"Boros","year":"1992","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0166-218X(99)00135-3_BIB4","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1007\/BF01531069","article-title":"On renamable Horn and generalized Horn functions","volume":"1","author":"Chandru","year":"1990","journal-title":"Ann. Math. Artif. Intell."},{"key":"10.1016\/S0166-218X(99)00135-3_BIB5","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1145\/102782.102789","article-title":"Extended Horn sets in propositional logic","volume":"38","author":"Chandru","year":"1991","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/S0166-218X(99)00135-3_BIB6","doi-asserted-by":"crossref","unstructured":"S.A. Cook, The complexity of theorem proving procedures, in: Proceedings of the third annual ACM symposium on the Theory of Computing, 1971, pp. 151\u2013158.","DOI":"10.1145\/800157.805047"},{"issue":"3","key":"10.1016\/S0166-218X(99)00135-3_BIB7","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 Program."},{"key":"10.1016\/S0166-218X(99)00135-3_BIB8","unstructured":"O. Dubois, Lecture held at DIMACS conference, Rutgers University, New Brunswick, NJ, March 1996."},{"key":"10.1016\/S0166-218X(99)00135-3_BIB9","doi-asserted-by":"crossref","unstructured":"O. Dubois, P. Andre, Y. Boufkhad, J. Carlier, SAT versus UNSAT, in: Johnson and Trick (Eds.), Cliques, Coloring and Satisfiability: Second DIMACS implementation challenge, vol. 26 of DIMACS series in Discrete Mathematics and Computer Science. American Mathematical Society, Providence, RI, 1996, pp. 415\u2013436.","DOI":"10.1090\/dimacs\/026\/20"},{"key":"10.1016\/S0166-218X(99)00135-3_BIB10","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1016\/0020-0190(88)90113-5","article-title":"Polynomially solvable satisfiability problems","volume":"29","author":"Gallo","year":"1988","journal-title":"Inform. Process. Lett."},{"issue":"3","key":"10.1016\/S0166-218X(99)00135-3_BIB11","doi-asserted-by":"crossref","first-page":"361","DOI":"10.1109\/69.334864","article-title":"Global optimization for satisfiability (SAT) problem","volume":"6","author":"Gu","year":"1994","journal-title":"IEEE Trans. Knowledge Data Eng."},{"key":"10.1016\/S0166-218X(99)00135-3_BIB12","doi-asserted-by":"crossref","unstructured":"D.S. Johnson, M.A. Trick (Eds.), Cliques, Coloring and Satisfiability: Second DIMACS implementation challenge, vol. 26 of DIMACS series in Discrete Mathematics and Computer Science. American Mathematical Society, Providence, RI, 1996.","DOI":"10.1090\/dimacs\/026\/01"},{"key":"10.1016\/S0166-218X(99)00135-3_BIB13","unstructured":"H. Van Maaren, Elliptic approximations of propositional formulae, Technical Report 96-65, Faculty of Technical Mathematics and Informatics, Delft University of Technology, Delft, The Netherlands, 1996."},{"key":"10.1016\/S0166-218X(99)00135-3_BIB14","doi-asserted-by":"crossref","unstructured":"H. Van Maaren, On the use of second order derivatives for the satisfiability problem, in: D. Du, J. Gu, P.M. Pardalos (Eds.), Satisfiability problem: Theory and applications, vol. 35 of DIMACS series in Discrete Mathematics and Computer Science, American Mathematical Society, Providence, RI, 1997, pp. 677\u2013687.","DOI":"10.1090\/dimacs\/035\/21"},{"key":"10.1016\/S0166-218X(99)00135-3_BIB15","doi-asserted-by":"crossref","unstructured":"T.J. Schaefer, The complexity of satisfiability problems, in: Proceedings of the Tenth Symposium on the Theory of Computing, 1978, pp. 216\u2013226.","DOI":"10.1145\/800133.804350"},{"key":"10.1016\/S0166-218X(99)00135-3_BIB16","unstructured":"G.S. Tseitin, On the complexity of derivation in propositional calculus, Studies in Constructive Mathematics and Mathematical Logic Part 2 (1968) 115\u2013125. Reprinted in J. Siekmann, G. Wrightson (Eds.), Automation of Reasoning, vol. 2, Springer, Berlin, 1983."},{"key":"10.1016\/S0166-218X(99)00135-3_BIB17","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"},{"key":"10.1016\/S0166-218X(99)00135-3_BIB18","unstructured":"J.P. Warners, H. Van Maaren, Solving satisfiability problems using elliptic approximations \u2014 Effective branching rules, Technical Report 98-18, Department of Technical Mathematics and Informatics, Faculty of Information Technology and Systems, Delft University of Technology, Delft, The Netherlands, 1998, accepted for publication in Discr. Appl. Math."},{"issue":"3\u20135","key":"10.1016\/S0166-218X(99)00135-3_BIB19","first-page":"81","article-title":"A two-phase algorithm for solving a class of hard satisfiability problems","volume":"23","author":"Warners","year":"1999","journal-title":"Oper. Res. Lett."}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X99001353?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X99001353?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,30]],"date-time":"2019-04-30T19:28:23Z","timestamp":1556652503000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X99001353"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000,2]]},"references-count":19,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[2000,2]]}},"alternative-id":["S0166218X99001353"],"URL":"https:\/\/doi.org\/10.1016\/s0166-218x(99)00135-3","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[2000,2]]}}}