Relevant closure: a new form of defeasible reasoning for description logics

DOI10.1007/978-3-319-11558-0_7MaRDI QIDQ2938487zbMATH OpenOpenAlexFDO

Authors Giovanni Casini, Kodylan Moodley, Riku Nortje, Thomas 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

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

Recommendations

• Reasoning in the defeasible description logic \(\mathcal{EL}_{\bot}\) -- computing standard inferences under rational and relevant semantics
• A KLM perspective on defeasible reasoning for description logics
• Contextual rational closure for defeasible \(\mathcal{ALC} \)
• Rational closure for all description logics
• Defeasible reasoning in \(\mathcal{SROEL}\): from rational entailment to rational closure

Cited in

(19)

• Semantic characterization of rational closure: from propositional logic to description logics
• Reasoning in the defeasible description logic \(\mathcal{EL}_{\bot}\) -- computing standard inferences under rational and relevant semantics
• Defeasible inheritance-based description logics
• Reasoning about Multiple Aspects in Rational Closure for DLs
• A polynomial time subsumption algorithm for nominal safe \(\mathcal{ELO}_\bot\) under rational closure
• Defeasible description logic reasoning based on abstract syntax graph
• Approximations of system W between c-inference, system Z, and lexicographic inference
• Situated conditional reasoning
• Rational Closure for Defeasible Description Logics
• A KLM perspective on defeasible reasoning for description logics
• ASP for minimal entailment in a rational extension of SROEL
• On the logical properties of the nonmonotonic description logic \(\mathcal{DL}^{\operatorname{N}}\)
• A reconstruction of multipreference closure
• Towards a Rational Closure for Expressive Description Logics: the Case of 𝒮𝒽𝒾𝓆
• Rational closure for all description logics
• Defeasible RDFS via rational closure
• Reasoning about exceptions in ontologies: from the lexicographic closure to the skeptical closure
• Optimizing the computation of overriding in \(\mathcal{DL}^{\mathsf{N}}\)
• Deciding subsumption in defeasible \(\mathcal{ELI}_\bot\) with typicality models

This page was built for publication: Relevant closure: a new form of defeasible reasoning for description logics

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