Abstract
Taxonomic reasoning is a typical inference task performed by many AI knowledge representation systems. We illustrate the effectiveness of taxonomic reasoning techniques as an active support to knowledge acquisition and schemas design in the advanced database environment LOGIDATA+, supporting complex objects and a rule-based language. The developed idea is that, by extending complex object data models with defined classes, it is possible to infer ISA relationships (i.e. compute subsumption) between classes on the basis of their descriptions. From a theoretical point of view, this approach makes it possible to give a formal definition of consistency to a schema, while, from a pragmatic point of view, it is possible to automatically classify a new class in the correct position of a given taxonomy.
Preview
Unable to display preview. Download preview PDF.
References
P. Atzeni, F. Cacace, S. Ceri, and L. Tanca. The LOGIDATA+ model. Technical Report 5/20, CNR — Progetto Finalizzato Sistemi Informatici e Calcolo Parallelo — S5, 1990.
S. Abiteboul and R. Hull. IFO: A formal semantic database model. ACM Transactions on Database Systems, 12(4):525–565, 1987.
H. Ait-Kaci. Type subsumption as a model of computation. In L. Kershberg, editor, 1st Int. Workshop on Expert Database Systems, pages 115–140. The Benjamin-Cimmings Publishing Company Inc., 1986.
S. Abiteboul and P. Kanellakis. Object identity as a query language primitive. In SIGMOD, pages 159–173. ACM Press, 1989.
P. Atzeni and D.S. Parker. Formal properties of net-based knowledge representation schemes. Data and Knowledge Engineering, 3:137–147, 1988.
P. Atzeni and D.S. Parker. Set containment inference and syllogisms. Theoretical Computer Science, 62:39–65, 1988.
A. Borgida, R.J. Brachman, D.L. McGuinness, and L.A. Resnick. CLASSIC: A structural data model for objects. In SIGMOD, pages 58–67, Portland, Oregon, 1989. ACM.
S. Bergamaschi, L. Cavedoni, C. Sartori, and P. Tiberio. On taxonomical reasoning in E/R environment. In C. Batini, editor, 7th Int. Conf. on the Entity Relationship Approach-Roma-1988, pages 443–454, Amsterdam, 1989. Elsevier Science Publisher B.V. (North-Holland).
H.W. Beck, S.K. Gala, and S.B. Navathe. Classification as a query processing technique in the CANDIDE data model. In 5th Int. Conf. on Data Engineering, pages 572–581, Los Angeles, CA, 1989.
R.J. Brachman, and H.J. Levesque. Expressiveness and Tractability in Knowledge Representation and REasoning. Computational Intelligence, 3:78–93, 1987.
R.J. Brachman, and H.J. Levesque. The tractability of Subsumption in Frame-Based Description Languages. AAAI, 34–37, 1984.
S. Bergamaschi and B. Nebel. The complexity of multiple inheritance in complex object data models. Workshop on AI and Objects — IJCAI '91, Sidney-Australia, August 1991 (also available as Technical Report 74 CIOC-CNR, Viale Risorgimento,2 Bologna, Italia, December 1991).
R.J. Brachman, D.L. McGuiness, P.F. Patel-Schneider, L. Alperin Resnick, A. Borgida. Living with Classic: when and how to use a KL-ONE language. in [Sowa91]
R.J. Brachman and J.G. Schmolze. An overview of the KL-ONE knowledge representation system. Cognitive Science, 9(2):171–216, 1985.
S. Bergamaschi and C. Sartori. On taxonomic reasoning in conceptual design. ACM Transactions on Database Systems, Vol.17, N.3, Sept, 1992.
L. Cardelli. A semantics of multiple inheritance. em Semantics of Data Types-Lecture Notes in Computer Science N. 173, 1984, pages 51–67, 1984. Springer-Verlag.
G. Di Battista and M. Lenzerini. A deductive method for Entity-Relationship modelling. In 15th Int. Conf. on Very Large Databases, pages 13–21, Amsterdam s-NL, August 1989.
L.M.L. Delcambre and K.C. Davis. Automatic validation of objectoriented database structures. In 5th Int. Conf. on Data Engineering, pages 2–9, Los Angeles, CA, 1989.
F.M. Donini and B. Hollunder and M. Lenzerini and A. Marchetti Spaccamela and D. Nardi and W. Nutt. The Complexity of Existential Quantification in Concept Languages, rap.01.91, Dipartimento di Informatica e Sistemistica, Roma, 1991.
F. M. Donini, M. Lenzerini, D. Nardi and W. Nutt. The Complexity of Concept Languages. In J. Allen and R. Fikes and E. Sandewall, editors, KR '91 — 2nd Int. Conf on Principles of Knowledge Representation and Reasoning, pages 151–162, 1991. Morgan Kauffmann Publishers, Inc., Cambridge-MA.
F. M. Donini, M. Lenzerini, D. Nardi and W. Nutt. Tractable Concept Languages. In IJCAI 91, Sidney, Australia, 1991.
T. Finin and D. Silverman. Interactive classification as a knowledge acquisition tool. In L. Kershberg, editor, Expert Database Systems, pages 79–90. The Benjamin/Cummings Publishing Company Inc., 1986.
G.M. Kuper and M.Y. Vardi. A new approach to database logic. In PODS '84, pages 86–96. SIGACT-SIGMOD-SIGART, ACM Press, 1984.
C. Lecluse and P. Richard. Modelling complex structures in objectoriented databases. In Symp. on Principles of Database Systems, pages 362–369. ACM SIGACT-SIGMOD-SIGART, 1989.
C. Lecluse and P. Richard. The O2 data model. In Int. Conf. On Very Large Data Bases, 1989.
C. Lecluse, P. Richard, and F. Velez. O2, an object-oriented data model. In SIGMOD, pages 424–433, Chicago — IL, June 1988. ACM.
B. Nebel. Computational complexity of terminological reasoning in BACK, In Artificial Intelligence. vol. 34, n.3, 1988.
B. Nebel. Terminological reasoning is inherently intractable. In Artificial Intelligence. vol. 43, n.2, 1990.
B. Nebel. Terminological cycles: semantics and computational properties. In J. Sowa, editor, Principles of Semantic Networks. Morgan Kaufmann, 1991.
B. Nebel. Reasoning and Revision in Hybrid Representation Systems. Lecture Notes in Artificial Intelligence, n. 422, 1990.
P.F. Patel-Schneider. Small can be beautiful in knowledge representation. In Workshop on Principles of Knowledge-Based Systems, pages 11–16, Denver-Colorado, December 1984. IEEE.
P.F. Patel-Schneider. A four-valued semantics for frame-based description languages. In AAAI, pages 344–348, 1986.
P.F. Patel-Schneider. Undecidability of Subsumption in NIKL. Artificial Intelligence, 39:263–272, 1989.
P.F. Patel-Schneider. Pratical Obiect-Based Knowledge Representation for Knowledge-Based System. Information System, vol.15, n.1, 1990.
P.F. Patel-Schneider. A four-valued semantics for frame-based description languages. In AAAI, pages 344–348, 1986.
M. Schmidt-Schauss. Subsumption in KL-ONE is undecidable. In Brachmann, R.J. and Levesque, H.J. and R. Reiter, editors, KR '89 — 1st Int. Conf. on Principles of Knowledge Representation and Reasoning, pages 421–431, Morgan Kauffmann Publishers, Inc., Toronto-Canada.
Sowa J.F. editor Principles of Semantic Networks, Morgan Kaufmann Publishers.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1993 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Beneventano, D., Bergamaschi, S., Sartori, C., Artale, A., Cesarini, F., Soda, G. (1993). Taxonomic reasoning in LOGIDATA+ . In: Atzeni, P. (eds) LOGIDATA+: Deductive Databases with Complex Objects. Lecture Notes in Computer Science, vol 701. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0021891
Download citation
DOI: https://doi.org/10.1007/BFb0021891
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-56974-9
Online ISBN: 978-3-540-47844-7
eBook Packages: Springer Book Archive