Subrata Kumar Das. Deductive Databases and Logic Programming. Addison-Wesley, Wokingham, 1992.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....process over deductive databases is tractable and has been extensively studied in both a bottom up and a top down direction [3] In this paper, a query evaluation algorithm over deductive databases is assumed and referred to as deduce. Any one of many such algorithms described in the literature [3, 5, 13] may serve as a denotation for deduce. Thus, the remainder of the paper assumes to be well de ned an expression such as A : deduce(Q; IDB;EDB) that assigns to A the answer to a query Q over a deductive database IDB [ EDB. Inductive logic programming (ILP) 17] can be seen as an approach to ....

....implemented in Prolog. The prototype implements the algorithm in Figure 2 and, with additional performance improvements, the policies in Figure 3 on top of a service layer that enables storage and retrieval of Datalog clauses. For the deductive function, it uses the deductive database described in [5], while, for the inductive function, it uses the implementation of mFOIL described in [10] The architecture of the prototype separates, via wellde ned call interfaces, inference functions and policies, so that their replacement can be carried out non disruptively and all other parts of the ....

Subrata Kumar Das, Deductive Databases and Logic Programming, Addison Wesley, 1992.

....logic programs. We discuss how the de nition can be extended to evaluation of normal logic programs under well founded semantics. 2.0.0. 2 Notational Conventions: Weuse# to denote logic programs; HB(# ) #(# ) #(# ) to denote the Herbrand Base and least Herbrand model and perfect model of # [9] respectively; # and # to denote atoms or literals; # to denote a set of atoms or literals; # to denote a conjunction of atoms (a goal is a conjunction of atoms) or literals; # to denote substitutions; # to denote atom subsumption (# # # for # subsumes #) and # to denote a clause in a program. ....

Subrata K. Das. Deductive Databases and Logic Programming. Addison-Wesley, 1992.

....logic programs. We discuss how the de nition can be extended to evaluation of normal logic programs under well founded semantics. 2.0.0. 2 Notational Conventions: We use P to denote logic programs; HB(P ) M(P ) M(P ) to denote the Herbrand Base and least Herbrand model and perfect model of P [9] respectively; A and B to denote atoms or literals; to denote a set of atoms or literals; to denote a conjunction of atoms (a goal is a conjunction of atoms) or literals; to denote substitutions; to denote atom subsumption (A B for A subsumes B) and C to denote a clause in a program. ....

Subrata K. Das. Deductive Databases and Logic Programming. Addison-Wesley, 1992.

....overall beliefs as long as they are not used for immediate reasoning needs. The sequence of belief change can then be used as the basis for the consistency recovery processes when resources become available. Another area of application is: for any given set of beliefs such as a deductive database [Das, 1992] that is arbitrarily contradictory, if it can be represented by a NLBN and a particular sequence on the set of all base nodes is followed, an exhaustive lazy consistency reasoning process can always extract a G consistent set of beliefs out of it (a consistent theory) As different passes of lazy ....

.... (t and f) using some kinds of closed world assumptions [Minker, 1982] This provides an efficient way for information storage and processing because only positive information (or negative information) needs to be kept and the default opposite information can always be inferred by the assumptions [Das, 1992; Zdonik and Maier, 1990] But for open domain reasoning such as your belief status about John s bank account or any other beliefs, a general closed world assumption approach is not applicable to all beliefs and no information usually implies an unknown belief. Needless to say, unknown beliefs are ....

Subrata Kumar Das. Deductive Databases and Logic Programming. AddisonWesley, Reading, Massachusetts, 1992.

....in that traditional approaches are based only on knowledge of data structures and physical organization, such as access paths and the query itself (in relational databases) Jarke and Koch [11] present techniques for traditional query optimization in relational databases. Deductive databases [7, 20], stemming from logic programming paradigm, provide a database theory and a query language that are more powerful than those for standard relational databases. Moreover, deductive databases provide a uniform representation formalism (in terms of clause form) for expressing database components; ....

....giving rise to the deductive object oriented data model [12] The scope of this paper is deductive relational databases. The definitions of the main concepts of deductive (relational) database model are given below. More elaborate treatment can be found in Lloyd [20] Ceri et al. 4] and Das [7]. Definition 2.1 (Database Clause) A database clause, representing either fact or deductive rule, is a first order clause without function symbol. Database) clauses are formulas of the general form below: a 1 : am p 1 : p n m 1; n 0 where each a i is an atom and each p j is a ....

[Article contains additional citation context not shown here]

Subrata Kumar Das. Deductive Databases and Logic Programming. Addison-Wesley, 1992.

....in section 4. Section 5 describes the consequences of the architecture for the development of large scale, data intensive applications, and section 6 presents some general conclusions. In section 4 acquaintance with object oriented and deductive notions is assumed at the level of [18] and [11], respectively. 2 Related Work This section compares a number of alternative approaches to the development of database systems which are intended to support application development, and in particular those approaches which utilise some form of object oriented data model. One of the major goals of ....

Subrata Kumar Das. Deductive Databases and Logic Programming. Addison-Wesley Publ. Co., Wokingham, England, 1992. ISBN 0-201-56897-7.

....relation parent. The word ancestor in this case can be translated in theoretically an infinite number of ways. An intelligent database engine can provide the additional relation ancestor derived from the relation parent. Examples of such an intelligent database engines are deductive databases [8] or Prolog. Assumption 3.4 together with the assumption 3.5 about the output language is a superset of constraints implicitly made in the [23] Original AET assumes that any lexical formula that can be translated into a database formula can be also obtained by (one byone) substitution of the ....

Subrata Kumar Das. Deductive databases and logic programming. Addison - Wesley, Reading, Mass., 1992. BIBLIOGRAPHY 124

No context found.

Subrata Kumar Das. Deductive Databases and Logic Programming. Addison-Wesley, Wokingham, 1992.

No context found.

Kumar, S.D.: Deductive Databases and Logic Programming. Addison-Wesley, 1992.

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