{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T18:16:58Z","timestamp":1725560218977},"publisher-location":"Berlin, Heidelberg","reference-count":32,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540280057"},{"type":"electronic","value":"9783540318644"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11532231_14","type":"book-chapter","created":{"date-parts":[[2010,7,21]],"date-time":"2010-07-21T18:56:52Z","timestamp":1279738612000},"page":"182-203","source":"Crossref","is-referenced-by-count":8,"title":["Temporal Logics over Transitive States"],"prefix":"10.1007","author":[{"given":"Boris","family":"Konev","sequence":"first","affiliation":[]},{"given":"Frank","family":"Wolter","sequence":"additional","affiliation":[]},{"given":"Michael","family":"Zakharyaschev","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"doi-asserted-by":"crossref","unstructured":"Artemov, S., Davoren, J., Nerode, A.: Modal logics and topological semantics for hybrid systems. Technical Report MSI 97-05, Cornell University (1997)","key":"14_CR1","DOI":"10.21236\/ADA344355"},{"key":"14_CR2","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1145\/322374.322380","volume":"30","author":"D. Brand","year":"1983","unstructured":"Brand, D., Zafiropulo, P.: On communicating finite-state machines. Journal of the ACM\u00a030, 323\u2013342 (1983)","journal-title":"Journal of the ACM"},{"key":"14_CR3","doi-asserted-by":"publisher","first-page":"985","DOI":"10.1109\/5.871305","volume":"88","author":"J. Davoren","year":"2000","unstructured":"Davoren, J., Nerode, A.: Logics for hybrid systems. Proceedings of the IEEE\u00a088, 985\u20131010 (2000)","journal-title":"Proceedings of the IEEE"},{"key":"14_CR4","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1007\/BF02277857","volume":"7","author":"A. Finkel","year":"1994","unstructured":"Finkel, A.: Decidability of the termination problem for completely specified protocols. Distributed Computing\u00a07, 129\u2013135 (1994)","journal-title":"Distributed Computing"},{"key":"14_CR5","first-page":"99","volume-title":"Proceedings of IJCAI 1991","author":"M. Fisher","year":"1991","unstructured":"Fisher, M.: A resolution method for temporal logic. In: Myopoulos, J., Reiter, R. (eds.) Proceedings of IJCAI 1991, pp. 99\u2013104. Morgan Kaufman, San Francisco (1991)"},{"issue":"1","key":"14_CR6","doi-asserted-by":"publisher","first-page":"12","DOI":"10.1145\/371282.371311","volume":"2","author":"M. Fisher","year":"2001","unstructured":"Fisher, M., Dixon, C., Peim, M.: Clausal temporal resolution. ACM Transactions on Computational Logic (TOCL)\u00a02(1), 12\u201356 (2001)","journal-title":"ACM Transactions on Computational Logic (TOCL)"},{"key":"14_CR7","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0013976","volume-title":"Temporal Logic","author":"D. Gabbay","year":"1994","unstructured":"Gabbay, D., Hodkinson, I., Reynolds, M.: Temporal Logic, vol.\u00a01. Oxford University Press, Oxford (1994)"},{"key":"14_CR8","volume-title":"Studies in Logic","author":"D. Gabbay","year":"2003","unstructured":"Gabbay, D., Kurucz, A., Wolter, F., Zakharyaschev, M.: Many-Dimensional Modal Logics: Theory and Applications. In: Studies in Logic, vol.\u00a0148, Elsevier, Amsterdam (2003)"},{"key":"14_CR9","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1613\/jair.1537","volume":"23","author":"D. Gabelaia","year":"2005","unstructured":"Gabelaia, D., Kontchakov, R., Kurucz, A., Wolter, F., Zakharyaschev, M.: Combining spatial and temporal logics: expressiveness vs. complexity. Journal of Artificial Intelligence Research\u00a023, 167\u2013243 (2005)","journal-title":"Journal of Artificial Intelligence Research"},{"unstructured":"Gabelaia, D., Kurucz, A., Wolter, F., Zakharyaschev, M.: Non-primitive recursive decidability of products of modal logics with expanding domains. Manuscript (2004), Available at http:\/\/www.dcs.kcl.ac.uk\/staff\/mz","key":"14_CR10"},{"unstructured":"Gabelaia, D., Kurucz, A., Wolter, F., Zakharyaschev, M.: Products of \u2018transitive\u2019 modal logics. Journal of Symbolic Logic (2005). (in print) Draft, available at http:\/\/www.dcs.kcl.ac.uk\/staff\/mz","key":"14_CR11"},{"key":"14_CR12","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1016\/0022-0000(89)90039-1","volume":"38","author":"J. Halpern","year":"1989","unstructured":"Halpern, J., Vardi, M.: The complexity of reasoning about knowledge and time I: lower bounds. Journal of Computer and System Sciences\u00a038, 195\u2013237 (1989)","journal-title":"Journal of Computer and System Sciences"},{"key":"14_CR13","doi-asserted-by":"publisher","first-page":"326","DOI":"10.1112\/plms\/s3-2.1.326","volume":"2","author":"G. Higman","year":"1952","unstructured":"Higman, G.: Ordering by divisibility in abstract algebras. Proceedings of the London Mathematical Society\u00a02, 326\u2013336 (1952)","journal-title":"Proceedings of the London Mathematical Society"},{"key":"14_CR14","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1016\/S0168-0072(00)00018-X","volume":"106","author":"I. Hodkinson","year":"2000","unstructured":"Hodkinson, I., Wolter, F., Zakharyaschev, M.: Decidable fragments of first-order temporal logics. Annals of Pure and Applied Logic\u00a0106, 85\u2013134 (2000)","journal-title":"Annals of Pure and Applied Logic"},{"key":"14_CR15","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"274","DOI":"10.1007\/978-3-540-45085-6_21","volume-title":"Automated Deduction \u2013 CADE-19","author":"U. Hustadt","year":"2003","unstructured":"Hustadt, U., Konev, B.: TRP++ 2.0: A temporal resolution prover. In: Baader, F. (ed.) CADE 2003. LNCS (LNAI), vol.\u00a02741, pp. 274\u2013278. Springer, Heidelberg (2003)"},{"key":"14_CR16","series-title":"LNAI","first-page":"326","volume-title":"Proceedings IJCAR 2004","author":"U. Hustadt","year":"2004","unstructured":"Hustadt, U., Konev, B., Riazanov, A., Voronkov, A.: TeMP: A temporal monodic prover. In: Proceedings IJCAR 2004. LNCS (LNAI), vol.\u00a03097, pp. 326\u2013330. Springer, Heidelberg (2004)"},{"unstructured":"Konev, B., Degtyarev, A., Dixon, C., Fisher, M., Hustadt, U.: Towards the implementation of first-order temporal resolution: the expanding domain case. Information and Computation. In: print. Available as Technical Report ULCS-03-005, The University of Liverpool, Department of Computer Science (2005)","key":"14_CR17"},{"doi-asserted-by":"crossref","unstructured":"Konev, B., Kontchakov, R., Wolter, F., Zakharyaschev, M.: On dynamic topological and metric logics. Manuscript (2005), Available at http:\/\/www.dcs.kcl.ac.uk\/staff\/mz","key":"14_CR18","DOI":"10.1007\/s11225-006-9005-x"},{"key":"14_CR19","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1023\/B:STUD.0000027468.28935.6d","volume":"76","author":"R. Kontchakov","year":"2004","unstructured":"Kontchakov, R., Lutz, C., Wolter, F., Zakharyaschev, M.: Temporalising tableaux. Studia Logica\u00a076, 91\u2013134 (2004)","journal-title":"Studia Logica"},{"key":"14_CR20","first-page":"371","volume":"3","author":"P. Kremer","year":"1997","unstructured":"Kremer, P., Mints: Dynamic topological logic. Bulletin of Symbolic Logic\u00a03, 371\u2013372 (1997)","journal-title":"Bulletin of Symbolic Logic"},{"key":"14_CR21","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1016\/j.apal.2004.06.004","volume":"131","author":"P. Kremer","year":"2005","unstructured":"Kremer, P., Mints, G.: Dynamic topological logic. Annals of Pure and Applied Logic\u00a0131, 133\u2013158 (2005)","journal-title":"Annals of Pure and Applied Logic"},{"key":"14_CR22","first-page":"210","volume":"95","author":"J.B. Kruskal","year":"1960","unstructured":"Kruskal, J.B.: Well-quasi-orderings, the tree theorem, and V\u00e1zsonyi\u2019s conjecture. Transactions of the American Mathematical Society\u00a095, 210\u2013225 (1960)","journal-title":"Transactions of the American Mathematical Society"},{"key":"14_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"262","DOI":"10.1007\/3-540-44802-0_18","volume-title":"Computer Science Logic","author":"C. Lutz","year":"2001","unstructured":"Lutz, C., Sattler, U., Wolter, F.: Modal logic and the two-variable fragment. In: Fribourg, L. (ed.) CSL 2001 and EACSL 2001. LNCS, vol.\u00a02142, pp. 262\u2013276. Springer, Heidelberg (2001)"},{"key":"14_CR24","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1016\/S0304-3975(02)00646-1","volume":"297","author":"R. Mayr","year":"2003","unstructured":"Mayr, R.: Undecidable problems in unreliable computations. Theoretical Computer Science\u00a0297, 337\u2013354 (2003)","journal-title":"Theoretical Computer Science"},{"doi-asserted-by":"crossref","unstructured":"Schild, K.: Combining terminological logics with tense logic. In: Proceedings of the 6th Portuguese Conference on Artificial Intelligence, Porto, pp. 105\u2013120 (1993)","key":"14_CR25","DOI":"10.1007\/3-540-57287-2_41"},{"key":"14_CR26","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1016\/S0020-0190(01)00337-4","volume":"83","author":"P. Schnoebelen","year":"2002","unstructured":"Schnoebelen, P.: Verifying lossy channel systems has nonprimitive recursive complexity. Information Processing Letters\u00a083, 251\u2013261 (2002)","journal-title":"Information Processing Letters"},{"unstructured":"Schwendimann, S.: Aspects of Computational Logic. PhD thesis, Universit\u00e4t Bern, Switzerland (1998)","key":"14_CR27"},{"key":"14_CR28","doi-asserted-by":"crossref","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 logics. Journal of the Association for Computing Machinery\u00a032, 733\u2013749 (1985)","journal-title":"Journal of the Association for Computing Machinery"},{"unstructured":"Sistla, A., German, S.: Reasoning with many processes. In: Proceedings of the Second IEEE Symposium on Logic in Computer Science, pp. 138\u2013153 (1987)","key":"14_CR29"},{"key":"14_CR30","first-page":"119","volume":"28","author":"P. Wolper","year":"1985","unstructured":"Wolper, P.: The tableau method for temporal logic: An overview. Logique et Analyse\u00a028, 119\u2013152 (1985)","journal-title":"Logique et Analyse"},{"key":"14_CR31","first-page":"379","volume-title":"Frontiers of Combining Systems II","author":"F. Wolter","year":"2000","unstructured":"Wolter, F., Zakharyaschev, M.: Temporalizing description logics. In: Gabbay, D., de Rijke, M. (eds.) Frontiers of Combining Systems II, pp. 379\u2013401. Studies Press\/Wiley, Chichester (2000)"},{"key":"14_CR32","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1016\/S0168-0072(01)00124-5","volume":"118","author":"F. Wolter","year":"2002","unstructured":"Wolter, F., Zakharyaschev, M.: Axiomatizing the monodic fragment of first-order temporal logic. Annals of Pure and Applied Logic\u00a0118, 133\u2013145 (2002)","journal-title":"Annals of Pure and Applied Logic"}],"container-title":["Lecture Notes in Computer Science","Automated Deduction \u2013 CADE-20"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11532231_14.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T20:09:06Z","timestamp":1605643746000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11532231_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540280057","9783540318644"],"references-count":32,"URL":"https:\/\/doi.org\/10.1007\/11532231_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}