Linear Temporal Logic with Non-transitive Time, Algorithms for Decidability and Verification of Admissibility : материалы временных коллективов

Описание

Тип публикации: доклад, тезисы доклада, статья из сборника материалов конференций

Год издания: 2018

Идентификатор DOI: 10.1007/978-3-319-69917-2_11

Ключевые слова: Admissibility problem, Admissible rules, Deciding algorithms, Knowledge, Linear temporal logic, Logical knowledge operations, Non-transitive time

Аннотация: We investigate linear temporal logic LTLNT with non-transitive time and operators NEXT and UNTIL, as well as some possible interpretations of logical knowledge operators in this context. We assume time to be non-transitive, linear and discrete, the former This paper presents mathematical models describing extended objects with compПоказать полностьюlex configuration used for planning satellite imagery with optoelectronic scanners of submeter spatial resolution. The most efficient spline approximation methods were used for m We investigate linear temporal logic LTLNT with non-transitive time and operators NEXT and UNTIL, as well as some possible interpretations of logical knowledge operators in this context. We assume time to be non-transitive, linear and discrete, the former

Ссылки на полный текст

Издание

Журнал: Larisa Maksimova on implication, interpolation, and definability

Выпуск журнала: Vol. 15

Номера страниц: 219-243

ISSN журнала: 22112766

Место издания: Dordrecht

Издатель: Springer

Авторы

  • Rybakov Vladimir V. (Siberian Fed Univ Krasnoyarsk, Inst Math & Informat, Av Svobodnui 79, Krasnoyarsk 660041, Russia; RAS, Siberian Div, Inst Informat Syst, Av Svobodnui 79, Krasnoyarsk 660041, Russia)

Вхождение в базы данных