Efficient Bottom-Up Evaluation Of Logic Programs (1992)
| Venue: | THE STATE OF THE ART IN COMPUTER SYSTEMS AND SOFTWARE ENGINEERING |
| Citations: | 42 - 4 self |
BibTeX
@INPROCEEDINGS{Ramakrishnan92efficientbottom-up,
author = {Raghu Ramakrishnan and Divesh Srivastava and S. Sudarshan},
title = {Efficient Bottom-Up Evaluation Of Logic Programs},
booktitle = {THE STATE OF THE ART IN COMPUTER SYSTEMS AND SOFTWARE ENGINEERING},
year = {1992},
pages = {640--700},
publisher = {Kluwer Academic Publishers}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
In recent years, much work has been directed towards evaluating logic programs and queries on deductive databases by using an iterative bottom-up fixpoint computation. The resulting techniques offer an attractive alternative to Prolog-style top-down evaluation in several situations. They are sound and complete for positive Horn clause programs, are well-suited to applications with large volumes of data (facts), and can support a variety of extensions to the standard logic programming paradigm. We present the basics of database query evaluation and logic programming evaluation, and then discuss bottom-up fixpoint evaluation. We discuss an approach based upon using a program transformation ("Magic Templates") to restrict search, followed by fixpoint computation using a technique ("Semi-naive evaluation") that avoids repeated inferences. The program transformation technique focuses the fixpoint evaluation, which is a forward-chaining strategy, by propagating bindings in the goal in a ma...
