This paper studies the logic of modalities for motivational attitudes (desires, obligations, wishes, wants, intentions, etc.) that come with a deadline condition. For instance, an agent may want to get home before it starts raining. We use a 'reduction approach' from deontic logic to characterize two separate semantic definitions for these motivational modalities in CTL. The main advantage of applying reductions is that the formal reasoning can be performed entirely in CTL. We claim that the reduction approach applies to any motivational modality.
CITATION STYLE
Broersen, J. (2004). On the logic of “being motivated to achieve ρ, before δ.” In Lecture Notes in Artificial Intelligence (Subseries of Lecture Notes in Computer Science) (Vol. 3229, pp. 334–346). Springer Verlag. https://doi.org/10.1007/978-3-540-30227-8_29
Mendeley helps you to discover research relevant for your work.