- Titel
- Beyond Optimal
- Untertitel
- Interactive Identification of Better-than-optimal Repairs
- Extended Version
- Zitierfähige Url:
- https://nbn-resolving.org/urn:nbn:de:bsz:14-qucosa2-945117
- Schriftenreihe
- LTCS-Report
- Bandnummer
- 24-05
- Erstveröffentlichung
- 2024
- DOI
- https://doi.org/10.25368/2024.319
- Abstract (EN)
- We propose an interactive repair method for the description logic EL that is based on the optimal-repair framework. The obtained repair might not be optimal in the theoretical sense, i.e. more than a minimal amount of consequences might have been removed---but from a practical perspective it is superior to a theoretically optimal repair as the interaction strategy enables the users to identify further faulty consequences connected to the initially reported errors.
- This is an extended version of an article accepted at the KRR track of the 40th ACM/SIGAPP Symposium On Applied Computing (SAC 2025).
- Zitiert in
- Proceedings of the 40th ACM/SIGAPP Symposium On Applied Computing (SAC 2025)
- Freie Schlagwörter (DE)
- Beschreibungslogik, Wissensbasisreparatur, Optimale Reparatur, Anfechtbare Konsequenz, Interaktive Reparatur
- Freie Schlagwörter (EN)
- Description Logic, Knowledge-base repair, Optimal repair, Disputable consequence, Interactive repair
- Klassifikation (DDC)
- 004
- Klassifikation (RVK)
- ST 136
- Herausgeber (Institution)
- Technische Universität Dresden
- Förder- / Projektangaben
- Deutsche Forschungsgemeinschaft (DFG)
TRR 248: Foundations of Perspicuous Software Systems
Enabling Comprehension in a Cyber-Physical World
ID: 389792660 - Deutsche Forschungsgemeinschaft (DFG)
Reparatur beschreibungslogischer Ontologien
ID: 430150274 - Center for Scalable Data Analytics and Artificial Intelligence Dresden/Leipzig (ScaDS.AI)
- Version / Begutachtungsstatus
- angenommene Version / Postprint / Autorenversion
- URN Qucosa
- urn:nbn:de:bsz:14-qucosa2-945117
- Veröffentlichungsdatum Qucosa
- 18.12.2024
- Dokumenttyp
- Bericht
- Sprache des Dokumentes
- Englisch
- Lizenz / Rechtehinweis
CC BY 4.0