Inconsistency-tolerant description logic. II: A tableau algorithm for CALC^ C

DOI10.1016/J.JAL.2007.06.001zbMATH Open1149.03023OpenAlexW2092329913MaRDI QIDQ946573FDOQ946573

Authors: S. P. Odintsov, Heinrich Wansing 

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

Recommendations

• scientific article; zbMATH DE number 2070200
• A Decidable Constructive Description Logic
• scientific article; zbMATH DE number 1612535
• A resolution based description logic calculus
• \({\mathcal KALC}\): a constructive semantics for \({\mathcal ALC}\)

zbMATH Keywords

description logicconstructive logicparaconsistent logictableau algorithms

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (17)

• Title not available (Why is that?)
• \(\mathcal {BCDL}\): Basic constructive description logic
• A hybrid calculus for logic \(N^{*}\): residual finiteness and decidability
• Combining linear-time temporal logic with constructiveness and paraconsistency
• A decidable paraconsistent relevant logic: Gentzen system and Routley-Meyer semantics
• Logical foundations and complexity of 4QL, a query language with unrestricted negation
• Inconsistency-tolerant multi-agent calculus
• Composition of an intuitionistic negation and negative modalities as a necessity operator
• Title not available (Why is that?)
• \({\mathcal KALC}\): a constructive semantics for \({\mathcal ALC}\)
• Carnap, Goguen, and the hyperontologies: logical pluralism and heterogeneous structuring in ontology design
• Inconsistency-tolerant reasoning with OWL DL
• Towards constructive DL for abstraction and refinement
• On the methodology of paraconsistent logic
• Improvement of a tableau-based algorithm and the finite-step halting theorem
• Proof theory of Nelson's paraconsistent logic: a uniform perspective
• Bisimilarity for paraconsistent description logics

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q946573)