Bowman, Howard and Thompson, Simon (1998) A tableau method for interval temporal logic with projection. In: deSwart, H., ed. Automated Reasoning with Analytic Tableaux and Related Methods International Conference. Lecture Notes in Computer Science . Springer, Berlin, Germany, pp. 108-123. ISBN 978-3-540-64406-4. E-ISBN 978-3-540-69778-7. (doi:10.1007/3-540-69778-0_17) (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided) (KAR id:17603)
The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided. | |
Official URL: http://dx.doi.org/10.1007/3-540-69778-0_17 |
Abstract
This paper introduces a tableau method for propositional interval temporal logic (ITL) [14]. Beyond the usual operators of linear temporal logic, ITL contains sequencing and iterative operators, ‘;’ and proj akin to programming combinators. Central to our approach is a normal form for the formulas of ITL, particularly ‘;’ and proj, in terms of the ‘◯’ operator of the logic.
Item Type: | Book section |
---|---|
DOI/Identification number: | 10.1007/3-540-69778-0_17 |
Subjects: | Q Science > QA Mathematics (inc Computing science) > QA 9 Formal systems, logics |
Divisions: | Divisions > Division of Computing, Engineering and Mathematical Sciences > School of Computing |
Depositing User: | I. Ghose |
Date Deposited: | 29 Jun 2011 08:23 UTC |
Last Modified: | 16 Nov 2021 09:55 UTC |
Resource URI: | https://kar.kent.ac.uk/id/eprint/17603 (The current URI for this page, for reference purposes) |
- Export to:
- RefWorks
- EPrints3 XML
- BibTeX
- CSV
- Depositors only (login required):