GraATP: A graph theoretic approach for Automated Theorem Proving in plane geometry

Automated Theorem Proving (ATP) is an established branch of Artificial Intelligence. The purpose of ATP is to design a system which can automatically figure out an algorithm either to prove or disprove a mathematical claim, on the basis of a set of given premises, using a set of fundamental postulates and following the method of logical inference. In this paper, we propose GraATP, a generalized framework for automated theorem proving in plane geometry. Our proposed method translates the geometric entities into nodes of a graph and the relations between them as edges of that graph. The automated system searches for different ways to reach the conclusion for a claim via graph traversal by which the validity of the geometric theorem is examined.

[1]  David A. Plaisted,et al.  Eliminating duplication with the hyper-linking strategy , 1992, Journal of Automated Reasoning.

[2]  Lawrence J. Henschen,et al.  What Is Automated Theorem Proving? , 1985, J. Autom. Reason..

[3]  Melvin Fitting.  Possible world semantics for first-order logic of proofs , 2014, Ann. Pure Appl. Log..

[4]  Marta Franova,et al.  A Cartesian Methodology for an Autonomous Program Synthesis System , 2014, ICONS 2014.

[5]  Alan Robinson,et al.  Computational Logic - Essays in Honor of Alan Robinson , 1991, Computational Logic - Essays in Honor of Alan Robinson.

[6]  Hongguang Fu,et al.  Geometry Knowledge Base Learning from Theorem Proofs , 2014 .

[7]  Allen Newell,et al.  A guide to the general problem-solver program GPS-2-2 , 1963 .

[8]  Joran M. Elias.  Automated Geometric Theorem Proving: Wu's Method , 2006, The Mathematics Enthusiast.

[9]  S-C Chou,et al.  Machine Proofs in Geometry , 1994 .

[10]  Nikolaj Bjørner,et al.  Satisfiability modulo theories , 2011, Commun. ACM.

[11]  Jr. R. M. Bennett.  Papers presented at the May 3-5, 1960, western joint IRE-AIEE-ACM computer conference , 1960 .

[12]  Maria Paola Bonacina,et al.  New results on rewrite-based satisfiability procedures , 2006, TOCL.

[13]  Peter Baumgartner,et al.  Model Evolution-Based Theorem Proving , 2014, IEEE Intelligent Systems.

[14]  D. Loveland,et al.  Empirical explorations of the geometry theorem machine , 1960, IRE-AIEE-ACM '60 (Western).

[15]  Sharad Malik,et al.  Chaff: engineering an efficient SAT solver , 2001, Proceedings of the 38th Design Automation Conference (IEEE Cat. No.01CH37232).

[16]  Sharad Malik,et al.  Boolean satisfiability from theoretical hardness to practical success , 2009, Commun. ACM.

[17]  W. Marsden.  I and J , 2012 .

[18]  Lawrence C. Paulson,et al.  Case Splitting in an Automatic Theorem Prover for Real-Valued Special Functions , 2012, Journal of Automated Reasoning.

[19]  Allen Newell,et al.  The logic theory machine-A complex information processing system , 1956, IRE Trans. Inf. Theory.

[20]  David A. Plaisted,et al.  Ordered Semantic Hyper-Linking , 1997, Journal of Automated Reasoning.