Geodesic
Branching time agents' logic, satisfiability problem by rules in reduced form
Sibirskie èlektronnye matematičeskie izvestiâ, Tome 16 (2019), pp. 1158-1170

Voir la notice de l'article provenant de la source Math-Net.Ru

This paper considers the branching time logic on non-transitive intervals of agents' accessibility relations. The agents' accessibility relations are defined inside transitivity intervals and via neighboring limit points, they may be not complete and lose some states — the lacunas of forgotten time thought they may interfere. This approach is used for modeling computational processes and analysis of incomplete information for individual agents. A logical language for reasoning about models' properties which includes temporal and modal logical operations is suggested. Illustrative examples are provided. Mathematical part of the paper is devoted to the satisfiability and decidability problems for the suggested logic. We use instruments of reduced normal forms for rules and algorithms converting rules to such forms. We find algorithms solving the satisfiability problem. Some open problems are suggested.
Keywords: temporal logic, branching time logic, multi-agent logic, computability, satisfiability, decidability.
Mots-clés : information 
@article{SEMR_2019_16_a19,
     author = {V. V. Rybakov},
     title = {Branching time agents' logic, satisfiability problem by rules in reduced form},
     journal = {Sibirskie \`elektronnye matemati\v{c}eskie izvesti\^a},
     pages = {1158--1170},
     publisher = {mathdoc},
     volume = {16},
     year = {2019},
     language = {en},
     url = {http://geodesic.mathdoc.fr/item/SEMR_2019_16_a19/}
}
TY  - JOUR
AU  - V. V. Rybakov
TI  - Branching time agents' logic, satisfiability problem by rules in reduced form
JO  - Sibirskie èlektronnye matematičeskie izvestiâ
PY  - 2019
SP  - 1158
EP  - 1170
VL  - 16
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/SEMR_2019_16_a19/
LA  - en
ID  - SEMR_2019_16_a19
ER  - 
%0 Journal Article
%A V. V. Rybakov
%T Branching time agents' logic, satisfiability problem by rules in reduced form
%J Sibirskie èlektronnye matematičeskie izvestiâ
%D 2019
%P 1158-1170
%V 16
%I mathdoc
%U http://geodesic.mathdoc.fr/item/SEMR_2019_16_a19/
%G en
%F SEMR_2019_16_a19
V. V. Rybakov. Branching time agents' logic, satisfiability problem by rules in reduced form. Sibirskie èlektronnye matematičeskie izvestiâ, Tome 16 (2019), pp. 1158-1170. http://geodesic.mathdoc.fr/item/SEMR_2019_16_a19/