Rational Closure for Defeasible Description Logics
From MaRDI portal
Publication:4930756
DOI10.1007/978-3-642-15675-5_9zbMath1306.68187OpenAlexW1571433157WikidataQ58049249 ScholiaQ58049249MaRDI QIDQ4930756
Umberto Straccia, Giovanni Casini
Publication date: 1 October 2010
Published in: Logics in Artificial Intelligence (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-15675-5_9
Related Items
An ASP Approach for Reasoning on Neural Networks under a Finitely Many-Valued Semantics for Weighted Conditional Knowledge Bases ⋮ A note on a description logic of concept and role typicality for defeasible reasoning over ontologies ⋮ Preferences in artificial intelligence ⋮ On the KLM properties of a fuzzy DL with typicality ⋮ Data repair of inconsistent nonmonotonic description logic programs ⋮ A Minimal Model Semantics for Nonmonotonic Reasoning ⋮ On the logical properties of the nonmonotonic description logic \(\mathcal{DL}^{\operatorname{N}}\) ⋮ Reasoning on with Defeasibility in ASP ⋮ ASP for minimal entailment in a rational extension of SROEL ⋮ Semantic characterization of rational closure: from propositional logic to description logics ⋮ Situated conditional reasoning ⋮ Preferential accessibility and preferred worlds ⋮ Generalized fuzzy rough description logics ⋮ 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 ⋮ An ASP approach for reasoning in a concept-aware multipreferential lightweight DL ⋮ A Tableau Calculus for a Nonmonotonic Extension of $\mathcal{EL}^\bot$ ⋮ Enhancing context knowledge repositories with justifiable exceptions ⋮ Contextual rational closure for defeasible \(\mathcal{ALC} \) ⋮ On rational entailment for propositional typicality logic ⋮ A reconstruction of multipreference closure ⋮ Weighted defeasible knowledge bases and a multipreference semantics for a deep neural network model ⋮ Preferential Reasoning for Modal Logics ⋮ Inconsistency-Tolerant Query Answering: Rationality Properties and Computational Complexity Analysis ⋮ Introducing Role Defeasibility in Description Logics ⋮ Reasoning about Exceptions in Ontologies: from the Lexicographic Closure to the Skeptical Closure ⋮ Strong inconsistency ⋮ Rational closure for all description logics ⋮ Optimizing the computation of overriding in \(\mathcal{DL}^{\mathsf{N}}\) ⋮ Typicalities and probabilities of exceptions in nonmotonic description logics
