Anzeige
Erschienen in:
2017 | OriginalPaper | Buchkapitel
Including Quantification in Defeasible Reasoning for the Description Logic \(\mathcal {EL} _{\bot } \)
verfasst von : Maximilian Pensel, Anni-Yasmin Turhan
Erschienen in: Logic Programming and Nonmonotonic Reasoning
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
Abstract
Defeasible Description Logics (DDLs) can state defeasible concept inclusions and often use rational closure according to the KLM postulates for reasoning. If in DDLs with quantification a defeasible subsumption relationship holds between concepts, it can also hold if these concepts appear nested in existential restrictions. Earlier reasoning algorithms did not detect this kind of relationships. We devise a new form of canonical models that extend classical ones for \(\mathcal {EL} _{\bot }\) by elements that satisfy increasing amounts of defeasible knowledge and show that reasoning w.r.t. these models yields the missing rational entailments.