GraATP: A Graph Theoretic Approach for Automated Theorem Proving in Plane Geometry
Mohammad Murtaza Mahmud, Swakkhar Shatabda, Mohammad Nurul Huda

TL;DR
GraATP introduces a graph-based framework for automated theorem proving in plane geometry, translating geometric entities into graph nodes and relations into edges to verify theorems through graph traversal.
Contribution
It presents a novel graph-theoretic approach that generalizes automated theorem proving in plane geometry, enabling systematic validation of geometric claims.
Findings
Graph translation of geometric entities and relations.
Systematic theorem validation via graph traversal.
Potential for automation in geometric theorem proving.
Abstract
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
