The formal definition of abduction asks what needs to be
added to a knowledge base to enable an observation to be entailed. TBox
abduction in description logics (DLs) asks what TBox axioms need to
be added to a DL knowledge base to allow a TBox axiom to be entailed.
We describe a sound and complete algorithm, based on the standard DL
tableau, that takes a TBox abduction problem in ALC and generates
solutions in a restricted language. We then show how this algorithm can
be enhanced to deal with a broader range of problems in ALC.
Reference:
Halland, K, Britz, K and Klarman, S. 2014. TBox abduction in ALC using a DL tableau. In: 27th International Workshop on Description Logics (DL2014), Vienna, Austria, 17-20 July 2014
Halland, K., Britz, K., & Klarman, S. (2014). TBox abduction in ALC using a DL tableau. http://hdl.handle.net/10204/7744
Halland, K, K Britz, and S Klarman. "TBox abduction in ALC using a DL tableau." (2014): http://hdl.handle.net/10204/7744
Halland K, Britz K, Klarman S, TBox abduction in ALC using a DL tableau; 2014. http://hdl.handle.net/10204/7744 .
