Yehoshua Sagiv. On testing effective computability of magic programs. In C. Delobel, M. Kifer, and Y. Masunaga, editors, Proceedings of the Second International Conference on Deductive and Object-Oriented Databases, Munich, Germany., pages 244--262, 1991. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Logic and Databases - Eder (Correct)
....optimization techniques. Important evaluation techniques are the seminaive evaluation (or differential fixpoint evaluation) GKB87, HQC88] the method of Henschen and Naqvi [HN84] and the Query Subquery algorithm [Vie86, Vie88] The most renowned optimization algorithms include the Magic Set method [BMSU86, BR87, Ram88, Sag91], the Counting method [SZ88] and Static Filtering [KL86] 3.3 Extensions of Pure Datalog An important extension of pure Datalog is the use of negation in rule bodies. With this extensions Datalog no longer requires all clauses to be Horn clauses. A drawback of the use of negation is that a ....
Y. Sagiv. On testing effective computability of Magic programs. In C. Delobel, M Kiferd Y. Masunaga, editors, Proc. 2nd Int. Conf. Deductive and ObjectOriented Databases, volume 566 of LNCS. Springer Verlag, 1991.
Chain-Split Evaluation in Deductive Databases - Han (1995) (3 citations) (Correct)
....arity n is transformed to a predicate of arity n 1, with the last argument representing the functional variable. For example, V = f(X 1 ; Delta Delta Delta ; X k ) is transformed to f(X 1 ; Delta Delta Delta ; X k ; V ) A similar transformation has also been discussed by other researchers [12, 15, 17]. Since the transformation maps a functional logical rule to a function free one, the analysis of a functional recursion can be performed in the framework of a function free one. Notice that the transformation converts constructors to predicates. Since constructors mainly serve as constraints ....
Y. Sagiv. On testing effective computability of magic programs. In Proc. of 2nd Int. Conf. on Deductive and Object-Oriented Databases, pages 244--262, Munich, Germany, Dec. 1991.
On the Decidability and Axiomatization of Query Finiteness in.. - Kifer (1998) (Correct)
....and finiteness constraints (abbr. FC s) It is generally agreed now that this abstraction is a useful tool for studying the problems of finiteness and computability when function symbols must be taken into account. The interest in finiteness constraints was further stimulated by the works [30, 20, 17] that showed that the knowledge of certain FC s over some database predicates may help prove that the query is evaluable by a bottom up algorithm in a finite number of steps. These studies, thus, suggest that algorithms for FC inference may become an important part of query processing. The first ....
....symbols. The reader is referred to [38, 39] for the introductory material on deductive databases. Most of this paper is concerned with Extended Datalog. Extended Datalog was introduced in [26] as an approximation of Datalog with function symbols 4 and has been extensively studied since then [32, 16, 4, 31, 30]. The interest in this approximation is fueled primarily by the fact that finiteness and computability of Extended Datalog queries is easier to study, and the corresponding algorithms can be converted into sufficient tests for finiteness and termination of queries over Horn databases with function ....
[Article contains additional citation context not shown here]
Y. Sagiv. On testing effective computability of magic programs. In Intl. Conference on Deductive and Object-Oriented Databases, pages 244--262, December 1991.
Speeding Up Inferences Using Relevance - Reasoning Formalism And Self-citation (Sagiv) (Correct)
No context found.
Yehoshua Sagiv. On testing effective computability of magic programs. In C. Delobel, M. Kifer, and Y. Masunaga, editors, Proceedings of the Second International Conference on Deductive and Object-Oriented Databases, Munich, Germany., pages 244--262, 1991.
Monotonic Aggregation in Deductive Databases - Ross, Sagiv (1992) (56 citations) Self-citation (Sagiv) (Correct)
....a minimal element always exists, being the greatest lower bound of all elements of the lattice. 2.3.3 Safety Safety is needed to guarantee finiteness of the result. However, safety (as defined below) cannot guarantee termination of a bottom up evaluation. Methods for detecting termination (e.g. [4, 14, 13]) may be used for that purpose. In addition to negative subgoals and built in subgoals, there are two other cases of subgoals that may have infinitely many ground instances that are satisfied (with respect to a given interpretation) One case is aggregate subgoals that uses the = form, since in ....
Y. Sagiv. On testing effective computability of magic programs. In C. Delobel, M. Kifer, and Y. Masunaga, editors, Proceedings of the Second International Conference on Deductive and Object-Oriented Databases, pages 244--262. Springer-Verlag, LNCS 566, 1991.
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