Finding maximally satisfiable terminologies for the description logic ALC

  • Authors:

  • Thomas Meyer;Kevin Lee;Richard Booth;Jeff Z. Pan

  • Affiliations:

  • National ICT Australia and University of New South Wales, Kensington, Australia;National ICT Australia and University of New South Wales, Kensington, Australia;Faculty of Informatics, Mahasarakham University, Mahasarakham, Thailand;Department of Computing Science, The University of Aberdeen

  • Venue:
  • AAAI'06 Proceedings of the 21st national conference on Artificial intelligence - Volume 1
  • Year:
  • 2006

Quantified Score

Hi-index 0.00

Visualization

Abstract

For ontologies represented as Description Logic Tboxes, optimised DL reasoners are able to detect logical errors, but there is comparatively limited support for resolving such problems. One possible remedy is to weaken the available information to the extent that the errors disappear, but to limit the weakening process as much as possible. The most obvious way to do so is to remove just enough Tbox sentences to eliminate the errors. In this paper we propose a tableau-like procedure for finding maximally concept-satisfiable terminologies represented in the description logic ALC. We discuss some optimisation techniques, and report on preliminary, but encouraging, experimental results.