{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T12:09:32Z","timestamp":1725538172436},"publisher-location":"Berlin, Heidelberg","reference-count":27,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642042218"},{"type":"electronic","value":"9783642042225"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-04222-5_22","type":"book-chapter","created":{"date-parts":[[2009,9,16]],"date-time":"2009-09-16T16:42:11Z","timestamp":1253119331000},"page":"350-365","source":"Crossref","is-referenced-by-count":2,"title":["Learning to Integrate Deduction and Search in Reasoning about Quantified Boolean Formulas"],"prefix":"10.1007","author":[{"given":"Luca","family":"Pulina","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Armando","family":"Tacchella","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"22_CR1","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)"},{"unstructured":"Ansotegui, C., Gomes, C.P., Selman, B.: Achille\u2019s heel of QBF. In: Proc. of AAAI, pp. 275\u2013281 (2005)","key":"22_CR2"},{"key":"22_CR3","first-page":"417","volume-title":"Seventeenth National Conference on Artificial Intelligence (AAAI 2000)","author":"U. Egly","year":"2000","unstructured":"Egly, U., Eiter, T., Tompits, H., Woltran, S.: Solving Advanced Reasoning Tasks Using Quantified Boolean Formulas. In: Seventeenth National Conference on Artificial Intelligence (AAAI 2000), pp. 417\u2013422. MIT Press, Cambridge (2000)"},{"key":"22_CR4","doi-asserted-by":"crossref","first-page":"371","DOI":"10.1613\/jair.1959","volume":"26","author":"E. Giunchiglia","year":"2006","unstructured":"Giunchiglia, E., Narizzano, M., Tacchella, A.: Clause-Term Resolution and Learning in Quantified Boolean Logic Satisfiability. Artificial Intelligence Research\u00a026, 371\u2013416 (2006), http:\/\/www.jair.org\/vol\/vol26.html","journal-title":"Artificial Intelligence Research"},{"key":"22_CR5","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":"22_CR6","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: Hoos, H.H., Mitchell, D.G. (eds.) SAT 2004. LNCS, vol.\u00a03542, pp. 59\u201370. Springer, Heidelberg (2005)"},{"key":"22_CR7","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)"},{"issue":"1","key":"22_CR8","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1007\/s10601-008-9051-2","volume":"14","author":"L. Pulina","year":"2009","unstructured":"Pulina, L., Tacchella, A.: A self-adaptive multi-engine solver for quantified Boolean formulas. Constraints\u00a014(1), 80\u2013116 (2009)","journal-title":"Constraints"},{"unstructured":"Samulowitz, H., Memisevic, R.: Learning to Solve QBF. In: Proc. of 22nd Conference on Artificial Intelligence (AAAI 2007), pp. 255\u2013260 (2007)","key":"22_CR9"},{"unstructured":"Peschiera, C., Pulina, L., Tacchella, A.: 6th QBF solvers evaluation (2008), http:\/\/www.qbfeval.org\/2008","key":"22_CR10"},{"issue":"1","key":"22_CR11","doi-asserted-by":"publisher","first-page":"12","DOI":"10.1006\/inco.1995.1025","volume":"117","author":"H. Kleine-B\u00fcning","year":"1995","unstructured":"Kleine-B\u00fcning, H., Karpinski, M., Fl\u00f6gel, A.: Resolution for Quantified Boolean Formulas. Information and Computation\u00a0117(1), 12\u201318 (1995)","journal-title":"Information and Computation"},{"key":"22_CR12","volume-title":"Seventeenth International Joint Conference on Artificial Intelligence (IJCAI 2001)","author":"E. Giunchiglia","year":"2001","unstructured":"Giunchiglia, E., Narizzano, M., Tacchella, A.: Backjumping for Quantified Boolean Logic Satisfiability. In: Seventeenth International Joint Conference on Artificial Intelligence (IJCAI 2001). Morgan Kaufmann, San Francisco (2001)"},{"issue":"1\/2","key":"22_CR13","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1023\/A:1006303512524","volume":"24","author":"I. Rish","year":"2000","unstructured":"Rish, I., Dechter, R.: Resolution versus search: Two strategies for sat. Journal of Automated Reasoning\u00a024(1\/2), 225\u2013275 (2000)","journal-title":"Journal of Automated Reasoning"},{"key":"22_CR14","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1016\/S0004-3702(00)00078-3","volume":"124","author":"G. Gottlob","year":"2000","unstructured":"Gottlob, G., Leone, N., Scarcello, F.: A comparison of structural CSP decomposition methods. Artificial Intelligence\u00a0124, 243\u2013282 (2000)","journal-title":"Artificial Intelligence"},{"key":"22_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"232","DOI":"10.1007\/11538363_17","volume-title":"Computer Science Logic","author":"H. Chen","year":"2005","unstructured":"Chen, H., Dalmau, V.: From Pebble Games to Tractability: An Ambidextrous Consistency Algorithm for Quantified Constraint Satisfaction. In: Ong, L. (ed.) CSL 2005. LNCS, vol.\u00a03634, pp. 232\u2013247. Springer, Heidelberg (2005)"},{"unstructured":"Gottlob, G., Greco, G., Scarcello, F.: The Complexity of Quantified Constraint Satisfaction Problems under Structural Restrictions. In: IJCAI 2005, Proceedings of the Nineteenth International Joint Conference on Artificial Intelligence, pp. 150\u2013155. Professional Book Center (2005)","key":"22_CR16"},{"key":"22_CR17","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1109\/LICS.2006.25","volume-title":"21th IEEE Symposium on Logic in Computer Science (LICS 2006)","author":"G. Pan","year":"2006","unstructured":"Pan, G., Vardi, M.Y.: Fixed-Parameter Hierarchies inside PSPACE. In: 21th IEEE Symposium on Logic in Computer Science (LICS 2006), pp. 27\u201336. IEEE Computer Society, Los Alamitos (2006)"},{"key":"22_CR18","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"528","DOI":"10.1007\/978-3-540-89439-1_37","volume-title":"Logic for Programming, Artificial Intelligence, and Reasoning","author":"L. Pulina","year":"2008","unstructured":"Pulina, L., Tacchella, A.: Treewidth: A useful marker of empirical hardness in quantified boolean logic encodings. In: Cervesato, I., Veith, H., Voronkov, A. (eds.) LPAR 2008. LNCS (LNAI), vol.\u00a05330, pp. 528\u2013542. Springer, Heidelberg (2008)"},{"key":"22_CR19","volume-title":"C4.5: Programs for Machine Learning","author":"J.R. Quinlan","year":"1993","unstructured":"Quinlan, J.R.: C4.5: Programs for Machine Learning. Morgan Kaufmann Publishers, San Francisco (1993)"},{"key":"22_CR20","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4757-2440-0","volume-title":"The nature of statistical learning","author":"V. Vapnik","year":"1995","unstructured":"Vapnik, V.: The nature of statistical learning. Springer, New York (1995)"},{"issue":"3","key":"22_CR21","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1023\/A:1025627211942","volume":"8","author":"J. Larrosa","year":"2003","unstructured":"Larrosa, J., Dechter, R.: Boosting Search with Variable Elimination in Constraint Optimization and Constraint Satisfaction Problems. Constraints\u00a08(3), 303\u2013326 (2003)","journal-title":"Constraints"},{"unstructured":"Cadoli, M., Giovanardi, A., Schaerf, M.: An algorithm to evaluate quantified boolean formulae. In: Proc. of AAAI (1998)","key":"22_CR22"},{"doi-asserted-by":"crossref","unstructured":"Bodlaender, H.L.: A linear time algorithm for finding tree-decompositions of small treewidth. In: 25th Annual ACM Symposium on Theory of Computing, pp. 226\u2013234 (1993)","key":"22_CR23","DOI":"10.1145\/167088.167161"},{"key":"22_CR24","volume-title":"Data Mining","author":"I.H. Witten","year":"2005","unstructured":"Witten, I.H., Frank, E.: Data Mining, 2nd edn. Morgan Kaufmann, San Francisco (2005)","edition":"2"},{"unstructured":"Chang, C.-C., Lin, C.-J.: LIBSVM \u2013 A Library for Support Vector Machines (2005), http:\/\/www.csie.ntu.edu.tw\/~cjlin\/libsvm\/","key":"22_CR25"},{"doi-asserted-by":"crossref","unstructured":"Yu, Y., Malik, S.: Verifying the Correctness of Quantified Boolean Formula(QBF) Solvers: Theory and Practice. In: ASP-DAC (2005)","key":"22_CR26","DOI":"10.1145\/1120725.1120821"},{"key":"22_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"353","DOI":"10.1007\/11814948_33","volume-title":"Theory and Applications of Satisfiability Testing - SAT 2006","author":"H. Samulowitz","year":"2006","unstructured":"Samulowitz, H., Bacchus, F.: Binary Clause Reasoning in QBF. In: Biere, A., Gomes, C.P. (eds.) SAT 2006. LNCS, vol.\u00a04121, pp. 353\u2013367. Springer, Heidelberg (2006)"}],"container-title":["Lecture Notes in Computer Science","Frontiers of Combining Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-04222-5_22","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,22]],"date-time":"2019-05-22T17:17:37Z","timestamp":1558545457000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-04222-5_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642042218","9783642042225"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-04222-5_22","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}