Tabled Evaluation with Delaying for General Logic Programs (1996)
Cached
Download Links
- [ftp.ms.uky.edu]
- [www.seas.smu.edu]
- [ftp.cs.sunysb.edu]
- DBLP
Other Repositories/Bibliography
| Citations: | 226 - 26 self |
BibTeX
@MISC{Chen96tabledevaluation,
author = {Weidong Chen and David S. Warren},
title = {Tabled Evaluation with Delaying for General Logic Programs},
year = {1996}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
SLD resolution with negation as finite failure (SLDNF) reflects the procedural interpretation of predicate calculus as a programming language and forms the computational basis for Prolog systems. Despite its advantages for stack-based memory management, SLDNF is often not appropriate for query evaluation for three reasons: a) it may not terminate due to infinite positive recursion; b) it may not terminate due to infinite recursion through negation; c) it may repeatedly evaluate the same literal in a rule body, leading to unacceptable performance. We address three problems fir a goal-oriented query evaluation of general logic programs by presenting tabled evaluation with delaying (SLG resolution).
