Z. Somogyi, D. Kemp, J. Harland, and K. Ramamohanarao. Subsumption-free bottom-up evaluation of logic programs with partially instantiated data structures. Technical Report 93/26, Department of Computer Science, University of Melbourne, Melbourne, Australia, 1993. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Implementation of Constraint Database Systems Using a.. - Gross-Brunschwiler (1996) (Correct)
....W ut91] The original definition of Ceri at al. CGT90, p.82] does not consider quantification. Common in all definitions is the idea that a ground term will be assigned to every variable during query evaluation. This can take place by unification with a ground argument 1 Somogyi et al. SKHR94] denote it as superhomogeneous from 12 CHAPTER 2. DEDUCTIVE DATABASE SYSTEMS of a positive predicate or by explicit assignment of a ground term. A synthesis of the three mentioned definitions which is based on or free part normal form is given in [B oh94, p.22f] Surveys on domain independence ....
Zoltan Somogyi, David Kemp, James Harland, and Kotagiri Ramamohanarao. Subsumption-free bottom-up evaluation of logic programs with partially instantiated data structures. In Proc. 4th Int. Conf. on Extending Database Technology (EDBT), pages 59--72, Cambridge, United Kingdom, March 1994. LNCS 779, Springer Verlag.
Subsumption-Free Bottom-Up Evaluation of Logic.. - Somogyi, Kemp.. (1994) (1 citation) Self-citation (Somogyi Kemp Harland Ramamohanarao) (Correct)
....and types as necessary background for the description of our mode system, which follows in Section 3. In section 4, we show how to transform mode correct programs for bottom up evaluation, which, as we prove in section 5, does not need subsumption. The proofs of our theorems are available in [8]. 2 Selectors and types 2.1 Selectors Definition 2.1 A term is defined as follows: a variable X is a term, and if f is a function symbol of n arguments (n 0) and t 1 ; t n are terms, then f(t 1 ; t n ) is a term. A function symbol of arity 0 is a constant. A term that is not a ....
....in which data flows two ways have to be split into two or more unifications in which data flows one way, one for each instantiation state to be achieved. The first unification in the second clause of iota2 binds T0 while the second binds L2. The details of the algorithm can be found in [8]. 4.2 The magic set transformation Naive bottom up evaluation of logic programs does not make use of data provided in the query and is therefore very inefficient. The magic set transformation is the standard technique for restricting the set of tuples generated to the ones actually relevant to ....
[Article contains additional citation context not shown here]
Z. Somogyi, D. Kemp, J. Harland, and K. Ramamohanarao. Subsumption-free bottom-up evaluation of logic programs with partially instantiated data structures. Technical Report 93/26, Department of Computer Science, University of Melbourne, Melbourne, Australia, 1993.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC