ESQIMO system
¬ BACK to Homepage
ESQIMO solves puzzles of the form:
find D such that D is to C what B is to A.
ESQIMO is a computational model for simple analogy solving. It is also a first application of the CAT framework to diagrammatic reasoning [see TR LRI 1192].
In ESQIMO, the source and target analogs are represented as simplexes and the space of the problem is represented as a simplicial complex. Solving the analogy begins then by finding a topological transformation between the simplex of A and the simplex of B. This transformation is modeled as a polygonal chain. Applying this transformation to C is simply deforming the simplex of C along this chain while staying into the complex that represents the space of the problem.
ESQIMO 1.0 [download] has been implemented in the MATHEMATICA 3.0 programming language. A slide presentation of this old version is still available as a html diaporama page.
ESQIMO 2.0 [download] has been implemented in the CAML programming language. It has been developed with the Caml-light system, compiler and linker version 0.74. The Hitchicker's guide to ESQIMO is available as a .ps.gz file.
Last Modified: 03.08.2004
