The complexity of the temporal logic with "until" over general linear time
Journal of Computer and System Sciences
Analyzing consistency of security policies
SP '97 Proceedings of the 1997 IEEE Symposium on Security and Privacy
Relativized Deontic Modalities for Contractual Obligations in Formal Business Communication
HICSS '97 Proceedings of the 30th Hawaii International Conference on System Sciences: Information Systems Track—Internet and the Digital Economy - Volume 4
Specifying deadlines with continuous time using deontic and temporal logic
International Journal of Electronic Commerce - Special issue: Formal aspects of digital commerce
Security policy compliance with violation management
Proceedings of the 2007 ACM workshop on Formal methods in security engineering
The temporal logic of programs
SFCS '77 Proceedings of the 18th Annual Symposium on Foundations of Computer Science
Meeting the deadline: why, when and how
FAABS'04 Proceedings of the Third international conference on Formal Approaches to Agent-Based Systems
| Hi-index | 0.00 |
We propose a normal modal deontic logic based on a dyadic operator, similar in structure to the temporal "until". By bringing significant expressiveness to the logic, it allows both the definition of a monadic desirability operator similar to the SDL obligation, and the expression of the relative level of desirability of target formulae. The interpretation of this logic on a linear structure of worlds ordered by desirability makes its semantics more intuitive and concrete than the SDL deontic accessibility relation. We also show that the core modality of the logic permits to represent the Chisholm and Forrester paradoxes of deontic logic in a more precise way, which does not lead to inconsistencies.