In this paper we present a propositional deontic logic, with the goal of using it to specify fault-tolerant systems, and an axiomatization of it. We prove several results about this logic: completeness, soundness, compactness and decidability. The main technique used during the completeness proof is based on standard techniques for modal logics, but it has some new characteristics introduced for dealing with this logic. In addition, the logic provides several operators which appear useful for use in practice, in particular to model fault-tolerant systems and to reason about their fault tolerance properties. © Springer-Verlag Berlin Heidelberg 2007.
CITATION STYLE
Castro, P. F., & Maibaum, T. S. E. (2007). A complete and compact propositional deontic logic. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4711 LNCS, pp. 109–123). Springer Verlag. https://doi.org/10.1007/978-3-540-75292-9_8
Mendeley helps you to discover research relevant for your work.