Abstract
Interval temporal logics (ITLs) were introduced in the philosophy of time (see [] for a survey) but have proved useful in artificial intelligence and computer science [, , , ]. They provide a rich specification language for systems working with dense time (for example, []). By now, there is a whole menagerie of ITLs. In this paper, we work with the simplest (propositional) ITLs and discuss their decidability.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
