Computing repairs for inconsistent DL-programs over EL ontologies

DOI10.1007/978-3-319-11558-0_30MaRDI QIDQ2938511zbMATH OpenOpenAlexFDO

Authors Thomas Eiter, Michael Fink, Daria Stepanova

Publication date 14 January 2015

Published in Logics in Artificial Intelligence (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-11558-0_30

Mathematics Subject Classification ID

Logic programming (68N17) Logic in artificial intelligence (68T27) Knowledge representation (68T30)

Recommendations

• Computing repairs of inconsistent DL-programs over \(\mathcal{EL}\) ontologies
• Towards practical deletion repair of inconsistent DL-programs
• Data repair of inconsistent nonmonotonic description logic programs
• -ASP for computing repairs with existential ontologies
• scientific article; zbMATH DE number 1954112

Cited in

(8)

• Computing optimal repairs of quantified ABoxes w.r.t. static \(\mathcal{EL}\) TBoxes
• Computing repairs of inconsistent DL-programs over \(\mathcal{EL}\) ontologies
• Data repair of inconsistent nonmonotonic description logic programs
• -ASP for computing repairs with existential ontologies
• Towards practical deletion repair of inconsistent DL-programs
• Optimal fixed-premise repairs of \(\mathcal{E}\mathcal{L}\) TBoxes
• Optimal repairs in the description logic \(\mathcal{EL}\) revisited
• Tractable closure-based possibilistic repair for partially ordered DL-Lite ontologies

This page was built for publication: Computing repairs for inconsistent DL-programs over \(\mathcal{EL}\) ontologies

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2938511)