{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:37:51Z","timestamp":1759639071166,"version":"3.40.3"},"publisher-location":"Cham","reference-count":25,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319115573"},{"type":"electronic","value":"9783319115580"}],"license":[{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-11558-0_9","type":"book-chapter","created":{"date-parts":[[2014,9,16]],"date-time":"2014-09-16T02:22:39Z","timestamp":1410834159000},"page":"122-136","source":"Crossref","is-referenced-by-count":6,"title":["Sub-propositional Fragments of the Interval Temporal Logic of Allen\u2019s Relations"],"prefix":"10.1007","author":[{"given":"Davide","family":"Bresolin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Emilio","family":"Mu\u00f1oz-Velasco","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Guido","family":"Sciavicco","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"11","key":"9_CR1","doi-asserted-by":"publisher","first-page":"832","DOI":"10.1145\/182.358434","volume":"26","author":"J.F. Allen","year":"1983","unstructured":"Allen, J.F.: Maintaining knowledge about temporal intervals. Communications of the ACM\u00a026(11), 832\u2013843 (1983)","journal-title":"Communications of the ACM"},{"key":"9_CR2","unstructured":"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\u2013366 (2007)"},{"key":"9_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1007\/978-3-642-45221-5_3","volume-title":"Logic for Programming, Artificial Intelligence, and Reasoning","author":"A. Artale","year":"2013","unstructured":"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.\u00a08312, pp. 35\u201352. Springer, Heidelberg (2013)"},{"key":"9_CR4","unstructured":"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)"},{"key":"9_CR5","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"590","DOI":"10.1007\/978-3-540-89439-1_41","volume-title":"Logic for Programming, Artificial Intelligence, and Reasoning","author":"D. Bresolin","year":"2008","unstructured":"Bresolin, D., Della Monica, D., Goranko, V., Montanari, A., Sciavicco, G.: Decidable and undecidable fragments of Halpern and Shoham\u2019s interval temporal logic: towards a complete classification. In: Cervesato, I., Veith, H., Voronkov, A. (eds.) LPAR 2008. LNCS (LNAI), vol.\u00a05330, pp. 590\u2013604. Springer, Heidelberg (2008)"},{"key":"9_CR6","doi-asserted-by":"crossref","unstructured":"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\u2013138. IEEE Comp. Society Press (2011)","DOI":"10.1109\/TIME.2011.21"},{"key":"9_CR7","doi-asserted-by":"crossref","unstructured":"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.\u00a096, pp. 155\u2013169 (2012)","DOI":"10.4204\/EPTCS.96.12"},{"issue":"1","key":"9_CR8","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.: Tableau-based decision procedures for the logics of subinterval structures over dense orderings. Journal of Logic and Computation\u00a020(1), 133\u2013166 (2010)","journal-title":"Journal of Logic and Computation"},{"issue":"1-3","key":"9_CR9","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1007\/s10472-013-9337-y","volume":"71","author":"D. Bresolin","year":"2014","unstructured":"Bresolin, D., Monica, D.D., Montanari, A., Sciavicco, G.: The light side of interval temporal logic: the Bernays-Sch\u00f6nfinkel fragment of CDT. Annals of Mathematics and Artificial Intelligence\u00a071(1-3), 11\u201339 (2014)","journal-title":"Annals of Mathematics and Artificial Intelligence"},{"key":"9_CR10","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 $\\mathsf{AB\\overline{B}\\overline{L}}$. In: Proc. of the 26th IEEE Symposium on Logic in Computer Science (LICS), pp. 387\u2013396. IEEE Computer Society (2011)","DOI":"10.1109\/LICS.2011.35"},{"key":"9_CR11","doi-asserted-by":"crossref","unstructured":"Chaochen, Z., Hansen, M.R.: Duration Calculus: A Formal Approach to Real-Time Systems. EATCS: Monographs in Theoretical Computer Science. Springer (2004)","DOI":"10.1007\/978-3-662-06784-0"},{"issue":"45","key":"9_CR12","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1016\/0020-0190(93)90014-Z","volume":"3","author":"C. Chen","year":"1993","unstructured":"Chen, C., Lin, I.: The computational complexity of satisfiability of temporal Horn formulas in propositional linear-time temporal logic. Information Processing Letters\u00a03(45), 131\u2013136 (1993)","journal-title":"Information Processing Letters"},{"issue":"1","key":"9_CR13","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1016\/0304-3975(94)90082-5","volume":"129","author":"C. Chen","year":"1994","unstructured":"Chen, C., Lin, I.: The computational complexity of the satisfiability of modal Horn clauses for modal propositional logics. Theoretical Computer Science\u00a0129(1), 95\u2013121 (1994)","journal-title":"Theoretical Computer Science"},{"issue":"1","key":"9_CR14","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0743-1066(87)90018-5","volume":"4","author":"L. Fari\u00f1as Del Cerro","year":"1987","unstructured":"Fari\u00f1as Del Cerro, L., Penttonen, M.: A note on the complexity of the satisfiability of modal Horn clauses. Journal of Logic Programming\u00a04(1), 1\u201310 (1987)","journal-title":"Journal of Logic Programming"},{"key":"9_CR15","unstructured":"Fisher, M.: A resolution method for temporal logic. In: Proc. of the 12th International Joint Conference on Artificial Intelligence (IJCAI), pp. 99\u2013104. Morgan Kaufman (1991)"},{"issue":"4","key":"9_CR16","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\u00a038(4), 935\u2013962 (1991)","journal-title":"Journal of the ACM"},{"key":"9_CR17","doi-asserted-by":"crossref","unstructured":"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\u2013386. IEEE Comp. Society Press (2011)","DOI":"10.1109\/LICS.2011.21"},{"key":"9_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1007\/978-3-642-14162-1_29","volume-title":"Automata, Languages and Programming","author":"A. Montanari","year":"2010","unstructured":"Montanari, A., Puppis, G., Sala, P.: Maximal decidable fragments of Halpern and Shoham\u2019s 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.\u00a06199, pp. 345\u2013356. Springer, Heidelberg (2010)"},{"key":"9_CR19","unstructured":"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\u2013608. Inria Nancy Grand Est & Loria (2010)"},{"key":"9_CR20","unstructured":"Moszkowski, B.: Reasoning about digital circuits. Tech. rep. stan-cs-83-970, Dept. of Computer Science, Stanford University, Stanford, CA (1983)"},{"issue":"3-4","key":"9_CR21","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1016\/j.jalgor.2007.04.001","volume":"62","author":"C. Nalon","year":"2007","unstructured":"Nalon, C., Dixon, C.: Clausal resolution for normal modal logics. Journal of Algorithms\u00a062(3-4), 117\u2013134 (2007)","journal-title":"Journal of Algorithms"},{"key":"9_CR22","first-page":"318","volume":"5","author":"L. Nguyen","year":"2004","unstructured":"Nguyen, L.: On the complexity of fragments of modal logics. Advances in Modal Logic\u00a05, 318\u2013330 (2004)","journal-title":"Advances in Modal Logic"},{"issue":"1-2","key":"9_CR23","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.artint.2005.04.003","volume":"166","author":"I. Pratt-Hartmann","year":"2005","unstructured":"Pratt-Hartmann, I.: Temporal prepositions and their logic. Artificial Intelligence\u00a0166(1-2), 1\u201336 (2005)","journal-title":"Artificial Intelligence"},{"key":"9_CR24","unstructured":"Sipser, M.: Introduction to the theory of computation. PWS Publishing Company (1997)"},{"key":"9_CR25","doi-asserted-by":"publisher","first-page":"733","DOI":"10.1145\/3828.3837","volume":"32","author":"A. Sistla","year":"1985","unstructured":"Sistla, A., Clarke, E.: The complexity of propositional linear temporal logic. Journal of the ACM\u00a032, 733\u2013749 (1985)","journal-title":"Journal of the ACM"}],"container-title":["Lecture Notes in Computer Science","Logics in Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-11558-0_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,8]],"date-time":"2023-02-08T03:27:12Z","timestamp":1675826832000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-11558-0_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319115573","9783319115580"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-11558-0_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}