{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,11,10]],"date-time":"2026-11-10T20:04:25Z","timestamp":1794341065580,"version":"4.9.0"},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540372066","type":"print"},{"value":"9783540372073","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11814948_35","type":"book-chapter","created":{"date-parts":[[2006,7,18]],"date-time":"2006-07-18T06:12:38Z","timestamp":1153203158000},"page":"382-395","source":"Crossref","is-referenced-by-count":15,"title":["QBF Modeling: Exploiting Player Symmetry for Simplicity and Efficiency"],"prefix":"10.1007","author":[{"given":"Ashish","family":"Sabharwal","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Carlos","family":"Ansotegui","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Carla P.","family":"Gomes","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Justin W.","family":"Hart","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Bart","family":"Selman","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"35_CR1","unstructured":"Ansotegui, C., Gomes, C.P., Selman, B.: The Achilles\u2019 heel of QBF. In: 20th AAAI, Pittsburgh, PA, July 2005, pp. 275\u2013281 (2005)"},{"key":"35_CR2","unstructured":"Benedetti, M.: Extracting certificates from quantified Boolean formulas. In: 19th IJCAI, Edinburgh, Scotland, July 2005, pp. 47\u201353 (2005)"},{"key":"35_CR3","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"369","DOI":"10.1007\/11532231_27","volume-title":"Automated Deduction \u2013 CADE-20","author":"M. Benedetti","year":"2005","unstructured":"Benedetti, M.: sKizzo: a suite to evaluate and certify QBFs. In: Nieuwenhuis, R. (ed.) CADE 2005. LNCS (LNAI), vol.\u00a03632, pp. 369\u2013376. Springer, Heidelberg (2005)"},{"key":"35_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1007\/11527695_5","volume-title":"Theory and Applications of Satisfiability Testing","author":"A. Biere","year":"2005","unstructured":"Biere, A.: Resolve and expand. In: H. Hoos, H.H., Mitchell, D.G. (eds.) SAT 2004. LNCS, vol.\u00a03542, pp. 59\u201370. Springer, Heidelberg (2005)"},{"issue":"2","key":"35_CR5","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1023\/A:1015019416843","volume":"28","author":"M. Cadoli","year":"2002","unstructured":"Cadoli, M., Schaerf, M., Giovanardi, A., Giovanardi, M.: An algorithm to evaluate QBFs and its experimental evaluation. J. Auto. Reas.\u00a028(2), 101\u2013142 (2002)","journal-title":"J. Auto. Reas."},{"key":"35_CR6","doi-asserted-by":"crossref","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. CACM\u00a05, 394\u2013397 (1962)","journal-title":"CACM"},{"key":"35_CR7","unstructured":"Gent, I.P., Rowley, A.G.: Encoding Connect-4 using quantified Boolean formulae. In: Work. Modelling and Reform. CSP, Ireland, pp. 78\u201393 (September 2003)"},{"key":"35_CR8","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"364","DOI":"10.1007\/3-540-45744-5_27","volume-title":"Automated Reasoning","author":"E. Giunchiglia","year":"2001","unstructured":"Giunchiglia, E., Narizzano, M., Tacchella, A.: QUBE: A symtem for deciding QBFs satisfiability. In: Gor\u00e9, R.P., Leitsch, A., Nipkow, T. (eds.) IJCAR 2001. LNCS (LNAI), vol.\u00a02083, pp. 364\u2013369. Springer, Heidelberg (2001)"},{"key":"35_CR9","unstructured":"Kautz, H.A., Selman, B.: Planning as satisfiability. In: Proc. 10th Euro. Conf. on AI, Vienna, Austria, August 1992, pp. 359\u2013363 (1992)"},{"key":"35_CR10","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":"35_CR11","doi-asserted-by":"crossref","unstructured":"Madhusudan, P., Nam, W., Alur, R.: Symbolic computation techniques for solving games. Elec. Notes TCS\u00a089(4) (2003)","DOI":"10.1016\/S1571-0661(05)82544-7"},{"key":"35_CR12","unstructured":"Narizzano, M., Tacchella, A.: (Organizers). QBF 2005 evaluation (June 2005), http:\/\/www.qbflib.org\/qbfeval\/2005"},{"key":"35_CR13","unstructured":"Otwell, C., Remshagen, A., Truemper, K.: An effective QBF solver for planning problems. In: Proc. MSV\/AMCS, Las Vegas, NV, June 2004, pp. 311\u2013316 (2004)"},{"key":"35_CR14","volume-title":"Computational Complexity","author":"C.H. Papadimitriou","year":"1994","unstructured":"Papadimitriou, C.H.: Computational Complexity. Addison-Wesley, Reading (1994)"},{"key":"35_CR15","unstructured":"Rintanen, J.: Improvements to the evaluation of quantified Boolean formulae. In: 16th IJCAI, Stockholm, Sweden, July 1999, pp. 1192\u20131197 (1999)"},{"key":"35_CR16","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":"35_CR17","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1613\/jair.591","volume":"10","author":"J. Rintanen","year":"1999","unstructured":"Rintanen, J.: Constructing conditional plans by a theorem prover. JAIR\u00a010, 323\u2013352 (1999)","journal-title":"JAIR"},{"key":"35_CR18","doi-asserted-by":"crossref","unstructured":"Stockmeyer, L.J., Meyer, A.R.: Word problems requiring exponential time. In: Conf. Record of 5th STOC, Austin, TX, April\u2013May 1973, pp. 1\u20139 (1973)","DOI":"10.1145\/800125.804029"},{"key":"35_CR19","unstructured":"Zhang, L.: Solving QBF by combining conjunctive and disjunctive normal forms. In: 21th AAAI, Boston, MA July 2006 (to appear)"},{"key":"35_CR20","doi-asserted-by":"crossref","unstructured":"Zhang, L., Malik, S.: Conflict driven learning in a quantified Boolean satisfiability solver. In: ICCAD, San Jose, CA, November 2002, pp. 442\u2013449 (2002)","DOI":"10.1145\/774572.774637"},{"key":"35_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"200","DOI":"10.1007\/3-540-46135-3_14","volume-title":"Principles and Practice of Constraint Programming - CP 2002","author":"L. Zhang","year":"2002","unstructured":"Zhang, L., Malik, S.: Towards a symmetric treatment of satisfaction and conflicts in QBF evaluation. In: Van Hentenryck, P. (ed.) CP 2002. LNCS, vol.\u00a02470, pp. 200\u2013215. Springer, Heidelberg (2002)"}],"container-title":["Lecture Notes in Computer Science","Theory and Applications of Satisfiability Testing - SAT 2006"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11814948_35.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T03:28:04Z","timestamp":1619494084000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11814948_35"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540372066","9783540372073"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/11814948_35","relation":{"is-part-of":[{"id-type":"doi","id":"https:\/\/doi.org\/10.1007\/11814948","asserted-by":"object"}]},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006]]}}}