Improvements on the evaluation of declarative specifications

Research output: Chapter in Book/Report/Conference proceedingConference contribution

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.

Original languageEnglish (US)
Title of host publicationEighth Annu Int Phoenix Conf Comput Commun 1989 Conf Proc
Editors Anon
Place of PublicationPiscataway, NJ, United States
PublisherPubl by IEEE
Pages606-610
Number of pages5
StatePublished - 1989
EventEighth Annual International Phoenix Conference on Computers and Communications - 1989 Conference Proceedings - Scottsdale, AZ, USA
Duration: Mar 22 1989Mar 24 1989

Other

OtherEighth Annual International Phoenix Conference on Computers and Communications - 1989 Conference Proceedings
CityScottsdale, AZ, USA
Period3/22/893/24/89

ASJC Scopus subject areas

  • Engineering(all)

Fingerprint Dive into the research topics of 'Improvements on the evaluation of declarative specifications'. Together they form a unique fingerprint.

  • Cite this

    Dietrich, S. (1989). Improvements on the evaluation of declarative specifications. In Anon (Ed.), Eighth Annu Int Phoenix Conf Comput Commun 1989 Conf Proc (pp. 606-610). Publ by IEEE.