Journal of KIISE:Software and Applications (한국정보과학회논문지:소프트웨어및응용)

Korean Institute of Information Scientists and Engineers (한국정보과학회)
권호 표지

Integration of Ontology Open-World and Rule Closed-World Reasoning

온톨로지 Open World 추론과 규칙 Closed World 추론의 통합

  • Received : 2009.09.23
  • Accepted : 2010.01.28
  • Published : 2010.04.15
Download PDF
⟨ Previous Next ⟩

Abstract

OWL is an ontology language for the Semantic Web, and suited to modelling the knowledge of a specific domain in the real-world. Ontology also can infer new implicit knowledge from the explicit knowledge. However, the modeled knowledge cannot be complete as the whole of the common-sense of the human cannot be represented totally. Ontology do not concern handling nonmonotonic reasoning to detect incomplete modeling such as the integrity constraints and exceptions. A default rule can handle the exception about a specific class in ontology. Integrity constraint can be clear that restrictions on class define which and how many relationships the instances of that class must hold. In this paper, we propose a practical reasoning system for open and closed-world reasoning that supports a novel hybrid integration of ontology based on open world assumption (OWA) and non-monotonic rule based on closed-world assumption (CWA). The system utilizes a method to solve the problem which occurs when dealing with the incomplete knowledge under the OWA. The method uses the answer set programming (ASP) to find a solution. ASP is a logic-program, which can be seen as the computational embodiment of non-monotonic reasoning, and enables a query based on CWA to knowledge base (KB) of description logic. Our system not only finds practical cases from examples by the Protege, which require non-monotonic reasoning, but also estimates novel reasoning results for the cases based on KB which realizes a transparent integration of rules and ontologies supported by some well-known projects.

OWL 온톨로지는 실세계의 도메인 지식을 모델링 하는데 적합하다. 또한 명백하게 정의된 지식으로부터 암시적인 새로운 지식을 추론할 수 있다. 하지만 이 모델링된 지식은 완전할 수 없다. 사람이 가지고 있는 모든 상식을 모델링 할 수 없기 때문이다. 온톨로지는 완전한 지식표현을 위한 무결성 제약조건과 예외 처리와 같은 비단조 추론을 지원할 방법이 없다. 디폴트 규칙은 온톨로지 안의 특정 클래스에 대한 예외를 처리할 수 있다. 또한 무결성 제약은 온톨로지에 정의된 클래스의 제한조건(restriction)에 인스턴스가 일관되게 할 수 있다. 본 논문에서는 Open World Assumption(OWA) 기반의 온톨로지와 Closed World Assumption(CWA) 기반의 비단조 추론을 지원하는 규칙의 지식베이스를 통합하여 Open World 와 Closed World 추론을 모두 지원하는 실질적인 추론 시스템을 제안한다. 이 시스템은 온톨로지에 정의된 불완전한 개념을 다룰 때 OWA기반이라서 발생하는 문제점을 ASP(Answer Set Programming)를 사용하여 해결방안을 제안한다. ASP는 논리 프로그래밍 언어로써 비단조 추론을 허용하며, 서술 논리 지식베이스에 CWA 기반의 질의를 가능하게 한다. 제안하는 시스템은 Protege에서 제공하는 Pizza 온톨로지를 예로써 비단조 추론이 필요한 경우를 보이고, 잘 알려진 온톨로지들로 성능 평가하여 본 시스템의 정당(sound)하고 완전(complete)함을 증명한다.

Keywords

Acknowledgement

Supported by : 한국학술진흥재단

References

  1. G. Antonious, C.V. Damasio, B. Grosof, I. Horrocks, M. Kifer, J. Maluszynski, P.F. Patel-Schneider, "Combining rules and ontologies," A survery. Technical Report IST506779/Linkoping/I3-D3/D/PU/a1, Linkoping University, 2005.
  2. J.Z. Pan, E. Franconi, S. Tessaris, G. Stamou, V. Tzouvaras, L. Serafini, I. Horrocks, B. Glimm, "Specification of coordination of rule and ontology languages," Project Deliverable D2.5.1, Knowledge-Web NoE, 2004.
  3. T. Eiter, G. Ianni, A. Polleres, R. Schindlauer, H. Tompits, "Reasoning with Rules and Ontologies," In Springer LNCS 4126, pp.93-127, 2006.
  4. T. Eiter, T. Lukasiewicz, R. Schindlauer, H. Tompits, "Combining Answer Set Programming with Description Logics for the Semantic Web," Proc. of the 9th International Conference on Principles of Knowledge Representation and Reasoning (KR2004), pp.141-151, 2004.
  5. R.J. Brachman, H. J. Levesque, "Knowledge Representation and Reasoning," Morgan Kaufmann, 1991.
  6. D. Poole, "A logical framework for default reasoning," Artificial Intelligence, vol.36, pp.27-47, 1988. https://doi.org/10.1016/0004-3702(88)90077-X
  7. M. Smith, C. Welty, D. McGuiness, "OWL Web Ontology Language Guide," W3C Recommendation http://www.w3.org/TR/owl-guide/, 2004.
  8. V. Lifschitz, "Nonmonotonic Databases and Epistemic Queries," Proc. of the 12th IJCAI, pp. 381-386, Aug. 1991.
  9. B. Motik, I. Horrocks, R. Rosati, U. Sattler, "Can OWL and Logic Programming Live Together Happily Ever After?," Proc. of the 5th International Semantic Web Conference (ISWC 2006), vol.4273 of LNCS, pp.501-514. Springer, 2006.
  10. Y. Zhang, "Epistemic Reasoning in Logic Programs," Proc. of the 20th International Joint Conference on Artificial Intelligence (IJCAI 2007), pp.647-652, 2007.
  11. U. Hustadt, "Do we need the closed-world assumption in knowledge representation?," Proc. of the 1st Workshop KRDB'94, pp.123-124, 1994.
  12. E. Sirin, B. Parsia, B.C. Grau, A. Kalyanpur, Y. Katz, "Pellet: a practical owl-dl reasoner," Proc. of the 3rd International Semantic Web Conference (ISWC2004), 2004.
  13. S. Grimm, B. Motik, "Closed-World Reasoning in the Semantic Web through Epistemic Operators," Proc. of the OWL Experiences and Directions Workshop, 2005.
  14. C.V. Damasio, A. Analyti, G. Antoniou, G. Wagner, "Supporting Open and Closed World Reasoning on the Web," Proc. of the Principles and Practice of Semantic Web Reasoning (PPSWR'06), vol.4187 of LNCS, pp.149-163, Springer, 2006.
  15. F.M. Donini, D. Nardi, R. Rosati, "Description Logics of Minimal Knowledge and Negation as Failure," ACM Trans. on Computational Logic, 3(2), pp.177-225, 2002. https://doi.org/10.1145/505372.505373
  16. I. Horrocks, P.F. Patel-Schneider, H. Boley, S. Tabet, B. Grosof, M. Dean, "SWRL: A Semantic Web Rule Language Combining OWL and RuleML," W3C Member Submission, 21 May 2004. Available at http://www.w3.org/Submission/SWRL/. 2004.
  17. J.-M. Kim, S.-H. Kwon, J.-H. Choi, Y.-T. Park, "Tableaux Algorithm based OWL Ontology Reasoner," Proc. of the 35th KIISE Fall Conference, vol.35, no.1(A), pp.0102-0103, 2008. (in Korean)