Using Gröbner bases to reason about geometry problems
Journal of Symbolic Computation
Mechanical geometry theorem proving
Mechanical geometry theorem proving
Automated development of Tarski's geometry
Journal of Automated Reasoning
Empirical explorations of the geometry-theorem proving machine
Computers & thought
Efficiency of a Good But Not Linear Set Union Algorithm
Journal of the ACM (JACM)
A Deductive Database Approach to Automated Geometry Theorem Proving and Discovering
Journal of Automated Reasoning
HOL Light: A Tutorial Introduction
FMCAD '96 Proceedings of the First International Conference on Formal Methods in Computer-Aided Design
Isar - A Generic Interpretative Approach to Readable Formal Proof Documents
TPHOLs '99 Proceedings of the 12th International Conference on Theorem Proving in Higher Order Logics
Higher-Order Intuitionistic Formalization and Proofs in Hilbert's Elementary Geometry
ADG '00 Revised Papers from the Third International Workshop on Automated Deduction in Geometry
The Thirteen Books of Euclid's Elements, Books 1 and 2
The Thirteen Books of Euclid's Elements, Books 1 and 2
On the Mechanization of the Proof of Hessenberg's Theorem in Coherent Logic
Journal of Automated Reasoning
Formalizing Desargues' theorem in Coq using ranks
Proceedings of the 2009 ACM symposium on Applied Computing
The TPTP Problem Library and Associated Infrastructure
Journal of Automated Reasoning
Skolem machines and geometric logic
ICTAC'07 Proceedings of the 4th international conference on Theoretical aspects of computing
Mechanical theorem proving in Tarski's geometry
ADG'06 Proceedings of the 6th international conference on Automated deduction in geometry
Formalizing projective plane geometry in Coq
ADG'08 Proceedings of the 7th international conference on Automated deduction in geometry
LPAR'05 Proceedings of the 12th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
The Seventeen Provers of the World
Towards understanding triangle construction problems
CICM'12 Proceedings of the 11th international conference on Intelligent Computer Mathematics
Hi-index | 0.00 |
We present a theorem prover ArgoCLP based on coherent logic that can be used for generating both readable and formal (machine verifiable) proofs in various theories, primarily geometry. We applied the prover to various axiomatic systems and proved tens of theorems from standard university textbooks on geometry. The generated proofs can be used in different educational purposes and can contribute to the growing body of formalized mathematics. The system can be used, for instance, in showing that modifications of some axioms do not change the power of an axiom system. The system can also be used as an assistant for proving appropriately chosen subgoals of complex conjectures.