| Abstract [eng] |
The aim of the present paper was to go deeper into the logics of time. By the formula of the classical logic it is possible to analyze only those problems where the condition of the objects is static. However, there are such problems where the condition of the objects is dynamic, i.e., the meanings are not always the same, they change. That is why it is not possible to solve them by the formula of classical logic. By referring to the articles (look [CM97], [MSC97]) calculation rules for the finite linear temporal logic as well as predicates’ logic above the finite temporal logic (PLBLL) were formulated. Concrete possible problem cases were defined by those rules. Therefore, it is no longer difficult to analyze the problems wanted with the help of those rules. Moreover, the formulated rules make it possible to analyze such problems where it is necessary to pay attention to the change of meanings at appropriate time moments. The main difference of this logic is: a more exact detailed analysis of the problem, additional tools of a problem analysis, i.e. new time operators are used. The work of the Turing machine was analyzed (look [Nor04]) over finite temporal structure. Necessary predicates were formulated, with the help of which transit formula were described. Also, this work aims at verifying the effective possibility of using Linear Time logic as a planning language. The main advantage of such a rich and expressive language is the possibility of encoding problem specific information that can be of help both in reducing the search space and finding a better plan. This work aims at a different planning model that takes into account the possibility to express actions and fluents with non-boolean values. Action that can have different application degrees can be defined. |
