Abstract
This paper studies the logic of a dyadic modal operator for being obliged to meet a condition ρ before a condition δ becomes true. Starting from basic intuitions we arrive at a simple semantics for deadline obligations in terms of branching time models. We show that this notion of deadline obligation can be characterized in the branching time logic CTL. The defined operator obeys intuitive logic properties, like monotony w.r.t. ρ and anti-monotony w.r.t. δ, and avoids some counter-intuitive properties like agglomeration w.r.t ρ and’weak agglomeration’ w.r.t. δ. However, obligations of this type are implied by the actual achievement of ρ before the deadline. We argue that this problem is caused by the fact that we model the obligation only from the point of view of its violation conditions. We show that the property might be eliminated by considering success conditions also.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Dean, T., Firby, R., Miller, D.: Hierarchical planning involving deadlines, travel time, and resources. Computational Intelligence 6(1), 381–398 (1990)
Clarke, E., Emerson, E., Sistla, A.: Automatic verification of finite-state concurrent systems using temporal logic specifications. ACM Transactions on Programming Languages and Systems 8 (1986)
Emerson, E.: Temporal and modal logic. In: van Leeuwen, J. (ed.) Handbook of Theoretical Computer Science. Formal Models and Semantics, vol. B, pp. 996–1072. Elsevier Science, Amsterdam (1990)
Clarke, E., Grumberg, O., Long, D.: Verification tools for finite-state concurrent systems. In: de Bakker, J.W., de Roever, W.-P., Rozenberg, G. (eds.) REX 1993. LNCS, vol. 803, pp. 124–175. Springer, Heidelberg (1994)
van Wright, G.: Deontic logic. Mind 60, 1–15 (1951)
Broersen, J., Dastani, M., Torre, L.v.d.: BDIO-CTL: Obligations and the specification of agent behavior. In: Proceedings of Eighteenth International Joint Conference on Artificial Intelligence (IJCAI 2003) (2003)
Anderson, A.: A reduction of deontic logic to alethic modal logic. Mind 67, 100–103 (1958)
Kanger, S.: New foundations for ethical theory. In: Hilpinen, R. (ed.) Deontic Logic: Introductory and Systematic Readings, pp. 36–58. D. Reidel Publishing Company, Dordrecht (1971)
Dignum, F., Kuiper, R.: Combining dynamic deontic logic and temporal logic for the specification of deadlines. In: S. Jr., R. (ed.) Proceedings of thirtieth HICSS (1997)
Rao, A., Georgeff, M.: Modeling rational agents within a BDI-architecture. In: Allen, J., Fikes, R., Sandewall, E. (eds.) Proceedings of the 2nd International Conference on Principles of Knowledge Representation and Reasoning (KR 1991), pp. 473–484. Morgan Kaufmann Publishers, San Francisco (1991)
Schnoebelen, P.: The complexity of temporal logic model checking. In: Balbiani, P., Suzuki, N.Y., Wolter, F., Zakharyaschev, M. (eds.) Advances in Modal Logic, vol. 4, pp. 393–436 (2003)
Schild, K.: On the relationship between BDI-logics and standard logics of concurrency. Autonomous agents and multi-agent systems 3, 259–283 (2000)
Cohen, P., Levesque, H.: Intention is choice with commitment. Artificial Intelligence 42, 213–261 (1990)
Benthem, J.v.: Minimal deontic logics. Bulletin of the Section of Logic 8, 36–42 (1979)
Lutz, C., Sattler, U.: The complexity of reasoning with boolean modal logic. In: Advances in Modal Logic, vol. 3, pp. 365–387. World Scientific, Singapore (2002)
Gasquet, O., Herzig, A.: Translating non-normal modal logics into normal modal logics. In: Jomes, A., Sergot, M. (eds.) Proceedings International Workshop on Deontic Logic, TANO, Oslo (1993)
Gasquet, O., Herzig, A.: (From classical to normal modal logics)
Bolotov, A., Fisher, M.: A clausal resolution method for CTL branching-time temporal logic. Journal of Experimental and Theoretical Artificial Intelligence 11, 77–93 (1999)
Shankar, N.: Machine-assisted verification using theorem proving and model checking. In: Broy, M. (ed.) Mathematical Methods in Program Development, Springer, Heidelberg (1997)
Torre, L.v.d., Tan, Y.: Diagnosis and decision making in normative reasoning. Artificial Intelligence and Law 7, 51–67 (1999)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Broersen, J., Dignum, F., Dignum, V., Meyer, JJ.C. (2004). Designing a Deontic Logic of Deadlines. In: Lomuscio, A., Nute, D. (eds) Deontic Logic in Computer Science. DEON 2004. Lecture Notes in Computer Science(), vol 3065. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-25927-5_5
Download citation
DOI: https://doi.org/10.1007/978-3-540-25927-5_5
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-22111-1
Online ISBN: 978-3-540-25927-5
eBook Packages: Springer Book Archive