Results 1 
7 of
7
Algebraic topology for knowledge representation in analogy solving
 European Conference on Artificial Intelligence (ECAI98
, 1998
"... ..."
(Show Context)
Amalgams: Names and Name Capture in a Declarative Framework
, 1998
"... this paper, we address the problem of names and name capture on its own by designing, through the use of three operators, a complete and consistent mechanism of name capture for a declarative framework. We perceive expressions with free names as incomplete expressions which will be dynamically compl ..."
Abstract

Cited by 3 (2 self)
 Add to MetaCart
(Show Context)
this paper, we address the problem of names and name capture on its own by designing, through the use of three operators, a complete and consistent mechanism of name capture for a declarative framework. We perceive expressions with free names as incomplete expressions which will be dynamically completed by a name capture mechanism. The formalism allows the denition of rstclass environments (which can be the result of a computation). We apply this mechanism to model distributed incremental program construction and to dene an object oriented programming style in a declarative language
Modeling diagrammatic reasoning tasks with a topological framework
 In TwD98 Workshop, dic
, 1998
"... ..."
(Show Context)
Design and Implementation of 8½, a Declarative DataParallel Language
 Computer Languages
, 1995
"... 8 ½, an experimental language combining features of collection and stream oriented languages... ..."
Abstract
 Add to MetaCart
8 ½, an experimental language combining features of collection and stream oriented languages...
Algebraic Topology for Knowledge Representation in Analogy Solving
"... Abstract. We propose a computational model for analogy solving based on a topological formalism of representation. The source and the target analogs are represented as simplexes and the analogy solving is modeled as a topological deformation of these simplexes along a polygonal chain and according t ..."
Abstract
 Add to MetaCart
(Show Context)
Abstract. We propose a computational model for analogy solving based on a topological formalism of representation. The source and the target analogs are represented as simplexes and the analogy solving is modeled as a topological deformation of these simplexes along a polygonal chain and according to some constraints. We apply this framework to the resolution of IQtests typically presented as “given A, B and C, find D such that A is to B what C is to D”. 1
1. A Topological Framework for Modeling Diagrammatic Reasoning Tasks
"... We propose to model some diagrammatic reasoning tasks within a topological framework. We only focus on problems that require a specific diagrammatic reasoning procedure to be solved rather than on reasoning on diagrams. To model such cognitive tasks, we propose to represent the problem with topologi ..."
Abstract
 Add to MetaCart
We propose to model some diagrammatic reasoning tasks within a topological framework. We only focus on problems that require a specific diagrammatic reasoning procedure to be solved rather than on reasoning on diagrams. To model such cognitive tasks, we propose to represent the problem with topological objects and to model the diagrammatic operations performed on them as topological operations. The idea underlying this proposition is that combinatorial algebraic topology is an adequate and unifying framework to specify and analyse diagrammatic representations and reasoning. To illustrate such a proposal, we present here three applications of this topological framework: the first concerns a categorization problem, the second deals with hierachy restructuring, and the last one is the ESQIMO system for simple intradomain analogy solving in unsupervised IQtests. 1.1