Proof-theoretical investigation of temporal logic with time gaps
β Scribed by R. Alonderis
- Publisher
- Springer
- Year
- 2000
- Tongue
- English
- Weight
- 977 KB
- Volume
- 40
- Category
- Article
- ISSN
- 0363-1672
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
Chronolog(MC) is an extension of logic programming based on a linear-time temporal logic with multiple granularity of time called TLC . A Chronolog(MC) program consists of a clock definition, a clock assignment and a program body. Each predicate symbol appearing in the program body is associated wit
It is shown that the decision problem for the temporal logic with the strict until operator over general linear time is PSPACE-complete. This shows that it is no harder to reason with arbitrary linear orderings than with discrete linear time temporal logics. New techniques are used to give a PSPACE