Applications of deontic logic in computer science: a concise overview
Deontic logic in computer science
Dynamic Logic
Towards managing dynamic reconfiguration of software systems in a categorical setting
ICTAC'10 Proceedings of the 7th International colloquium conference on Theoretical aspects of computing
| Hi-index | 0.00 |
In this article we describe a first-order extension of the deontic logic introduced in [1]. The main useful and interesting characteristic of this extended logic is that it not only provides the standard quantifiers of first-order logic, but it also has similar algebraic operators for actions as for the propositional version of [1]. Since the pioneering works of Hintikka and Kanger, little advance has been made in developing first-order deontic logics. Furthermore, to the best of our knowledge, the introduction of quantifiers in deontic action logics (i.e., deontic action logics where predicates are applied only to actions) has not been investigated in detail in the literature. This paper represents a significant step in addressing these problems. We also demonstrate the application of this novel logic to fault-tolerance by means of a simple example.