Nothing Special   »   [go: up one dir, main page]

Skip to main content

Inheritance reasoning by regular sets in knowledge-bases with dot notation

  • Objects and Inheritance
  • Conference paper
  • First Online:
Deductive and Object-Oriented Databases (DOOD 1995)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1013))

Included in the following conference series:

Abstract

In this paper, we propose an inheritance system for knowledgebases in which IS-A relation and IS-NOT-A relation are specified on the domain extended by dot notation ‘.’. Due to the simplicity of the framework, we can obtain several computational advantages including the following: (1) IS-A relation and IS-NOT-A relation are determined in polynomial time. (2) Satisfiability of a given knowledge-base is also determined in polynomial time. (3) Set-at-a-time queries are completely answered by regular expressions. (4) Regular expressions are also used for specifications of knowledge-bases. Consequently, we can achieve advanced reasoning by the computational operations on regular sets using union, intersection, and difference. Furthermore, the obtained results can be incrementally reused to specify new knowledge-bases. Several applications of the proposed inheritance reasoning mechanism in advanced computer systems are also demonstrated.

This research was supported in part by the Science Research Grant-in-Aid from Ministry of Education, Science, Sports and Culture of Japan.

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

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Aït-Kaci, H., “A Lattice Theoretic Approach to Computation Based on Calculus on Partially Ordered Type Structures”, Ph.D. Thesis, Univ. of Pennsylvania, 1984.

    Google Scholar 

  2. Brachman, R.J. and Schmolze, J.G., “An Overview of the KL-ONE Knowledge Representation System”, Cognitive Science, Vol.9, No.2, 1985.

    Google Scholar 

  3. Brown, R. and Parker, D.S., “LAURA: A Formal Data Model and her Logical Design Methodology”, Proc. of the 9th Int'l Conf. on Very Large Database Systems, pp.206–217, 1983.

    Google Scholar 

  4. Carpenter, B., “The Logic of Typed Feature Structures”, Cambridge University Press, 1992.

    Google Scholar 

  5. Chomicki, J. and Imieliński, T., “Temporal Deductive Databases and Infinite Objects”, Proc. of the 8th ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, pp.61–73, 1988.

    Google Scholar 

  6. Chomicki, J. and Imieliński, T., “Relational Specification of Infinite Query Answers”, Proc. of ACM Int'l Conf. on Management on Data, pp.174–183, 1989.

    Google Scholar 

  7. Coburn, N. and Weddell, G.E., “Path Constraints for Graph-Based Data Models: Towards a Unified Theory of Typing Constraints, Equations and Functional Dependencies”, Delobel, C., Kifer, M., and Masunaga, Y.(Eds.): Deductive and Object-Oriented Databases, Lecture Notes in Computer Science 566, Springer-Verlag, pp.312–331, 1991.

    Google Scholar 

  8. Gentzen, G., “Investigations into Logical Deduction”, Szabo, M.E.(Ed.): The Collected Papers of Gerhard Gentzen, North-Holland, pp.68–131, 1969.

    Google Scholar 

  9. Guarino, N., “A Concise Presentation of ITL”, ACM-SIGART BULLETIN, Vol.2, No.3, pp.61–69, 1991.

    Google Scholar 

  10. Hopcroft, J.E. and Ullman, J.D., “Introduction to Automata Theory”, Language and Computation, Addison-Wesley Publishing Company Inc., 1979.

    Google Scholar 

  11. ISO/IEC, “DIS 10747 — Information Technology — Telecommunications and Information Exchange between Systems — Protocol for Exchange of Inter-Domain Routeing Information among Intermediate Systems”, 1993.

    Google Scholar 

  12. Iwamuro, M., Tanaka, R., Tsukamoto, M., and Nishio, S., “Implementation of a Mail Distribution System using Reasoning Mechanism”, Special Interest Group Report of Information Processing Society of Japan (94-DPS-66), Vol.94, No.56, pp.91–96, 1994 (in Japanese).

    Google Scholar 

  13. Kifer, M., Kim, W., and Sagiv. Y., “Querying Object-Oriented Database”, Proc. of ACM Int'l Conf. on Management on Data, pp.393–402, 1992.

    Google Scholar 

  14. Kifer, M. and Lausen, G., “F-Logic: A Higher-Order Language for Reasoning About Objects, Inheritance, and Scheme”, Proc. of ACM Int'l Conf. on Management on Data, pp.134–146, 1989.

    Google Scholar 

  15. Lenzerini, M., Nardi, D., and Simi, M. (Eds.), “Inheritance Hierarchies in Knowledge Representation and Programming Languages”, John Wiley & Sons, 1991.

    Google Scholar 

  16. Maier, D., “A Logic for Objects”, Proc. of Workshop on Foundation of Deductive Databases and Logic Programming, pp.6–26, 1986.

    Google Scholar 

  17. McAllester, D. and Givan, B., “Taxonomic Syntax for First Order Inference”, Journal of the ACM, Vol.40, No.2, pp.246–283, 1993.

    Google Scholar 

  18. Murata, A., Tsukamoto, M., and Nishio, S., “A Policy Description Language for Inter-Domain Routing Protocol (IDRP)”, Special Interest Group Report of Information Processing Society of Japan (95-DPS-71), Vol.95, No.61, pp.151–156, 1995 (in Japanese).

    Google Scholar 

  19. Schmidt-Schauß, M., “Subsumption in KL-ONE is Undecidable”, Proc. of the 1st Int'l Conf. on Principles of Knowledge Representation and Reasoning, pp.421–431, 1989.

    Google Scholar 

  20. Sei, K., Tsukamoto, M., and Nishio, S., “Efficient Reasoning Algorithms for an Inference System with DOT Notations and IS-A Relations”, Proc. of the 1994 Annual Conference of Japan Society of Artificial Intelligence, pp.517–520, 1994 (in Japanese).

    Google Scholar 

  21. Thomason, R.H. and Touretzky, D.S., “Inheritance Theory and Networks with Roles”, Sowa, J.F.(Ed.): Principles of Semantic Networks, Morgan Kaufmann Publishers, pp.231–266, 1991.

    Google Scholar 

  22. Touretzky, D.S., “The Mathematics of Inheritance Systems”, Morgan Kaufmann Publishers, 1986.

    Google Scholar 

  23. Tsukamoto, M., Nishio, S., and Fujio, M., “DOT: A Term Representation using DOT Algebra for Knowledge-bases”, Delobel, C., Kifer, M., and Masunaga, Y.(Eds.): Deductive and Object-Oriented Databases, Lecture Notes in Computer Science 566, Springer-Verlag, pp.391–410, 1991.

    Google Scholar 

  24. Tsukamoto, M., Nishio, S., Fujio, M., and Miyamoto, M., “Query Processing for a Knowledge-base Using DOT Algebra”, Proc. of the IEEE 1st Int'l Workshop on Interoperability of Multi-Database Systems, pp.46–53, 1991.

    Google Scholar 

  25. Yanagisawa, Y., Tsukamoto, M., and Nishio, S., “Deductive Object-Oriented Programming for Knowledge-base Independence”, Proc. of the 4th Int'l Conf. on Deductive and Object-Oriented Databases, 1995.

    Google Scholar 

  26. Yokota, K., “Quixote: A Constraint Based Approach to a Deductive Object-Oriented Database”, Dr. Eng. Thesis, Dept. of Information Science, Faculty of Engineering, Kyoto University, 1994.

    Google Scholar 

  27. Yokota, K., Tsuda, H., and Morita, Y., “Specific Features of a Deductive Object-Oriented Database Language Quixote”, Proc. of the Workshop on Combining Declarative and Object-Oriented Databases, pp.89–99, 1993.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Tok Wang Ling Alberto O. Mendelzon Laurent Vieille

Rights and permissions

Reprints and permissions

Copyright information

© 1995 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Tsukamoto, M., Nishio, S. (1995). Inheritance reasoning by regular sets in knowledge-bases with dot notation. In: Ling, T.W., Mendelzon, A.O., Vieille, L. (eds) Deductive and Object-Oriented Databases. DOOD 1995. Lecture Notes in Computer Science, vol 1013. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-60608-4_44

Download citation

  • DOI: https://doi.org/10.1007/3-540-60608-4_44

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-60608-6

  • Online ISBN: 978-3-540-48460-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics