{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T22:57:45Z","timestamp":1773442665315,"version":"3.50.1"},"publisher-location":"Cham","reference-count":34,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030290252","type":"print"},{"value":"9783030290269","type":"electronic"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-29026-9_2","type":"book-chapter","created":{"date-parts":[[2019,8,21]],"date-time":"2019-08-21T23:10:06Z","timestamp":1566429006000},"page":"21-38","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Certification of Nonclausal Connection Tableaux Proofs"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-1634-9525","authenticated-orcid":false,"given":"Michael","family":"F\u00e4rber","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8273-6059","authenticated-orcid":false,"given":"Cezary","family":"Kaliszyk","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,8,14]]},"reference":[{"key":"2_CR1","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"146","DOI":"10.1007\/978-3-540-73086-6_14","volume-title":"Towards Mechanized Mathematical Assistants","author":"A Asperti","year":"2007","unstructured":"Asperti, A., Tassi, E.: Higher order proof reconstruction from paramodulation-based refutations: the unit equality case. In: Kauers, M., Kerber, M., Miner, R., Windsteiger, W. (eds.) Calculemus\/MKM -2007. LNCS (LNAI), vol. 4573, pp. 146\u2013160. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-73086-6_14"},{"key":"2_CR2","doi-asserted-by":"crossref","unstructured":"Bertot, Y.: A short presentation of Coq. In: Mohamed et al. [22], pp. 12\u201316","DOI":"10.1007\/978-3-540-71067-7_3"},{"key":"2_CR3","series-title":"Artificial Intelligence","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-322-90102-6","volume-title":"Automated Theorem Proving","author":"W Bibel","year":"1987","unstructured":"Bibel, W.: Automated Theorem Proving. Artificial Intelligence, 2nd edn. Vieweg, Wiesbaden (1987)","edition":"2"},{"key":"2_CR4","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"116","DOI":"10.1007\/978-3-642-22438-6_11","volume-title":"Automated Deduction \u2013 CADE-23","author":"JC Blanchette","year":"2011","unstructured":"Blanchette, J.C., B\u00f6hme, S., Paulson, L.C.: Extending Sledgehammer with SMT solvers. In: Bj\u00f8rner, N., Sofronie-Stokkermans, V. (eds.) CADE 2011. LNCS (LNAI), vol. 6803, pp. 116\u2013130. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-22438-6_11"},{"issue":"1","key":"2_CR5","first-page":"101","volume":"9","author":"JC Blanchette","year":"2016","unstructured":"Blanchette, J.C., Kaliszyk, C., Paulson, L.C., Urban, J.: Hammering towards QED. J. Formaliz. Reason. 9(1), 101\u2013148 (2016)","journal-title":"J. Formaliz. Reason."},{"key":"2_CR6","unstructured":"Burel, G.: A shallow embedding of resolution and superposition proofs into the $$\\lambda \\varPi $$ -calculus modulo. In: Blanchette, J.C., Urban, J. (eds.) PxTP. EPiC Series in Computing, vol. 14, pp. 43\u201357. EasyChair (2013)"},{"key":"2_CR7","doi-asserted-by":"publisher","first-page":"57","DOI":"10.4204\/EPTCS.186.7","volume":"186","author":"Rapha\u00ebl Cauderlier","year":"2015","unstructured":"Cauderlier, R., Halmagrand, P.: Checking Zenon modulo proofs in Dedukti. In: Kaliszyk and Paskevich [18], pp. 57\u201373","journal-title":"Electronic Proceedings in Theoretical Computer Science"},{"key":"2_CR8","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1007\/978-3-319-40229-1_20","volume-title":"Automated Reasoning","author":"Gabriel Ebner","year":"2016","unstructured":"Ebner, G., Hetzl, S., Reis, G., Riener, M., Wolfsteiner, S., Zivota, S.: System description: GAPT 2.0. In: Olivetti and Tiwari [24], pp. 293\u2013301"},{"key":"2_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"126","DOI":"10.1007\/978-3-319-63390-9_7","volume-title":"Computer Aided Verification","author":"B Ekici","year":"2017","unstructured":"Ekici, B., et al.: SMTCoq: a plug-in for integrating SMT solvers into Coq. In: Majumdar, R., Kun\u010dak, V. (eds.) CAV 2017. LNCS, vol. 10427, pp. 126\u2013133. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-63390-9_7"},{"key":"2_CR10","unstructured":"F\u00e4rber, M., Kaliszyk, C.: Metis-based paramodulation tactic for HOL Light. In: Gottlob, G., Sutcliffe, G., Voronkov, A., (eds.) GCAI. EPiC Series in Computing, vol. 36, pp. 127\u2013136. EasyChair (2015)"},{"key":"2_CR11","unstructured":"F\u00e4rber, M.: Learning proof search in proof assistants. Ph.D. thesis, Universit\u00e4t Innsbruck (2018)"},{"issue":"1","key":"2_CR12","doi-asserted-by":"publisher","first-page":"176","DOI":"10.1007\/BF01201353","volume":"39","author":"G Gentzen","year":"1935","unstructured":"Gentzen, G.: Untersuchungen \u00fcber das logische Schlie\u00dfen. I. Mathematische Zeitschrift 39(1), 176\u2013210 (1935)","journal-title":"Mathematische Zeitschrift"},{"key":"2_CR13","doi-asserted-by":"crossref","first-page":"169","DOI":"10.7551\/mitpress\/5641.003.0012","volume-title":"Proof, Language, and Interaction, Essays in Honour of Robin Milner","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, Essays in Honour of Robin Milner, pp. 169\u2013186. The MIT Press, Cambridge (2000)"},{"key":"2_CR14","doi-asserted-by":"crossref","unstructured":"Hales, T.C., et al.: A formal proof of the Kepler conjecture. Forum Math. Pi 5 (2017)","DOI":"10.1017\/fmp.2017.1"},{"key":"2_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1007\/3-540-61511-3_97","volume-title":"Automated Deduction \u2014 Cade-13","author":"J Harrison","year":"1996","unstructured":"Harrison, J.: Optimizing proof search in model elimination. In: McRobbie, M.A., Slaney, J.K. (eds.) CADE 1996. LNCS, vol. 1104, pp. 313\u2013327. Springer, Heidelberg (1996). https:\/\/doi.org\/10.1007\/3-540-61511-3_97"},{"key":"2_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1007\/978-3-642-03359-9_4","volume-title":"Theorem Proving in Higher Order Logics","author":"J Harrison","year":"2009","unstructured":"Harrison, J.: HOL Light: an overview. In: Berghofer, S., Nipkow, T., Urban, C., Wenzel, M. (eds.) TPHOLs 2009. LNCS, vol. 5674, pp. 60\u201366. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-03359-9_4"},{"key":"2_CR17","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). NASA Technical reports, no. NASA\/CP-2003-212448, pp. 56\u201368, September 2003"},{"key":"2_CR18","doi-asserted-by":"crossref","unstructured":"Kaliszyk, C., Paskevich, A. (eds.): PxTP. EPTCS, vol. 186 (2015)","DOI":"10.4204\/EPTCS.186"},{"key":"2_CR19","doi-asserted-by":"crossref","unstructured":"Kaliszyk, C., Urban, J., Vysko\u010dil, J.: Certified connection tableaux proofs for HOL Light and TPTP. In: Leroy, X., Tiu, A. (eds.) CPP, pp. 59\u201366. ACM (2015)","DOI":"10.1145\/2676724.2693176"},{"issue":"1\u20132","key":"2_CR20","doi-asserted-by":"publisher","first-page":"226","DOI":"10.1006\/inco.2000.2913","volume":"162","author":"C Kreitz","year":"2000","unstructured":"Kreitz, C., Schmitt, S.: A uniform procedure for converting matrix proofs into sequent-style systems. Inf. Comput. 162(1\u20132), 226\u2013254 (2000)","journal-title":"Inf. Comput."},{"key":"2_CR21","doi-asserted-by":"publisher","first-page":"2015","DOI":"10.1016\/B978-044450813-3\/50030-8","volume-title":"Handbook of Automated Reasoning","author":"Reinhold Letz","year":"2001","unstructured":"Letz, R., Stenz, G.: Model elimination and connection tableau procedures. In: Robinson and Voronkov [32], pp. 2015\u20132114"},{"key":"2_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-71067-7","volume-title":"Theorem Proving in Higher Order Logics","year":"2008","unstructured":"Mohamed, O.A., Mu\u00f1oz, C., Tahar, S. (eds.): TPHOLs 2008. LNCS, vol. 5170. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-71067-7"},{"key":"2_CR23","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1016\/B978-044450813-3\/50008-4","volume-title":"Handbook of Automated Reasoning","author":"Andreas Nonnengart","year":"2001","unstructured":"Nonnengart, A., Weidenbach, C.: Computing small clause normal forms. In: Robinson and Voronkov [32], pp. 335\u2013367"},{"key":"2_CR24","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-40229-1","volume-title":"Automated Reasoning","year":"2016","unstructured":"Olivetti, N., Tiwari, A. (eds.): IJCAR 2016. LNCS (LNAI), vol. 9706. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-40229-1"},{"key":"2_CR25","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1007\/11554554_19","volume-title":"Automated Reasoning with Analytic Tableaux and Related Methods","author":"J Otten","year":"2005","unstructured":"Otten, J.: Clausal connection-based theorem proving in intuitionistic first-order logic. In: Beckert, B. (ed.) TABLEAUX 2005. LNCS (LNAI), vol. 3702, pp. 245\u2013261. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11554554_19"},{"key":"2_CR26","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"226","DOI":"10.1007\/978-3-642-22119-4_18","volume-title":"Automated Reasoning with Analytic Tableaux and Related Methods","author":"J Otten","year":"2011","unstructured":"Otten, J.: A non-clausal connection calculus. In: Br\u00fcnnler, K., Metcalfe, G. (eds.) TABLEAUX 2011. LNCS (LNAI), vol. 6793, pp. 226\u2013241. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-22119-4_18"},{"key":"2_CR27","doi-asserted-by":"publisher","first-page":"302","DOI":"10.1007\/978-3-319-40229-1_21","volume-title":"Automated Reasoning","author":"Jens Otten","year":"2016","unstructured":"Otten, J.: nanoCoP: a non-clausal connection prover. In: Olivetti and Tiwari [24], pp. 302\u2013312"},{"key":"2_CR28","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1007\/978-3-319-66902-1_13","volume-title":"Automated Reasoning with Analytic Tableaux and Related Methods","author":"J Otten","year":"2017","unstructured":"Otten, J.: Non-clausal connection calculi for\u00a0non-classical\u00a0logics. In: Schmidt, R.A., Nalon, C. (eds.) TABLEAUX 2017. LNCS (LNAI), vol. 10501, pp. 209\u2013227. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-66902-1_13"},{"key":"2_CR29","unstructured":"Otten, J.: Proof search optimizations for non-clausal connection calculi. In: Konev, B., Urban, J., R\u00fcmmer, P. (eds.) PAAR. CEUR Workshop Proceedings, vol. 2162, pp. 49\u201357. CEUR-WS.org (2018)"},{"issue":"1\u20132","key":"2_CR30","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1016\/S0747-7171(03)00037-3","volume":"36","author":"J Otten","year":"2003","unstructured":"Otten, J., Bibel, W.: leanCoP: lean connection-based theorem proving. J. Symb. Comput. 36(1\u20132), 139\u2013161 (2003)","journal-title":"J. Symb. Comput."},{"key":"2_CR31","doi-asserted-by":"publisher","first-page":"3","DOI":"10.4204\/EPTCS.186.3","volume":"186","author":"Giselle Reis","year":"2015","unstructured":"Reis, G.: Importing SMT and connection proofs as expansion trees. In: Kaliszyk and Paskevich [18], pp. 3\u201310","journal-title":"Electronic Proceedings in Theoretical Computer Science"},{"key":"2_CR32","unstructured":"Robinson, J.A., Voronkov, A., (eds.): Handbook of Automated Reasoning (in 2 volumes). Elsevier and MIT Press (2001)"},{"key":"2_CR33","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"421","DOI":"10.1007\/3-540-45744-5_34","volume-title":"Automated Reasoning","author":"S Schmitt","year":"2001","unstructured":"Schmitt, S., Lorigo, L., Kreitz, C., Nogin, A.: JProver: integrating connection-based theorem proving into interactive proof assistants. In: Gor\u00e9, R., Leitsch, A., Nipkow, T. (eds.) IJCAR 2001. LNCS, vol. 2083, pp. 421\u2013426. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-45744-5_34"},{"key":"2_CR34","doi-asserted-by":"crossref","unstructured":"Wenzel, M., Paulson, L.C., Nipkow, T.: The Isabelle framework. In: Mohamed et al. [22], pp. 33\u201338","DOI":"10.1007\/978-3-540-71067-7_7"}],"container-title":["Lecture Notes in Computer Science","Automated Reasoning with Analytic Tableaux and Related Methods"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-29026-9_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,7,22]],"date-time":"2024-07-22T10:55:14Z","timestamp":1721645714000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-29026-9_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030290252","9783030290269"],"references-count":34,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-29026-9_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"14 August 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"TABLEAUX","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Automated Reasoning with Analytic Tableaux and Related Methods","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"London","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"United Kingdom","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3 September 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 September 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"tableaux2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/tableaux2019.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"43","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"25","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"58% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3.2","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}