Paraconsistent Resolution for Four-valued Description Logics

1
Paraconsistent Resolution for Four-valued
Description Logics

• Yue Ma1,2, Pascal Hitzler1, Zuoquan
  Lin2
• 1 AIFB Institute, Universität Karlsruhe,
  Germany
• 2 School of Mathematical Science,
  Peking University, China
• 26th, Mar. 2007_at_ Koblenz

2
Semantic Web from Logical View

• -- An official project of w3c, founded by Tim
  Berners-Lee, the webs inventor
• Flexible Syntax Formal Semantics
• OWL (Ontology Web Language)
• Once a piece of information is tagged,
  Semantic Web can reason with contents

SecurityTokenType(a) implies TokenType(a) Userna
merToken is a subclass of TokenType
3
Description Logics (decidable subsets of FOL)

• The language
• Reasoning tasks correspond to the entailment of a
  FOL KB
• The reasoners
• Tableau-based decision procedures FaCT, Pellet,
  RacerPro, Cerebra Engine
• Resolution-based decision procedure KAON2
  (http//kaon2.semanticweb.org/)

4
Inconsistency Handling

• Information may be distributed and
  multi-authored, be assembled from different
  sources and reused.
• Ontology Learning and Mapping
• Approaches
• Pinpoint, debugging
• Paraconsistent semantics

5
Our Work 1

• The definition of

6
Our Work 2
7
Thank you!
Refer to poster for more details