{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T10:58:12Z","timestamp":1725533892321},"publisher-location":"Berlin, Heidelberg","reference-count":28,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642027765"},{"type":"electronic","value":"9783642027772"}],"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-02777-2_46","type":"book-chapter","created":{"date-parts":[[2009,6,26]],"date-time":"2009-06-26T02:58:18Z","timestamp":1245985098000},"page":"509-523","source":"Crossref","is-referenced-by-count":5,"title":["PaQuBE: Distributed QBF Solving with Advanced Knowledge Sharing"],"prefix":"10.1007","author":[{"given":"Matthew","family":"Lewis","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Paolo","family":"Marin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tobias","family":"Schubert","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Massimo","family":"Narizzano","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bernd","family":"Becker","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Enrico","family":"Giunchiglia","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"46_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"531","DOI":"10.1007\/978-3-540-75867-9_67","volume-title":"Computer Aided Systems Theory \u2013 EUROCAST 2007","author":"M. Herbstritt","year":"2007","unstructured":"Herbstritt, M., Becker, B.: On Combining 01X-Logic and QBF. In: Moreno D\u00edaz, R., Pichler, F., Quesada Arencibia, A. (eds.) EUROCAST 2007. LNCS, vol.\u00a04739, pp. 531\u2013538. Springer, Heidelberg (2007)"},{"key":"46_CR2","doi-asserted-by":"publisher","first-page":"408","DOI":"10.1007\/11499107_32","volume-title":"Theory and Applications of Satisfiability Testing","author":"N. Dershowitz","year":"2005","unstructured":"Dershowitz, N., Hanna, Z., Katz, J.: Bounded model checking with QBF. In: Bacchus, F., Walsh, T. (eds.) SAT 2005, vol.\u00a03569, pp. 408\u2013414. Springer, Heidelberg (2005)"},{"key":"46_CR3","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. Journal of Artificial Intelligence Research\u00a010, 323\u2013352 (1999)","journal-title":"Journal of Artificial Intelligence Research"},{"issue":"7","key":"46_CR4","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.W.: A machine program for theorem proving. Communication of ACM\u00a05(7), 394\u2013397 (1962)","journal-title":"Communication of ACM"},{"unstructured":"Gent, I.P., Rowley, A.G.: Solution learning and solution directed backjumping revisited. Technical Report APES-80-2004, APES Research Group (February 2004), \n                    \n                      http:\/\/www.dcs.st-and.ac.uk\/~apes\/apesreports.html","key":"46_CR5"},{"key":"46_CR6","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 the evaluation of quantified Boolean formulas. Journal of Artificial Intelligence Research (JAIR)\u00a026, 371\u2013416 (2006)","journal-title":"Journal of Artificial Intelligence Research (JAIR)"},{"issue":"1","key":"46_CR7","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":"46_CR8","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 quantified Boolean formula evaluation. In: Van Hentenryck, P. (ed.) CP 2002. LNCS, vol.\u00a02470, pp. 200\u2013215. Springer, Heidelberg (2002)"},{"unstructured":"Giunchiglia, E., Marin, P., Narizzano, M.: An effective preprocessor for QBF pre-reasoning (2008)","key":"46_CR9"},{"key":"46_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"514","DOI":"10.1007\/11889205_37","volume-title":"Principles and Practice of Constraint Programming - CP 2006","author":"H. Samulowitz","year":"2006","unstructured":"Samulowitz, H., Davies, J., Bacchus, F.: Preprocessing QBF. In: Benhamou, F. (ed.) CP 2006. LNCS, vol.\u00a04204, pp. 514\u2013529. Springer, Heidelberg (2006)"},{"key":"46_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1007\/978-3-540-30494-4_15","volume-title":"Formal Methods in Computer-Aided Design","author":"E. Giunchiglia","year":"2004","unstructured":"Giunchiglia, E., Narizzano, M., Tacchella, A.: QuBE++: An efficient QBF solver. In: Hu, A.J., Martin, A.K. (eds.) FMCAD 2004. LNCS, vol.\u00a03312, pp. 201\u2013213. Springer, Heidelberg (2004)"},{"key":"46_CR12","series-title":"Frontiers in Artificial Intelligence and Applications","first-page":"761","volume-title":"Reasoning with Quantified Boolean Formulas","author":"E. Giunchiglia","year":"2009","unstructured":"Giunchiglia, E., Marin, P., Narizzano, M.: 24. In: Reasoning with Quantified Boolean Formulas. Frontiers in Artificial Intelligence and Applications, vol.\u00a0185, pp. 761\u2013780. IOS Press, Amsterdam (2009)"},{"issue":"4-6","key":"46_CR13","doi-asserted-by":"publisher","first-page":"543","DOI":"10.1006\/jsco.1996.0030","volume":"21","author":"H. Zhang","year":"1996","unstructured":"Zhang, H., Bonacina, M.P., Hsiang, J.: Psato: a distributed propositional prover and its application to quasigroup problems. J. Symb. Comput.\u00a021(4-6), 543\u2013560 (1996)","journal-title":"J. Symb. Comput."},{"unstructured":"Lewis, M., Schubert, T., Becker, B.: QMiraXT \u2013 A Multithreaded QBF Solver. In: Methoden und Beschreibungssprachen zur Modellierung und Verifikation von Schaltungen und Systemen (January 2009)","key":"46_CR14"},{"key":"46_CR15","doi-asserted-by":"publisher","first-page":"1047","DOI":"10.1145\/1120725.1120821","volume-title":"ASP-DAC","author":"Y. Yu","year":"2005","unstructured":"Yu, Y., Malik, S.: Validating the result of a quantified boolean formula (QBF) solver: theory and practice. In: Tang, T.A. (ed.) ASP-DAC, pp. 1047\u20131051. ACM Press, New York (2005)"},{"unstructured":"Feldmann, R., Monien, B., Schamberger, S.: A distributed algorithm to evaluate Quantified Boolean Formulae. In: Proc.\u00a0AAAI (2000)","key":"46_CR16"},{"key":"46_CR17","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., Mitchell, D.G. (eds.) SAT 2004. LNCS, vol.\u00a03542, pp. 59\u201370. Springer, Heidelberg (2005)"},{"key":"46_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"196","DOI":"10.1007\/978-3-540-79719-7_19","volume-title":"Theory and Applications of Satisfiability Testing \u2013 SAT 2008","author":"F. Lonsing","year":"2008","unstructured":"Lonsing, F., Biere, A.: Nenofex: Expanding nnf for QBF solving. In: B\u00fcning, H.K., Zhao, X. (eds.) SAT 2008. LNCS, vol.\u00a04996, pp. 196\u2013210. Springer, Heidelberg (2008)"},{"key":"46_CR19","series-title":"Lecture Notes in Computer Science","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, vol.\u00a03632, pp. 369\u2013376. Springer, Heidelberg (2005)"},{"key":"46_CR20","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":"I.P. Gent","year":"2003","unstructured":"Gent, I.P., Hoos, H.H., Rowley, A.G.D., 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":"46_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"574","DOI":"10.1007\/978-3-540-74970-7_41","volume-title":"Principles and Practice of Constraint Programming \u2013 CP 2007","author":"L. Pulina","year":"2007","unstructured":"Pulina, L., Tacchella, A.: A multi-engine solver for quantified Boolean formulas. In: Bessi\u00e8re, C. (ed.) CP 2007. LNCS, vol.\u00a04741, pp. 574\u2013589. Springer, Heidelberg (2007)"},{"unstructured":"Samulowitz, H., Memisevic, R.: Learning to solve QBF. In: Proc. AAAI, pp. 255\u2013260 (2007)","key":"46_CR22"},{"key":"46_CR23","first-page":"37","volume-title":"SC 2003: Proceedings of the 2003 ACM\/IEEE conference on Supercomputing","author":"W. Chrabakh","year":"2003","unstructured":"Chrabakh, W., Wolski, R.: Gridsat: A chaff-based distributed sat solver for the grid. In: SC 2003: Proceedings of the 2003 ACM\/IEEE conference on Supercomputing, Washington, DC, USA, p. 37. IEEE Computer Society, Los Alamitos (2003)"},{"doi-asserted-by":"crossref","unstructured":"Lewis, M., Schubert, T., Becker, B.: Multithreaded SAT Solving. In: ASP Design Automation Conf., Yokohama, Japan (January 2007)","key":"46_CR24","DOI":"10.1109\/ASPDAC.2007.358108"},{"key":"46_CR25","first-page":"285","volume-title":"Proceedings of the 7th Conference on Artificial Intelligence (AAAI 2000) and of the 12th Conference on Innovative Applications of Artificial Intelligence (IAAI 2000)","author":"R. Feldmann","year":"2000","unstructured":"Feldmann, R., Monien, B., Schamberger, S.: A distributed algorithm to evaluate Quantified Boolean Formulae. In: Proceedings of the 7th Conference on Artificial Intelligence (AAAI 2000) and of the 12th Conference on Innovative Applications of Artificial Intelligence (IAAI 2000), July 30-3, pp. 285\u2013290. AAAI Press, Menlo Park (2000)"},{"issue":"6","key":"46_CR26","doi-asserted-by":"publisher","first-page":"789","DOI":"10.1016\/0167-8191(96)00024-5","volume":"22","author":"W. Gropp","year":"1996","unstructured":"Gropp, W., Lusk, E., Doss, N., Skjellum, A.: A high-performance, portable implementation of the MPI message passing interface standard. Parallel Computing\u00a022(6), 789\u2013828 (1996)","journal-title":"Parallel Computing"},{"key":"46_CR27","volume-title":"MPI: The Complete Reference","author":"M. Snir","year":"1995","unstructured":"Snir, M., Otto, S., Walker, D., Dongarra, J., Huss-Lederman, S.: MPI: The Complete Reference. MIT Press, Cambridge (1995)"},{"unstructured":"Giunchiglia, E., Narizzano, M., Tacchella, A.: Quantified Boolean Formulas satisfiability library (QBFLIB) (2001), \n                    \n                      www.qbflib.org","key":"46_CR28"}],"container-title":["Lecture Notes in Computer Science","Theory and Applications of Satisfiability Testing - SAT 2009"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-02777-2_46","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,8]],"date-time":"2019-03-08T20:11:07Z","timestamp":1552075867000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-02777-2_46"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642027765","9783642027772"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-02777-2_46","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}