Editing Interval temporal logic

{{no footnotes|date=January 2011}}
'''Interval temporal logic''' (also '''interval logic''') is a [[temporal logic]] for representing both [[propositional logic|propositional]] and [[first-order logic|first-order]] [[logic]]al reasoning about periods of time that is capable of handling both sequential and parallel composition. Instead of dealing with infinite sequences of state, interval temporal logics deal with finite sequences. 

Interval temporal logics find application in [[computer science]], [[artificial intelligence]] and [[linguistics]]. First-order interval temporal logic was initially developed in the 1980s for the [[specification]] and [[Verification and validation|verification]] of hardware [[Protocol (computing)|protocols]]. '''Interval temporal logic''' ('''ITL''') is a specific form of ''temporal logic'', originally developed by [[Ben Moszkowski]] for his thesis at [[Stanford University]].<ref>{{Cite web|url=http://antonio-cau.co.uk/ITL/|title=Interval Temporal Logic|last=|first=|date=|website=|publisher=|access-date=}}</ref> It is useful in the formal description of [[computer hardware|hardware]] and [[software]] for computer-based systems. Tools are available to aid in this process. ''Tempura'' provides an [[executable program|executable]] ITL framework. [[Compositionality]] is a significant issue and consideration in the design of ITL.

Notable derivatives of interval temporal logic are [[graphical interval logic]], [[signed interval logic]] and [[future interval logic]].

==See also==
*[[Duration calculus]]
*[[Formal methods]]
*[[Temporal logic of actions]]

==References==
{{Reflist}}

[[Category:Temporal logic]]

{{logic-stub}}
{{formalmethods-stub}}