Inconsistency-tolerant description logic. II: A tableau algorithm for \(\mathcal{CALC}^{\mathsf C}\)

DOI10.1016/j.jal.2007.06.001zbMath1149.03023OpenAlexW2092329913MaRDI QIDQ946573

Heinrich Wansing, Sergei P. Odintsov

Publication date: 23 September 2008

Published in: Journal of Applied Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jal.2007.06.001

zbMATH Keywords

description logictableau algorithmsconstructive logicparaconsistent logic

Mathematics Subject Classification ID

Logic in artificial intelligence (68T27) Paraconsistent logics (03B53)

Related Items (14)

Bisimilarity for paraconsistent description logics ⋮ Inconsistency-Tolerant Multi-Agent Calculus ⋮ Logical foundations and complexity of 4QL, a query language with unrestricted negation ⋮ KALC: a constructive semantics for ALC ⋮ Carnap, Goguen, and the hyperontologies: logical pluralism and heterogeneous structuring in ontology design ⋮ Composition of an intuitionistic negation and negative modalities as a necessity operator ⋮ A hybrid calculus for logic \(N^{*}\): residual finiteness and decidability ⋮ Towards constructive DL for abstraction and refinement ⋮ \(\mathcal {BCDL}\): Basic constructive description logic ⋮ Combining linear-time temporal logic with constructiveness and paraconsistency ⋮ On the Methodology of Paraconsistent Logic ⋮ A decidable paraconsistent relevant logic: Gentzen system and Routley-Meyer semantics ⋮ Proof theory of Nelson's paraconsistent logic: a uniform perspective ⋮ Inconsistency-tolerant reasoning with OWL DL

Cites Work

• Some useful 16-valued logics: How a computer network should think
• Phase semantics and Petri net interpretation for resource-sensitive strong negation
• A four-valued semantics for terminological logics
• The logic of information structures
• Intuitive semantics for first-degree entailments and `coupled trees'
• Partiality and its dual
• Contraction-free sequent calculi for intuitionistic logic
• A description logic with transitive and inverse roles and role hierarchies
• An O(n log n)-Space Decision Procedure for Intuitionistic Propositional Logic
• A sequent calculus for reasoning in four-valued Description Logics
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Inconsistency-tolerant description logic. II: A tableau algorithm for \(\mathcal{CALC}^{\mathsf C}\)