A Logic for Paraconsistent Transition Systems

Ana Cruz
(Aveiro University)
Alexandre Madeira
(CIDMA, Aveiro University)
Luís Soares Barbosa
(INESC TEC & Dep. Informatics, Minho University)

Modelling complex information systems often entails the need for dealing with scenarios of inconsistency in which several requirements either reinforce or contradict each other. In this kind of scenarios, arising e.g. in knowledge representation, simulation of biological systems, or quantum computation, inconsistency has to be addressed in a precise and controlled way. This paper generalises Belnap-Dunn four-valued logic, introducing paraconsistent transition systems (PTS), endowed with positive and negative accessibility relations, and a metric space over the lattice of truth values, and their modal logic.

In Andrzej Indrzejczak and Michał Zawidzki: Proceedings of the 10th International Conference on Non-Classical Logics. Theory and Applications (NCL 2022), Łódź, Poland, 14-18 March 2022, Electronic Proceedings in Theoretical Computer Science 358, pp. 270–284.
Published: 14th April 2022.

ArXived at: https://dx.doi.org/10.4204/EPTCS.358.20 bibtex PDF
References in reconstructed bibtex, XML and HTML format (approximated).
Comments and questions to: eptcs@eptcs.org
For website issues: webmaster@eptcs.org