Inconsistency-Tolerant Multi-Agent Calculus
From MaRDI portal
Publication:3448622
DOI10.1142/S0218488514500433zbMath1323.03028MaRDI QIDQ3448622
Publication date: 26 October 2015
Published in: International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems (Search for Journal in Brave)
paraconsistencysequent calculusdecidabilitycompleteness theoremcut-elimination theoreminconsistency-tolerant logic
Logic in artificial intelligence (68T27) Cut-elimination and normal-form theorems (03F05) Paraconsistent logics (03B53) Agent technology and artificial intelligence (68T42)
Cites Work
- Synchronized linear-time temporal logic
- Proof theory of Nelson's paraconsistent logic: a uniform perspective
- Some useful 16-valued logics: How a computer network should think
- Inconsistency-tolerant description logic. II: A tableau algorithm for \(\mathcal{CALC}^{\mathsf C}\)
- Combining linear-time temporal logic with constructiveness and paraconsistency
- On axiomatizing Shramko-Wansing's logic
- The value of the four values
- Intuitive semantics for first-degree entailments and `coupled trees'
- Combining Valuations with Society Semantics
- Constructible falsity and inexact predicates
- Logic Programming with Strong Negation and Inexact Predicates
This page was built for publication: Inconsistency-Tolerant Multi-Agent Calculus
