The concept of locally effective objects was introduced by Sergeraert in the field of Effective Algebraic Topology, where this tool was used to represent potentially infinite data structures. This notion, borrowed from symbolic computation, was later used to produce, in an innovative way, code implementing the well-known search algorithms in Artificial Intelligence. In this paper, we show how these implementations can be appropriately reinterpreted and specified, by using some recent advances in the algebraic specification setting. As a by-product, the concept of locally effective graphs provides a framework in which the Production Systems and the State Space programming metaphors can be formally integrated.
[1]
Joseph A. Goguen,et al.
A hidden agenda
,
2000,
Theor. Comput. Sci..
[2]
Hans-Dieter Ehrich,et al.
Specification of abstract data types
,
1996
.
[3]
Julio Rubio,et al.
Locally effective objects and algebraic topology
,
1993
.
[4]
Claude Kirchner,et al.
An overview of ELAN
,
1998,
WRLA.
[5]
Martín Abadi,et al.
A Theory of Objects
,
1996,
Monographs in Computer Science.
[6]
Kenneth D. Forbus,et al.
Building Problem Solvers
,
1993
.
[7]
Vico Pascual,et al.
Specifying implementations
,
1999,
ISSAC '99.