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. The most influential propositional interval-based logic is probably Halpern and Shoham’s Modal Logic of Time Intervals, a.k.a. HS. While most studies focused on the computational properties of the syntactic fragments that arise by considering only a subset of the set of modalities, the fragments that are obtained by weakening the propositional side have received very scarce attention. Here, we approach this problem by considering various sub-propositional fragments of HS, such as the so-called Horn, Krom, and core fragment. We prove that the Horn fragment of HS is undecidable on every interesting class of linearly ordered sets, and we briefly discuss the difficulties that arise when considering the other fragments.
The authors acknowledge the support from the Italian GNCS Project “Automata, games and temporal logics for verification and synthesis of safety-critical systems” (D. Bresolin), the Spanish Project TIN12-39353-C04-01 (E. Muñoz-Velasco), and the Spanish fellowship program ‘Ramon y Cajal’ RYC-2011-07821 (G. Sciavicco).
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
Allen, J.F.: Maintaining knowledge about temporal intervals. Communications of the ACM 26(11), 832–843 (1983)
Artale, A., Calvanese, D., Kontchakov, R., Zakharyaschev, M.: DL-lite in the light of first-order logic. In: Proc. of the 22nd AAAI Conference on Artificial Intelligence, pp. 361–366 (2007)
Artale, A., Kontchakov, R., Ryzhikov, V., Zakharyaschev, M.: The complexity of clausal fragments of LTL. In: McMillan, K., Middeldorp, A., Voronkov, A. (eds.) LPAR-19 2013. LNCS, vol. 8312, pp. 35–52. Springer, Heidelberg (2013)
Artale, A., Ryzhikov, V., Kontchakov, R., Zakharyaschev, M.: A cookbook for temporal conceptual data modelling with description logics. ACM Transaction on Computational Logic (TOCL) (To appear)
Bresolin, D., Della Monica, D., Goranko, V., Montanari, A., Sciavicco, G.: Decidable and undecidable fragments of Halpern and Shoham’s interval temporal logic: towards a complete classification. In: Cervesato, I., Veith, H., Voronkov, A. (eds.) LPAR 2008. LNCS (LNAI), vol. 5330, pp. 590–604. Springer, Heidelberg (2008)
Bresolin, D., Della Monica, D., Goranko, V., Montanari, A., Sciavicco, G.: The dark side of interval temporal logic: sharpening the undecidability border. In: Proc. of the 18th International Symposium on Temporal Representation and Reasoning (TIME), pp. 131–138. IEEE Comp. Society Press (2011)
Bresolin, D., Della Monica, D., Montanari, A., Sala, P., Sciavicco, G.: Interval temporal logics over strongly discrete linear orders: the complete picture. In: Proc. of the 4th International Symposium on Games, Automata, Logics, and Formal Verification (GANDALF). EPTCS, vol. 96, pp. 155–169 (2012)
Bresolin, D., Goranko, V., Montanari, A., Sala, P.: Tableau-based decision procedures for the logics of subinterval structures over dense orderings. Journal of Logic and Computation 20(1), 133–166 (2010)
Bresolin, D., Monica, D.D., Montanari, A., Sciavicco, G.: The light side of interval temporal logic: the Bernays-Schönfinkel fragment of CDT. Annals of Mathematics and Artificial Intelligence 71(1-3), 11–39 (2014)
Bresolin, D., Montanari, A., Sala, P., Sciavicco, G.: What’s decidable about Halpern and Shoham’s interval logic? the maximal fragment \(\mathsf{AB\overline{B}\overline{L}}\). In: Proc. of the 26th IEEE Symposium on Logic in Computer Science (LICS), pp. 387–396. IEEE Computer Society (2011)
Chaochen, Z., Hansen, M.R.: Duration Calculus: A Formal Approach to Real-Time Systems. EATCS: Monographs in Theoretical Computer Science. Springer (2004)
Chen, C., Lin, I.: The computational complexity of satisfiability of temporal Horn formulas in propositional linear-time temporal logic. Information Processing Letters 3(45), 131–136 (1993)
Chen, C., Lin, I.: The computational complexity of the satisfiability of modal Horn clauses for modal propositional logics. Theoretical Computer Science 129(1), 95–121 (1994)
Fariñas Del Cerro, L., Penttonen, M.: A note on the complexity of the satisfiability of modal Horn clauses. Journal of Logic Programming 4(1), 1–10 (1987)
Fisher, M.: A resolution method for temporal logic. In: Proc. of the 12th International Joint Conference on Artificial Intelligence (IJCAI), pp. 99–104. Morgan Kaufman (1991)
Halpern, J., Shoham, Y.: A propositional modal logic of time intervals. Journal of the ACM 38(4), 935–962 (1991)
Marcinkowski, J., Michaliszyn, J.: The ultimate undecidability result for the Halpern-Shoham logic. In: Proc. of the 26th IEEE Symposium on Logic in Computer Science (LICS), pp. 377–386. IEEE Comp. Society Press (2011)
Montanari, A., Puppis, G., Sala, P.: Maximal decidable fragments of Halpern and Shoham’s modal logic of intervals. In: Abramsky, S., Gavoille, C., Kirchner, C., Meyer auf der Heide, F., Spirakis, P.G. (eds.) ICALP 2010, Part II. LNCS, vol. 6199, pp. 345–356. Springer, Heidelberg (2010)
Montanari, A., Puppis, G., Sala, P., Sciavicco, G.: Decidability of the interval temporal logic \(\mathsf{AB\overline{B}}\) on natural numbers. In: Proc. of the 27th Symposium on Theoretical Aspects of Computer Science (STACS), pp. 597–608. Inria Nancy Grand Est & Loria (2010)
Moszkowski, B.: Reasoning about digital circuits. Tech. rep. stan-cs-83-970, Dept. of Computer Science, Stanford University, Stanford, CA (1983)
Nalon, C., Dixon, C.: Clausal resolution for normal modal logics. Journal of Algorithms 62(3-4), 117–134 (2007)
Nguyen, L.: On the complexity of fragments of modal logics. Advances in Modal Logic 5, 318–330 (2004)
Pratt-Hartmann, I.: Temporal prepositions and their logic. Artificial Intelligence 166(1-2), 1–36 (2005)
Sipser, M.: Introduction to the theory of computation. PWS Publishing Company (1997)
Sistla, A., Clarke, E.: The complexity of propositional linear temporal logic. Journal of the ACM 32, 733–749 (1985)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer International Publishing Switzerland
About this paper
Cite this paper
Bresolin, D., Muñoz-Velasco, E., Sciavicco, G. (2014). Sub-propositional Fragments of the Interval Temporal Logic of Allen’s Relations. In: Fermé, E., Leite, J. (eds) Logics in Artificial Intelligence. JELIA 2014. Lecture Notes in Computer Science(), vol 8761. Springer, Cham. https://doi.org/10.1007/978-3-319-11558-0_9
Download citation
DOI: https://doi.org/10.1007/978-3-319-11558-0_9
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-11557-3
Online ISBN: 978-3-319-11558-0
eBook Packages: Computer ScienceComputer Science (R0)