Abstract
Interval Temporal Logic (ITL) is a formalism for reasoning about time periods. To date no one has proved completeness of a relatively simple ITL deductive system supporting infinite time and permitting infinite sequential iteration comparable to ω-regular expressions. We have developed a complete axiomatization for such a version of quantified ITL over finite domains and can show completeness by representing finite-state automata in ITL and then translating ITL formulas into them. Here we limit ourselves to finite time. The full paper (and another conference paper [15]) extends the approach to infinite time.
Cite
CITATION STYLE
Moszkowski, B. C. (2000). An automata-theoretic completeness proof for interval temporal logic. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1853, pp. 223–234). Springer Verlag. https://doi.org/10.1007/3-540-45022-x_19
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
