Sibirskie Èlektronnye Matematicheskie Izvestiya [Siberian Electronic Mathematical Reports]
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive
Impact factor

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS



Sib. Èlektron. Mat. Izv.:
Year:
Volume:
Issue:
Page:
Find






Personal entry:
Login:
Password:
Save password
Enter
Forgotten password?
Register


Sibirskie Èlektronnye Matematicheskie Izvestiya [Siberian Electronic Mathematical Reports], 2020, Volume 17, Pages 923–932
DOI: https://doi.org/10.33048/semi.2020.17.068
(Mi semr1262)
 

This article is cited in 4 scientific papers (total in 4 papers)

Mathematical logic, algebra and number theory

Temporal logic with overlap temporal relations generated by time states themselves

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
Full-text PDF (163 kB) Citations (4)
References:
Abstract: We study a temporal logic with non–standard temporal accessibility relations. This logic is generated by semantic underground models, and any such a model has a base formed by a frame with temporal relations generated by temporal states themselves; potentially, any state possesses its own temporal accessibility relation, and it is possible that all of them can be different. We consider this to be the most plausible modelling, because any time state has, in principle, its own view on what is past (or future). Time relations may have non–empty overlaps and they can be totally intransitive. Thus, this approach may be suitable for analysis of the most general cases of reasoning about computation, information flows, reliability, and other areas of AI and CS. The main mathematical question under consideration here is the existence of algorithms for solving satisfiability problems. Here we solve this problem and find the required algorithms. In the final part of our paper we formulate some interesting open problems.
Keywords: temporal logic, non–classical logics, information, knowledge representation, deciding algorithms, computability, information, satisfiability, decidability.
Funding agency Grant number
Russian Foundation for Basic Research 18-41-240005
Ministry of Science and Higher Education of the Russian Federation 075-02-2020-1534/1
Supported by RFBR and Krasnoyarsk Regional Fund of Science, research project 18-41-240005 and by the Krasnoyarsk Mathematical Center and the Ministry of Science and Higher Education of the Russian Federation, research project 075-02-2020-1534/1
Received February 2, 2020, published July 9, 2020
Bibliographic databases:
Document Type: Article
UDC: 510.64
MSC: 03F99
Language: English
Citation: V. V. Rybakov, “Temporal logic with overlap temporal relations generated by time states themselves”, Sib. Èlektron. Mat. Izv., 17 (2020), 923–932
Citation in format AMSBIB
\Bibitem{Ryb20}
\by V.~V.~Rybakov
\paper Temporal logic with overlap temporal relations generated by time states themselves
\jour Sib. \`Elektron. Mat. Izv.
\yr 2020
\vol 17
\pages 923--932
\mathnet{http://mi.mathnet.ru/semr1262}
\crossref{https://doi.org/10.33048/semi.2020.17.068}
\isi{https://gateway.webofknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcApp=Publons&SrcAuth=Publons_CEL&DestLinkType=FullRecord&DestApp=WOS_CPL&KeyUT=000548271500001}
Linking options:
  • https://www.mathnet.ru/eng/semr1262
  • https://www.mathnet.ru/eng/semr/v17/p923
  • This publication is cited in the following 4 articles:
    Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    Statistics & downloads:
    Abstract page:191
    Full-text PDF :37
    References:28
     
      Contact us:
     Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024