ABox abduction in ALC using a DL tableau

Authors:
Ken Halland;Katarina Britz
Affiliations:
University of South Africa, Pretoria, South Africa;UKZN and CSIR Meraka Institute, South Africa
Venue:
Proceedings of the South African Institute for Computer Scientists and Information Technologists Conference
Year:
2012

Citing 6
Cited 0

A theory of diagnosis from first principles

Artificial Intelligence
A variant of Reiter's hitting-set algorithm

Information Processing Letters
The Description Logic Handbook

The Description Logic Handbook
A correspondence theory for terminological logics: preliminary report

IJCAI'91 Proceedings of the 12th international joint conference on Artificial intelligence - Volume 1
Computing Information Minimal Match Explanations for Logic-Based Matchmaking

WI-IAT '09 Proceedings of the 2009 IEEE/WIC/ACM International Joint Conference on Web Intelligence and Intelligent Agent Technology - Volume 02
ABox Abduction in the Description Logic $\boldsymbol{\mathcal{ALC}}$

Journal of Automated Reasoning

Quantified Score

Hi-index	0.00

Visualization

Abstract

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. ABox abduction in description logics (DLs) asks what ABox statements need to be added to a DL knowledge base to allow an observation (also in the form of ABox statements) to be entailed. Klarman et al have provided an algorithm for performing ABox abduction in the description logic ALC by converting the knowledge base and observation to first-order logic, using a connection tableau to obtain abductive solutions, and then converting these back to DL syntax. In this paper we describe how this can be done directly using a DL tableau.