Skip to main content
SpringerLink
Log in

A hybrid reasoning system for terminologies and first-order clauses in knowledge bases

  • Regular Papers
  • Published:
New Generation Computing Aims and scope Submit manuscript

Abstract

Description Logics (DLs) theoretically explore knowledge representation and reasoning in concept languages. However, since they are conceptually oriented, they are not equipped with rule-based reasoning mechanisms for assertional knowledge bases — specifically, rules and facts in Logic Programming (LP), or the interaction of rules and facts with terminological knowledge. To combine rule-based reasoning with terminological knowledge, this paper presents a hybrid reasoning system for DL knowledge bases (TBox and ABox) and first-order clause sets. The primary result of this study involves the design of a sound and completeresolution method for thecomposed knowledge bases, and this method possesses features of an effective deduction procedure such as Robinson’s Resolution Principle.

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. Areces, C., Nivelle, H. de and Rijke, M. de, “Resolution in Modal, Description and Hybrid Logics,”Journal of Logic and Computation, 11, 5, pp. 717–736, 2001.

    Article  MATH  MathSciNet  Google Scholar 

  2. Baader, F. and Sattler, U., “An Overview of Tableau Algorithms for Description Logics,”Studia Logica, 69, pp. 5–40, 2001.

    Article  MATH  MathSciNet  Google Scholar 

  3. Beierle, C., Hedtsück, U., Pletat, U., Schmitt, P.H. and Siekmann, J., “An order-Sorted Logic for Knowledge Representation Systems,”Artificial Intelligence, 55, pp. 149–191, 1992.

    Article  MATH  MathSciNet  Google Scholar 

  4. Brachman, R. J., Fikes, R. E. and Levesque, H. J., “KRYPTON: A Functional Approach to Knowledge Representation,”Computer, 16, 10, pp. 67–73, 1983.

    Article  Google Scholar 

  5. Bürckert, H. J., “A Resolution Principle for a Logic with Restricted Quantifiers,”Lecture Notes in Artificial Intelligence and Lecture Notes in Computer Science, 568, Springer-Verlag Inc., New York, NY, USA, 1991.

    MATH  Google Scholar 

  6. Bürckert, H. J., “A Resolution Principle for Constraint Logics,”Artificial Intelligence, 66, pp. 235–271, 1994.

    Article  MATH  MathSciNet  Google Scholar 

  7. Cohn, A. G., “Taxonomic Reasoning with Many Sorted Logics,”Artificial Intelligence Review, 3, pp. 89–128, 1989.

    Google Scholar 

  8. Denecker, M., “A Terminological Interpretation of (Abductive) Logic Programming,” inLogic Programming and Nonmonotonic Reasoning, Proceedings LPNMR’95, Lecture Notes in Artificial Intelligence, 928, pp. 15–29, Springer, 1995.

  9. Doets, K.,From Logic to Logic Programming, The MIT Press, 1994.

  10. Donini, F. D., Lenzerini, M., Nardi, D. and Schaerf, A. “Reasoning in Description Logic,” inPrinciples of Knowledge Representation (G. Brewka, ed.), CSLI Publications, FoLLI, 1996.

  11. Donini, F. D., Lenzerini, M., Nardi, D. and Schaerf, A., “AL-LOG: Integrating Datalog and Description Logic,”Journal of Intelligent Information Systems, 10, 3, pp. 227–252, 1998.

    Article  Google Scholar 

  12. Enjalbert P. and Farinas del Cerro, L., “Modal Resolution in Clausal Form,”Theoretical Computer Science, 65, 1, pp. 1–33, 1989.

    Article  MATH  MathSciNet  Google Scholar 

  13. Frisch, A. M., “A General Framework for Sorted Deduction: Fundamental Result on Hybrid Reasoning,” inProc. of the First International Conference on Principles of Knowledge Representation and Reasoning, 1989.

  14. Gabbay D. and Reyle, U., “Labelled Resolution for Classical and Non-classical Logics,”Studia Logica, 59, 2, pp. 179–216, 1997.

    Article  MATH  MathSciNet  Google Scholar 

  15. Grosof, B., Horrocks, I., Volz, R. and Decker, S., “Description Logic Programs: Combining Logic Programs with Description Logics,” inProc. of WWW-2003, Budapest, Hungary, May, 2003.

  16. Heymans, S. and Vermeir, D., “Integrating Ontology Languages and Answer Set Programming,” inProc. of the 14th International Workshop on Expert System Applications (DEXA2003), pp. 584–588, IEEE Computer Society, 2003.

  17. Heymans, S. and Vermeir, D., “Integrating Semantic Web Reasoning and Answer Set Programming,” inAnswer Set Programming: Advances in Theory and Implementation (ASP03), CEUR Proc., 78, pp. 194–208, 2003.

  18. Hollunder, B., “Hybrid Inferences,” inKL-ONE-based Knowledge Representation systems, inProc. of GWAI-90, Fourteenth German Workshop on Artificial Intelligence, pp. 38–47, 1990.

  19. Horrocks, I. and Patel-Schneider, P. F., “A Proposal for an Owl Rules Language,”in Proc. of the Thirteenth International World Wide Web Conference (WWW 2004), pp. 723–731, ACM, 2004.

  20. Kaneiwa, K., “The Completeness of Logic Programming with Sort Predicates,”Systems and Computers in Japan, 35, 1, pp. 37–46, 2004.

    Article  Google Scholar 

  21. Kaneiwa, K., “A Hybrid Reasoning System for Terminologies and Clause Sets,” inProc. of the Twenty-Second IASTED International Multi-Conference on Applied Informatics, 2004.

  22. Kaneiwa, K., “Order-sorted Logic Programming with Predicate Hierarchy,”Artificial Intelligence, 158, 2, pp. 155–188, 2004.

    Article  MATH  MathSciNet  Google Scholar 

  23. Kaneiwa, K. and Mizoguchi, R., “Ontological Knowledge Base Reasoning with Sort-hierarchy and Rigidity,” inProc. of the Ninth International Conference on the Principles of Knowledge Representation and Reasoning (KR2004), pp. 278–288, 2004.

  24. Kaneiwa, K. and Tojo, S., “An Order-sorted Resolution with Implicitly Negative Sorts,” inProc. of the 2001 Int. Conf. on Logic Programming, LNCS, 2237, pp. 300–314, Springer-Verlag, 2001.

  25. Levy A. A. and Rousset, M.-C., “CARIN: A Representation Language Combining Horn rules and Description Logics,”Artificial Intelligence, 104, 1–2, pp. 165–209, 1998.

    Article  MATH  MathSciNet  Google Scholar 

  26. Lloyd, J. W.,Foundations of Logic Programming, Springer-Verlag, 1987.

  27. Lobo, J., Minker, J. and Rajasekar, A.,Foundations of Disjunctive Logic Programming, The MIT Press, 1992.

  28. Robinson, J. A., “A Machine-oriented Logic Based on the Resolution Principle,”Journal of the ACM (JACM), 12, 1, pp. 23–41, 1965.

    Article  MATH  Google Scholar 

  29. Schmidt-Schauss, M. and Smolka, G., “Attributive Concept Descriptions with Complements,”Artificial Intelligence, 48, pp 1–26, 1991.

    Article  MATH  MathSciNet  Google Scholar 

  30. Belleghem, K. Van, Denecker M. and Schreye, D. De, “A Strong Correspondence between Description Logics and Open Logic Programming,” inLogic Programming, Proc. of the Fourteenth International Conference on Logic Programming, pp. 346–360. MIT Press, 1997.

