Relevant Closure: A New Form of Defeasible Reasoning for Description Logics

DOI10.1007/978-3-319-11558-0_7zbMath1432.68433OpenAlexW2108555151MaRDI QIDQ2938487

Giovanni Casini, Riku Nortje, Kodylan Moodley, Thomas Andreas Meyer

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_7

Mathematics Subject Classification ID

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

Related Items (8)

On the logical properties of the nonmonotonic description logic \(\mathcal{DL}^{\operatorname{N}}\) ⋮ ASP for minimal entailment in a rational extension of SROEL ⋮ Situated conditional reasoning ⋮ Reasoning in the defeasible description logic \(\mathcal{EL}_{\bot}\) -- computing standard inferences under rational and relevant semantics ⋮ A polynomial time subsumption algorithm for nominal safe \(\mathcal{ELO}_\bot\) under rational closure ⋮ A reconstruction of multipreference closure ⋮ Reasoning about Exceptions in Ontologies: from the Lexicographic Closure to the Skeptical Closure ⋮ Optimizing the computation of overriding in \(\mathcal{DL}^{\mathsf{N}}\)

This page was built for publication: Relevant Closure: A New Form of Defeasible Reasoning for Description Logics