Referenced Items are not available for this document.
We prove decidability of 'non local' propositional CTL*, where truth values of atoms may depend on the branch of evaluation. This result is then used to show decidability of the 'weak' one-variable fragment of first-order (local) CTL*, in which all temporal operators and path quantifiers except 'tomorrow' are applicable only to sentences. Various spatio-temporal logics based on combinations of CTL* and RCC-8 can be embedded into this fragment, and so are decidable.
Published in:
Temporal Representation and Reasoning, 2002. TIME 2002. Proceedings.Ninth International Symposium on
Date of Conference: 2002
- Page(s):
- 2 - 9
- ISSN :
- 1530-1311
- Print ISBN:
- 0-7695-1474-X
- INSPEC Accession Number:
- 7412119
- Digital Object Identifier :
- 10.1109/TIME.2002.1027466
- Product Type:
- Conference Publications
About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies
A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.
