A hierarchical completeness proof for propositional Interval Temporal Logic with finite time

De Montfort University Open Research Archive

Show simple item record

dc.contributor.author Moszkowski, B. C. en
dc.date.accessioned 2008-11-24T13:57:21Z
dc.date.available 2008-11-24T13:57:21Z
dc.date.issued 2004-05-01 en
dc.identifier.citation Moszkowski, B.C. (2004) A hierarchical completeness proof for propositional Interval Temporal Logic with finite time. Journal of Applied Non-Classical Logics, 14 (1-2), pp.55-104.
dc.identifier.issn 1166-3081 en
dc.identifier.uri http://hdl.handle.net/2086/267
dc.description Interval-oriented temporal logics are now found even in three recent IEEE standards. Consequently, it is natural to better understand the proof theory, including completeness. We describe a propositional axiom system adapted from our previous work and a completeness proof which involves a hierarchical reduction to conventional temporal logic and is much more direct than previous proofs (e.g., with tableaux). Future presentations of such logics’ proof theory will cite this. It will also encourage more hierarchical analyses. An unexpected spinoff is an intermediate interval-oriented logic with theoretical and practical value, including an implementable symbolic decision procedure (Theoretical Computer Science, Vol. 337, 2005). en
dc.language.iso en en
dc.publisher Springer Verlag en
dc.subject RAE 2008
dc.subject UoA 23 Computer Science and Informatics
dc.title A hierarchical completeness proof for propositional Interval Temporal Logic with finite time en
dc.type Article en
dc.identifier.doi http://dx.doi.org/10.3166/jancl.14.55-104 en
dc.researchgroup Software Technology Research Laboratory (STRL)


Files in this item

This item appears in the following Collection(s)

Show simple item record