Rational closure for all description logics
From MaRDI portal
Publication:2321316
DOI10.1016/J.ARTINT.2019.04.001zbMATH Open1478.68345OpenAlexW2938157237WikidataQ128071737 ScholiaQ128071737MaRDI QIDQ2321316FDOQ2321316
Publication date: 28 August 2019
Published in: Artificial Intelligence (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.artint.2019.04.001
Recommendations
- Rational Closure for Defeasible Description Logics
- Semantic characterization of rational closure: from propositional logic to description logics
- Towards a Rational Closure for Expressive Description Logics: the Case of ๐ฎ๐ฝ๐พ๐
- Relevant closure: a new form of defeasible reasoning for description logics
- An adaptive logic for rational closure
- Practical reasoning for very expressive description logics
- Reasoning in Description Logics: Basics, Extensions, and Relatives
- scientific article; zbMATH DE number 1531967
- Reasoning in expressive description logics
- Publication:4938424
Cites Work
- Nonmonotonic reasoning, preferential models and cumulative logics
- Title not available (Why is that?)
- What does a conditional knowledge base entail?
- Title not available (Why is that?)
- The Complexity of Circumscription in DLs
- Priorities on defaults with prerequisites, and their application in treating specificity in terminological default logic
- Rational Closure for Defeasible Description Logics
- The strong exponential hierarchy collapses
- A non-monotonic description logic for reasoning about typicality
- Description logics of minimal knowledge and negation as failure
- Expressive probabilistic description logics
- Defeasible inheritance-based description logics
- Semantic characterization of rational closure: from propositional logic to description logics
- A Minimal Model Semantics for Nonmonotonic Reasoning
- On the logical properties of the nonmonotonic description logic \(\mathcal{DL}^{\operatorname{N}}\)
- Preferential 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
- Towards a Rational Closure for Expressive Description Logics: the Case of ๐ฎ๐ฝ๐พ๐
- Defeasible Reasoning in ๐ฎโ๐ชโฐโ: from Rational Entailment to Rational Closure
- ASP for minimal entailment in a rational extension of SROEL
Cited In (9)
- Reasoning about Multiple Aspects in Rational Closure for DLs
- An ASP approach for reasoning in a concept-aware multipreferential lightweight DL
- Situated conditional reasoning
- Rational Closure for Defeasible Description Logics
- A reconstruction of multipreference closure
- Towards a Rational Closure for Expressive Description Logics: the Case of ๐ฎ๐ฝ๐พ๐
- Defeasible RDFS via rational 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: Rational closure for all description logics
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2321316)
