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.
CITATION STYLE
Chen, J., Ma, Y., Peñaloza, R., & Yang, H. (2022). Union and Intersection of All Justifications. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 13261 LNCS, pp. 56–73). Springer Science and Business Media Deutschland GmbH. https://doi.org/10.1007/978-3-031-06981-9_4
Mendeley helps you to discover research relevant for your work.