C. Zaniolo. Design and implementation of a logic based language for data intensive applications. In Proc. Int. Conf. on Logic Programming, 1988. 10  Home/Search   Document Not in Database   Summary   Related Articles   Check

.... to stored data: qf The query forms are generic goals in that they specify which arguments represent input parameters (covered variables, indicated by a preceding sign) and which are expected as output (free variables) These bindings are essential for the efficient compilation of the rule set [35]. The important difference to logic programming systems like Prolog is that in SALAD the facts are treated differently from the rules, they are described by the schema at compilation time. Therefore, any update can be performed freely without the need for recompiling or reinterpreting the program ....

C. Zaniolo. Design and Implementation of a Logic Based Language for Data Intensive Applications. Proc. Intl. Conf. Logic Programming, 1988.

....and possesses a fine relaxed stratification. This implies that good programming practices in DeReS require that the programmer submits (if possible) a theory with these desirable properties. From this perspective, DeReS is not much different from other declarative languages such as Prolog or LDL[Zan88] That is, the programmer writes a declarative program, but the ease with 32 hamilton.board n; 2; 0; 0; 1; 0; 0 , one solution n jDj NCPP time f time l time a 2 13 260 0.02 0.01 0.01 3 21 5248 0.55 0.11 0.01 4 29 121371 16.92 2.56 0.30 5 37 2598270 488.29 65.32 5.67 6 45 52139039 2 hrs: ....

C. Zaniolo. Design and implementation of logic based language for data intensive applications. In International Conference om Logic Programming, Cambridge, MA, 1988. MIT Press. 37

....c 4 g] or [a = c 1 ; b = ffc 2 ; c 3 g; fc 3 ; c 4 gg] Each tuple is resulted by a set union or a set of (set grouping) operations respectively. 37 While an (extended) NF 2 model[Dadam et al. 86, Schk and Weikum 86] employs the second semantics, Verso model[Verso 86] employs the first. LDL [Zaniolo 88] is also considered as the second case. We take the first, and give the semantics of a nested tuple as a set of only column nested tuples, which is independent of row nest and row unnest operation. Under the semantics, we can omit f and g in the case of a singleton set. There is the following ....

....is useful in the construction of a knowledge base or in thought experiment or trial and error type query processing. 3.3. 6 Other Features Here, we list some more features of QUIXOT E: ffl Assertion and deletion of extensional objects and properties during query processing are supported as in [Zaniolo 88] These are controlled by the same uniform nested transaction logic used in hypothetical reasoning. However, note that the subsumption relation and submodule relation may not be updated during query processing, because the change in their inheritance might destroy the soundness of the derivation, ....

