Interval temporal logics over strongly discrete linear orders: Expressiveness and complexity
- 1 December 2014
- journal article
- Published by Elsevier BV in Theoretical Computer Science
- Vol. 560, 269-291
- https://doi.org/10.1016/j.tcs.2014.03.033
Abstract
No abstract availableKeywords
Funding Information
- Spanish fellowship program ‘Ramon y Cajal’ (RYC-2011-07821)
- GNCS (U 2013/000042)
- Icelandic Research Fund (100048021, 130802-051)
This publication has 10 references indexed in Scilit:
- On termination and invariance for faulty channel machinesFormal Aspects of Computing, 2012
- ON BEGINS, MEETS AND BEFOREInternational Journal of Foundations of Computer Science, 2012
- Propositional interval neighborhood logics: Expressiveness, decidability, and undecidable extensionsAnnals of Pure and Applied Logic, 2009
- Tableaux for Logics of Subinterval Structures over Dense OrderingsJournal of Logic and Computation, 2008
- An Optimal Decision Procedure for Right Propositional Neighborhood LogicJournal of Automated Reasoning, 2006
- A Road Map of Interval Temporal Logics and Duration CalculiJournal of Applied Non-Classical Logics, 2004
- The Case for Durative Actions: A Commentary on PDDL2.1Journal of Artificial Intelligence Research, 2003
- A propositional modal logic of time intervalsJournal of the ACM, 1991
- Expressiveness and completeness of an interval tense logic.Notre Dame Journal of Formal Logic, 1990
- Maintaining knowledge about temporal intervalsCommunications of the ACM, 1983