Access the full text.
Sign up today, get DeepDyve free for 14 days.
S. Abiteboul, S. Grumbach (1988)
COL: A Logic-Based Language for Complex Objects
Pascal Hentenryck, Mehmet Dincbas (1986)
Domains in Logic Programming
(1987)
Bases de données déductives : Langages de règles et récursivité," (Deductive databases : Rule-based languages and recursion) Journées FIRTECH
S. Naqvi (1989)
Stratification as a Design Principle in Logical Query Langugages
(1987)
Bases de donnres drductives: Langages de rrgles et rrcursivitr
It is easy to verify that this function is continuous and differentiable
S. Su, V. Krishnamurthy, H. Lam (1988)
An Object-oriented Semantic Association Model, AI in Industrial Engineering and Manufacturing: Theoretical Issues and Applications(OSAM*)
D. Jacobs (1989)
A Type System for Algebraic Database Programming Languages
(1986)
Bases de donnres et bases de connaissances: Une approche systemique h l'aide d'une algrbre matricielle
(1988)
Les Etudes d'Intelligence Artificielle a EDF
S. Abiteboul, S. Grumbach (1987)
Workshop on Database Programming Languages
By Codd (1970)
A relational model of data for large shared data banksM.D. computing : computers in medical practice, 15 3
L. Vieille (1986)
Recursive Axioms in Deductive Databases: The Query/Subquery Approach
M. Kifer, James Wu (1989)
A Logic for Object-Oriented Logic Programming (Maier's O-Logic Revisited).
Then, relational differentiation can be defined as a formal operation on
(1990)
Extending a Deductive Object-Oriented Database towards Logic Programming," Be l l co re Techn ica l Memorandum
Therefore, (q i < ϒ(q 0 )) for each i, so (q f < ϒ(q 0 ))
G. Gleason (1990)
Semantic Query Optimization in an Object-Oriented Semantic Association Model (OSAM)
R. Hull, Jianwen Su (1989)
Untyped sets, invention, and computable queries
Y. Caseau (1988)
A model for a reflective object-oriented language
R n ) with the same rules as mathematical differentiation: ∂R j /∂R i = 1 if i = j and 0 otherwise
We prove by induction on p that: For each p and each studied goal R j (x), ε p (q 0 )(R j )(x) Ê q f (R j )(x) ◊ If p = 0
H. Gallaire (1986)
Merging Objects and Logic Programming: Relational Semantics
Y. Caseau (1987)
Étude et réalisation d'un langage objet : lore
Ulrich Güntzer, Werner Kießling, R. Bayer (1987)
On the evaluation of recursion in (deductive) database systems by efficient differential fixpoint iteration1987 IEEE Third International Conference on Data Engineering
obtained by formal rules of differentiation (composition theorems), such as: [∂M i /∂M i ](X) = X [∂M j /∂M i ](X) = 0 p if i
C. Beeri, S. Naqvi, R. Ramakrishnan, O. Shmueli, S. Tsur (1987)
Sets and negation in a logic data base language (LDL1)
M. Kifer, G. Lausen (1989)
F-logic: a higher-order language for reasoning about objects, inheritance, and scheme
Y. Caseau (1989)
A Formal System for Producing Demons from Rules in an Object-Oriented Database
If one right x is chosen, some y i,j is gotten, for each pair (i,j), such that
(1988)
Les 6tudes d'intelligence artificielle /l EDF
Since (1) is true even if ∆ is not a proper update (∆ Ê [R i ] q ), the following weaker result is also obtained: ∀ (o 1 ,o 2 ) ∈ q
C. Forgy (1991)
Rete: a fast algorithm for the many pattern/many object pattern match problemExpert Systems
J. Backus (1978)
Can programming be liberated from the von Neumann style?: a functional style and its algebra of programsCommun. ACM, 21
D. Saccá, C. Zaniolo (1988)
Differential Fixpoint Methods and Stratification of Logic Programs
(1989)
The LAURE documentation
G. Kuper (1986)
The logical data model: a new approach to database logic
S. Abiteboul, P. Kanellakis (1989)
Object identity as a query language primitive
F. Bancilhon, D. Maier, Y. Sagiv, J. Ullman (1985)
Magic sets and other strange ways to implement logic programs (extended abstract)
M. Hornick, S. Zdonik (1987)
A shared, segmented memory system for an object-oriented databaseACM Trans. Inf. Syst., 5
(1986)
Bases de Données et Bases de Connaissances: Une Approche Systemique à l'Aide d'une Algèbre Matricielle
A. Tarski (1955)
A LATTICE-THEORETICAL FIXPOINT THEOREM AND ITS APPLICATIONSPacific Journal of Mathematics, 5
a classical analysis result gives: ∃ K i,j , ∀ x, ∃ y | (0
Weidong Chen, M. Kifer, D. Warren (1989)
HiLog as a Platform for Database Languages
F. Bancilhon, R. Ramakrishnan (1986)
An amateur's introduction to recursive query processing strategies
J. Jaffar, J. Lassez (1987)
Constraint logic programming
R n ): ◊ 0 and 1 belongs to F(R 1 ,...,R n ): ∀ r ∈ O × O , 0(r) = ∅ and 1(r) = rR n ) is allowed with the induced definition: if t
H. Schmidt, Werner Kießling, Ulrich Güntzer, R. Bayer (1987)
Compiling Exploratory and Goal-Directed Deduction into Sloppy Delta-Iteration
F. Bancilhon (1986)
Naive Evaluation of Recursively Defined Relations
B. MacLennan (1981)
Programming with a relational calculus
S. Naqvi, S. Tsur (1989)
A Logical Language for Data and Knowledge Bases
we know that (x,y) ∈ ξ(q m ,∂T j /∂R i(m) )(u,v)), so (x,y)
M. Ganti, P. Goyal, Rodolphe Nassif, S. Podar (1990)
An object-oriented application development environmentDigest of Papers Compcon Spring '90. Thirty-Fifth IEEE Computer Society International Conference on Intellectual Leverage
M. Kifer, James Wu (1989)
A logic for object-oriented logic programming
C. Forgy (1982)
Rete: A Fast Algorithm for the Many Patterns/Many Objects Match ProblemArtif. Intell., 19
To use this first equation [0], differentiation must be defined at the relation level
M. Atkinson, F. Bancilhon, D. DeWitt, K. Dittrich, D. Maier, S. Zdonik (1994)
The Object-Oriented Database System Manifesto
Mehmet Dincbas, H. Simonis, P. Hentenryck (1989)
Extending Equation Solving and Constraint Handling in Logic Programming
R(m i + xδ a,b ),.,R(m n ))(R(xδ a,b ))) , or [t] q
Weidong Chen, D. Warren (1989)
C-logic of complex objects
Each intermediate value q i is bigger than q 0 and less than the final value q f . Showing that the algorithm is sound (q f < ϒ(q 0 )) is straightforward by induction
We propose a logic for objects that captures the knowledge represented with the LAURE object-oriented language. The work is oriented toward efficient implementation and compilation of queries. A data model for object-oriented databases is presented, with a declarative logic language used to perform queries and positive updates on the database. The expressiveness of this language is reduced, compared to other propositions in the same field, by the use of purely Horn clauses. An equivalent relational algebra is given, from which a formal technique for performing positive updates, called differentiation, is obtained. Two algorithms are proposed that achieve a sound and complete resolution, either for a bottom-up evaluation or a top-down resolution. An efficient implementation of constraint resolution is presented in this framework.
Annals of Mathematics and Artificial Intelligence – Springer Journals
Published: Apr 5, 2005
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.