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

DOI10.1016/J.JAL.2007.06.001MaRDI QIDQ946573zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

description logicconstructive logicparaconsistent logictableau algorithms

Mathematics Subject Classification ID

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

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}\)

Cites work

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

Cited in

(17)

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

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)