We present algorithms based on truth-prefixed tableaux to solve both Concept Abduction and Contraction in ALN DL. We also analyze the computational complexity of the problems, showing that the upper bound of our approach meets the complexity lower bound. The work is motivated by the need to offer a uniform approach to reasoning services useful in semantic-based matchmaking scenarios.
|Titolo:||A Uniform Tableaux-Based Approach to Concept Abduction and Contraction in ALN|
|Data di pubblicazione:||2004|
|Nome del convegno:||International Workshop on Description Logics, DL 2004|
|Appare nelle tipologie:||4.1 Contributo in Atti di convegno|