Adding the Relation Meets to the Temporal Logic of Prefixes and Infixes makes it EXPSPACE-Complete
- 17 September 2021
- journal article
- Published by Open Publishing Association in Electronic Proceedings in Theoretical Computer Science
- Vol. 346, 179-194
- https://doi.org/10.4204/eptcs.346.12
Abstract
No abstract availableThis publication has 12 references indexed in Scilit:
- Complexity Hierarchies beyond ElementaryACM Transactions on Computation Theory, 2016
- Checking interval properties of computationsActa Informatica, 2015
- Interval temporal logics over strongly discrete linear orders: Expressiveness and complexityTheoretical Computer Science, 2014
- An Optimal Tableau System for the Logic of Temporal Neighborhood over the RealsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2012
- Optimal Tableau Systems for Propositional Neighborhood Logic over All, Dense, and Discrete Linear OrdersLecture Notes in Computer Science, 2011
- B and D Are Enough to Make the Halpern–Shoham Logic UndecidableLecture Notes in Computer Science, 2010
- A Road Map of Interval Temporal Logics and Duration CalculiJournal of Applied Non-Classical Logics, 2004
- A propositional modal logic of time intervalsJournal of the ACM, 1991
- A Modal Logic for Chopping IntervalsJournal of Logic and Computation, 1991
- Expressiveness and completeness of an interval tense logic.Notre Dame Journal of Formal Logic, 1990