{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T21:50:42Z","timestamp":1725573042355},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540278290"},{"type":"electronic","value":"9783540315803"}],"license":[{"start":{"date-parts":[[2005,1,1]],"date-time":"2005-01-01T00:00:00Z","timestamp":1104537600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11527695_28","type":"book-chapter","created":{"date-parts":[[2010,12,20]],"date-time":"2010-12-20T17:06:47Z","timestamp":1292864807000},"page":"376-392","source":"Crossref","is-referenced-by-count":9,"title":["The Second QBF Solvers Comparative Evaluation"],"prefix":"10.1007","author":[{"given":"Daniel","family":"Le Berre","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Massimo","family":"Narizzano","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Laurent","family":"Simon","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Armando","family":"Tacchella","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"28_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"468","DOI":"10.1007\/978-3-540-24605-3_35","volume-title":"Theory and Applications of Satisfiability Testing","author":"D. Berre Le","year":"2004","unstructured":"Le Berre, D., Simon, L., Tacchella, A.: Challenges in the QBF arena: the SAT 2003 evaluation of QBF solvers. In: Giunchiglia, E., Tacchella, A. (eds.) SAT 2003. LNCS, vol.\u00a02919, pp. 468\u2013485. Springer, Heidelberg (2004)"},{"issue":"3","key":"28_CR2","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1145\/321033.321034","volume":"7","author":"M. Davis","year":"1960","unstructured":"Davis, M., Putnam, H.: A computing procedure for quantification theory. Journal of the ACM\u00a07(3), 201\u2013215 (1960)","journal-title":"Journal of the ACM"},{"issue":"7","key":"28_CR3","doi-asserted-by":"publisher","first-page":"394","DOI":"10.1145\/368273.368557","volume":"5","author":"M. Davis","year":"1962","unstructured":"Davis, M., Logemann, G., Loveland, D.: A machine program for theorem proving. Communications of the ACM\u00a05(7), 394\u2013397 (1962)","journal-title":"Communications of the ACM"},{"key":"28_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"348","DOI":"10.1007\/978-3-540-45193-8_24","volume-title":"Principles and Practice of Constraint Programming \u2013 CP 2003","author":"A.G.D. Rowley","year":"2003","unstructured":"Rowley, A.G.D., Gent, I.P., Hoos, H.H., Smyth, K.: Using stochastic local search to solve quantified boolean formulae. In: Rossi, F. (ed.) CP 2003. LNCS, vol.\u00a02833, pp. 348\u2013362. Springer, Heidelberg (2003)"},{"key":"28_CR5","doi-asserted-by":"crossref","unstructured":"Biere, A.: Resolve and Expand. In: Seventh Intl. Conference on Theory and Applications of Satisfiability Testing (2004), Extended Abstract","DOI":"10.1007\/11527695_5"},{"key":"28_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"453","DOI":"10.1007\/978-3-540-30201-8_34","volume-title":"Principles and Practice of Constraint Programming \u2013 CP 2004","author":"G. Pan","year":"2004","unstructured":"Pan, G., Vardi, M.Y.: Symbolic decision procedures for QBF. In: Wallace, M. (ed.) CP 2004. LNCS, vol.\u00a03258, pp. 453\u2013467. Springer, Heidelberg (2004)"},{"key":"28_CR7","unstructured":"Gent, I., Walsh, T.: Beyond NP: the QSAT phase transition. In: Proc. of AAAI, pp. 648\u2013653 (1999)"},{"key":"28_CR8","unstructured":"Giunchiglia, E., Narizzano, M., Tacchella, A.: Quantified Boolean Formulas satisfiability library, QBFLIB (2001), \n                    \n                      www.qbflib.org"},{"key":"28_CR9","unstructured":"Rowley, A.G., Gent, I.P.: Solution learning and solution directed backjumping revisited. Technical Report APES-80-2004, APES Research Group (February 2004)"},{"key":"28_CR10","unstructured":"Le Berre, D., Narizzano, M., Simon, L., Tacchella, A. (eds.): Second QBF solvers evaluation. Pacific Institute of Mathematics (2004), Available on-line at, \n                    \n                      www.qbflib.org"},{"key":"28_CR11","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"362","DOI":"10.1007\/3-540-45653-8_25","volume-title":"Logic for Programming, Artificial Intelligence, and Reasoning","author":"J. Rintanen","year":"2001","unstructured":"Rintanen, J.: Partial implicit unfolding in the Davis-Putnam procedure for quantified Boolean formulae. In: Nieuwenhuis, R., Voronkov, A. (eds.) LPAR 2001. LNCS (LNAI), vol.\u00a02250, pp. 362\u2013376. Springer, Heidelberg (2001)"},{"key":"28_CR12","unstructured":"Feldmann, R., Monien, B., Schamberger, S.: A distributed algorithm to evaluate quantified boolean formula. In: Proceedings of the Seventeenth National Conference in Artificial Intelligence (AAAI 2000), pp. 285\u2013290 (2000)"},{"key":"28_CR13","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"160","DOI":"10.1007\/3-540-45616-3_12","volume-title":"Automated Reasoning with Analytic Tableaux and Related Methods","author":"R. Letz","year":"2002","unstructured":"Letz, R.: Lemma and model caching in decision procedures for quantified boolean formulas. In: Egly, U., Ferm\u00fcller, C. (eds.) TABLEAUX 2002. LNCS (LNAI), vol.\u00a02381, pp. 160\u2013175. Springer, Heidelberg (2002)"},{"key":"28_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1007\/10722167_11","volume-title":"Computer Aided Verification","author":"A. Ayari","year":"2000","unstructured":"Ayari, A., Basin, D.: Bounded model construction for monadic second-order logics. In: Emerson, E.A., Sistla, A.P. (eds.) CAV 2000. LNCS, vol.\u00a01855, pp. 99\u2013113. Springer, Heidelberg (2000)"},{"issue":"1","key":"28_CR15","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1016\/S0004-3702(02)00375-2","volume":"147","author":"C. Castellini","year":"2003","unstructured":"Castellini, C., Giunchiglia, E., Tacchella, A.: Sat-based planning in complex domains: Concurrency, constraints and nondeterminism. Artificial Intelligence\u00a0147(1), 85\u2013117 (2003)","journal-title":"Artificial Intelligence"},{"key":"28_CR16","unstructured":"Rowley, A.G., Gent, I.P.: Encoding connect 4 using quantified boolean formulae. Technical Report APES-68-2003, APES Research Group (July 2003)"},{"key":"28_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"411","DOI":"10.1007\/978-3-540-24605-3_31","volume-title":"Theory and Applications of Satisfiability Testing","author":"M. Mneimneh","year":"2004","unstructured":"Mneimneh, M., Sakallah, K.: Computing Vertex Eccentricity in Exponentially Large Graphs: QBF Formulation and Solution. In: Giunchiglia, E., Tacchella, A. (eds.) SAT 2003. LNCS, vol.\u00a02919, pp. 411\u2013425. Springer, Heidelberg (2004)"},{"key":"28_CR18","doi-asserted-by":"crossref","unstructured":"Pan, G., Vardi, M.Y.: Optimizing a BDD-based modal solver. In: Proceedings of the 19th International Conference on Automated Deduction (2003)","DOI":"10.1007\/978-3-540-45085-6_7"},{"issue":"3","key":"28_CR19","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1023\/A:1006249507577","volume":"24","author":"P. Balsiger","year":"2000","unstructured":"Balsiger, P., Heuerding, A., Schwendimann, S.: A benchmark method for the propositional modal logics k, kt, s4. Journal of Automated Reasoning\u00a024(3), 297\u2013317 (2000)","journal-title":"Journal of Automated Reasoning"},{"key":"28_CR20","first-page":"1192","volume-title":"Proceedings of the Sixteenth International Joint Conferences on Artificial Intelligence (IJCAI 1999)","author":"J. Rintanen","year":"1999","unstructured":"Rintanen, J.: Improvements to the evaluation of quantified boolean formulae. In: Proceedings of the Sixteenth International Joint Conferences on Artificial Intelligence (IJCAI 1999), Stockholm, Sweden, pp. 1192\u20131197. Morgan Kaufmann, San Francisco (1999)"},{"key":"28_CR21","doi-asserted-by":"crossref","unstructured":"Scholl, C., Becker, B.: Checking equivalence for partial implementations. In: 38th Design Automation Conference, DAC 2001 (2001)","DOI":"10.1145\/378239.378471"},{"key":"28_CR22","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1007\/3-540-45411-X_13","volume-title":"AI*IA 2001: Advances in Artificial Intelligence","author":"E. Giunchiglia","year":"2001","unstructured":"Giunchiglia, E., Narizzano, M., Tacchella, A.: An Analysis of Backjumping and Trivial Truth in Quantified Boolean Formulas Satisfiability. In: Esposito, F. (ed.) AI*IA 2001. LNCS (LNAI), vol.\u00a02175, p. 111. Springer, Heidelberg (2001)"}],"container-title":["Lecture Notes in Computer Science","Theory and Applications of Satisfiability Testing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11527695_28","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T23:30:20Z","timestamp":1558308620000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11527695_28"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540278290","9783540315803"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/11527695_28","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}