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, sho...
Simona Colucci, Tommaso Di Noia, Eugenio Di Sciasc...
We describe in this article an abductive procedure based on a constrained resolution principle. The choice of constrained resolution is motivated by the whish to gain full advanta...
We analyze the complexity of propositional kernel resolution (del Val 1999), a general method for obtaining logical consequences in restricted target languages. Different choices ...
Motivated by the need to extend features of semantic matchmaking between request and offer descriptions, a model is presented that exploits recently proposed non-standard inference...
Tommaso Di Noia, Eugenio Di Sciascio, Francesco M....
Abstract—In semantic matchmaking processes it is often useful, when the obtained match is not full, to provide explanations for the mismatch, to leverage further interaction and/...
Tommaso Di Noia, Eugenio Di Sciascio, Francesco M....