Abstract
Interval temporal logics provide a natural framework for temporal reasoning about interval structures over linearly ordered domains, where intervals are taken as the primitive ontological entities. Their computational behaviour and expressive power mainly depend on two parameters: the set of modalities they feature and the linear orders over which they are interpreted. In this paper, we consider all fragments of Halpern and Shoham’s interval temporal logic HS with a decidable satisfiability problem over the class of all dense linear orders, and we provide a complete classification of them in terms of their complexity and expressiveness by solving the last two open cases.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Aceto, L., Della Monica, D., Goranko, V., Ingólfsdóttir, A., Montanari, A., Sciavicco, G.: A complete classification of the expressiveness of interval logics of Allen’s relations: the dense and the general case. Acta Informatica 2014, (in press)
Aceto, L., Della Monica, D., Ingólfsdóttir, A., Montanari, A., Sciavicco, G.: On the expressiveness of the interval logic of allen’s relations over finite and discrete linear orders. In: Fermé, E., Leite, J. (eds.) JELIA 2014. LNCS, vol. 8761, pp. 267–281. Springer, Heidelberg (2014)
Allen, J.F.: Maintaining knowledge about temporal intervals. Communications of the ACM 26(11), 832–843 (1983)
Bresolin, D., Della Monica, D., Goranko, V., Montanari, A., Sciavicco, G.: The dark side of interval temporal logic: marking the undecidability border. Annals of Mathematics and Artificial Intelligence 71(1–3), 41–83 (2014)
Bresolin, D., Della Monica, D., Montanari, A., Sala, P., Sciavicco, G.: Interval temporal logics over strongly discrete linear orders: Expressiveness and complexity. Theoretical Computer Science 560, 269–291 (2014)
Bresolin, D., Goranko, V., Montanari, A., Sala, P.: Tableaux for logics of subinterval structures over dense orderings. Journal of Logic and Computation 20(1), 133–166 (2010)
Bresolin, D., Montanari, A., Sala, P., Sciavicco, G.: Optimal tableau systems for propositional neighborhood logic over all, dense, and discrete linear orders. In: Brünnler, K., Metcalfe, G. (eds.) TABLEAUX 2011. LNCS, vol. 6793, pp. 73–87. Springer, Heidelberg (2011)
Bresolin, D., Montanari, A., Sala, P., Sciavicco, G.: What’s decidable about Halpern and Shoham’s interval logic? The maximal fragment \({\sf AB\mathit{}{\sf \overline{BL}}}\). In: Proc. of the 26th LICS. pp. 387–396 (2011)
Bresolin, D., Della Monica, D., Montanari, A., Sala, P., Sciavicco, G.: On the complexity of fragments of the modal logic of Allen’s relations over dense structures (extended version) (2014), available at. http://www.icetcs.ru.is/dario/techrep/lata15ext.pdf
Chaochen, Z., Hansen, M.R.: Duration calculus: A formal approach to real-time systems. Monographs in Theoretical Computer Science, Springer, EATCS (2004)
Gennari, R., Tonelli, S., Vittorini, P.: An AI-based process for generating games from flat stories. In: Proc. of the 33th SGAI, pp. 337–350 (2013)
Halpern, J., Shoham, Y.: A propositional modal logic of time intervals. Journal of the ACM 38(4), 935–962 (1991)
Laban, S., El-Desouky, A.: RISMA: A rule-based interval state machine algorithm for alerts generation, performance analysis and monitoring real-time data processing. In: Proc. of the European Geosciences Union General Assembly. Geophysical Research Abstracts, vol. 15 (2013)
Montanari, A., Puppis, G., Sala, P.: Decidability of the interval temporal logic \({\sf A}{\sf \overline{A}}{\sf B}{\sf \overline{B}}\) over the rationalsd. In: Csuhaj-Varjú, E., Dietzfelbinger, M., Ésik, Z. (eds.) MFCS 2014, Part I. LNCS, vol. 8634, pp. 451–463. Springer, Heidelberg (2014)
Moszkowski, B.: Reasoning about digital circuits. Tech. rep. stan-cs-83-970, Dept. of Computer Science. Stanford University, Stanford, CA (1983)
Sala, P.: Decidability of Interval Temporal Logics. Ph.D. thesis, Department of Mathematics and Computer Science, University of Udine, Udine, Italy (2010)
Schnoebelen, P.: Lossy counter machines decidability cheat sheet. In: Proc. of the 4th International Workshop (RP 2010), pp. 51–75 (2010)
Terenziani, P., Snodgrass, R.T.: Reconciling point-based and interval-based semantics in temporal relational databases: A treatment of the telic/atelic distinction. IEEE Transactions on Knowledge and Data Engineering 16(5), 540–551 (2004)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer International Publishing Switzerland
About this paper
Cite this paper
Bresolin, D., Della Monica, D., Montanari, A., Sala, P., Sciavicco, G. (2015). On the Complexity of Fragments of the Modal Logic of Allen’s Relations over Dense Structures. In: Dediu, AH., Formenti, E., Martín-Vide, C., Truthe, B. (eds) Language and Automata Theory and Applications. LATA 2015. Lecture Notes in Computer Science(), vol 8977. Springer, Cham. https://doi.org/10.1007/978-3-319-15579-1_40
Download citation
DOI: https://doi.org/10.1007/978-3-319-15579-1_40
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-15578-4
Online ISBN: 978-3-319-15579-1
eBook Packages: Computer ScienceComputer Science (R0)