swMATH16742MaRDI QIDQ28610FDOQ28610
Author name not available (Why is that?)
Official website: http://link.springer.com/chapter/10.1007%2F978-3-319-40970-2_32
Cited In (19)
- Hypergraph-based inference rules for computing \(\mathcal{EL}^+\)-ontology justifications
- Counting minimal unsatisfiable subsets
- BEACON: an efficient SAT-based tool for debugging \(\mathcal {EL}^+\) ontologies
- Ltur
- AMUSE
- CEL
- MUSer2
- Just
- ELK
- VoCol
- EL2MCS
- PULi
- HgMUS
- Understanding the complexity of axiom pinpointing in lightweight description logics
- Efficient reasoning for inconsistent Horn formulae
- QRATPre+
- Pinpointing axioms in ontologies via ASP
- The Bayesian ontology language \(\mathcal {BEL}\)
- Enumerating justifications using resolution
This page was built for software: BEACON
