A polynomial time subsumption algorithm for nominal safe \(\mathcal{ELO}_\bot\) under rational closure
From MaRDI portal
Publication:2224833
DOI10.1016/j.ins.2018.09.037zbMath1453.68177arXiv1802.08201OpenAlexW2788307127WikidataQ62668505 ScholiaQ62668505MaRDI QIDQ2224833
Umberto Straccia, Giovanni Casini, Thomas Andreas Meyer
Publication date: 4 February 2021
Published in: Information Sciences (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1802.08201
Related Items (8)
On the KLM properties of a fuzzy DL with typicality ⋮ Reasoning on with Defeasibility in ASP ⋮ Reasoning in the defeasible description logic \(\mathcal{EL}_{\bot}\) -- computing standard inferences under rational and relevant semantics ⋮ An ASP approach for reasoning in a concept-aware multipreferential lightweight DL ⋮ On rational entailment for propositional typicality logic ⋮ Weighted defeasible knowledge bases and a multipreference semantics for a deep neural network model ⋮ Rational closure for all description logics ⋮ Optimizing the computation of overriding in \(\mathcal{DL}^{\mathsf{N}}\)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- A non-monotonic description logic for reasoning about typicality
- Local closed world reasoning with description logics under the well-founded semantics
- Semantic characterization of rational closure: from propositional logic to description logics
- Description logic programs under probabilistic uncertainty and fuzzy vagueness
- Probabilistic description logic programs
- Nonmonotonic reasoning, preferential models and cumulative logics
- What does a conditional knowledge base entail?
- Reasoning in the defeasible description logic \(\mathcal{EL}_{\bot}\) -- computing standard inferences under rational and relevant semantics
- Priorities on defaults with prerequisites, and their application in treating specificity in terminological default logic
- Another perspective on default reasoning
- The incredible ELK. From polynomial procedures to efficient reasoning with \(\mathcal {EL}\) ontologies
- Including quantification in defeasible reasoning for the description logic \(\mathcal{EL}_{\bot}\)
- Defeasible Inheritance-Based Description Logics
- A Minimal Model Semantics for Nonmonotonic Reasoning
- Relevant Closure: A New Form of Defeasible Reasoning for Description Logics
- Well-founded semantics for description logic programs in the semantic web
- Complexities of Horn Description Logics
- A Tableau Calculus for a Nonmonotonic Extension of $\mathcal{EL}^\bot$
- ALC + T: a Preferential Extension of Description Logics
- Reconciling description logics and rules
- Prototypical Reasoning with Low Complexity Description Logics: Preliminary Results
- The Complexity of Circumscription in DLs
- The DL-Lite Family and Relations
- Towards a Rational Closure for Expressive Description Logics: the Case of 𝒮𝒽𝒾𝓆
- Defeasible Reasoning in 𝒮ℛ𝒪ℰℒ: from Rational Entailment to Rational Closure
- Rational Closure for Defeasible Description Logics
- Efficient Inferencing for OWL EL
- Decidability of Circumscribed Description Logics Revisited
- Description logics of minimal knowledge and negation as failure
This page was built for publication: A polynomial time subsumption algorithm for nominal safe \(\mathcal{ELO}_\bot\) under rational closure
