{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,16]],"date-time":"2026-01-16T10:27:13Z","timestamp":1768559233449,"version":"3.49.0"},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540250159","type":"print"},{"value":"9783540322580","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/978-3-540-32258-0_7","type":"book-chapter","created":{"date-parts":[[2010,7,5]],"date-time":"2010-07-05T16:17:24Z","timestamp":1278346644000},"page":"91-105","source":"Crossref","is-referenced-by-count":4,"title":["Dealing with Time in Content Language Expressions"],"prefix":"10.1007","author":[{"given":"Mario","family":"Verdicchio","sequence":"first","affiliation":[]},{"given":"Marco","family":"Colombetti","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"7_CR1","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1016\/0004-3702(84)90008-0","volume":"23","author":"J.F. Allen","year":"1984","unstructured":"Allen, J.F.: Towards a general theory of action and time. Artificial Intelligence\u00a023, 123\u2013154 (1984)","journal-title":"Artificial Intelligence"},{"key":"7_CR2","first-page":"186","volume-title":"Proceedings of the 31st Annual Hawaii International Conference on System Sciences","author":"F. Dignum","year":"1998","unstructured":"Dignum, F., Kuiper, R.: Obligations and dense time for specifying deadlines. In: Proceedings of the 31st Annual Hawaii International Conference on System Sciences, vol.\u00a05, pp. 186\u2013195. IEEE Computer Society Press, Los Alamitos (1998)"},{"key":"7_CR3","first-page":"995","volume-title":"Handbook of Theoretical Computer Science, ch. 16","author":"E.A. Emerson","year":"1990","unstructured":"Emerson, E.A.: Temporal and modal logic. In: van Leeuwen, J. (ed.) Handbook of Theoretical Computer Science, ch. 16, vol.\u00a0B, pp. 995\u20131072. MIT Press, Cambridge (1990)"},{"issue":"1","key":"7_CR4","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1145\/4904.4999","volume":"33","author":"E.A. Emerson","year":"1986","unstructured":"Emerson, E.A., Halpern, J.Y.: \u2018Sometimes\u2019 and \u2018not never\u2019 revisited. Journal of the ACM\u00a033(1), 151\u2013178 (1986)","journal-title":"Journal of the ACM"},{"key":"7_CR5","unstructured":"FIPA. FIPA SL Content Language Specification. Specification, Foundation for Intelligent Physical Agents (2002), \n                    \n                      http:\/\/www.fipa.org\/specs\/fipa00008\/"},{"key":"7_CR6","first-page":"535","volume-title":"Proceedings of the 1st International Joint Conference on Autonomous Agents and Multiagent Systems (AAMAS 2002)","author":"N. Fornara","year":"2002","unstructured":"Fornara, N., Colombetti, M.: Operational specification of a commitment-based agent communication language. In: Castelfranchi, C., Lewis Johnson, W. (eds.) Proceedings of the 1st International Joint Conference on Autonomous Agents and Multiagent Systems (AAMAS 2002), pp. 535\u2013542. ACM Press, New York (2002)"},{"key":"7_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1007\/3-540-18088-5_22","volume-title":"Automata, Languages and Programming","author":"T. Hafer","year":"1987","unstructured":"Hafer, T., Thomas, W.: Computational Tree Logic CTL* and path quantifiers in the monadic theory of the binary tree. In: Ottmann, T. (ed.) ICALP 1987. LNCS, vol.\u00a0267, pp. 269\u2013279. Springer, Heidelberg (1987)"},{"key":"7_CR8","first-page":"25","volume-title":"Proceedings of the 10th Annual IEEE Symposium on Logic in Computer Science","author":"Y. Kesten","year":"1995","unstructured":"Kesten, Y., Pnueli, A.: Once and for all. In: Proceedings of the 10th Annual IEEE Symposium on Logic in Computer Science, San Diego, California, pp. 25\u201335. IEEE Computer Society Press, Los Alamitos (1995)"},{"issue":"2","key":"7_CR9","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1016\/0304-3975(95)00035-U","volume":"148","author":"F. Laroussinie","year":"1995","unstructured":"Laroussinie, F., Schnoebelen, P.: A hierarchy of temporal logics with past. Theoretical Computer Science\u00a0148(2), 303\u2013324 (1995)","journal-title":"Theoretical Computer Science"},{"key":"7_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"196","DOI":"10.1007\/3-540-15648-8_16","volume-title":"Logics of Programs","author":"O. Lichtenstein","year":"1985","unstructured":"Lichtenstein, O., Pnueli, A., Zuck, L.: The glory of the past. In: Parikh, R. (ed.) Logic of Programs 1985. LNCS, vol.\u00a0193, pp. 196\u2013218. Springer, Heidelberg (1985)"},{"key":"7_CR11","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"166","DOI":"10.1007\/978-3-540-24608-4_10","volume-title":"Advances in Agent Communication","author":"A.U. Mallya","year":"2004","unstructured":"Mallya, A.U., Yolum, P., Singh, M.P.: Resolving commitments among autonomous agents. In: Dignum, F.P.M. (ed.) ACL 2003. LNCS (LNAI), vol.\u00a02922, pp. 166\u2013182. Springer, Heidelberg (2004)"},{"issue":"4","key":"7_CR12","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1080\/11663081.1998.10510948","volume":"8","author":"H.J. Ohlbach","year":"1998","unstructured":"Ohlbach, H.J., Gabbay, D.: Calendar logic. Journal of Applied Non-classical Logics\u00a08(4), 291\u2013324 (1998)","journal-title":"Journal of Applied Non-classical Logics"},{"key":"7_CR13","volume-title":"Elements of Symbolic Logic","author":"H. Reichenbach","year":"1947","unstructured":"Reichenbach, H.: Elements of Symbolic Logic. MacMillan, New York (1947)"},{"key":"7_CR14","first-page":"229","volume-title":"Proceedings of the 15th Annual IEEE Symposium on Logic in Computer Science (LICS 2000)","author":"M. Reynolds","year":"2000","unstructured":"Reynolds, M.: More past glories. In: Proceedings of the 15th Annual IEEE Symposium on Logic in Computer Science (LICS 2000), pp. 229\u2013240. IEEE Comp. Soc. Press, Los Alamitos (2000)"},{"key":"7_CR15","unstructured":"Reynolds, M.: An axiomatization of PCTL*. Draft, Murdoch University, Perth, Australia (January 2002)"},{"key":"7_CR16","volume-title":"Proceedings of the 4th International Workshop on Advances in Modal Logic (AiML 2002)","author":"P. Schnoebelen","year":"2003","unstructured":"Schnoebelen, P.: The complexity of temporal logic model checking. In: Proceedings of the 4th International Workshop on Advances in Modal Logic (AiML 2002). World Scientific Publishers, Singapore (2003) (to appear)"},{"key":"7_CR17","first-page":"477","volume-title":"Handbook of Philosophical Logic","author":"C. Stirling","year":"1992","unstructured":"Stirling, C.: Modal and temporal logics. In: Abramsky, S., Gabbay, D., Maibaum, T. (eds.) Handbook of Philosophical Logic, vol.\u00a02, pp. 477\u2013563. Oxford University Press, Oxford (1992)"},{"key":"7_CR18","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1007\/978-94-009-6259-0_3","volume-title":"Handbook of Philosophical Logic, Extensions of Classical Logic","author":"R. Thomason","year":"1984","unstructured":"Thomason, R.: Combinations of tense and modality. In: Gabbay, D., Guenthner, F. (eds.) Handbook of Philosophical Logic, Extensions of Classical Logic, vol.\u00a0II, pp. 135\u2013165. Reidel, Dordrecht (1984)"},{"key":"7_CR19","doi-asserted-by":"publisher","first-page":"528","DOI":"10.1145\/860575.860660","volume-title":"Proceedings of the 2nd International Joint Conference on Autonomous Agents and Multiagent Systems (AAMAS 2003)","author":"M. Verdicchio","year":"2003","unstructured":"Verdicchio, M., Colombetti, M.: A logical model of social commitment for agent communication. In: Rosenschein, J.S., Sandholm, T., Wooldridge, M.J., Yokoo, M. (eds.) Proceedings of the 2nd International Joint Conference on Autonomous Agents and Multiagent Systems (AAMAS 2003), pp. 528\u2013535. ACM Press, New York (2003)"}],"container-title":["Lecture Notes in Computer Science","Agent Communication"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-32258-0_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,15]],"date-time":"2019-03-15T07:34:14Z","timestamp":1552635254000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-32258-0_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540250159","9783540322580"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-32258-0_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2005]]}}}