Mechanical geometry theorem proving
Mechanical geometry theorem proving
Communications of the ACM
Figure correctness in an expert system for teaching geometry
Proceedings of the eighth biennial conference of the Canadian Society for Computational Studies of Intelligence on CSCSI-90
Algorithms for non-linear algebraic constraints
Constraint logic programming
RISC-CLP (real): logic programming with non-linear constraints over the reals
Constraint logic programming
Constraint arithmetic on real intervals
Constraint logic programming
The Programming Language Aspects of ThingLab, a Constraint-Oriented Simulation Laboratory
ACM Transactions on Programming Languages and Systems (TOPLAS)
A constraint-based dynamic geometry system
Computer-Aided Design
| Hi-index | 0.00 |
An important component of an Intelligent Tutoring System (ITS) for teaching geometry is its capacity to transform a figure into as many different figures as possible, yet all of which respect the same underlying logical specification. Given a logical specification for a figure, (i) a figure can be constructed automatically from the objects and properties in the spepification; and (ii) once constructed, one can transform a figure through displacement of any of its objects and still obtain a figure that respects the specification. For a student user, this feature provides an invaluable tool for graphical exploration and discovery of properties induced by the logical specification. Our problem domain is automatic construction of figures; and we address this issue in restricted cases using Constraint Logic Programming We present solutions to cases in which figures can be constructed automatically and in which there is also a natural notion of completeness for our system. For this automatic figure construction system, we describe an implementation, written in Prolog III, which makes use of both constraints and coroutines provided in the language. Results of experimentation are also included, as well as ways in which the system can be extended to handle non restricted cases.