Mechanical geometry theorem proving
Mechanical geometry theorem proving
Automated geometry theorem proving by vector calculation
ISSAC '93 Proceedings of the 1993 international symposium on Symbolic and algebraic computation
Geometry theorem proving in vector spaces by means of Gröbner bases
ISSAC '93 Proceedings of the 1993 international symposium on Symbolic and algebraic computation
Logic and Databases: A Deductive Approach
ACM Computing Surveys (CSUR)
Automated Production of Readable Proofs for Theorems in Non-Euclidian Geometries
Selected Papers from the International Workshop on Automated Deduction in Geometry
Clifford Algebraic Calculus for Geometric Reasoning with Application to Computer Vision
Selected Papers from the International Workshop on Automated Deduction in Geometry
Proving Geometric Theorems Using Clifford Algebra and Rewrite Rules
CADE-15 Proceedings of the 15th International Conference on Automated Deduction: Automated Deduction
A Semantically Guided Deductive System for Automatic Theorem Proving
IEEE Transactions on Computers
Empirical explorations of the geometry theorem machine
IRE-AIEE-ACM '60 (Western) Papers presented at the May 3-5, 1960, western joint IRE-AIEE-ACM computer conference
| Hi-index | 0.00 |
Readability is a fuzzy concept and there are several levels of readability. Readable machine solving avails the development of mathematics culture and is useful to education. There are several methods of readable machine solving, such as the logic method, points elimination method, geometry information searching system or deductive database method. Based on these methods, some new types of educational software have been developed. As an example, the intelligent educational software "Mathematics Lab: Solid Geometry" (MSG) is introduced in this paper.