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.
A Uniform Tableaux-Based Approach to Concept Abduction and Contraction in ALN / Colucci, S.; Di Noia, T.; Di Sciascio, E.; Donini, F. M.; Mongiello, M.. - ELETTRONICO. - 104:(2004). (Intervento presentato al convegno International Workshop on Description Logics, DL 2004 tenutosi a Whistler, British Columbia, Canada nel June 6-8, 2004).
A Uniform Tableaux-Based Approach to Concept Abduction and Contraction in ALN
S. Colucci;T. Di Noia;E. Di Sciascio;F. M. Donini;M. Mongiello
2004-01-01
Abstract
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.I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
