Halland, KBritz, K2013-03-252013-03-252012-06Halland, K and Britz, K. 2012. Naive ABox abduction in ALC using a DL reasoner. Proceedings of the 25th International Workshop on Description Logics, 7-10 June 2012, Rome, Italy, volume 846 CEUR Workshop Proceedings1613-0073http://ceur-ws.org/Vol-846/paper_47.pdfhttp://www.cair.za.net/sites/default/files/outputs/NAAinA4.pdfhttp://hdl.handle.net/10204/658525th International Workshop on Description Logics, Rome, Italy, 7-10 June 2012The formal definition of abduction asks what needs to be added to a knowledge base to enable an observation to be entailed by the knowledge base. An observation which is not entailed by the knowledge base will result in open branches in a complete semantic tableau for the entailment. The statements required to close these branches therefore represent a solution to the abductive problem. In this paper we describe how this idea can be implemented for ABox abduction in the description logic ALC. We analyse the limitations of our algorithm and propose refinements to improve the quality of results.enDescription logicsABox abductionALC description logicsSemanticsNaive ABox abduction in ALC using a DL tableauConference PresentationHalland, K., & Britz, K. (2012). Naive ABox abduction in ALC using a DL tableau. Sun SITE Central Europe (CEUR). http://hdl.handle.net/10204/6585Halland, K, and K Britz. "Naive ABox abduction in ALC using a DL tableau." (2012): http://hdl.handle.net/10204/6585Halland K, Britz K, Naive ABox abduction in ALC using a DL tableau; Sun SITE Central Europe (CEUR); 2012. http://hdl.handle.net/10204/6585 .TY - Conference Presentation AU - Halland, K AU - Britz, K AB - The formal definition of abduction asks what needs to be added to a knowledge base to enable an observation to be entailed by the knowledge base. An observation which is not entailed by the knowledge base will result in open branches in a complete semantic tableau for the entailment. The statements required to close these branches therefore represent a solution to the abductive problem. In this paper we describe how this idea can be implemented for ABox abduction in the description logic ALC. We analyse the limitations of our algorithm and propose refinements to improve the quality of results. DA - 2012-06 DB - ResearchSpace DP - CSIR KW - Description logics KW - ABox abduction KW - ALC description logics KW - Semantics LK - https://researchspace.csir.co.za PY - 2012 SM - 1613-0073 T1 - Naive ABox abduction in ALC using a DL tableau TI - Naive ABox abduction in ALC using a DL tableau UR - http://hdl.handle.net/10204/6585 ER -