Abstract:
The nonmonotonic logic systems being expansions of linear time logic with hours are considered. The basic attention is given interrelations between them and to characteristics of their computing complexity.
Keywords:temporal logic, nonmonotonic formalismes, polinomial translations, computing complexity of reasonings.