Abstract
The ability to express temporal conditions, like for example deadlines, is extremely important in agent applications. Nevertheless, communication standards like FIPA ACL do not outline a uniform way to specify such conditions in Content Language expressions. In this paper we extend a CTL*-like temporal language with two very expressive interval operators, and integrate it with a FIPA-compatible representation of dates. We then show, by a number of selected examples, that the resulting language allows agents to express a rich assortment of temporal constraints in a very natural way.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Allen, J.F.: Towards a general theory of action and time. Artificial Intelligence 23, 123–154 (1984)
Dignum, F., Kuiper, R.: Obligations and dense time for specifying deadlines. In: Proceedings of the 31st Annual Hawaii International Conference on System Sciences, vol. 5, pp. 186–195. IEEE Computer Society Press, Los Alamitos (1998)
Emerson, E.A.: Temporal and modal logic. In: van Leeuwen, J. (ed.) Handbook of Theoretical Computer Science, ch. 16, vol. B, pp. 995–1072. MIT Press, Cambridge (1990)
Emerson, E.A., Halpern, J.Y.: ‘Sometimes’ and ‘not never’ revisited. Journal of the ACM 33(1), 151–178 (1986)
FIPA. FIPA SL Content Language Specification. Specification, Foundation for Intelligent Physical Agents (2002), http://www.fipa.org/specs/fipa00008/
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–542. ACM Press, New York (2002)
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. 267, pp. 269–279. Springer, Heidelberg (1987)
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–35. IEEE Computer Society Press, Los Alamitos (1995)
Laroussinie, F., Schnoebelen, P.: A hierarchy of temporal logics with past. Theoretical Computer Science 148(2), 303–324 (1995)
Lichtenstein, O., Pnueli, A., Zuck, L.: The glory of the past. In: Parikh, R. (ed.) Logic of Programs 1985. LNCS, vol. 193, pp. 196–218. Springer, Heidelberg (1985)
Mallya, A.U., Yolum, P., Singh, M.P.: Resolving commitments among autonomous agents. In: Dignum, F.P.M. (ed.) ACL 2003. LNCS (LNAI), vol. 2922, pp. 166–182. Springer, Heidelberg (2004)
Ohlbach, H.J., Gabbay, D.: Calendar logic. Journal of Applied Non-classical Logics 8(4), 291–324 (1998)
Reichenbach, H.: Elements of Symbolic Logic. MacMillan, New York (1947)
Reynolds, M.: More past glories. In: Proceedings of the 15th Annual IEEE Symposium on Logic in Computer Science (LICS 2000), pp. 229–240. IEEE Comp. Soc. Press, Los Alamitos (2000)
Reynolds, M.: An axiomatization of PCTL*. Draft, Murdoch University, Perth, Australia (January 2002)
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)
Stirling, C.: Modal and temporal logics. In: Abramsky, S., Gabbay, D., Maibaum, T. (eds.) Handbook of Philosophical Logic, vol. 2, pp. 477–563. Oxford University Press, Oxford (1992)
Thomason, R.: Combinations of tense and modality. In: Gabbay, D., Guenthner, F. (eds.) Handbook of Philosophical Logic, Extensions of Classical Logic, vol. II, pp. 135–165. Reidel, Dordrecht (1984)
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–535. ACM Press, New York (2003)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Verdicchio, M., Colombetti, M. (2005). Dealing with Time in Content Language Expressions. In: van Eijk, R.M., Huget, MP., Dignum, F. (eds) Agent Communication. AC 2004. Lecture Notes in Computer Science(), vol 3396. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-32258-0_7
Download citation
DOI: https://doi.org/10.1007/978-3-540-32258-0_7
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-25015-9
Online ISBN: 978-3-540-32258-0
eBook Packages: Computer ScienceComputer Science (R0)