Planner-BESM-6 system: implementation methods

Authors:
Vladimir N. Pilehikov
Affiliations:
Department of Computation Mathematics and Cybernetics, Moscow University, Moscow, USSR
Venue:
IJCAI'75 Proceedings of the 4th international joint conference on Artificial intelligence - Volume 1
Year:
1975

Citing 2
Cited 0

New Programming Languages for Artificial Intelligence Research

ACM Computing Surveys (CSUR)
A model and stack implementation of multiple environments

Communications of the ACM

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper describee some new methods used in PLANNER-BESM-6 system for the implementation of PLANNER. Backtracking is implemented with a single stack and no copying of activation frames is needed. Lists are represented as arrays of pointers; the garbage collector for this representation requires no additional memory. Restrictions on variable values are accomplished by using 'semi-definedf structures. These methods have enabled to achieve the high efficiency of the system work.