{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T17:08:09Z","timestamp":1760202489322},"reference-count":23,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[2003,4,1]],"date-time":"2003-04-01T00:00:00Z","timestamp":1049155200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,8,22]],"date-time":"2013-08-22T00:00:00Z","timestamp":1377129600000},"content-version":"vor","delay-in-days":3796,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Artificial Intelligence"],"published-print":{"date-parts":[[2003,4]]},"DOI":"10.1016\/s0004-3702(02)00373-9","type":"journal-article","created":{"date-parts":[[2003,4,4]],"date-time":"2003-04-04T22:33:30Z","timestamp":1049495610000},"page":"99-120","source":"Crossref","is-referenced-by-count":30,"title":["Backjumping for Quantified Boolean Logic satisfiability"],"prefix":"10.1016","volume":"145","author":[{"given":"Enrico","family":"Giunchiglia","sequence":"first","affiliation":[]},{"given":"Massimo","family":"Narizzano","sequence":"additional","affiliation":[]},{"given":"Armando","family":"Tacchella","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0004-3702(02)00373-9_BIB001","series-title":"Proc. IJCAI-01, Seattle, WA","first-page":"275","article-title":"Backjumping for quantified boolean logic satisfiability","author":"Giunchiglia","year":"2001"},{"issue":"1","key":"10.1016\/S0004-3702(02)00373-9_BIB002","doi-asserted-by":"crossref","first-page":"12","DOI":"10.1006\/inco.1995.1025","article-title":"Resolution for quantified boolean formulas","volume":"117","author":"Kleine-B\u00fcning","year":"1995","journal-title":"Inform. and Comput."},{"key":"10.1016\/S0004-3702(02)00373-9_BIB003","series-title":"Proc. AAAI-98\/IAAI-98, Madison, WI","first-page":"262","article-title":"An algorithm to evaluate quantified boolean formulae","author":"Cadoli","year":"1998"},{"key":"10.1016\/S0004-3702(02)00373-9_BIB004","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1023\/A:1015019416843","article-title":"An algorithm to evaluate quantified boolean formulae and its experimental evaluation","volume":"28","author":"Cadoli","year":"2002","journal-title":"J. Automat. Reason."},{"key":"10.1016\/S0004-3702(02)00373-9_BIB005","series-title":"Proc. IJCAI-99, Stockholm, Sweden, Vol. 2","first-page":"1192","article-title":"Improvements to the evaluation of quantified boolean formulae","author":"Rintanen","year":"1999"},{"key":"10.1016\/S0004-3702(02)00373-9_BIB006","series-title":"Proc. AAAI-00\/IAAI-00, Austin, TX","first-page":"417","article-title":"Solving advanced reasoning tasks using quantified boolean formulas","author":"Egly","year":"2000"},{"key":"10.1016\/S0004-3702(02)00373-9_BIB007","series-title":"Proc. AAAI-00\/IAAI-00, Austin, TX","first-page":"285","article-title":"A distributed algorithm to evaluate quantified boolean formulae","author":"Feldmann","year":"2000"},{"issue":"7","key":"10.1016\/S0004-3702(02)00373-9_BIB008","doi-asserted-by":"crossref","first-page":"394","DOI":"10.1145\/368273.368557","article-title":"A machine program for theorem proving","volume":"5","author":"Davis","year":"1962","journal-title":"Comm. ACM"},{"issue":"3","key":"10.1016\/S0004-3702(02)00373-9_BIB009","doi-asserted-by":"crossref","first-page":"268","DOI":"10.1111\/j.1467-8640.1993.tb00310.x","article-title":"Hybrid algorithms for the constraint satisfaction problem","volume":"9","author":"Prosser","year":"1993","journal-title":"Computational Intelligence"},{"key":"10.1016\/S0004-3702(02)00373-9_BIB010","series-title":"Proc. AAAI-97\/IAAI-97, Providence, RI","first-page":"203","article-title":"Using CSP look-back techniques to solve real-world SAT instances","author":"Bayardo","year":"1997"},{"key":"10.1016\/S0004-3702(02)00373-9_BIB011","series-title":"Proc. International Joint Conference on Automated Reasoning (IJCAR'2001)","first-page":"347","article-title":"Evaluating search heuristics and optimization techniques in propositional satisfiability","volume":"2083","author":"Giunchiglia","year":"2001"},{"key":"10.1016\/S0004-3702(02)00373-9_BIB012","series-title":"Proc. International Joint Conference on Automated Reasoning (IJCAR'2001)","first-page":"364","article-title":"QuBE: A system for deciding quantified boolean formulas satisfiability","volume":"2083","author":"Giunchiglia","year":"2001"},{"key":"10.1016\/S0004-3702(02)00373-9_BIB013","unstructured":"M. Buro, H. Buning, Report on a SAT competition, Technical Report 110, University of Paderborn, Germany, November, 1992"},{"key":"10.1016\/S0004-3702(02)00373-9_BIB014","doi-asserted-by":"crossref","first-page":"381","DOI":"10.1007\/BF02127976","article-title":"A fast parallel SAT-solver\u2014Efficient workload balancing","volume":"17","author":"B\u00f6hm","year":"1996","journal-title":"Ann. Math. Artificial Intelligence"},{"key":"10.1016\/S0004-3702(02)00373-9_BIB015","unstructured":"J.W. Freeman, Improvements to propositional satisfiability search algorithms, Ph.D. Thesis, University of Pennsylvania, Philadelphia, PA, 1995"},{"key":"10.1016\/S0004-3702(02)00373-9_BIB016","series-title":"Proc. AAAI-99\/IAAI-99, Orlando, FL","first-page":"648","article-title":"Beyond NP: The QSAT phase transition","author":"Gent","year":"1999"},{"key":"10.1016\/S0004-3702(02)00373-9_BIB017","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1613\/jair.591","article-title":"Constructing conditional plans by a theorem prover","volume":"10","author":"Rintanen","year":"1999","journal-title":"J. Artificial Intelligence Res."},{"key":"10.1016\/S0004-3702(02)00373-9_BIB018","series-title":"Proc. 12th International Conference on Computer-Aided Verification (CAV'00), Chicago, IL","first-page":"99","article-title":"Bounded model construction for monadic second-order logics","volume":"1855","author":"Abdelwaheb","year":"2000"},{"key":"10.1016\/S0004-3702(02)00373-9_BIB019","series-title":"Proc. IJCAI-93, Chamb\u00e9ry, France","first-page":"262","article-title":"Domain filtering can degrade intelligent backjumping search","author":"Prosser","year":"1993"},{"key":"10.1016\/S0004-3702(02)00373-9_BIB020","series-title":"Proc. AAAI-02, Edmonton, AB","first-page":"649","article-title":"Learning for quantified boolean logic satisfiability","author":"Giunchiglia","year":"2002"},{"key":"10.1016\/S0004-3702(02)00373-9_BIB021","series-title":"Proc. AI\u2217IA 2001: Advances in Artificial Intelligence (AI\u2217IA'2001)","first-page":"111","article-title":"An analysis of backjumping and trivial truth in quantified boolean formulas satisfiability","volume":"2175","author":"Giunchiglia","year":"2001"},{"key":"10.1016\/S0004-3702(02)00373-9_BIB022","first-page":"365","article-title":"A theoretical evaluation of selected backtracking algorithms","volume":"89 (1\u20132)","author":"Kondrak","year":"1989","journal-title":"Artificial Intelligence"},{"key":"10.1016\/S0004-3702(02)00373-9_BIB023","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1613\/jair.788","article-title":"Conflict-directed backjumping revisited","volume":"14","author":"Chen","year":"2001","journal-title":"J. Artificial Intelligence Res."}],"container-title":["Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0004370202003739?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0004370202003739?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,3,12]],"date-time":"2020-03-12T06:51:24Z","timestamp":1583995884000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0004370202003739"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,4]]},"references-count":23,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2003,4]]}},"alternative-id":["S0004370202003739"],"URL":"https:\/\/doi.org\/10.1016\/s0004-3702(02)00373-9","relation":{},"ISSN":["0004-3702"],"issn-type":[{"value":"0004-3702","type":"print"}],"subject":[],"published":{"date-parts":[[2003,4]]}}}