{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,18]],"date-time":"2025-05-18T06:10:10Z","timestamp":1747548610524,"version":"3.40.5"},"reference-count":20,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2003,3,1]],"date-time":"2003-03-01T00:00:00Z","timestamp":1046476800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2003,3,1]],"date-time":"2003-03-01T00:00:00Z","timestamp":1046476800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Annals of Mathematics and Artificial Intelligence"],"published-print":{"date-parts":[[2003,3]]},"DOI":"10.1023\/a:1021200130191","type":"journal-article","created":{"date-parts":[[2003,3,21]],"date-time":"2003-03-21T00:56:49Z","timestamp":1048208209000},"page":"273-283","source":"Crossref","is-referenced-by-count":1,"title":["Solving Satisfiability Problems Using Elliptic Approximations. A Note on Volumes and Weights"],"prefix":"10.1007","volume":"37","author":[{"given":"Hans","family":"van Maaren","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Joost P.","family":"Warners","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"5098005_CR1","doi-asserted-by":"crossref","first-page":"381","DOI":"10.1007\/BF02127976","volume":"17","author":"M. B\u00f6hm","year":"1996","unstructured":"M. B\u00f6hm and E. Speckenmeyer, A fast parallel SAT-solver - efficient workload balancing, Annals of Mathematics and Artificial Intelligence 17 (1996) 381\u2013400.","journal-title":"Annals of Mathematics and Artificial Intelligence"},{"doi-asserted-by":"crossref","unstructured":"S.A. Cook, The complexity of theorem proving procedures, in: Proceedings of the 3rd Annual ACM Symposium on the Theory of Computing (1971) pp. 151\u2013158.","key":"5098005_CR2","DOI":"10.1145\/800157.805047"},{"key":"5098005_CR3","volume-title":"Second DIMACS Challenge","author":"J.M. Crawford","year":"1993","unstructured":"J.M. Crawford, Solving satisfiability problems using a combination of systematic and local search, Extended abstract, presented at Second DIMACS Challenge, Rutgers University, NJ (1993)."},{"doi-asserted-by":"crossref","unstructured":"J.M. Crawford and L.D. Auton, Experimental results on the crossover point in random 3-SAT, Artificial Intelligence (1996) 81.","key":"5098005_CR4","DOI":"10.1016\/0004-3702(95)00046-1"},{"key":"5098005_CR5","doi-asserted-by":"crossref","first-page":"394","DOI":"10.1145\/368273.368557","volume":"5","author":"M. Davis","year":"1962","unstructured":"M. Davis, M. Logemann and D. Loveland, A machine program for theorem proving, Communications of the ACM 5 (1962) 394\u2013397.","journal-title":"Communications of the ACM"},{"key":"5098005_CR6","doi-asserted-by":"crossref","first-page":"210","DOI":"10.1145\/321033.321034","volume":"7","author":"M. Davis","year":"1960","unstructured":"M. Davis and H. Putnam, A computing procedure for quantification theory, Journal of the ACM 7 (1960) 210\u2013215.","journal-title":"Journal of the ACM"},{"key":"5098005_CR7","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1023\/A:1006362203438","volume":"24","author":"E. de Klerk","year":"2000","unstructured":"E. de Klerk, H. van Maaren and J.P. Warners, Relaxations of the satisfiability problem using semidefinite programming, Journal of Automated Reasoning 24 (2000) 37\u201365.","journal-title":"Journal of Automated Reasoning"},{"unstructured":"D. Du, J. Gu and P.M. Pardalos (eds.), Satisfiability Problem: Theory and Applications, DIMACS Series in Discrete Mathematics and Computer Science, Vol. 35 (American Mathematical Society, 1997).","key":"5098005_CR8"},{"doi-asserted-by":"crossref","unstructured":"O. Dubois, P. Andre, Y. Boufkhad and J. Carlier, SAT versus UNSAT, in: [13], pp. 415\u2013436.","key":"5098005_CR9","DOI":"10.1090\/dimacs\/026\/20"},{"unstructured":"J. Gu, P.W. Purdom, J. Franco and B.W. Wah, Algorithms for the satisfiability (SAT) problem: a survey, in: [8], pp. 9\u2013151.","key":"5098005_CR10"},{"issue":"3","key":"5098005_CR11","doi-asserted-by":"crossref","first-page":"359","DOI":"10.1007\/BF00881805","volume":"15","author":"J.N. Hooker","year":"1995","unstructured":"J.N. Hooker and V. Vinay, Branching rules for satisfiability, Journal of Automated Reasoning 15(3) (1995) 359\u2013383.","journal-title":"Journal of Automated Reasoning"},{"key":"5098005_CR12","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1007\/BF01531077","volume":"1","author":"R.G. Jeroslow","year":"1990","unstructured":"R.G. Jeroslow and J. Wang, Solving propositional satisfiability problems. Annals of Mathematics and Artificial Intelligence 1 (1990) 167\u2013187.","journal-title":"Annals of Mathematics and Artificial Intelligence"},{"doi-asserted-by":"crossref","unstructured":"D.S. Johnson and M.A. Trick (eds.), Cliques, Coloring and Satisfiability: Second DIMACS Implementation Challenge, DIMACS Series in DiscreteMathematics and Computer Science, Vol. 26 (American Mathematical Society, 1996).","key":"5098005_CR13","DOI":"10.1090\/dimacs\/026"},{"key":"5098005_CR14","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1137\/1038003","volume":"38","author":"L. Vandenberghe","year":"1996","unstructured":"L. Vandenberghe and S. Boyd, Semidefinite programming, SIAM Review 38 (1996) 49\u201395.","journal-title":"SIAM Review"},{"doi-asserted-by":"crossref","unstructured":"A. van Gelder and Y.K. Tsuji, Satisfiability testing with more reasoning and less guessing, in: [13], pp. 559\u2013586.","key":"5098005_CR15","DOI":"10.1090\/dimacs\/026\/27"},{"doi-asserted-by":"crossref","unstructured":"H. van Maaren, On the use of second order derivatives for the satisfiability problem, in [8], pp. 677\u2013687.","key":"5098005_CR16","DOI":"10.1090\/dimacs\/035\/21"},{"key":"5098005_CR17","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1016\/S0166-218X(99)00041-4","volume":"96-97","author":"H. van Maaren","year":"1999","unstructured":"H. van Maaren, Elliptic approximations of propositional formulae, Discrete Applied Mathematics 96-97 (1999) 223\u2013244.","journal-title":"Discrete Applied Mathematics"},{"key":"5098005_CR18","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1016\/S0167-6377(98)00052-2","volume":"23","author":"J.P. Warners","year":"1998","unstructured":"J.P. Warners and H. van Maaren, A two phase algorithm for solving a class of hard satisfiability problems, Operations Research Letters 23 (1998) 81\u201388.","journal-title":"Operations Research Letters"},{"key":"5098005_CR19","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1016\/S0166-218X(99)00135-3","volume":"99","author":"J.P. Warners","year":"2000","unstructured":"J.P. Warners and H. van Maaren, Recognition of tractable satisfiability problems trough balanced polynomial representations, Discrete Applied Mathematics 99 (2000) 229\u2013244.","journal-title":"Discrete Applied Mathematics"},{"key":"5098005_CR20","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1016\/S0166-218X(00)00249-3","volume":"107","author":"J.P. Warners","year":"2000","unstructured":"J.P.Warners and H. van Maaren, Solving satisfiability problems using elliptic approximations - effective branching rules, Discrete Applied Mathematics 107 (2000) pp. 241\u2013259.","journal-title":"Discrete Applied Mathematics"}],"container-title":["Annals of Mathematics and Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1021200130191.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1021200130191\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1021200130191.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,18]],"date-time":"2025-05-18T05:44:03Z","timestamp":1747547043000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1021200130191"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,3]]},"references-count":20,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2003,3]]}},"alternative-id":["5098005"],"URL":"https:\/\/doi.org\/10.1023\/a:1021200130191","relation":{},"ISSN":["1012-2443","1573-7470"],"issn-type":[{"type":"print","value":"1012-2443"},{"type":"electronic","value":"1573-7470"}],"subject":[],"published":{"date-parts":[[2003,3]]}}}