Relation-changing models meet paraconsistency

Switch graphs are graph-like structures characterized by embedding higher-level edges (edges that link to other edges) to describe reactive phenomena. When an edge of such structure is traversed, the accessibility relation of this graph can be changed by adding/removing edges. Relation-changing mode...

Full description

Saved in:
Bibliographic Details
Published inJournal of logical and algebraic methods in programming Vol. 133; p. 100870
Main Authors Costa, Diana, Figueiredo, Daniel, Martins, Manuel A.
Format Journal Article
LanguageEnglish
Published Elsevier Inc 01.06.2023
Online AccessGet full text

Cover

More Information
Summary:Switch graphs are graph-like structures characterized by embedding higher-level edges (edges that link to other edges) to describe reactive phenomena. When an edge of such structure is traversed, the accessibility relation of this graph can be changed by adding/removing edges. Relation-changing models have been used to represent phenomena in diverse fields (from Biology to Computer Science) and some modal languages were introduced recently. In this paper we introduce four-valued local information in switch graphs, and propose a paraconsistent logic to study these systems.
ISSN:2352-2208
DOI:10.1016/j.jlamp.2023.100870