EXTENSION TABLES: MEMO RELATIONS IN LOGIC PROGRAMMING.

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

70 Scopus citations

Abstract

A useful optimization technique called memoization that uses a dynamic programming approach to computation in which intermediate results are saved and later reused to avoid redundant work is presented. The application of this principle to Horn-clause programming is explored. The table in which the intermediate results of computation are saved is known as an extension table since the set of tuples that satisfy a predicate, its extension, is stored in the table. Because of the nondeterminism in logic programming, an extension-table facility improves the termination and completeness characteristics of depth-first evaluation methods in the presence of recursion, and thus the consequences of memoizing in a relational system are much more far-reaching than in functional environments.

Original languageEnglish (US)
Title of host publicationUnknown Host Publication Title
PublisherIEEE
Pages264-272
Number of pages9
ISBN (Print)0818607998
StatePublished - Dec 1 1987
Externally publishedYes

ASJC Scopus subject areas

  • Engineering(all)

Fingerprint Dive into the research topics of 'EXTENSION TABLES: MEMO RELATIONS IN LOGIC PROGRAMMING.'. Together they form a unique fingerprint.

Cite this