Carlo Zaniolo, "Design and Implementation of a Logic Based Languages for Data Intensive Applications", Proc. International Conference and Symposium on Logic Programming (LP'88), 1988.

....and discuss research perspectives on new databases. 5.1 Other Extensions Research on extensions of DDBs has been spreading from various points of view. We describe some approaches. ffl Other Logic Programming Languages Based on Extended Terms As other extensions of DDBs, there are LDL [25] , which introduces set grouping into logic programming, COL [1] which manipulates complex objects, and CRL [23] which works on nested relations. Furthermore, along with O logic and F logic, HiLog [10] is proposed. The syntax of the language is higher order, while the semantics is ....

C. Zaniolo, "Design and Implementation of a Logic Based Language for Data Intensive Applications", Proc. LP, pp. 1666-1687, Seattle, 1988.

.... of SALAD The query forms are generic goals in that they specify which arguments represent input parameters (covered variables, indicated by a preceding sign) and which are expected as output (free variables) These bindings are essential for the efficient compilation of the rule set [Zaniolo88]. The important difference to logic programming systems like Prolog is that in SALAD the facts are treated differently from the rules, they are described by the schema at compilation time. Therefore, any update can be performed freely without the need for recompiling or reinterpreting the program ....

C. Zaniolo; Design and Implementation of a Logic Based Language for Data Intensive Applications; Proc. Int. Conf. Logic Programming; 1988

....a tuple a and a constraint c, it is not possible to say whether chosen(a; c) will return true or false. The truth value of this predicate not only depends on its attributes but also depends on the other tuples in the relation. The notion of a choice predicate is due to Zaniolo and his co workers [10, 14] and was originally used for characterizing the semantics of nonmonotonic negation in deductive databases. In contrast, our use of this construct is to enable the resolution of inconsistencies in a multidatabase setting. Hence, tuple a will go to the result if and only if all the following ....

....using the federated approach is content in Sheth and Larson [11] It is instructive to note that this survey does not specify what to do when integrity constraints are violated. We should mention that the idea behind CHOICE SELECT and CHOICE JOIN was motivated, in part, by work by Zaniolo [14, 10] and his colleagues on nondeterministic choices in logic programming languages. The idea in their work was that in logic database languages, one may often wish to express the fact that one out of several possible ways of satisfying an atom is nondeterministically selected. This is then used by ....

C. Zaniolo. (1988) Design and Implementation of a Logic-based Language for Data-Intensive Applications, Proc. of the International Conference on Logic Programming (eds. K. Bowen and R. Kowalski), pps 1666-1687, MIT Press.

....databases [Rei84] and the first survey of the field appeared [GMN84] The area has been developing rapidly during the following years. In particular, the first comprehensive book on the subject [Ull88] has been recently published and implementation of large experimental deductive database systems [MUG86, Zan88] has begun. More information on the historical perspective of the field can be found in [Min88b] Logic programming was introduced in the early 1970 s by Colmerauer [CKRP73] and Kowalski [Kow74] and the first Prolog interpreter was implemented by Roussel in 1972 [Rou75] Logic programming ....

....unique perfect model of the program P 4 discussed in Example 6.3 consists of: fbird(tweety) f ly(tweety)g; leading to the expected intended semantics. The perfect model semantics is actually used in two large experimental deductive database systems, namely in the LDL system, implemented at MCC [Zan88], and in the NAIL system, which is currently under development at Stanford [MUG86] 6.3.1 Perfect Models As Iterated Fixed Points and Iterated Least Models Least models of positive programs have been characterized as fixed points of the Van Emden Kowalski operator. It turns out that perfect ....

C. Zaniolo. Design and implementation of logic-based language for data intensive applications. In R. Kowalski and K. Bowen, editors, Proceedings of the Fifth Logic Programming Symposium, pages 1666-- 1688, Cambridge, Mass., 1988. Association for Logic Programming, MIT Press.

....frequently confronted with the problem of how to represent complex data such as complex objects and partial information, as a predicate in Prolog. To cope with the problem, new constructors, such as tuples and sets, and their corresponding functions are introduced into logic programming as in LDL [28] and COL [1] Also in our environment, we developed a nested relational database management system, Kappa, a corresponding logic programming language, CRL, and a partial information based logic programming language, CIL, for such applications [26] However, our attempts to represent more kinds of ....

....is useful in the construction of a knowledgebase or in thinking experiment or trial and error type query processing. 4. 3 Other Features Here, we list some more features of QUIXOT E: 1) Assertion and deletion of extensional objects and properties during query processing are supported as in [28]. These are controlled by the same uniform nested transaction logic used in hypothetical reasoning. However, note that the subsumption relation and submodule relation may not be updated during query processing, because the change in their inheritance might destroy the soundness of the derivation, ....

C. Zaniolo, "Design and Implementation of a Logic Based Languages for Data Intensive Applications", Proc. Int. Conf. and Symp. on Logic Programming, 1988.

.... SLS resolution (SL resolution for Stratified programs) Prz88b] which extends SLD resolution (SL resolution for Definite (positive) programs) ffl The perfect model semantics is actually used in two large experimental deductive database systems, namely in the LDL system, implemented at MCC [Zan88], and in NAIL , which is currently under development at Stanford [MUG86] 5.2 Equivalence to Non Monotonic Formalisms The perfect model semantics has one more very important property. It has been shown (see [Prz88a] for an overview) that for stratified programs the perfect model semantics is ....

C. Zaniolo. Design and implementation of logic-based language for data intensive applications. In R. Kowalski and K. Bowen, editors, Proceedings of the Fifth Logic Programming Symposium, pages 1666--1688, Association for Logic Programming, MIT Press, Cambridge, Mass., 1988.

