Defeasible Reasoning in 𝒮ℛ𝒪ℰℒ: from Rational Entailment to Rational Closure

DOI10.3233/FI-2018-1698zbMath1404.68152arXiv1803.08885OpenAlexW3102065810MaRDI QIDQ4686517

Daniele Theseider Dupré, Laura Giordano

Publication date: 2 October 2018

Published in: Fundamenta Informaticae (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1803.08885

zbMATH Keywords

Datalogdescription logicsinstance checkingranked modelsrational and minimal entailmenttypicality operator

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Logic in artificial intelligence (68T27) Knowledge representation (68T30) Logic programming (68N17)

Related Items (4)

A polynomial time subsumption algorithm for nominal safe \(\mathcal{ELO}_\bot\) under rational closure ⋮ An ASP approach for reasoning in a concept-aware multipreferential lightweight DL ⋮ Reasoning about Exceptions in Ontologies: from the Lexicographic Closure to the Skeptical Closure ⋮ Rational closure for all description logics

This page was built for publication: Defeasible Reasoning in 𝒮ℛ𝒪ℰℒ: from Rational Entailment to Rational Closure