Prioritizing Default Rules Embedded in Description Logic Knowledge Base

Description logic based semantic query needs complete information from sources of knowledge where available information is often incomplete. To solve such incomplete reasoning problem, this paper embedded default logic into the description logic knowledge base, meanwhile prioritized the default rules, which preferred more specific default rules over more general ones. Then, an original incomplete query could be transformed into a complete query relative to the extended knowledge base, by checking default satisfiability of complex concept in accord with the query. Furthermore, the default satisfiability can be detected through a new extended tableau algorithm.

[1]  Ian Horrocks FaCT and iFaCT , 1999, Description Logics.

[2]  Georg Gottlob,et al.  Complexity Results for Nonmonotonic Logics , 1992, J. Log. Comput..

[3]  Gerhard Brewka,et al.  Adding Priorities and Specificity to Default Logic , 1994, JELIA.

[4]  Frank van Harmelen,et al.  Reviewing the design of DAML+OIL: an ontology language for the semantic web , 2002, AAAI/IAAI.

[5]  Zhao Xi-shun,et al.  A Method of Finding Priorities in Default Theories , 2003 .

[6]  Diego Calvanese,et al.  The Description Logic Handbook , 2007 .

[7]  Victor W. Marek,et al.  Nonmonotonic logic - context-dependent reasoning , 1997, Artificial intelligence.

[8]  Tran Cao Son,et al.  Default Reasoning with Specificity , 2000, Computational Logic.

[9]  Diego Calvanese,et al.  The Description Logic Handbook: Theory, Implementation, and Applications , 2003, Description Logic Handbook.

[10]  Franz Baader,et al.  Embedding defaults into terminological knowledge representation formalisms , 1995, Journal of Automated Reasoning.

[11]  Gerhard Brewka,et al.  Nonmonotonic Reasoning: Logical Foundations of Commonsense By Gerhard Brewka (Cambridge University Press, 1991) , 1991, SGAR.

[12]  Patrick Lambrix,et al.  A default extension to description logics for use in an intelligent search engine , 1998, Proceedings of the Thirty-First Hawaii International Conference on System Sciences.

[13]  Volker Haarslev,et al.  RACER System Description , 2001, IJCAR.

[14]  Marco Schaerf,et al.  A Survey of Complexity Results for Nonmonotonic Logics , 1993, J. Log. Program..

[15]  Umberto Straccia Default Inheritance Reasoning in Hybrid KL-ONE-Style Logics , 1993, IJCAI.

[16]  Franz Baader,et al.  How to Prefer More Specific Defaults in Terminological Default Logic , 1993, IJCAI.

[17]  Gert Smolka,et al.  Attributive Concept Descriptions with Complements , 1991, Artif. Intell..

[18]  Jonathan Stillman,et al.  It's Not My Default: The Complexity of Membership Problems in Restricted Propositional Default Logics , 1990, AAAI.

[19]  Raymond Reiter,et al.  A Logic for Default Reasoning , 1987, Artif. Intell..

[20]  Judea Pearl,et al.  System Z: a Natural Ordering of Defaults with Tractable Applications to Nonmonotonic Reasoning^ , 1990 .