{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T17:09:35Z","timestamp":1760202575228,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":25,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540875307"},{"type":"electronic","value":"9783540875314"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"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":[[2008]]},"DOI":"10.1007\/978-3-540-87531-4_23","type":"book-chapter","created":{"date-parts":[[2008,8,30]],"date-time":"2008-08-30T08:40:53Z","timestamp":1220085653000},"page":"308-322","source":"Crossref","is-referenced-by-count":10,"title":["Non-finite Axiomatizability and Undecidability of Interval Temporal Logics with C, D, and T"],"prefix":"10.1007","author":[{"given":"Ian","family":"Hodkinson","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Angelo","family":"Montanari","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Guido","family":"Sciavicco","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"23_CR1","volume-title":"Modal Logic","author":"P. Blackburn","year":"2002","unstructured":"Blackburn, P., de Rijke, M., Venema, Y.: Modal Logic. Cambridge University Press, Cambridge (2002)"},{"key":"23_CR2","series-title":"Perspectives of Mathematical Logic","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-59207-2","volume-title":"The Classical Decision Problem","author":"E. B\u00f6rger","year":"1997","unstructured":"B\u00f6rger, E., Gr\u00e4del, E., Gurevich, Y.: The Classical Decision Problem. Perspectives of Mathematical Logic. Springer, Heidelberg (1997)"},{"issue":"2","key":"23_CR3","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1093\/logcom\/13.2.195","volume":"13","author":"H. Bowman","year":"2003","unstructured":"Bowman, H., Thompson, S.: A decision procedure and complete axiomatization of finite interval temporal logic with projection. Journal of Logic and Computation\u00a013(2), 195\u2013239 (2003)","journal-title":"Journal of Logic and Computation"},{"key":"23_CR4","unstructured":"Bresolin, D., Goranko, V., Montanari, A., Sala, P.: Tableau-based Decision Procedure for the Logic of Proper Subinterval Structures over Dense Orderings. In: Areces, C., Demri, S. (eds.) Proceedings of M4M-5: 5th International Workshop on Methods for Modalities, pp. 335\u2013351 (2007)"},{"key":"23_CR5","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1007\/978-3-540-73099-6_8","volume-title":"Automated Reasoning with Analytic Tableaux and Related Methods","author":"D. Bresolin","year":"2007","unstructured":"Bresolin, D., Goranko, V., Montanari, A., Sala, P.: Tableau Systems for Logics of Subinterval Structures over Dense Orderings. In: Olivetti, N. (ed.) TABLEAUX 2007. LNCS (LNAI), vol.\u00a04548, pp. 73\u201389. Springer, Heidelberg (2007)"},{"key":"23_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"84","DOI":"10.1007\/978-3-540-72734-7_7","volume-title":"Logical Foundations of Computer Science","author":"D. Bresolin","year":"2007","unstructured":"Bresolin, D., Goranko, V., Montanari, A., Sciavicco, G.: On Decidability and Expressiveness of Propositional Interval Neighborhood Logics. In: Artemov, S.N., Nerode, A. (eds.) LFCS 2007. LNCS, vol.\u00a04514, pp. 84\u201399. Springer, Heidelberg (2007)"},{"key":"23_CR7","doi-asserted-by":"crossref","unstructured":"Bresolin, D., Goranko, V., Montanari, A., Sciavicco, G.: Propositional interval neighborhood logics: Expressiveness, decidability, and undecidable extensions. Technical Report\u00a005, Department of Mathematics and Computer Science, University of Udine, Italy (2008)","DOI":"10.1016\/j.apal.2009.07.003"},{"key":"23_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"549","DOI":"10.1007\/978-3-540-70918-3_47","volume-title":"STACS 2007","author":"D. Bresolin","year":"2007","unstructured":"Bresolin, D., Montanari, A., Sala, P.: An optimal tableau-based decision algorithm for Propositional Neighborhood Logic. In: Thomas, W., Weil, P. (eds.) STACS 2007. LNCS, vol.\u00a04393, pp. 549\u2013560. Springer, Heidelberg (2007)"},{"issue":"1-3","key":"23_CR9","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1007\/s10817-006-9051-0","volume":"38","author":"D. Bresolin","year":"2007","unstructured":"Bresolin, D., Montanari, A., Sciavicco, G.: An optimal decision procedure for Right Propositional Neighborhood Logic. Journal of Automated Reasoning\u00a038(1-3), 173\u2013199 (2007)","journal-title":"Journal of Automated Reasoning"},{"key":"23_CR10","doi-asserted-by":"publisher","DOI":"10.1016\/S0049-237X(08)70075-2","volume-title":"Model theory","author":"C.C. Chang","year":"1990","unstructured":"Chang, C.C., Keisler, H.J.: Model theory. North-Holland, Amsterdam (1990)"},{"key":"23_CR11","doi-asserted-by":"crossref","unstructured":"Gabbay, D.M.: An irreflexive lemma with applications to axiomatization on linear frames. In: Aspects of Philosophical Logic, pp. 67\u201389 (1981)","DOI":"10.1007\/978-94-009-8384-7_3"},{"issue":"9","key":"23_CR12","first-page":"1137","volume":"9","author":"V. Goranko","year":"2003","unstructured":"Goranko, V., Montanari, A., Sciavicco, G.: Propositional interval neighborhood temporal logics. Journal of Universal Computer Science\u00a09(9), 1137\u20131167 (2003)","journal-title":"Journal of Universal Computer Science"},{"issue":"1\u20132","key":"23_CR13","doi-asserted-by":"publisher","first-page":"9","DOI":"10.3166\/jancl.14.9-54","volume":"14","author":"V. Goranko","year":"2004","unstructured":"Goranko, V., Montanari, A., Sciavicco, G.: A road map of interval temporal logics and duration calculi. J. of Applied Non-Classical Logics\u00a014(1\u20132), 9\u201354 (2004)","journal-title":"J. of Applied Non-Classical Logics"},{"issue":"3","key":"23_CR14","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1016\/j.jal.2005.06.012","volume":"4","author":"V. Goranko","year":"2006","unstructured":"Goranko, V., Montanari, A., Sciavicco, G., Sala, P.: A general tableau method for propositional interval temporal logics: Theory and implementation. Journal of Applied Logic\u00a04(3), 305\u2013330 (2006)","journal-title":"Journal of Applied Logic"},{"key":"23_CR15","doi-asserted-by":"crossref","first-page":"1","DOI":"10.4153\/CJM-1955-001-4","volume":"7","author":"R.E. Greenwood","year":"1955","unstructured":"Greenwood, R.E., Gleason, A.M.: Combinatorial relations and chromatic graphs. Canadian Journal of Mathematics\u00a07, 1\u20137 (1955)","journal-title":"Canadian Journal of Mathematics"},{"issue":"4","key":"23_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":"23_CR17","series-title":"Studies in Logic and the Foundations of Mathematics","volume-title":"Relation algebras by games","author":"R. Hirsch","year":"2002","unstructured":"Hirsch, R., Hodkinson, I.: Relation algebras by games. Studies in Logic and the Foundations of Mathematics, vol.\u00a0147. North-Holland, Amsterdam (2002)"},{"key":"23_CR18","volume-title":"Introduction to automata theory, languages, and computation","author":"J.E. Hopcroft","year":"1979","unstructured":"Hopcroft, J.E., Ullman, J.D.: Introduction to automata theory, languages, and computation. Addison-Wesley, Reading (1979)"},{"key":"23_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"290","DOI":"10.1007\/3-540-44464-5_21","volume-title":"Advances in Computing Science - ASIAN 2000","author":"K. Lodaya","year":"2000","unstructured":"Lodaya, K.: Sharpening the undecidability of interval temporal logic. In: He, J., Sato, M. (eds.) ASIAN 2000. LNCS, vol.\u00a01961, pp. 290\u2013298. Springer, Heidelberg (2000)"},{"key":"23_CR20","series-title":"Studies in Logic and the Foundations of Mathematics","volume-title":"Relation algebras","author":"R. Maddux","year":"2006","unstructured":"Maddux, R.: Relation algebras. Studies in Logic and the Foundations of Mathematics, vol.\u00a0150. Elsevier, Amsterdam (2006)"},{"key":"23_CR21","doi-asserted-by":"publisher","first-page":"331","DOI":"10.2307\/2270900","volume":"34","author":"J.D. Monk","year":"1969","unstructured":"Monk, J.D.: Nonfinitizability of classes of representable cylindric algebras. Journal Symbolic Logic\u00a034, 331\u2013343 (1969)","journal-title":"Journal Symbolic Logic"},{"key":"23_CR22","unstructured":"Moszkowski, B.: Reasoning about digital circuits. Tech. rep. stan-cs-83-970, Dept. of Computer Science, Stanford University, Stanford, CA (1983)"},{"key":"23_CR23","unstructured":"Roy, S., Sciavicco, G.: Completeness of chop. In: Guesguen, H.W., Ligozat, G., Rodriguez, R.V. (eds.) Proc. IJCAI 2007, pp. 90\u201395 (2007)"},{"issue":"4","key":"23_CR24","doi-asserted-by":"publisher","first-page":"529","DOI":"10.1305\/ndjfl\/1093635589","volume":"31","author":"Y. Venema","year":"1990","unstructured":"Venema, Y.: Expressiveness and completeness of an interval tense logic. Notre Dame Journal of Formal Logic\u00a031(4), 529\u2013547 (1990)","journal-title":"Notre Dame Journal of Formal Logic"},{"issue":"4","key":"23_CR25","doi-asserted-by":"publisher","first-page":"453","DOI":"10.1093\/logcom\/1.4.453","volume":"1","author":"Y. Venema","year":"1991","unstructured":"Venema, Y.: A modal logic for chopping intervals. Journal of Logic and Computation\u00a01(4), 453\u2013476 (1991)","journal-title":"Journal of Logic and Computation"}],"container-title":["Lecture Notes in Computer Science","Computer Science Logic"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-87531-4_23","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,5,7]],"date-time":"2024-05-07T05:13:36Z","timestamp":1715058816000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-540-87531-4_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540875307","9783540875314"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-87531-4_23","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2008]]}}}