We present new algorithms for computing the union and intersection of all justifications for a given ontological consequence without first computing the set of all justifications. Our goal is to use these sets to explain the consequences and, if needed, repair them. Through an empirical evaluation, we show that our approach behaves well in practice for expressive description logics. In particular, the union of all justifications can be computed much faster than with existing justification-enumeration approaches.
Chen, J., Ma, Y., Penaloza, R., Yang, H. (2022). Union and Intersection of All Justifications. In The Semantic Web. ESWC 2022 19th International Conference, ESWC 2022, Hersonissos, Crete, Greece, May 29 – June 2, 2022, Proceedings (pp.56-73). Springer Science and Business Media Deutschland GmbH [10.1007/978-3-031-06981-9_4].
Union and Intersection of All Justifications
Penaloza R.;
2022
Abstract
We present new algorithms for computing the union and intersection of all justifications for a given ontological consequence without first computing the set of all justifications. Our goal is to use these sets to explain the consequences and, if needed, repair them. Through an empirical evaluation, we show that our approach behaves well in practice for expressive description logics. In particular, the union of all justifications can be computed much faster than with existing justification-enumeration approaches.
| File | Dimensione | Formato | |
|---|---|---|---|
|
Chen-2022-ESWC-preprint.pdf
accesso aperto
Descrizione: Intervento a convegno
Tipologia di allegato:
Submitted Version (Pre-print)
Licenza:
Altro
Dimensione
5.98 MB
Formato
Adobe PDF
|
5.98 MB | Adobe PDF | Visualizza/Apri |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
