Title :
A Decidable Temporal Logic for Events and States
Author_Institution :
Sch. of Comput. Sci., Manchester Univ.
Abstract :
This paper introduces a new interval temporal logic, TPL*. Existing interval temporal logics, we claim, are inadequate to represent the meanings of certain natural language constructions, despite exhibiting high computational complexity. TPL* overcomes these problems, presents the semantics of some natural language constructions, and captures important real-time problems like behaviour of complex systems
Keywords :
computational complexity; decidability; natural languages; temporal logic; TPL*; computational complexity; decidable temporal logic; interval temporal logic; natural language construction; Computational complexity; Computer science; Logic; Natural languages; Power system modeling; Real time systems;
Conference_Titel :
Temporal Representation and Reasoning, 2006. TIME 2006. Thirteenth International Symposium on
Conference_Location :
Budapest
Print_ISBN :
0-7695-2617-9
DOI :
10.1109/TIME.2006.1
