Title :
Improvements on the evaluation of declarative specifications
Author :
Dietrich, Suzanne Wagner
Author_Institution :
Dept. of Comput. Sci., Arizona State Univ., Tempe, AZ, USA
Abstract :
ET is a complete evaluation strategy for pure logic programs. The ET algorithm is an essentially depth-first strategy that uses extension tables, which save the answers of selected predicates, to evaluate (recursive) declarative specifications. The implementation of the ET algorithm in Prolog is straightforward and easily modifiable. The author presents variations of the ET algorithm that, under certain assumptions, improve the evaluation of declarative specifications.<>
Keywords :
PROLOG; logic programming; specification languages; ET algorithm; Prolog; declarative specifications; depth-first strategy; extension tables; pure logic programs; Computer science; Control systems; Costs; Data structures; Educational institutions; Logic programming; Performance evaluation; Programming profession; Prototypes; Superluminescent diodes;
Conference_Titel :
Computers and Communications, 1989. Conference Proceedings., Eighth Annual International Phoenix Conference on
Conference_Location :
Scottsdale, AZ, USA
Print_ISBN :
0-8186-1918-x
DOI :
10.1109/PCCC.1989.37454