Managing inconsistent specifications: reasoning, analysis, and action
ACM Transactions on Software Engineering and Methodology (TOSEM)
Handbook of defeasible reasoning and uncertainty management systems
Quasi-classical Logic: Non-trivializable classical reasoning from incosistent information
ECSQARU '95 Proceedings of the European Conference on Symbolic and Quantitative Approaches to Reasoning and Uncertainty
A Semantic Tableau Version of First-Order Quasi-Classical Logic
ECSQARU '01 Proceedings of the 6th European Conference on Symbolic and Quantitative Approaches to Reasoning with Uncertainty
Reasoning with inconsistency in structured text
The Knowledge Engineering Review
A Tableau Algorithm for Handling Inconsistency in OWL
ESWC 2009 Heraklion Proceedings of the 6th European Semantic Web Conference on The Semantic Web: Research and Applications
Paraconsistent semantics for description logics: a comparison
KES'11 Proceedings of the 15th international conference on Knowledge-based and intelligent information and engineering systems - Volume Part I
Interpolation theorems for some extended description logics
KES'11 Proceedings of the 15th international conference on Knowledge-based and intelligent information and engineering systems - Volume Part II
Argumentation-Based reasoning with inconsistent knowledge bases
AI'10 Proceedings of the 23rd Canadian conference on Advances in Artificial Intelligence
Towards a paradoxical description logic for the semantic web
FoIKS'10 Proceedings of the 6th international conference on Foundations of Information and Knowledge Systems
| Hi-index | 0.00 |
Description logics are a family of knowledge representation formalism which descended from semantic networks. During the past decade, the important reasoning problems such as satisfiability and subsumption have been handled by tableau-like algorithms. Description logics are practical monotonic logics which, though imparting strong and conclusive reasoning mechanisms, lack the flexibility of non-monotonic reasoning mechanisms. In recent years, the study of inconsistency handling in description logics becomes more and more important. Some technologies are being applied to handle inconsistency in description logic. Quasi-classical logic, which allows the derivation of nontrivial classical inferences from inconsistent information, supports many important proof rules such as modus tollens, modus ponens, and disjunctive syllogism. In this paper, we consider the characters of $\mathcal{ALC}$ with Quasi-classical semantics and develop a sound and complete tableau algorithm for paraconsistent reasoning in $\mathcal{ALC}$.