{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T02:20:48Z","timestamp":1743128448665,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":25,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642228629"},{"type":"electronic","value":"9783642228636"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"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":[[2011]]},"DOI":"10.1007\/978-3-642-22863-6_15","type":"book-chapter","created":{"date-parts":[[2011,8,8]],"date-time":"2011-08-08T09:47:55Z","timestamp":1312796875000},"page":"184-199","source":"Crossref","is-referenced-by-count":1,"title":["Proving Valid Quantified Boolean Formulas in HOL Light"],"prefix":"10.1007","author":[{"given":"Ond\u0159ej","family":"Kun\u010dar","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"3","key":"15_CR1","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1007\/s10817-009-9149-2","volume":"44","author":"B. Akbarpour","year":"2010","unstructured":"Akbarpour, B., Paulson, L.C.: MetiTarski: An Automatic Theorem Prover for Real-Valued Special Functions. J. Autom. Reasoning\u00a044(3), 175\u2013205 (2010)","journal-title":"J. Autom. Reasoning"},{"key":"15_CR2","doi-asserted-by":"crossref","unstructured":"Benedetti, M., Mangassarian, H.: QBF-Based Formal Verification: Experience and Perspectives, vol.\u00a05, pp. 133\u2013191 (2008)","DOI":"10.3233\/SAT190055"},{"key":"15_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1007\/3-540-49059-0_14","volume-title":"Tools and Algorithms for the Construction of Analysis of Systems","author":"A. Biere","year":"1999","unstructured":"Biere, A., Cimatti, A., Clarke, E., Zhu, Y.: Symbolic Model Checking without BDDs. In: Cleaveland, W.R. (ed.) TACAS 1999. LNCS, vol.\u00a01579, pp. 193\u2013207. Springer, Heidelberg (1999)"},{"key":"15_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1007\/978-3-642-14052-5_14","volume-title":"Interactive Theorem Proving","author":"S. B\u00f6hme","year":"2010","unstructured":"B\u00f6hme, S., Weber, T.: Fast LCF-Style Proof Reconstruction for Z3. In: Kaufmann, M., Paulson, L.C. (eds.) ITP 2010. LNCS, vol.\u00a06172, pp. 179\u2013194. Springer, Heidelberg (2010)"},{"key":"15_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1007\/978-3-540-25967-1_3","volume-title":"Logic versus Approximation","author":"H. Kleine B\u00fcning","year":"2004","unstructured":"Kleine B\u00fcning, H., Zhao, X.: On Models for Quantified Boolean Formulas. In: Lenski, W. (ed.) Logic versus Approximation. LNCS, vol.\u00a03075, pp. 18\u201332. Springer, Heidelberg (2004)"},{"key":"15_CR6","series-title":"Lecture Notes in Computer Science","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. LNCS, vol.\u00a03569, pp. 408\u2013414. Springer, Heidelberg (2005)"},{"key":"15_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1007\/11527695_9","volume-title":"Theory and Applications of Satisfiability Testing","author":"E. Giunchiglia","year":"2005","unstructured":"Giunchiglia, E., Narizzano, M., Tacchella, A.: QBF Reasoning on Real-World Instances. In: Hoos, H.H., Mitchell, D.G. (eds.) SAT 2004. LNCS, vol.\u00a03542, pp. 105\u2013121. Springer, Heidelberg (2005)"},{"key":"15_CR8","doi-asserted-by":"crossref","first-page":"169","DOI":"10.7551\/mitpress\/5641.003.0012","volume-title":"Proof, Language, and Interaction","author":"M. Gordon","year":"2000","unstructured":"Gordon, M.: From LCF to HOL: a short history.. In: Plotkin, G.D., Stirling, C., Tofte, M. (eds.) Proof, Language, and Interaction, pp. 169\u2013186. MIT Press, Cambridge (2000)"},{"issue":"2","key":"15_CR9","doi-asserted-by":"publisher","first-page":"162","DOI":"10.1093\/comjnl\/38.2.162","volume":"38","author":"J. Harrison","year":"1995","unstructured":"Harrison, J.: Binary Decision Diagrams as a HOL Derived Rule. Comput. J.\u00a038(2), 162\u2013170 (1995)","journal-title":"Comput. J."},{"key":"15_CR10","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1007\/11814771_17","volume-title":"Automated Reasoning","author":"J. Harrison","year":"2006","unstructured":"Harrison, J.: Towards self-verification of HOL light. In: Furbach, U., Shankar, N. (eds.) IJCAR 2006. LNCS (LNAI), vol.\u00a04130, pp. 177\u2013191. Springer, Heidelberg (2006)"},{"key":"15_CR11","unstructured":"Harrison, J.: The HOL Light theorem prover (2010), http:\/\/www.cl.cam.ac.uk\/~jrh13\/hol-light\/"},{"key":"15_CR12","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1007\/11542384_3","volume-title":"The Seventeen Provers of the World","author":"J. Harrison","year":"2006","unstructured":"Harrison, J., Slind, K., Arthan, R.D.: HOL. In: Wiedijk, F. (ed.) The Seventeen Provers of the World. LNCS (LNAI), vol.\u00a03600, pp. 11\u201319. Springer, Heidelberg (2006)"},{"key":"15_CR13","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1023\/A:1006023127567","volume":"21","author":"J. Harrison","year":"1998","unstructured":"Harrison, J., Th\u00e9ry, L.: A skeptic\u2019s approach to combining HOL and Maple. Journal of Automated Reasoning\u00a021, 279\u2013294 (1998)","journal-title":"Journal of Automated Reasoning"},{"key":"15_CR14","unstructured":"HOL contributors: HOL4 Kananaskis 6 source code (2010), http:\/\/hol.sourceforge.net (retreived February 6, 2011)"},{"key":"15_CR15","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"134","DOI":"10.1007\/3-540-45620-1_10","volume-title":"Automated Deduction - CADE-18","author":"J. Hurd","year":"2002","unstructured":"Hurd, J.: An LCF-Style Interface between HOL and First-Order Logic. In: Voronkov, A. (ed.) CADE 2002. LNCS (LNAI), vol.\u00a02392, pp. 134\u2013138. Springer, Heidelberg (2002)"},{"key":"15_CR16","unstructured":"Hurd, J.: First-Order Proof Tactics in Higher-Order Logic Theorem Provers. In: Archer, M., Vito, B.D., Mu\u00f1oz, C. (eds.) Design and Application of Strategies\/Tactics in Higher Order Logics (STRATA 2003), Design and Application of Strategies\/Tactics in Higher Order Logics (STRATA 2003), pp. 56\u201368, No. NASA\/CP-2003-212448 in NASA Technical Reports (September 2003)"},{"key":"15_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1007\/978-3-540-72788-0_21","volume-title":"Theory and Applications of Satisfiability Testing \u2013 SAT 2007","author":"T. Jussila","year":"2007","unstructured":"Jussila, T., Biere, A., Sinz, C., Kr\u00f6ning, D., Wintersteiger, C.M.: A First Step Towards a Unified Proof Checker for QBF. In: Marques-Silva, J., Sakallah, K.A. (eds.) SAT 2007. LNCS, vol.\u00a04501, pp. 201\u2013214. Springer, Heidelberg (2007)"},{"key":"15_CR18","unstructured":"Kr\u00f6ning, D., Wintersteiger, C.: A file format for QBF certificates (2007), http:\/\/www.cprover.org\/qbv\/download\/qbcformat.pdf (retreived February 6, 2011)"},{"issue":"1","key":"15_CR19","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1007\/s10817-007-9085-y","volume":"40","author":"J. Meng","year":"2008","unstructured":"Meng, J., Paulson, L.C.: Translating Higher-Order Clauses to First-Order Clauses. J. Autom. Reasoning\u00a040(1), 35\u201360 (2008)","journal-title":"J. Autom. Reasoning"},{"key":"15_CR20","doi-asserted-by":"crossref","unstructured":"Meyer, A., Stockmeyer, L.: Word Problems Requiring Exponential Time. In: Proc. 5th ACM Symp. on the Theory of Computing, pp. 1\u20139 (1973)","DOI":"10.1145\/800125.804029"},{"issue":"4","key":"15_CR21","doi-asserted-by":"crossref","first-page":"191","DOI":"10.3233\/AIC-2009-0468","volume":"22","author":"M. Narizzano","year":"2009","unstructured":"Narizzano, M., Peschiera, C., Pulina, L., Tacchella, A.: Evaluating and certifying QBFs: A comparison of state-of-the-art tools. AI Commun.\u00a022(4), 191\u2013210 (2009)","journal-title":"AI Commun."},{"key":"15_CR22","unstructured":"Otwell, C., Remshagen, A., Truemper, K.: An Effective QBF Solver for Planning Problems.. In: Arabnia, H.R., Joshua, R., Ajwa, I.A., Gravvanis, G.A. (eds.) MSV\/AMCS, pp. 311\u2013316. CSREA Press, Boca Raton (2004)"},{"key":"15_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"232","DOI":"10.1007\/978-3-540-74591-4_18","volume-title":"Theorem Proving in Higher Order Logics","author":"L.C. Paulson","year":"2007","unstructured":"Paulson, L.C., Susanto, K.W.: Source-Level Proof Reconstruction for Interactive Theorem Proving. In: Schneider, K., Brandt, J. (eds.) TPHOLs 2007. LNCS, vol.\u00a04732, pp. 232\u2013245. Springer, Heidelberg (2007)"},{"key":"15_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"466","DOI":"10.1007\/978-3-642-14052-5_32","volume-title":"Interactive Theorem Proving","author":"T. Weber","year":"2010","unstructured":"Weber, T.: Validating QBF Invalidity in HOL4. In: Kaufmann, M., Paulson, L.C. (eds.) ITP 2010. LNCS, vol.\u00a06172, pp. 466\u2013480. Springer, Heidelberg (2010)"},{"issue":"1","key":"15_CR25","doi-asserted-by":"publisher","first-page":"26","DOI":"10.1016\/j.jal.2007.07.003","volume":"7","author":"T. Weber","year":"2009","unstructured":"Weber, T., Amjad, H.: Efficiently checking propositional refutations in HOL theorem provers. Journal of Applied Logic\u00a07(1), 26\u201340 (2009); special Issue: Empirically Successful Computerized Reasoning","journal-title":"Journal of Applied Logic"}],"container-title":["Lecture Notes in Computer Science","Interactive Theorem Proving"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-22863-6_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,4,9]],"date-time":"2024-04-09T19:18:51Z","timestamp":1712690331000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-22863-6_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642228629","9783642228636"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-22863-6_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}