M. Kifer and E. Lozinskii, "Implementing Logic Programs As a Database System, " Proc. Intl. Conf. on Data Engineering, 1987. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Magic Templates: A Spellbinding Approach to Logic Programs - Ramakrishnan (1988) (87 citations) (Correct)
....that the head fact must be ground since every head variable appears in the body, and is thus bound to a ground term. The notion of nonground facts is standard in the logic programming literature. To our knowledge, however, the first use of such facts in the deductive database literature is in [KL87]. In that paper, Kifer and Lozinskii present an evaluation method called Sygraf, and allow rules that are not range restricted, with the objective of dealing with general logic programs. The method does not always fully restrict the search, but it should be possible to combine the ideas with more ....
....the bottom up computation terminated due to its duplicate elimination or because the only answer had been generated. In this case, the computation mimics Prolog all too faithfully. We do not consider how to test whether bottom up evaluation terminates on a given program. We refer the reader to [APPRSU86, KL87, KRS88] for some work on this problem. 7. Constraint Logic Programming We now describe how Constraint Logic Programming (CLP) can be implemented using the bottom up approach we described in earlier sections. The ability to deal with rules that are not range restricted is crucial. Given this ability, ....
M. Kifer and E. Lozinskii, "Implementing Logic Programs As a Database System, " Proc. Intl. Conf. on Data Engineering, 1987.
Fully Distributed, AND/OR Parallel Execution of Logic Programs - Raman, Stark (1988) (Correct)
....new set of alternatives for the AND node. 1.2 Related Work We classify previous work in parallel interpreters for logic programs on the basis of the ANDparallelism each supports. In [CK85, LM86, Kal86] AND parallelism is restricted to independent goals (those that do not share variables) In [Wis86, KL87] AND goals are evaluated bottom up without any exchange of information between the AND parallel goals. The committed choice languages of [CG86, Sha83] evaluate AND goals in parallel with bidirectional exchange of information through shared variables, but eliminate OR parallelism by having each ....
....[LM86] are incomplete, the authors claims to the contrary notwithstanding. In [Kal86] Kale has given a modified version, which is apparently complete. In [CDD85, Her86] it is shown how the expense of maintaining the dependency graphs can be reduced by compile time preprocessing. In [Wis86] and [KL87], AND parallelism is supported by computing answers in a bottom up fashion, and merging answer sets for separate conjuncts to resolve conflicting bindings for shared variables. Whereas [KL87] merges the answers incrementally, Wis86] does not merge the answers until one of the conjuncts has ....
[Article contains additional citation context not shown here]
Michael Kifer and E. Lozinskii. Implementing logic programs as a database system. In Third International Conference on Data Engineering, February 1987.
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