Case Analysis in Euclidean Geometry: An Overview Export

@incollection{citeulike:1381493, abstract = {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.}, author = {Miller, Nathaniel}, citeulike-article-id = {1381493}, citeulike-linkout-0 = {http://www.springerlink.com/content/dcx94akwyeacedvv}, citeulike-linkout-1 = {http://hopper.unco.edu/faculty/personal/miller/diagrams/caseanal.pdf}, journal = {Theory and Application of Diagrams: First International Conference, Diagrams 2000, Edinburgh, Scotland, UK, September 2000. Proceedings}, keywords = {for\_gabe}, pages = {1--13}, posted-at = {2007-06-12 14:37:59}, priority = {0}, title = {Case Analysis in Euclidean Geometry: An Overview}, url = {http://www.springerlink.com/content/dcx94akwyeacedvv}, year = {2000} }

TY - CHAP ID - citeulike:1381493 L3 - citeulike-article-id:1381493 N2 - 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. JF - Theory and Application of Diagrams: First International Conference, Diagrams 2000, Edinburgh, Scotland, UK, September 2000. Proceedings EP - 13 TI - Case Analysis in Euclidean Geometry: An Overview SP - 1 KW - for_gabe AU - Miller, Nathaniel PY - 2000/// UR - http://www.springerlink.com/content/dcx94akwyeacedvv ER -