A tableau calculus for a nonmonotonic extension of EL^

DOI10.1007/978-3-642-22119-4_15MaRDI QIDQ3010368zbMATH OpenOpenAlexDBLPWikidataFDO

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

Publication date 1 July 2011

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-22119-4_15

Mathematics Subject Classification ID

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

Recommendations

• A non-monotonic description logic for reasoning about typicality
• A note on a description logic of concept and role typicality for defeasible reasoning over ontologies
• Reasoning about Typicality in Preferential Description Logics
• Preferential Description Logics
• Defeasible reasoning in \(\mathcal{SROEL}\): from rational entailment to rational closure

Cites work

• Defeasible inclusions in low-complexity DLs
• Description logics of minimal knowledge and negation as failure
• scientific article; zbMATH DE number 1149405 (Why is no real title available?)
• Nonmonotonic reasoning, preferential models and cumulative logics
• Priorities on defaults with prerequisites, and their application in treating specificity in terminological default logic
• Prototypical Reasoning with Low Complexity Description Logics: Preliminary Results
• Rational Closure for Defeasible Description Logics
• Reasoning about Typicality in Preferential Description Logics

Cited in

(2)

• A tableau prover for domain minimization
• A polynomial time subsumption algorithm for nominal safe \(\mathcal{ELO}_\bot\) under rational closure

This page was built for publication: A tableau calculus for a nonmonotonic extension of \(\mathcal{EL}^\bot\)

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