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

Fingerprint

Specifications

ASJC Scopus subject areas

  • Engineering(all)

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). Piscataway, NJ, United States: Publ by IEEE.

Improvements on the evaluation of declarative specifications. / Dietrich, Suzanne.

Eighth Annu Int Phoenix Conf Comput Commun 1989 Conf Proc. ed. / Anon. Piscataway, NJ, United States : Publ by IEEE, 1989. p. 606-610.

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

Dietrich, S 1989, Improvements on the evaluation of declarative specifications. in Anon (ed.), Eighth Annu Int Phoenix Conf Comput Commun 1989 Conf Proc. Publ by IEEE, Piscataway, NJ, United States, pp. 606-610, Eighth Annual International Phoenix Conference on Computers and Communications - 1989 Conference Proceedings, Scottsdale, AZ, USA, 3/22/89.
Dietrich S. Improvements on the evaluation of declarative specifications. In Anon, editor, Eighth Annu Int Phoenix Conf Comput Commun 1989 Conf Proc. Piscataway, NJ, United States: Publ by IEEE. 1989. p. 606-610
Dietrich, Suzanne. / Improvements on the evaluation of declarative specifications. Eighth Annu Int Phoenix Conf Comput Commun 1989 Conf Proc. editor / Anon. Piscataway, NJ, United States : Publ by IEEE, 1989. pp. 606-610
@inproceedings{6ab3c00eec254b84940edd5354d00236,
title = "Improvements on the evaluation of declarative specifications",
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.",
author = "Suzanne Dietrich",
year = "1989",
language = "English (US)",
pages = "606--610",
editor = "Anon",
booktitle = "Eighth Annu Int Phoenix Conf Comput Commun 1989 Conf Proc",
publisher = "Publ by IEEE",

}

TY - GEN

T1 - Improvements on the evaluation of declarative specifications

AU - Dietrich, Suzanne

PY - 1989

Y1 - 1989

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=0024877765&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0024877765&partnerID=8YFLogxK

M3 - Conference contribution

AN - SCOPUS:0024877765

SP - 606

EP - 610

BT - Eighth Annu Int Phoenix Conf Comput Commun 1989 Conf Proc

A2 - Anon, null

PB - Publ by IEEE

CY - Piscataway, NJ, United States

ER -