On the Complexity of Fragments of the Modal Logic of Allen’s Relations over Dense Structures
From MaRDI portal
Publication:2799202
DOI10.1007/978-3-319-15579-1_40zbMath1451.03020MaRDI QIDQ2799202
Davide Bresolin, Guido Sciavicco, Angelo Montanari, Pietro Sala, Dario Della Monica
Publication date: 8 April 2016
Published in: Language and Automata Theory and Applications (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/11390/1070738
03D15: Complexity of computation (including implicit computational complexity)
03B44: Temporal logic
Related Items
Adding one or more equivalence relations to the interval temporal logic \(\mathsf{AB}\overline{\mathsf{B}}\), Decidability and complexity of the fragments of the modal logic of Allen's relations over the rationals, Computational complexity of hybrid interval temporal logics, On coarser interval temporal logics, Hybrid fragments of Halpern-Shoham logic and their expressive power