Efficient Tabling Mechanisms for Logic Programs (1995)
| Venue: | PROCEEDINGS OF THE 12TH INTERNATIONAL CONFERENCE ON LOGIC PROGRAMMING |
| Citations: | 40 - 7 self |
BibTeX
@INPROCEEDINGS{Ramakrishnan95efficienttabling,
author = {I. V. Ramakrishnan and Prasad Rao and Konstantinos Sagonas and Terrance Swift and David S. Warren},
title = {Efficient Tabling Mechanisms for Logic Programs},
booktitle = {PROCEEDINGS OF THE 12TH INTERNATIONAL CONFERENCE ON LOGIC PROGRAMMING},
year = {1995},
pages = {697--711},
publisher = {The MIT Press}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
The use of tabling in logic programming allows bottom-up evaluation to be incorporated in a top-down framework, combining advantages that accrue from both. At the engine level, tabling also introduces complications not present in pure top-down evaluation, due to the need for subgoals and answers to access tables during clause resolution. This paper describes the design, implementation, and experimental evaluation of data structures and algorithms for highperformance table access. Our approach uses tries as the basis for tables. Tries provide complete discrimination for terms, and permit a lookup and possible insertion to be performed in a single pass through a term. A novel technique of substitution factoring is also proposed. When substitution factoring is used in conjunction with tries, the access cost for answers is proportional to the size of the answer substitution, rather than to the size of the answer itself. As a special case, the access cost of answers to a datalog query is pr...
