skip to main content
10.1145/2389836.2389843acmotherconferencesArticle/Chapter ViewAbstractPublication PageshtConference Proceedingsconference-collections
research-article

ABox abduction in ALC using a DL tableau

Published:01 October 2012Publication History

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.

References

  1. Baader, F., Calvanese, D., McGuinness, D., Nardi, D., Patel-Schneider, P.: The Description Logic Handbook, Cambridge University Press, 2003. Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. Baader, F., Horrocks, I., Sattler, U.: Chapter 3: Description Logics. In: van Harmelen, F., Lifschitz, V., Porter, B., editors: Handbook of Knowledge Representation, Elsevier, 2007.Google ScholarGoogle Scholar
  3. Baader, F., Sertkaya, B., Turhan, A.: Computing the least common subsumer w.r.t. a background terminology, Journal of Applied Logic, Springer, 2004.Google ScholarGoogle ScholarCross RefCross Ref
  4. Di Noia, T., Di Sciascio, E., Donini, F. M.: Computing information minimal match explanations for logic-based matchmaking, in Proc. of the 2009 IEEE/WIC/ACM International Joint Conference on Web Intelligence and Intelligent Agent Technology - Volume 02, IEEE Computer Society, 2009. Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. Du, J. Qi, G., Shen, Y-D., Pan, J. Z.: Towards practical ABox abduction in large OWL DL ontologies, in Proc. of the 25th AAAI Conference, 2011.Google ScholarGoogle Scholar
  6. Elsenbroich, C., Kutz, O., Sattler, U.: A case for abductive reasoning over ontologies, in Proc. of the OWLED'06 Workshop, vol 216, 2006.Google ScholarGoogle Scholar
  7. Halland, K., Britz, K.: Naïve Abox abduction in ALC using a DL tableau, in Proc. of DL2012, pp 443--453, 2012.Google ScholarGoogle Scholar
  8. Horrocks, I., Kutz, O., Sattler, U.: The even more irresistible SROIQ, in Proc. of KR2006, pp 57--67, 2006.Google ScholarGoogle Scholar
  9. Klarman, S., Endriss, U., Schlobach, S.: ABox abduction in the description logic ALC, Journal of Automated Reasoning, vol 46: 1, 2011. Google ScholarGoogle ScholarDigital LibraryDigital Library
  10. Lin, F.: On strongest necessary and weakest sufficient conditions, in Proc. of KR2000, pp 167--175, 2000.Google ScholarGoogle Scholar
  11. Reiter, R.: A theory of diagnosis from first principles, Artificial Intelligence, vol 32, 1987. Google ScholarGoogle ScholarDigital LibraryDigital Library
  12. Schild, K.: A correspondence theory for terminological logics: preliminary report. In Proc. of IJCAI'91, pp 446--471, 1991. Google ScholarGoogle ScholarDigital LibraryDigital Library
  13. Wotawa, F.: A variant of Reiter's hitting-set algorithm, Information Processing Letters, vol 79, 2001. Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. ABox abduction in ALC using a DL tableau

        Recommendations

        Comments

        Login options

        Check if you have access through your login credentials or your institution to get full access on this article.

        Sign in
        • Published in

          cover image ACM Other conferences
          SAICSIT '12: Proceedings of the South African Institute for Computer Scientists and Information Technologists Conference
          October 2012
          402 pages
          ISBN:9781450313087
          DOI:10.1145/2389836

          Copyright © 2012 ACM

          Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

          Publisher

          Association for Computing Machinery

          New York, NY, United States

          Publication History

          • Published: 1 October 2012

          Permissions

          Request permissions about this article.

          Request Permissions

          Check for updates

          Qualifiers

          • research-article

          Acceptance Rates

          Overall Acceptance Rate187of439submissions,43%

        PDF Format

        View or Download as a PDF file.

        PDF

        eReader

        View online with eReader.

        eReader