.... respect to a natural priority relation [Prz88a, Prz89b] As a result, the perfect model semantics is not only very intuitive, but it also has been proven equivalent to suitable forms of all four major formalizations of non monotonic reasoning in AI (see [Prz88b] and is used in existing database [Zan88] and truth maintenance systems. Additionally, the perfect model semantics eliminates some serious drawbacks of Clark s semantics [Prz89b] and admits a natural sound and complete procedural mechanism, called SLSresolution [Prz89b] One of the drawbacks of the perfect model semantics, however, was ....

C. Zaniolo. Design and implementation of logic-based language for data intensive applications. In R. Kowalski and K. Bowen, editors, Proceedings of the Fifth Logic Programming Symposium, pages 1666--1688, Cambridge, Mass., 1988. Association for Logic Programming, MIT Press.

....a tuple a and a constraint c, it is not possible to say whether chosen(a; c) will return true or false. The truth value of this predicate not only depends on its attributes but also depends on the other tuples in the relation. The notion of a choice predicate is due to Zaniolo and his co workers [10, 14] and was originally used for characterizing the semantics of nonmonotonic negation in deductive databases. In contrast, our use of this construct is to enable the resolution of inconsistencies in a multidatabase setting. Hence, tuple a will go to the result if and only if all the following ....

....schemes using the federated approach is content in Sheth and Larson [11] It is instructive to note that this survey does not specify what to do when integrity constraints are violated. We should mention that the idea behind CHOICE SELECT and CHOICE JOIN was motivated, in part, by work by Zaniolo [14, 10] and his colleagues on nondeterministic choices in logic programming languages. The idea in their work was that in logic database languages, one may often wish to express the fact that one out of several possible ways of satisfying an atom is nondeterministically selected. This is then used by ....

C. Zaniolo. (1988) Design and Implementation of a Logic-based Language for Data-Intensive Applications, Proc. of the International Conference on Logic Programming (eds. K. Bowen and R. Kowalski), pps 1666-1687, MIT Press.

....arc from x to y marked (exit, r) if there exists a ground adorned rule r : p(x, y) e(b) such that e(b) D. The query graph G associated with a program can be partitioned into the three subgraphs GL , GR and GE containing the arcs left, right and exit respectively. The choice construct of [19, 11], can be used to enforce functional constraints in rules. Thus, a goal of the form, choice(X, Y) in a rule r denotes that any consequence derived from r must respect the FD X Y . In general, X can be a vector of variables possibly an empty one denoted by ( and Y is a vector of one ....

....1 , B) B : c p( r 2 , X] A) down2(Y 1 , Y, X) Observe that here when we compute the predicate B : c p( the variable B is bound and this corresponds to a direct access to the memory. Thus, the method is very similar to the Bushy Depth First method used in the implementation of LDL [19]. Notice also that the shared variables which appear also in the head could be omitted from the list of share variables since they appear also in the predicate pushdown appearing in the body of modified rules. 3.2 Cyclic Databases The counting method is unsafe if the left part of the query graph ....

C. Zaniolo. Design and implementation of a logic based language for data intensive applications. In Proc. Int. Conf. on Logic Programming, 1988. 10

....[ TN (least(K) Hence, K n L = K L. Hence step 2 can now be rewritten as: step 2: K : min( K L) H I n (L [ L) L : L [ L; A : least(K) The semi naive greedy xpoint procedure thus derived is conducive to ecient implementation, within the architectural framework of deductive databases [27]. We can assume that sets of facts are implemented via index based structures, whereby operations such as variable assignment and set membership can be performed in constant time. To ensure the eciency of step 2, both the operations, n and least must be performed eciently. The rst operation can ....

C. Zaniolo. Design and implementation of a logic based language for data intensive applications. In Proceedings of the International Conference on Logic Programming, 1988. 31

No context found.

Carlo Zaniolo. "Design and Implementation of a Logic Based Language for Data Intensive Applications." In Proceeding of the International Conference on Logic Programming, 1988.

....value equivalent tuples timestamped with different maximal periods (thus violating the BCDM data model) This paper is organized as follows: Section 2 introduces a new approach of querying temporal databases. In Section 3 the Temporal Data Language (TDL) is introduced as an extension of LDL [Zan88, NT89]; the previous six TSQL2 examples are then reexpressed in TDL. Then, Section 4 discusses the semantics and universality for TDL, and Section 5 proposes various implementation approaches for TDL. Section 6 concludes the paper. 126 2 A New Approach The previous examples provide a simplified ....

C. Zaniolo. Design and Implementation of a Logic Based Language for Data Intensive Applications. In Proceedings of the International Conference on Logic Programming, 1988

.... akin to ADT methods defined using a procedural language and then imported into the SQL3 system (languages with data types compatible with SQL, such as Oracle PL SQL and JDBC represent natural candidates for this task) The LDL LDL System The logical data language LDL , developed at MCC [LDL, Zan88] supports userdefined aggregates. In LDL , an aggregate function f on a set S, can be introduced via the following inductive definition: 1. Base: the value f(fxg) on a singleton set must be defined in terms of x, 2. Induction: for any other set S 0 = S t fxg the value of f(S 0 ) must be ....

Carlo Zaniolo. "Design and Implementation of a Logic Based Language for Data Intensive Applications." In Proceeding of the International Conference on Logic Programming, 1988.

....a initialize routine that gives an initial value to the aggregate ffl an iterate routine yielding a new value for each new record in the table ffl a terminate routine that returns the final value computed for the aggregate. The LDL LDL System The logical data language LDL , developed at MCC [9,33] supports user defined aggregates. In LDL , an aggregate function f on a set S, can be introduced via the following inductive definition: 1. Base: the value f(fxg) on a singleton set must be defined in terms of x, 2. Induction: for any other set S 0 = S t fxg the value of f(S 0 ) must be ....

Carlo Zaniolo. "Design and Implementation of a Logic Based Language for Data Intensive Applications." In Proceeding of the International Conference on Logic Programming, 1988.

No context found.

C. Zaniolo. (1988) Design and Implementation of a Logic-based Language for DataIntensive Applications, Proc. of the International Conference on Logic Programming (eds. K. Bowen and R. Kowalski), pps 1666-1687, MIT Press. 28

No context found.

C. Zaniolo. (1988) Design and Implementation of a Logic-based Language for DataIntensive Applications, Proc. of the International Conference on Logic Programming (eds. K. Bowen and R. Kowalski), pps 1666-1687, MIT Press.

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