Search
Now showing items 1-9 of 9
On the Power of Magic
(University of Wisconsin-Madison Department of Computer Sciences, 1988)
An Amateur's Introduction to Recursive Query Processing Strategies
(University of Wisconsin-Madison Department of Computer Sciences, 1988)
Abstract: Magic Templates: A Spellbinding Approach to Logic Programs
(University of Wisconsin-Madison Department of Computer Sciences, 1988)
Deja Vu in Fixpoints of Logic Programs
(University of Wisconsin-Madison Department of Computer Sciences, 1989)
We investigate properties of logic programs that permit refinements in their fixpoint evaluation and shed light on the choice of control strategy. A fundamental aspect of a bottom-up computation is that we must constantly ...
Optimizing Existential Datalog Queries
(University of Wisconsin-Madison Department of Computer Sciences, 1988)
Parallelism in Logic Programs
(University of Wisconsin-Madison Department of Computer Sciences, 1989)
There is a tension between the objectives of avoiding irrelevant computation and extracting parallelism, in that a computational step used to restrict another must precede the latter. Our thesis, following [BeR87], is ...
A Framework for Testing Safety and Effective Computability of Extended Datalog
(University of Wisconsin-Madison Department of Computer Sciences, 1988)
Efficient Transitive Closure Algorithms
(University of Wisconsin-Madison Department of Computer Sciences, 1988)
A Unified Approach to Logic Program Evaluation
(University of Wisconsin-Madison Department of Computer Sciences, 1989)
The Prolog evaluation algorithm has become the standard for logic program evaluation, and bottom-up methods have long been considered impractical because they compute irrelevant facts. Recently, however, bottom-up evaluation ...









