A CSA-based robot plan generator

Authors:
Van King Tan;Eugeniusz Eberbach
Affiliations:
DMR Group Inc., Halifax, Nova Scotia, Canada B3J 4K2 and Jodrey School of Computer Science, Acadia University, Wolfville, Nova Scotia, Canada BOP 1X0;Jodrey School of Computer Science, Acadia University, Wolfville, Nova Scotia, Canada BOP 1X0
Venue:
CSC '93 Proceedings of the 1993 ACM conference on Computer science
Year:
1993

Citing 4
Cited 0

Introduction to artificial intelligence

Introduction to artificial intelligence
Machine learning: paradigms and methods

Machine learning: paradigms and methods
CSA: two paradigms of the language for adaptive expert systems

CSC '91 Proceedings of the 19th annual conference on Computer Science
Guarded commands, nondeterminacy and formal derivation of programs

Communications of the ACM

Quantified Score

Hi-index	0.00

Visualization

Abstract

The Calculus of Self-Modifiable Algorithms (CSA) is a universal theory that integrates different programming styles and may be applied to a wealth of domains and applications. This paper presents aspects of the Calculus of Self-Modifiable Algorithms and how it can be used in one area of Artificial Intelligence: Robot Plan Generation.