Download references

Author information

Authors and Affiliations

  1. National Institute of Informatics, 2-1-2 Hitotsubashi, Chiyoda-ku, 101-8430, Tokyo, Japan

    Ken Kaneiwa

Authors
  1. Ken Kaneiwa
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

This is an extended version of the paper.

Ken Kaneiwa, Ph.D.: He is an Assistant Professor with the Foundations of Informatics Research Division at the National Institute of Informatics. He worked for Fujitsu, Ltd. from 1993 to 1996, and received his M. S. and Ph.D. degrees from Japan Advanced Institute of Science and Technology (JAIST) in 1998 and 2001, respectively, majoring in Information Science in both cases. His research interests include knowledge representation, typed logic programming, and order-sorted logic. He is a member of the Japan Society for Software Science and Technology, the Institute of Electronics, Information and Communication Engineers, the Information Processing Society of Japan, the Japanese Society for Artificial Intelligence, the Association for Logic Programming, and the Association for Symbolic Logic.

About this article

Cite this article

Kaneiwa, K. A hybrid reasoning system for terminologies and first-order clauses in knowledge bases. New Gener Comput 24, 29–51 (2006). https://doi.org/10.1007/BF03037292

Download citation

  • Received:

  • Revised:

  • Issue Date:

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

Keywords

Search

Navigation