Abstract
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.
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.
Similar content being viewed by others
References
Meyer, J.J., Wieringa, R.J.: Deontic logic: A concise overview. In: DEON 1991. First International Workshop on Deontic Logic (1991)
Broersen, J.: Modal Action Logics for Reasoning about Reactive Systems. PhD thesis, Vrije University Amsterdam (2003)
Maibaum, T.S.E., Khosla, S.: The prescription and description of state-based systems. In: Barringer, H.B., Pnueli, A. (eds.) Temporal Logic in Computation, Springer, Heidelberg (1985)
Meyer, J.J.: Dynamic logic for reasoning about actions and agents. In: Workshop on Logic-Based Artificial Intelligence, Washington, DC (June 14-16, 1999)
Magee, J., Maibaum, T.S.E.: Towards specification, modelling and analysis of fault tolerance in self managed systems. In: Proceeding of the 2006 international workshop on self-adaptation and self-managing systems (2006)
Meyer, J.J.: A different approach to deontic logic: Deontic logic viewed as variant of dynamic logic. Notre Dame Journal of Formal Logic 29 (1988)
Kent, S., Quirk, B., Maibaum, T.S.E.: Specifying deontic behavior in modal action logic. Technical report, Forest Research Project (1991)
Gargov, G., Passy, S.: A note on boolean logic. In: Petkov, P.P. (ed.) Proceedings of the Heyting Summerschool, Plenum Press, New York (1990)
Harel, D., Kozen, D., Tiuryn, J.: Dynamic Logic. MIT Press, Cambridge (2000)
Sikorski, R.: Boolean Algebras. Springer, Heidelberg (1969)
Monk, J.D.: Mathematical Logic. Graduate Texts in Mathematics. Springer, Heidelberg (1976)
Castro, P.F., Maibaum, T.S.E.: Torwards a deontic logic for fault tolerance. Technical Report SQRL39, McMaster, Department of Computing & Software, Software Quality Research Laboratory (2007)
Blackburn, P., Rijke, M., Venema, Y.: Modal Logic. Cambridge Tracts in Theoretical Computer Science, vol. 53 (2001)
Emerson, E.A., Halpern, J.Y.: Decision procedures and expressiveness in the temporal logic of branching time. In: STOC. 14th Annual Symposiun on Theory of Computing (1982)
Dijkstra, E.W.: Hirarchical ordering of sequential processes. In: Acta Informatica, vol. 1, pp. 115–138. Springer, Heidelberg (1971)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Castro, P.F., Maibaum, T.S.E. (2007). A Complete and Compact Propositional Deontic Logic. In: Jones, C.B., Liu, Z., Woodcock, J. (eds) Theoretical Aspects of Computing – ICTAC 2007. ICTAC 2007. Lecture Notes in Computer Science, vol 4711. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-75292-9_8
Download citation
DOI: https://doi.org/10.1007/978-3-540-75292-9_8
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-75290-5
Online ISBN: 978-3-540-75292-9
eBook Packages: Computer ScienceComputer Science (R0)