Sib. Èlektron. Mat. Izv., 2016, Volume 13, Pages 656–663
This article is cited in 1 scientific paper (total in 1 paper)
Mathematical logic, algebra and number theory
Non-unifiability in linear temporal logic of knowledge with multi-agent relations
S. I. Bashmakova, A. V. Koshelevab, V. Rybakovc
a Institute of mathematics and computer science, Siberian Federal University, pr. Svobodny, 79, 660041, Krasnoyarsk, Russia
b Institute of space and informatic technologies, Siberian Federal University, Kirenskogo St. 26, ULK building, 660074, Krasnoyarsk, Russia
c Department of Computing and Mathematics, John Dalton Building, Chester Street, Manchester M1 5GD, UK
The paper is devoted to the study of the unification problem in the linear temporal logic of knowledge with multi-agent relations (denoted in the sequel as $LFPK$). This logic is based on frames (models) with time points represented by integer numbers from $Z$ and the information clusters $C^i$ for $i \in Z$ with multi-agent accessibility relations $R_i$.
The first main result is a theorem describing a criterion for formulas
to be not unifiable in $LFPK$. The second one is a construction of a basis for all inference rules passive in $LFPK$.
unification, modal temporal logic, passive inference rules.
PDF file (155 kB)
Received April 9, 2016, published August 17, 2016
S. I. Bashmakov, A. V. Kosheleva, V. Rybakov, “Non-unifiability in linear temporal logic of knowledge with multi-agent relations”, Sib. Èlektron. Mat. Izv., 13 (2016), 656–663
Citation in format AMSBIB
\by S.~I.~Bashmakov, A.~V.~Kosheleva, V.~Rybakov
\paper Non-unifiability in linear temporal logic of knowledge with multi-agent relations
\jour Sib. \`Elektron. Mat. Izv.
Citing articles on Google Scholar:
Related articles on Google Scholar:
This publication is cited in the following articles:
S. I. Bashmakov, A. V. Kosheleva, V. Rybakov, “Projective formulas and unification in linear discrete temporal multi-agent logics”, Sib. elektron. matem. izv., 13 (2016), 923–929
|Number of views:|