Locally Effective Objects and Artificial Intelligence

Authors:
Julio Rubio
Affiliations:
-
Venue:
AISC '00 Revised Papers from the International Conference on Artificial Intelligence and Symbolic Computation
Year:
2000

Citing 5
Cited 1

Building problem solvers

Building problem solvers
Specification of abstract data types

Specification of abstract data types
Specifying implementations

ISSAC '99 Proceedings of the 1999 international symposium on Symbolic and algebraic computation
A hidden agenda

Theoretical Computer Science
A Theory of Objects

A Theory of Objects

Formalizing in Coq Hidden Algebras to Specify Symbolic Computation Systems

Proceedings of the 9th AISC international conference, the 15th Calculemas symposium, and the 7th international MKM conference on Intelligent Computer Mathematics

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.