Skip to main content
SpringerLink
Log in

An object-oriented deductive language

  • Published:
Annals of Mathematics and Artificial Intelligence Aims and scope Submit manuscript

Abstract

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. S. Abiteboul and S. Grumbach, COL: A logic-based language for complex objects,Workshop on Database Programming Languages (Roscoff, France, 1987).

    Google Scholar 

  2. S. Abiteboul and P. Kanellakis, Object identity as a query language primitive,Proc. ACM Conf. on Management of Data (1989).

  3. M. Atkinson, F. Bancilhon, D. DeWitt, K. Dittrich, D. Maier and S. Zdonik, The object-oriented database manifesto,DOOD-89, Kyoto (December 1989).

  4. J. Backus, Can programming be liberated from Von Neumann style? A functional style and its algebra of programs,J. Comm. ACM (1978).

  5. F. Bancilhon, On the evaluation of recursively defined relation, inOn Knowledge Based Management Systems (Springer, 1986).

  6. F. Bancilhon and F. Ramakrishnan, An amateur's introduction to recursive query processing strategies,Proc. ACM SIGMOD Int. Conf. on Management of Data, Washington (May 1986).

  7. F. Bancilhon, D. Maier, Y. Sagiv and J. Ullman, Magic sets and other strange ways to implement logic programs,Proc. 5th ACM PODS (1986).

  8. R. Bayer, U. Guntzer and W. Kiessling, On the evaluation of recursion in deductive DB systems by efficient differential fixpoint iteration, Technical Report, Technische Univ. Munich (1985).

  9. C. Beeri, S. Naqvi, O. Shmueli and S. Tsur, Sets and negations in a logic database language (LDL), MCC Technical Report (1987).

  10. Y. Caseau, Etude et réalisation d'un langage objet: LORE (Studies in OOP, development of LORE) PhD Thesis, Paris XI University (November 1987).

  11. Y. Caseau, A model for a reflective object-oriented language,Sigplan Notices, Special Issue on Concurent Object-Oriented Programming (March 1989).

  12. Y. Caseau, A formal system for producing demons from rules,Proc. DOOD89, Kyoto (1989).

  13. Y. Caseau, Extending a deductive object-oriented database towards logic programming, Bellcore Technical Memorandum (November 1990).

  14. W. Chen, M. Kifer and D.S. Waren, Hilog as a platform for database languages,Proc. Int. Workshop on Database Programming Languages (June 1989).

  15. W. Chen and D.S. Waren, C-logic for complex objects,Proc. ACM SIGACT-SIGMOD-SIGART Symp. on Principles of Database Systems (March 1989).

  16. N. Heintze et al., Constraint logic programming: A reader,4th IEEE Symp. on Logic Programming, San Francisco (1987).

  17. E.F. Codd, A relational model of data for large shared data banks,Comm. ACM 13(6) (1970).

  18. C. Delobel, Bases de données et bases de connaissances: Une approche systemique à l'aide d'une algèbre matricielle,Journées Francophones, Grenoble (1986).

  19. M. Dincbas, H. Simonis and P. Van Henteyrick, Extending equation solving and constraint handling in logic programming,Coll. on Resolution of Equations in Algebraic Structures, Austin (May 1987).

  20. C.L. Forgy, RETE: a fast algorithm for the many pattern/many object pattern matching problem, Art. Int. 19 (1982).

  21. H. Gallaire, Merging objects and logic programming: Relational semantics,Proc. AAAI, Philadelphia (1986).

  22. M. Ganti, P. Goyal, R. Nassif and P. Sunil, An object-oriented development environment,COMPCON (Feb 1990).

  23. G. Gardarin and E. Simon, Bases de données déductives: Langages de règles et récursivité, (Deductive databases: Rule-based languages and recursion),Journées FIRTECH Bases de Données et Intelligence Artficielle, Paris (April 1987).

  24. M. Gondran, Les études d'intelligence artificielle à EDF, EDF Technical Report (conseil scientifique) (November 1988).

  25. R. Hull and J. Su, Untyped sets, invention, and computable queries,Proc. PODS-89 (Philadelphia, 1989).

  26. M. Hornick and S.B. Zdonik, A shared, segmented memory system for an object-oriented database, ACM Transaction on Office Inf. Syst. 5, 1 (1987).

    Google Scholar 

  27. D. Jacobs, A type system for algebraic database programming languages,Proc. 2nd Int. Workshop on Database Programming Languages (June 1989).

  28. M. Kifer and J. Wu, A logic for object-oriented logic programming (Maier's O-logic revisited),Proc. PODS-89, Philadelphia (1989).

  29. M. Kifer and G. Lausen, F-logic: A high-order language for reasoning about objects, inheritance and scheme,ACM SIGMOD Conf. on Management of Data (May 1989).

  30. G.M. Kuper, The logical data model: A new approach to database logic, PhD Dissertation, Stanford University (1985).

  31. Y. Caseau and D. Hoffoss, The LAURE documentation, Bellcore Technical Memorandum (October 1989).

  32. B.J. MacLennan, Programming with a relational calculus, Rep no. NPS52-81-013, Naval Postgraduate School (September 1981).

  33. D. Maier, A logic for objects,Proc. Workshop of Foundations of Deductive Database and Logic Programming, Washington (1986).

  34. S. Naqvi, Stratification as a design principle in a logical query language,Proc. 2nd Int. Workshop on Database Programming Languages (June, 1989).

  35. S. Naqvi and S. Tsur,A logical language for data and knowledge bases (Computer Science Press, 1989).

  36. H. Schmidt, W. Kiessling, V. Guntzer and R. Bayer, Compiling exploratory and goal-directed deduction into sloppy delta-iteration, in:Proc. Symp. on Logic Programming, San Francisco (1987).

  37. S. Su, V. Krishnamurthy and H. Lan, An object-oriented semantic association model (OSAM*), in:AI in Industrial Engineering and Manufacturing: Theoretical Issues and Applications (American Institute of Industrial Engineering, 1988).

  38. D. Sacca and C. Zaniolo, Differential fixpoint methods and stratification of logic programs, MCC Technical Report ACA-ST-032-88 (January, 1986).

  39. A. Tarski, A lattice theoretical fixpoint theorem and its application, Pacific J. Math. 5 (1955).

  40. L. Vieille, Recursive axioms in deductive databases: The query/subquery approach,Proc. 1st Int. Conf. on Expert Database Systems, Charleston (1986).

  41. P. VanHenteyrick and M. Dincbas, Domains in logic programming,AAAI-86, Philadelphia (Aug., 1986).

Download references

Author information

Authors and Affiliations

  1. Bellcore, room 2M337, 445, South Street, 07960-1910, Morristown, NJ, USA

    Yves Caseau

Authors
  1. Yves Caseau
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Caseau, Y. An object-oriented deductive language. Ann Math Artif Intell 3, 211–258 (1991). https://doi.org/10.1007/BF01530926

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01530926

Keywords

Search

Navigation