Access the full text.
Sign up today, get DeepDyve free for 14 days.
Giovanni Casini, T. Meyer, I. Varzinczak, Kodylan Moodley (2013)
Nonmonotonic Reasoning in Description Logics: Rational Closure for the ABox
A. BonattiPiero, LutzCarsten, WolterFrank (2009)
The complexity of circumscription in description logicJournal of Artificial Intelligence Research
R. Booth, J. Paris (1998)
A Note on the Rational Closure of Knowledge Bases with Both Positive and Negative KnowledgeJournal of Logic, Language and Information, 7
Loris Bozzato, Thomas Eiter, L. Serafini (2018)
Enhancing context knowledge repositories with justifiable exceptionsArtif. Intell., 257
Laura Giordano, N. Olivetti, Valentina Gliozzi, G. Pozzato (2009)
ALC + T: a Preferential Extension of Description LogicsFundam. Informaticae, 96
J. Quantz, V. Royer (1992)
A Preference Semantics for Defaults in Terminological Logics
K. Britz, J. Heidema, T. Meyer (2008)
Semantic Preferential Subsumption
Giovanni Casini, U. Straccia (2010)
Rational Closure for Defeasible Description Logics
L. Serafini, Martin Homola (2012)
Contextualized knowledge repositories for the Semantic WebJ. Web Semant., 12
K. Britz, T. Meyer, I. Varzinczak (2011)
Semantic Foundation for Preferential Description Logics
K. Britz, I. Varzinczak (2013)
Defeasible ModalitiesArXiv, abs/1310.6409
D. Lehmann, M. Magidor (1989)
What does a Conditional Knowledge Base Entail?
Y. Shoham (1987)
Reasoning About Change: Time and Causation from the Standpoint of Artificial Intelligence
Laura Giordano, Valentina Gliozzi, N. Olivetti, G. Pozzato (2008)
Reasoning about Typicality in Preferential Description Logics
Giovanni Casini, T. Meyer, Kodylan Moodley, U. Sattler, I. Varzinczak (2015)
Introducing Defeasibility into OWL Ontologies
L Giordano, V Gliozzi, N Olivetti, GL Pozzato (2009)
$\mathcal {{{ALC}}}+{T}$AℒC + T: a preferential extension of description logicsFund. Inf., 96
F. Baader, Diego Calvanese, D. McGuinness, D. Nardi, P. Patel-Schneider (2007)
The Description Logic Handbook
G Casini, U Straccia (2013)
Defeasible inheritance-based description logicsJ. Artif. Intell Res. (JAIR), 48
I. Varzinczak (2018)
A Note on a Description Logic of Concept and Role Typicality for Defeasible Reasoning Over OntologiesLogica Universalis, 12
(2014)
Ordered Interpretations and Entailment for Defeasible Description Logics
K. Britz, I. Varzinczak (2018)
From KLM-style conditionals to defeasible modalities, and backJournal of Applied Non-Classical Logics, 28
K. Britz, I. Varzinczak (2018)
Rationality and Context in Defeasible Subsumption
K. Britz, I. Varzinczak (2017)
Context-based defeasible subsumption for dSROIQ
K. Britz (2016)
Rational Defeasible Reasoning for Description Logics
R. Booth, Giovanni Casini, T. Meyer, I. Varzinczak (2015)
On the Entailment Problem for a Logic of Typicality
P. Bonatti, L. Sauro (2017)
On the logical properties of the nonmonotonic description logic DLNArtif. Intell., 248
R. Booth, T. Meyer, I. Varzinczak (2012)
PTL: A Propositional Typicality Logic
Antonis Bikakis, G. Antoniou (2010)
Defeasible Contextual Reasoning with Arguments in Ambient IntelligenceIEEE Transactions on Knowledge and Data Engineering, 22
K. Britz, I. Varzinczak (2019)
Preferential Tableaux for Contextual Defeasible ALC
P. Bonatti, M. Faella, I. Petrova, L. Sauro (2015)
A new semantics for overriding in description logicsArtif. Intell., 222
Proceedings of the Twenty-Second International Joint Conference on Artificial Intelligence Defeasible Inheritance-Based Description Logics
Maximilian Pensel, Anni-Yasmin Turhan (2017)
Including Quantification in Defeasible Reasoning for the Description Logic EL⊥
Laura Giordano, Valentina Gliozzi, N. Olivetti, G. Pozzato (2013)
A non-monotonic Description Logic for reasoning about typicalityArtif. Intell., 195
P. Bonatti, M. Faella, L. Sauro (2011)
Defeasible Inclusions in Low-Complexity DLsArXiv, abs/1401.3901
(2000)
An argumentation framework based on contextual preferences
D. Lehmann (1995)
Another perspective on default reasoningAnnals of Mathematics and Artificial Intelligence, 15
(1992)
and M
Kodylan Moodley, T. Meyer, U. Sattler (2014)
Practical Defeasible Reasoning for Description Logics
K. Britz, I. Varzinczak (2016)
Introducing Role Defeasibility in Description Logics
P. Bonatti, C. Lutz, F. Wolter (2009)
The Complexity of Circumscription in DLsArXiv, abs/1401.3476
Laura Giordano, Valentina Gliozzi, N. Olivetti, G. Pozzato (2012)
A Minimal Model Semantics for Nonmonotonic Reasoning
Craig Boutilier (1994)
Conditional Logics of Normality: A Modal ApproachArtif. Intell., 68
(2017)
Toward defeasible SROIQ
K. Britz, I. Varzinczak (2018)
Preferential Accessibility and Preferred WorldsJournal of Logic, Language and Information, 27
K. Britz, Giovanni Casini, T. Meyer, I. Varzinczak (2013)
Preferential Role Restrictions
K. Britz, Giovanni Casini, T. Meyer, I. Varzinczak (2019)
A KLM Perspective on Defeasible Reasoning for Description Logics
(2003)
EditorsJournal of Australian Studies, 27
Laura Giordano, Valentina Gliozzi, N. Olivetti, G. Pozzato (2015)
Semantic characterization of rational closure: From propositional logic to description logicsArtif. Intell., 226
Kunal Sengupta, Adila Krisnadhi, P. Hitzler (2011)
Local Closed World Semantics: Grounded Circumscription for OWL
R. Booth, T. Meyer, I. Varzinczak (2013)
A propositional typicality logic for extending rational consequence
Laura Giordano, Valentina Gliozzi, N. Olivetti, G. Pozzato (2007)
Preferential Description Logics
Sarit Kraus, D. Lehmann, M. Magidor (1990)
Nonmonotonic Reasoning, Preferential Models and Cumulative LogicsArXiv, cs.AI/0202021
Szymon Klarman, Víctor Gutiérrez-Basulto (2016)
Description logics of contextJ. Log. Comput., 26
Description logics have been extended in a number of ways to support defeasible reasoning in the KLM tradition. Such features include preferential or rational defeasible concept inclusion, and defeasible roles in complex concept descriptions. Semantically, defeasible subsumption is obtained by means of a preference order on objects, while defeasible roles are obtained by adding a preference order to role interpretations. In this paper, we address an important limitation in defeasible extensions of description logics, namely the restriction in the semantics of defeasible concept inclusion to a single preference order on objects. We do this by inducing a modular preference order on objects from each modular preference order on roles, and using these to relativise defeasible subsumption. This yields a notion of contextualised rational defeasible subsumption, with contexts described by roles. We also provide a semantic construction for rational closure and a method for its computation, and present a correspondence result between the two.
Annals of Mathematics and Artificial Intelligence – Springer Journals
Published: Jul 20, 2019
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.