A tableau algorithm for fuzzy description logics over residuated de morgan lattices

  • Authors:
  • Stefan Borgwardt;Rafael Peñaloza

  • Affiliations:
  • Theoretical Computer Science, TU Dresden, Germany;Theoretical Computer Science, TU Dresden, Germany

  • Venue:
  • RR'12 Proceedings of the 6th international conference on Web Reasoning and Rule Systems
  • Year:
  • 2012

Quantified Score

Hi-index 0.00

Visualization

Abstract

Fuzzy description logics can be used to model vague knowledge in application domains. This paper analyses the consistency and satisfiability problems in the description logic ${\mathcal{SHI}}$ with semantics based on a complete residuated De Morgan lattice. The problems are undecidable in the general case, but can be decided by a tableau algorithm when restricted to finite lattices. For some sublogics of ${\mathcal{SHI}}$, we provide upper complexity bounds that match the complexity of crisp reasoning.