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 language | English (US) |
|---|---|
| Title of host publication | Eighth Annu Int Phoenix Conf Comput Commun 1989 Conf Proc |
| Editors | Anon |
| Place of Publication | Piscataway, NJ, United States |
| Publisher | Publ by IEEE |
| Pages | 606-610 |
| Number of pages | 5 |
| State | Published - 1989 |
| Event | Eighth Annual International Phoenix Conference on Computers and Communications - 1989 Conference Proceedings - Scottsdale, AZ, USA Duration: Mar 22 1989 → Mar 24 1989 |
Other
| Other | Eighth Annual International Phoenix Conference on Computers and Communications - 1989 Conference Proceedings |
|---|---|
| City | Scottsdale, AZ, USA |
| Period | 3/22/89 → 3/24/89 |
ASJC Scopus subject areas
- General Engineering