On the completeness and decidability of duration calculus with iteration
Theoretical Computer Science
A theory of duration calculus with application
Domain modeling and the duration calculus
Hi-index | 0.00 |
This paper presents an ω-complete proof system for the extension of first-order Interval Temporal Logic (ITL) by a projection operator. Alternative earlier approaches to the axiomatisation of projection in ITL are briefly presented and discussed. An extension of the proof system which is complete for the extension of Duration Calculus (DC) by projection is also given.