Nonmonotonic reasoning, preferential models and cumulative logics
Artificial Intelligence
What does a conditional knowledge base entail?
Artificial Intelligence
The Description Logic Handbook
The Description Logic Handbook
Pellet: A practical OWL-DL reasoner
Web Semantics: Science, Services and Agents on the World Wide Web
Axiom Pinpointing in General Tableaux
TABLEAUX '07 Proceedings of the 16th international conference on Automated Reasoning with Analytic Tableaux and Related Methods
Web Semantics: Science, Services and Agents on the World Wide Web
Explaining Inconsistencies in OWL Ontologies
SUM '09 Proceedings of the 3rd International Conference on Scalable Uncertainty Management
A correspondence theory for terminological logics: preliminary report
IJCAI'91 Proceedings of the 12th international joint conference on Artificial intelligence - Volume 1
ALC + T: a Preferential Extension of Description Logics
Fundamenta Informaticae - Advances in Computational Logic (CIL C08)
Rational closure for defeasible description logics
JELIA'10 Proceedings of the 12th European conference on Logics in artificial intelligence
The OWL API: A Java API for OWL ontologies
Semantic Web
Preferential Reasoning for Modal Logics
Electronic Notes in Theoretical Computer Science (ENTCS)
FaCT++ description logic reasoner: system description
IJCAR'06 Proceedings of the Third international joint conference on Automated Reasoning
Semantic foundation for preferential description logics
AI'11 Proceedings of the 24th international conference on Advances in Artificial Intelligence
Hi-index | 0.00 |
Classical reasoning for logic-based KR (Knowledge Representation) systems is in general, monotonic. That is, there is an assumption in these systems that there is complete information about a domain. This means that they generally cannot deal with any new information arising which contradicts with the current information. This is not an appropriate model for reasoning in many applications. Therefore, alternative non-monotonic systems have been investigated which can reason under uncertainty or with incomplete information. Defeasible reasoning is one particular model for implementing non-monotonic reasoning. It is concerned with representing and reasoning with defeasible (non-strict) facts about a domain. The defeasible counterpart of the strict fact: "All birds fly" is the defeasible fact: "Most birds fly" (or the alternative phrasing "Birds usually fly"). We discuss two approaches for defeasible reasoning in the family of logic-based KR languages known as Description Logics (DLs). They are applicable to particular extensions of DLs that allow for the statement of defeasible sentences similar to the aforementioned examples. The approaches are known as prototypical reasoning and presumptive reasoning and are both rooted in the notion of Rational Closure developed by Lehmann and Magidor for an extension of propositional logic. Here we recast their definitions in a DL context and define algorithms for prototypical and presumptive reasoning for DL knowledge bases (also called DL ontologies) that may contain defeasible sentences. In particular, we present a plug-in for the Protégé ontology editor which implements these algorithms for OWL ontologies - the Web Ontology Language (OWL) is a formal standard of languages whose semantic basis is identical to that of DLs. Our plug-in, RaMP, allows the modeller to indicate defeasible information in OWL ontologies and perform logical inferencing to determine what defeasible conclusions one can draw from these ontologies.