{"type":"ScholarlyArticle","title":"nanoCoP: Natural Non-clausal Theorem Proving","authors":[{"name":"Jens Otten","slug":"jens-otten","given":"Jens","family":"Otten","affiliation":"Department of Informatics , University of Oslo , Norway"}],"abstract":"Most efficient fully automated theorem provers implement proof search calculi that require the input formula to be in a clausal form, i.e. disjunctive or conjunctive normal form. The translation into clausal form introduces a significant overhead to the proof search and modifies the structure of the original formula. Translating a proof in clausal form back into a more readable non-clausal proof of the original formula is not straightforward. This paper presents a non-clausal automated theorem prover for classical first-order logic. It is based on a non-clausal connection calculus and implemented with a few lines of Prolog code. Working entirely on the original structure of the input formula yields not only a speed up of the proof search, but the resulting non-clausal proofs are also shorter.","doi":"10.24963/ijcai.2017/695","url":"https://ijcai.org/proceedings/2017/695","pdf":"https://ijcai.org/proceedings/2017/0695.pdf","markdown":"https://ijcai.org/proceedings/2017/695.md","bibtex":"https://ijcai.org/proceedings/2017/bibtex/695","volume":{"slug":"2017","title":"Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence","short_title":"IJCAI 2017","url":"https://ijcai.org/proceedings/2017/","year":2017,"location":"Melbourne, Australia","dates":"19-25 August 2017","editors":"Carles Sierra","isbn":"978-0-9992411-0-3","publisher":"International Joint Conferences on Artificial Intelligence Organization","doi_prefix":"10.24963/ijcai.2017"},"section":"Best Sister Conferences","track":"Best Sister Conferences","number":695,"pages":{"first":4924,"last":4928},"keywords":["Artificial Intelligence: artificial intelligence","Artificial Intelligence: knowledge representation and reasoning"],"videos":[],"references":[{"position":1,"raw":"[Andrews, 1981] Peter B. Andrews. Theorem proving via general matings. J. ACM, 28(2):193-214, 1981.","title":"Theorem proving via general matings","authors":"B Peter, Andrews","year":"1981","venue":"J. ACM","doi":null,"url":null,"internal_url":null},{"position":2,"raw":"[Antonsen and Waaler, 2007] Roger Antonsen and Arild Waaler. Liberalized variable splitting. J. Autom. Reason- ing, 38(1-3):3-30, 2007.","title":"Liberalized variable splitting","authors":"Antonsen, Waaler, Roger Antonsen, Arild Waaler","year":"2007","venue":"J. Autom. Reasoning","doi":null,"url":null,"internal_url":null},{"position":3,"raw":"[Beckert and Posegga, 1995] Bernhard Beckert and Joachim Posegga. leanTAP: Lean tableau-based deduction. J. Au- tom. Reasoning, 15(3):339-358, 1995.","title":"leanTAP: Lean tableau-based deduction","authors":"Bernhard Beckert, Joachim Posegga","year":"1995","venue":"J. Autom. Reasoning","doi":null,"url":null,"internal_url":null},{"position":4,"raw":"[Bibel, 1983] Wolfgang Bibel. Matings in matrices. Com- mun. ACM, 26(11):844-852, 1983.","title":"Wolfgang Bibel. Matings in matrices","authors":"Bibel","year":"1983","venue":"Commun. ACM","doi":null,"url":null,"internal_url":null},{"position":5,"raw":"[Bibel, 1987] Wolfgang Bibel. Automated theorem proving. Artificial intelligence. F. Vieweg und Sohn, Wiesbaden, 2nd edition, 1987.","title":"Wolfgang Bibel. Automated theorem proving","authors":"Bibel","year":"1987","venue":null,"doi":null,"url":null,"internal_url":null},{"position":6,"raw":"[Eder, 1992] Elmar Eder. Relative Complexities of First Or- der Calculi. Vieweg, Braunschweig, 1992.","title":"Relative Complexities of First Order Calculi","authors":"Elmar Eder","year":"1992","venue":null,"doi":null,"url":null,"internal_url":null},{"position":7,"raw":"[Frege, 1879] Gottlob Frege. Begriffsschrift: Eine der arithmetischen nachgebildete Formelsprache des reinen Denkens. L. Nebert, Halle, 1879.","title":"Gottlob Frege. Begriffsschrift: Eine der arithmetischen nachgebildete Formelsprache des reinen Denkens","authors":"Frege","year":"1879","venue":null,"doi":null,"url":null,"internal_url":null},{"position":8,"raw":"[Gentzen, 1935] Gerhard Gentzen. Untersuchungen über das Logische Schließen. Mathematische Zeitschrift, 39:176- 210, 405-431, 1935.","title":"Untersuchungen über das Logische Schließen","authors":"Gerhard Gentzen, Gentzen","year":"1935","venue":"Mathematische Zeitschrift","doi":null,"url":null,"internal_url":null},{"position":9,"raw":"[Hähnle et al., 2004] Reiner Hähnle, Neil. V. Murray, and Erik Rosenthal. Linearity and regularity with negation nor- mal form. Theoretical Computer Science, 328:325-354, 2004.","title":"Linearity and regularity with negation normal form","authors":"Neil V Reiner Hähnle, Erik Murray, Rosenthal","year":"2004","venue":"Theoretical Computer Science","doi":null,"url":null,"internal_url":null},{"position":10,"raw":"[Hähnle, 2001] Reiner Hähnle. Tableaux and related meth- ods. In Alan Robinson and Andrei Voronkov, editors, Handbook of Automated Reasoning, volume I, chapter 3, pages 101-178. Elsevier Science B.V., 2001.","title":"Reiner Hähnle. Tableaux and related methods","authors":"Hähnle","year":"2001","venue":"Handbook of Automated Reasoning","doi":null,"url":null,"internal_url":null},{"position":11,"raw":"[Issar, 1990] Sunil Issar. Path-focused duplication: A search procedure for general matings. In T. S. W. Dietterich, edi- tor, AAAI-90, pages 221-226. MIT Press, 1990.","title":"Path-focused duplication: A search procedure for general matings","authors":"Sunil Issar","year":"1990","venue":"editor, AAAI-90","doi":null,"url":null,"internal_url":null},{"position":12,"raw":"[Kaliszyk and Urban, 2015] Cezary Kaliszyk and Josef Ur- ban. FeMaLeCoP: Fairly efficient machine learning connection prover. In Martin Davis, Ansgar Fehnker, Annabelle McIver, and Andrei Voronkov, editors, LPAR- 20, volume 9450 of Lecture Notes in Artificial Intelligence, pages 88-96. Springer, 2015.","title":"Cezary Kaliszyk and Josef Urban. FeMaLeCoP: Fairly efficient machine learning connection prover","authors":"Urban Kaliszyk","year":"2015","venue":"LPAR-20","doi":null,"url":null,"internal_url":null},{"position":13,"raw":"[Kreitz and Otten, 1999] Christoph Kreitz and Jens Otten. Connection-based theorem proving in classical and non- classical logics. J. UCS, 5(3):88-112, 1999.","title":"Connection-based theorem proving in classical and nonclassical logics","authors":"Otten Kreitz, Christoph Kreitz, Jens Otten","year":"1999","venue":"J. UCS","doi":null,"url":null,"internal_url":null},{"position":14,"raw":"[McCune, 2005] William McCune. Release of Prover9. 2005. Mile high conference on quasigroups, loops and nonassociative systems.","title":"Mile high conference on quasigroups, loops and nonassociative systems","authors":"William Mccune","year":"2005","venue":null,"doi":null,"url":null,"internal_url":null},{"position":15,"raw":"[Otten and Bibel, 2003] Jens Otten and Wolfgang Bibel. leanCoP: lean connection-based theorem proving. Jour- nal of Symbolic Computation, 36(1-2):139-161, 2003.","title":"leanCoP: lean connection-based theorem proving","authors":"Bibel Otten, Jens Otten, Wolfgang Bibel","year":"2003","venue":"Journal of Symbolic Computation","doi":null,"url":null,"internal_url":null},{"position":16,"raw":"[Otten and Bibel, 2017] Jens Otten and Wolfgang Bibel. Ad- vances in connection-based automated theorem proving. In J. Bowen, M. Hinchey, and E.-R. Olderog, editors, Provably Correct Systems. Springer, 2017. [Otten, 2008] Jens Otten. leanCoP 2.0 and ileanCoP 1.2: High performance lean theorem proving in classical and intuitionistic logic. In Alessandro Armando, Peter Baum- gartner, and Gilles Dowek, editors, IJCAR 2008, volume 5195 of Lecture Notes in Artificial Intelligence, pages 283-291. Springer, 2008.","title":"Advances in connection-based automated theorem proving","authors":"Bibel Otten, Jens Otten, Wolfgang Bibel","year":"2008","venue":"Provably Correct Systems","doi":null,"url":null,"internal_url":null},{"position":17,"raw":"[Otten, 2010] Jens Otten. Restricting backtracking in con- nection calculi. AI Commun., 23(2-3):159-182, 2010.","title":"Restricting backtracking in connection calculi","authors":"Jens Otten, Otten","year":"2010","venue":"AI Commun","doi":null,"url":null,"internal_url":null},{"position":18,"raw":"[Otten, 2011] Jens Otten. A non-clausal connection calculus. In Kai Brünnler and George Metcalfe, editors, TABLEAUX 2011, volume 6793 of Lecture Notes in Artificial Intelli- gence, pages 226-241. Springer, 2011.","title":"A non-clausal connection calculus","authors":"Jens Otten","year":"2011","venue":"TABLEAUX 2011","doi":null,"url":null,"internal_url":null},{"position":19,"raw":"[Otten, 2014] Jens Otten. MleanCoP: A connection prover for first-order modal logic. In Stéphane Demri, Deepak Kapur, and Christoph Weidenbach, editors, IJCAR 2014, volume 8562 of Lecture Notes in Artificial Intelligence, pages 269-276. Springer, 2014.","title":"MleanCoP: A connection prover for first-order modal logic","authors":"Jens Otten, Otten","year":"2014","venue":"IJCAR 2014","doi":null,"url":null,"internal_url":null},{"position":20,"raw":"[Otten, 2016] Jens Otten. nanoCoP: A non-clausal connec- tion prover. In Nicola Olivetti and Ashish Tiwari, editors, IJCAR 2016, volume 9706 of Lecture Notes in Artificial Intelligence, pages 302-312. Springer, 2016.","title":"nanoCoP: A non-clausal connection prover","authors":"Jens Otten, Otten","year":"2016","venue":"IJCAR 2016","doi":null,"url":null,"internal_url":null},{"position":21,"raw":"[Plaisted and Greenbaum, 1986] David A. Plaisted and Steven Greenbaum. A structure-preserving clause form translation. J. Symbolic Computation, 2(3):293-304, 1986.","title":"A structure-preserving clause form translation","authors":"David A Plaisted, Steven Greenbaum","year":"1986","venue":"J. Symbolic Computation","doi":null,"url":null,"internal_url":null},{"position":22,"raw":"[Reis, 2015] Giselle Reis. Importing SMT and connection proofs as expansion trees. In Proof Exchange for Theorem Proving (PxTP), volume 186 of EPTCS, pages 3-10, 2015.","title":"Importing SMT and connection proofs as expansion trees","authors":"Giselle Reis","year":"2015","venue":"Proof Exchange for Theorem Proving (PxTP)","doi":null,"url":null,"internal_url":null},{"position":23,"raw":"[Robinson and Voronkov, 2001] John Alan Robinson and Andrei Voronkov, editors. Handbook of Automated Rea- soning. Elsevier Science Publishers, Amsterdam, 2001.","title":"Handbook of Automated Reasoning","authors":null,"year":"2001","venue":null,"doi":null,"url":null,"internal_url":null},{"position":24,"raw":"[Schmitt et al., 2001] Stephan Schmitt, Lori Lorigo, Christoph Kreitz, and Aleksey Nogin. JProver: Integrat- ing connection-based theorem proving into interactive proof assistants. In Rajeev Goré, Alexander Leitsch, and Tobias Nipkow, editors, IJCAR 2001, volume 2083 of Lecture Notes in Artificial Intelligence, pages 421-426.","title":"JProver: Integrating connection-based theorem proving into interactive proof assistants","authors":"Stephan Schmitt, Lori Lorigo, Christoph Kreitz, Aleksey Nogin","year":null,"venue":"IJCAR 2001","doi":null,"url":null,"internal_url":null},{"position":25,"raw":"[Schulz, 2002] Stephan Schulz. E -a brainiac theorem prover. AI Commun., 15(2-3):111-126, 2002.","title":"E -a brainiac theorem prover","authors":"Stephan Schulz","year":"2002","venue":"AI Commun","doi":null,"url":null,"internal_url":null},{"position":26,"raw":"[Stickel, 1988] Mark E. Stickel. A PROLOG technology the- orem prover: Implementation by an extended PROLOG compiler. J. Autom. Reasoning, 4(4):353-380, 1988.","title":"A PROLOG technology theorem prover: Implementation by an extended PROLOG compiler","authors":"Mark E Stickel","year":"1988","venue":"J. Autom. Reasoning","doi":null,"url":null,"internal_url":null},{"position":27,"raw":"[Sutcliffe, 2009] Geoff Sutcliffe. The TPTP problem library and associated infrastructure: The FOF and CNF parts, v3.5.0. J. Autom. Reasoning, 43(4):337-362, 2009.","title":"The TPTP problem library and associated infrastructure: The FOF and CNF parts, v3.5.0","authors":"Geoff Sutcliffe","year":"2009","venue":"J. Autom. Reasoning","doi":null,"url":null,"internal_url":null}],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}