Sib. Èlektron. Mat. Izv., 2019, Volume 16, Pages 1158–1170
Mathematical logic, algebra and number theory
Branching time agents' logic, satisfiability problem by rules in reduced form
V. V. Rybakovab
a Institute of Mathematics and Computer Science Siberian Federal University, 79, Svobodny ave., Krasnoyarsk, 660041, Russia
b A.P. Ershov Institute of informatics systems SB RAS 6, Acad. Lavrentjev ave., Novosibirsk, 630090, Russia
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.
temporal logic, branching time logic, multi-agent logic, computability, information, satisfiability, decidability.
PDF file (179 kB)
Received January 4, 2019, published August 26, 2019
V. V. Rybakov, “Branching time agents' logic, satisfiability problem by rules in reduced form”, Sib. Èlektron. Mat. Izv., 16 (2019), 1158–1170
Citation in format AMSBIB
\paper Branching time agents' logic, satisfiability problem by rules in reduced form
\jour Sib. \`Elektron. Mat. Izv.
Citing articles on Google Scholar:
Related articles on Google Scholar:
|Number of views:|