---
res:
  bibo_abstract:
  - Abduction is the task of computing a sufficient extension of a knowledge base
    (KB) that entails a conclusion not entailed by the original KB. It serves to compute
    explanations, or hypotheses, for such missing entailments. While this task has
    been intensively investigated for perfect data and under classical semantics,
    less is known about abduction when erroneous data results in inconsistent KBs.
    In this paper we define a suitable notion of abduction under repair semantics
    and propose a set of minimality criteria that guides abduction towards `useful'
    hypotheses. We provide initial complexity results on deciding existence of and
    verifying abductive solutions with these criteria, under different repair semantics
    and for the description logics DL-Lite and EL_bot.@eng
  bibo_authorlist:
  - foaf_Person:
      foaf_givenName: Anselm
      foaf_name: Haak, Anselm
      foaf_surname: Haak
      foaf_workInfoHomepage: http://www.librecat.org/personId=109969
  - foaf_Person:
      foaf_givenName: Patrick
      foaf_name: Koopmann, Patrick
      foaf_surname: Koopmann
  - foaf_Person:
      foaf_givenName: Yasir
      foaf_name: Mahmood, Yasir
      foaf_surname: Mahmood
      foaf_workInfoHomepage: http://www.librecat.org/personId=99353
  - foaf_Person:
      foaf_givenName: Anni-Yasmin
      foaf_name: Turhan, Anni-Yasmin
      foaf_surname: Turhan
      foaf_workInfoHomepage: http://www.librecat.org/personId=104470
  dct_date: 2025^xs_gYear
  dct_language: eng
  dct_title: Why not? Developing ABox Abduction beyond Repairs@
...