This paper gives a brief overview of FG, a formal system for doing Euclidean geometry whose basic syntactic elements are geometric diagrams, and which has been implimentented as the computer system CDEG. The computational complexity of determining whether or not a given diagram is satisfiable is also briefly discussed.
CITATION STYLE
Miller, N. (2000). Case analysis in euclidean geometry: An overview. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1889, pp. 490–493). Springer Verlag. https://doi.org/10.1007/3-540-44590-0_44
Mendeley helps you to discover research relevant for your work.