Prototypical Reasoning with Low Complexity Description Logics: Preliminary Results

DOI10.1007/978-3-642-04238-6_38zbMATH Open1258.68140OpenAlexW1731895280WikidataQ58207614 ScholiaQ58207614MaRDI QIDQ3643136FDOQ3643136

Authors: N. Olivetti, Laura Giordano, V. Gliozzi, G. L. Pozzato 

Publication date: 10 November 2009

Published in: Logic Programming and Nonmonotonic Reasoning (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-04238-6_38

Recommendations

• A non-monotonic description logic for reasoning about typicality
• Reasoning about Typicality in Preferential Description Logics
• Preferential Description Logics
• \({\mathcal{ALC}}+T\): a preferential extension of description logics
• Reasoning in description logics with typicalities and probabilities of exceptions

Mathematics Subject Classification ID

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

Cited In (8)

• A description logic of typicality for conceptual combination
• A polynomial time subsumption algorithm for nominal safe \(\mathcal{ELO}_\bot\) under rational closure
• Reasoning with prototypes in the description logic \({\mathcal {ALC}}\) using weighted tree automata
• Concept Synthesis Using Logic of Prototypes and Counterexamples: A Graded Consequence Approach
• ASP for minimal entailment in a rational extension of SROEL
• Adding threshold concepts to the description logic \(\mathcal{EL}\)
• Extending the description logic \(\tau\mathcal{EL}(\deg)\) with acyclic TBoxes
• A tableau calculus for a nonmonotonic extension of \(\mathcal{EL}^\bot\)

This page was built for publication: Prototypical Reasoning with Low Complexity Description Logics: Preliminary Results

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