Optimizing the computation of overriding in \(\mathcal{DL}^{\mathsf{N}}\)
From MaRDI portal
Publication:2082509
DOI10.1016/j.artint.2022.103764OpenAlexW4285678322WikidataQ113879644 ScholiaQ113879644MaRDI QIDQ2082509
L. Sauro, I. M. Petrova, Piero A. Bonatti
Publication date: 4 October 2022
Published in: Artificial Intelligence (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.artint.2022.103764
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A non-monotonic description logic for reasoning about typicality
- Stable models and circumscription
- Defeasible inheritance with doubt index and its axiomatic characterization
- Semantic characterization of rational closure: from propositional logic to description logics
- Deciding inseparability and conservative extensions in the description logic
- A polynomial time subsumption algorithm for nominal safe \(\mathcal{ELO}_\bot\) under rational closure
- Rational closure for all description logics
- HermiT: an OWL 2 reasoner
- The incredible ELK. From polynomial procedures to efficient reasoning with \(\mathcal {EL}\) ontologies
- On the logical properties of the nonmonotonic description logic \(\mathcal{DL}^{\operatorname{N}}\)
- Optimizing terminological reasoning for expressive description logics
- Defeasible Inheritance-Based Description Logics
- Relevant Closure: A New Form of Defeasible Reasoning for Description Logics
- ALC + T: a Preferential Extension of Description Logics
- Reasoning about Typicality in Preferential Description Logics
- The DL-Lite Family and Relations
- Rational Closure for Defeasible Description Logics
- Enhancing Magic Sets with an Application to Ontological Reasoning
- Description logics of minimal knowledge and negation as failure
This page was built for publication: Optimizing the computation of overriding in \(\mathcal{DL}^{\mathsf{N}}\)
