{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T17:11:33Z","timestamp":1760202693545,"version":"3.40.3"},"publisher-location":"Cham","reference-count":18,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319155784"},{"type":"electronic","value":"9783319155791"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-15579-1_40","type":"book-chapter","created":{"date-parts":[[2015,2,23]],"date-time":"2015-02-23T08:36:13Z","timestamp":1424680573000},"page":"511-523","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["On the Complexity of Fragments of the Modal Logic of Allen\u2019s Relations over Dense Structures"],"prefix":"10.1007","author":[{"given":"Davide","family":"Bresolin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dario","family":"Della Monica","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Angelo","family":"Montanari","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pietro","family":"Sala","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Guido","family":"Sciavicco","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,2,24]]},"reference":[{"key":"40_CR1","doi-asserted-by":"crossref","unstructured":"Aceto, L., Della Monica, D., Goranko, V., Ing\u00f3lfsd\u00f3ttir, A., Montanari, A., Sciavicco, G.: A complete classification of the expressiveness of interval logics of Allen\u2019s relations: the dense and the general case. Acta Informatica 2014, (in press)","DOI":"10.1109\/TIME.2013.16"},{"key":"40_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1007\/978-3-319-11558-0_19","volume-title":"Logics in Artificial Intelligence","author":"L Aceto","year":"2014","unstructured":"Aceto, L., Della Monica, D., Ing\u00f3lfsd\u00f3ttir, A., Montanari, A., Sciavicco, G.: On the expressiveness of the interval logic of allen\u2019s relations over finite and discrete linear orders. In: Ferm\u00e9, E., Leite, J. (eds.) JELIA 2014. LNCS, vol. 8761, pp. 267\u2013281. Springer, Heidelberg (2014)"},{"issue":"11","key":"40_CR3","doi-asserted-by":"publisher","first-page":"832","DOI":"10.1145\/182.358434","volume":"26","author":"JF Allen","year":"1983","unstructured":"Allen, J.F.: Maintaining knowledge about temporal intervals. Communications of the ACM 26(11), 832\u2013843 (1983)","journal-title":"Communications of the ACM"},{"issue":"1\u20133","key":"40_CR4","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1007\/s10472-013-9376-4","volume":"71","author":"D Bresolin","year":"2014","unstructured":"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\u20133), 41\u201383 (2014)","journal-title":"Annals of Mathematics and Artificial Intelligence"},{"key":"40_CR5","doi-asserted-by":"crossref","unstructured":"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\u2013291 (2014)","DOI":"10.1016\/j.tcs.2014.03.033"},{"issue":"1","key":"40_CR6","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1093\/logcom\/exn063","volume":"20","author":"D Bresolin","year":"2010","unstructured":"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\u2013166 (2010)","journal-title":"Journal of Logic and Computation"},{"key":"40_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1007\/978-3-642-22119-4_8","volume-title":"Automated Reasoning with Analytic Tableaux and Related Methods","author":"D Bresolin","year":"2011","unstructured":"Bresolin, D., Montanari, A., Sala, P., Sciavicco, G.: Optimal tableau systems for propositional neighborhood logic over all, dense, and discrete linear orders. In: Br\u00fcnnler, K., Metcalfe, G. (eds.) TABLEAUX 2011. LNCS, vol. 6793, pp. 73\u201387. Springer, Heidelberg (2011)"},{"key":"40_CR8","doi-asserted-by":"crossref","unstructured":"Bresolin, D., Montanari, A., Sala, P., Sciavicco, G.: What\u2019s decidable about Halpern and Shoham\u2019s interval logic? The maximal fragment $${\\sf AB\\mathit{}{\\sf \\overline{BL}}}$$. In: Proc. of the 26th LICS. pp. 387\u2013396 (2011)","DOI":"10.1109\/LICS.2011.35"},{"key":"40_CR9","doi-asserted-by":"crossref","unstructured":"Bresolin, D., Della Monica, D., Montanari, A., Sala, P., Sciavicco, G.: On the complexity of fragments of the modal logic of Allen\u2019s relations over dense structures (extended version) (2014), available at. http:\/\/www.icetcs.ru.is\/dario\/techrep\/lata15ext.pdf","DOI":"10.1007\/978-3-319-15579-1_40"},{"key":"40_CR10","doi-asserted-by":"crossref","unstructured":"Chaochen, Z., Hansen, M.R.: Duration calculus: A formal approach to real-time systems. Monographs in Theoretical Computer Science, Springer, EATCS (2004)","DOI":"10.1007\/978-3-662-06784-0"},{"key":"40_CR11","doi-asserted-by":"crossref","unstructured":"Gennari, R., Tonelli, S., Vittorini, P.: An AI-based process for generating games from flat stories. In: Proc. of the 33th SGAI, pp. 337\u2013350 (2013)","DOI":"10.1007\/978-3-319-02621-3_25"},{"issue":"4","key":"40_CR12","doi-asserted-by":"publisher","first-page":"935","DOI":"10.1145\/115234.115351","volume":"38","author":"J Halpern","year":"1991","unstructured":"Halpern, J., Shoham, Y.: A propositional modal logic of time intervals. Journal of the ACM 38(4), 935\u2013962 (1991)","journal-title":"Journal of the ACM"},{"key":"40_CR13","unstructured":"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)"},{"key":"40_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"451","DOI":"10.1007\/978-3-662-44522-8_38","volume-title":"Mathematical Foundations of Computer Science 2014","author":"A Montanari","year":"2014","unstructured":"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\u00fa, E., Dietzfelbinger, M., \u00c9sik, Z. (eds.) MFCS 2014, Part I. LNCS, vol. 8634, pp. 451\u2013463. Springer, Heidelberg (2014)"},{"key":"40_CR15","unstructured":"Moszkowski, B.: Reasoning about digital circuits. Tech. rep. stan-cs-83-970, Dept. of Computer Science. Stanford University, Stanford, CA (1983)"},{"key":"40_CR16","unstructured":"Sala, P.: Decidability of Interval Temporal Logics. Ph.D. thesis, Department of Mathematics and Computer Science, University of Udine, Udine, Italy (2010)"},{"key":"40_CR17","doi-asserted-by":"crossref","unstructured":"Schnoebelen, P.: Lossy counter machines decidability cheat sheet. In: Proc. of the 4th International Workshop (RP 2010), pp. 51\u201375 (2010)","DOI":"10.1007\/978-3-642-15349-5_4"},{"issue":"5","key":"40_CR18","doi-asserted-by":"publisher","first-page":"540","DOI":"10.1109\/TKDE.2004.1277816","volume":"16","author":"P Terenziani","year":"2004","unstructured":"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\u2013551 (2004)","journal-title":"IEEE Transactions on Knowledge and Data Engineering"}],"container-title":["Lecture Notes in Computer Science","Language and Automata Theory and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-15579-1_40","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,16]],"date-time":"2023-02-16T21:37:47Z","timestamp":1676583467000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-15579-1_40"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319155784","9783319155791"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-15579-1_40","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"24 February 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}