Dobbie, Gillian. Foundations of deductive objectoriented database systems. Phd dissertation, Univ. of Melbourne, Parkville, Australia, March 1995.  Home/Search   Document Details and Download   Summary   Related Articles   Check

....logical accounts for the objectoriented model; Law93] s implementation is useful for running small F logic programs, but it is not clear how this can 323 be used in a real database context. ii) implementation of Gulog, an object oriented logic developed at Griffith University, Australia [Dob95]; Lef93] s implementation bootstraps on the implementation of the F logic interpreter above and inherits its limitations. iii) implementation of HiLog, a higher order database logic programming language developed at SUNY, Stony Brook [CKW89] SW95] describes an efficient implementation of HiLog ....

Dobbie, Gillian. Foundations of deductive objectoriented database systems. Phd dissertation, Univ. of Melbourne, Parkville, Australia, March 1995.

....In [33] it has been pointed out based on implementation experience that there are many difficulties in implementing F logic with its complex semantics and proof theory. Indeed, this has led some researchers to investigate implementations of languages based on restricted versions of F logic ([16]) We are not aware of an algebra corresponding to (even restricted versions of) F logic. Secondly, for extending SchemaLog to cater for OO data model, there is really no need to incorporate all the features of OODBs within the logic: we simply need a construct which will act as an interface to ....

Dobbie, Gillian. Foundations of Deductive Object-oriented Database Systems. Phd Dissertation, Research Report, University of Melbourne, Parkville, Australia, March 1995.

....community. Strategy Approach Proposals Extension 1 ConceptBase[JGJS94] Logres[CCF 93] Logidata [NST93] ROL[Liu96b] 2 Quixote[YTM93] 3 ESQL2[GV92b] Integration 4 Chimera[CM94] Peplom d [DR94] Coral [SRSS93] Validity[FGVLV95] 5 Noodle[MR93] ROCK ROLL[BPF 94] Reconstruction 6 Gulog[Dob96] Orlog[JL92] 7 FLORID[FHKS96] Table 1. Strategies and approaches to DOOD language design The different strategies and approaches reflect general disagreement on how to combine object orientation and deduction. An interesting issue is the expectations towards the delineation of an Oblog : the ....

G. Dobbie. Foundations of Deductive Object-Oriented Database Systems. PhD thesis, Victoria University Of Wellington, Comp. Science Dept., 1996.

....describe two approaches to resolving ambiguities that arise due to multiple inheritance. In the final section, we discuss the significance of this work and suggest further work in this area. Due to space limitations we have omitted proofs, which are included in the full version of the paper (Dobbie, 1994b) 2. Syntax and informal semantics In this section we describe the syntax of declarations, and of programs with respect to a set of declarations. We describe typed substitutions and a class of programs that we are particularly interested in, namely simple programs. Gulog can be considered as ....

....this paper change significantly with the inclusion of role atoms in the language. This approach is still under investigation. Early results show that such a language is a generalization of Gulog, and there is a query evaluation procedure for a language with role atoms. The results are described in (Dobbie, 1994a) 7. Discussion We have defined a simple language that incorporates many common concepts from other deductive object oriented systems, to present a relatively simple and natural declarative semantics for the language, to describe corresponding evaluation procedures, and hence to gain an ....

[Article contains additional citation context not shown here]

Dobbie, G. (1994a), Foundations of Deductive Object-Oriented Database Systems. thesis, University of Melbourne, 1994.

....names with super rather than explicitly with person. In this paper, we introduce a mathematical foundation for an object oriented language with roles and discuss properties of the language. This work extends that presented in [5] For space reasons, the proofs are omitted. They can be found in [4]. In Section 2, we outline the syntax of the language, and describe a syntactic condition for programs to be unambiguous with respect to multiple inheritance. We describe a class of programs called simple programs which are stratified and unambiguous with respect to multiple inheritance. In ....

....and semantics clear and simple, we consider only positive programs with multi valued methods, and do not differentiate between types and classes. Adding negation has the usual consequences and the consequences of including functional methods (as well as multi valued methods) are explained in [4]. In the language described in this paper, methods are defined by deductive rules as in the languages described in [1] and [7] Throughout this paper we use the following notation. The letters and oe denote type symbols, a denotes an object symbol, p denotes a predicate symbol, m denotes a ....

G. Dobbie. Foundations of Deductive Object-Oriented Database Systems. thesis, University of Melbourne, 1995.

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