Detecting Inconsistencies in Large First-Order Knowledge Bases

Large formalizations carry the risk of inconsistency, and hence may lead to instances of spurious reasoning. This paper describes a new approach and tool that automatically probes large first-order axiomatizations for inconsistency, by selecting subsets of the axioms centered on certain function and predicate symbols, and handling the subsets to a first-order theorem prover to test for unsatisfiability. The tool has been applied to several large axiomatizations, inconsistencies have been found, inconsistent cores extracted, and semi-automatic analysis of the inconsistent cores has helped to pinpoint the axioms that appear to be the underlying cause of inconsistency.

[1]  Thomas A. Henzinger,et al.  Proceedings of the 8th International Conference on Computer Aided Verification , 1996 .

[2]  Josef Urban,et al.  MaLARea SG1- Machine Learner for Automated Reasoning with Semantic Guidance , 2008, IJCAR.

[3]  Deepak Ramachandran,et al.  First-Orderized ResearchCyc : Expressivity and Efficiency in a Common-Sense Ontology , 2005 .

[4]  Enrico Motta,et al.  Proceedings of the 8th International Semantic Web Conference , 2009 .

[5]  Andrei Voronkov,et al.  First-Order Theorem Proving and Vampire , 2013, CAV.

[6]  Jesse Alama,et al.  Premise Selection for Mathematics by Corpus Analysis and Kernel Methods , 2011, Journal of Automated Reasoning.

[7]  Josef Urban,et al.  ATP and Presentation Service for Mizar Formalizations , 2011, Journal of Automated Reasoning.

[8]  Geoff Sutcliffe.  The TPTP Problem Library and Associated Infrastructure , 2017, Journal of Automated Reasoning.

[9]  Josef Urban,et al.  Overview and Evaluation of Premise Selection Techniques for Large Theory Mathematics , 2012, IJCAR.

[10]  Cesare Tinelli,et al.  Model Finding for Recursive Functions in SMT , 2016, IJCAR.

[11]  Adam Pease,et al.  Towards a standard upper ontology , 2001, FOIS.

[12]  Adam Pease,et al.  Sigma : An Integrated Development Environment for Logical Theories , 2010 .

[13]  David Ripley,et al.  Paraconsistent Logic , 2015, J. Philos. Log..

[14]  Tobias Nipkow,et al.  Nitpick: A Counterexample Generator for Higher-Order Logic Based on a Relational Model Finder , 2010, ITP.

[15]  Lawrence C. Paulson,et al.  LEO-II - A Cooperative Automatic Theorem Prover for Classical Higher-Order Logic (System Description) , 2008, IJCAR.

[16]  Tobias Nipkow,et al.  A FORMAL PROOF OF THE KEPLER CONJECTURE , 2015, Forum of Mathematics, Pi.

[17]  Bruno Woltzenlogel Paleo,et al.  Automating Gödel's Ontological Proof of God's Existence with Higher-order Automated Theorem Provers , 2014, ECAI.

[18]  Anthony Hunter,et al.  Paraconsistent logics , 1998 .

[19]  Stephan Schulz,et al.  E - a brainiac theorem prover , 2002, AI Commun..

[20]  Lawrence C. Paulson,et al.  Lightweight relevance filtering for machine-generated resolution problems , 2009, J. Appl. Log..

[21]  Adam Pease,et al.  The Suggested Upper Merged Ontology: A Large Ontology for the Semantic Web and its Applic ations , 2002 .

[22]  Cezary Kaliszyk,et al.  Learning-Assisted Automated Reasoning with Flyspeck , 2012, Journal of Automated Reasoning.

[23]  Douglas B. Lenat,et al.  CYC: a large-scale investment in knowledge infrastructure , 1995, CACM.

[24]  William McCune,et al.  Solution of the Robbins Problem , 1997, Journal of Automated Reasoning.

[25]  Josef Urban,et al.  Proceedings of the CADE-21 Workshop on Empirically Successful Automated Reasoning in Large Theories, Bremen, Germany, 17th July 2007 , 2007, ESARLT.

[26]  Josef Urban,et al.  DeepMath - Deep Sequence Models for Premise Selection , 2016, NIPS.

[27]  Chad E. Brown.  Reducing Higher-Order Theorem Proving to a Sequence of SAT Problems , 2013, Journal of Automated Reasoning.

[28]  Geoff Sutcliffe,et al.  SRASS - A Semantic Relevance Axiom Selection System , 2007, CADE.

[29]  Gerhard Lakemeyer,et al.  Proceedings of the Ninth International Symposium on Logical Formalizations of Commonsense Reasoning , 2009 .

[30]  Stephan Schulz,et al.  System Description: E 1.8 , 2013, LPAR.

[31]  Cezary Kaliszyk,et al.  MizAR 40 for Mizar 40 , 2013, Journal of Automated Reasoning.

[32]  Geoff Sutcliffe,et al.  First Order Reasoning on a Large Ontology , 2007, ESARLT.

[33]  Branden Fitelson,et al.  Steps Toward a Computational Metaphysics , 2007, J. Philos. Log..

[34]  Vinay K. Chaudhri,et al.  Representing States in a Biology Textbook , 2015, AAAI Spring Symposia.

[35]  Cezary Kaliszyk,et al.  Stronger Automation for Flyspeck by Feature Weighting and Strategy Evolution , 2013, PxTP@CADE.

[36]  Tim Benson,et al.  Principles of Health Interoperability , 2016, Health Information Technology Standards.

[37]  Adam Naumowicz,et al.  Mizar in a Nutshell , 2010, J. Formaliz. Reason..

[38]  Josef Urban,et al.  BliStr: The Blind Strategymaker , 2013, GCAI.

[39]  Robert Veroff,et al.  Loops with Abelian Inner Mapping Groups: An Application of Automated Deduction , 2015, Automated Reasoning and Mathematics.

[40]  Adam Pease,et al.  Higher-order aspects and context in SUMO , 2012, J. Web Semant..

[41]  Geoff Sutcliffe.  The TPTP Problem Library and Associated Infrastructure , 2009, Journal of Automated Reasoning.

[42]  Adam Pease,et al.  Sigma: An integrated development environment for formal ontology , 2013, AI Commun..

[43]  Geoff Sutcliffe.  The CADE-23 Automated Theorem Proving System Competition - CASC-23 , 2012, AI Commun..

[44]  Josef Urban,et al.  MPTP 0.2: Design, Implementation, and Initial Experiments , 2006, Journal of Automated Reasoning.

[45]  Erik Seligman,et al.  Formal Verification: An Essential Toolkit for Modern VLSI Design , 2015 .

[46]  Cezary Kaliszyk,et al.  Hammering towards QED , 2016, J. Formaliz. Reason..

[47]  Andrei Voronkov,et al.  Sine Qua Non for Large Theory Reasoning , 2011, CADE.