Abstract
We solve the problem left open in [5] by providing a complete axiomatisation of deontic interpreted systems on a language that includes full CTL as well as the K i , O i and \({\mathcal{\widehat{\rm {K}}}}^j_i\) modalities. Additionally we show that the logic employed enjoys the finite model property, hence decidability is guaranteed. To achieve these results we follow and extend the technique used by Halpern and Emerson in [2].
The authors acknowledge support from the EPSRC (grant GR/S49353) and the Nuffield Foundation (grant NAL/690/G).
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Clarke, E., Emerson, E.: Design and synthesis of synchronization skeletons for branching-time temporal logic. In: Kozen, D. (ed.) Logic of Programs 1981. LNCS, vol. 131, pp. 52–71. Springer, Heidelberg (1982)
Emerson, E.A., Halpern, J.Y.: Decision procedures and expressiveness in the temporal logic of branching time. Journal of Computer and System Sciences 30(1), 1–24 (1985)
Fagin, R., Halpern, J.Y., Moses, Y., Vardi, M.Y.: Reasoning about Knowledge. MIT Press, Cambridge (1995)
Lomuscio, A., Raimondi, F.: MCMAS: A model checker for multi-agent systems. In: Hermanns, H., Palsberg, J. (eds.) TACAS 2006. LNCS, vol. 3920, pp. 450–454. Springer, Heidelberg (2006)
Lomuscio, A., Sergot, M.: Deontic interpreted systems. Studia Logica 75(1), 63–92 (2003)
Lomuscio, A., Sergot, M.: A formalisation of violation, error recovery, and enforcement in the bit transmission problem. Journal of Applied Logic 2(1), 93–116 (2004)
Nabialek, W., Niewiadomski, A., Penczek, W., Pólrola, A., Szreter, M.: VerICS 2004: A model checker for real time and multi-agent systems. In: Proceedings of the International Workshop on Concurrency, Specification and Programming (CS&P 2004), Humboldt University. Informatik-Berichte, vol. 170, pp. 88–99 (2004)
Raimondi, F., Lomuscio, A.: Automatic verification of multi-agent systems by model checking via OBDDs. Journal of Applied Logic (2005) (to appear in special issue on Logic-based agent verification)
Wooldridge, M., Lomuscio, A.: A computationally grounded logic of visibility, perception, and knowledge. Logic Journal of the IGPL 9(2), 273–288 (2001)
Woźna, B., Lomuscio, A., Penczek, W.: Bounded model checking for deontic interpreted systems. In: Proc. of the 2nd Workshop on Logic and Communication in Multi-Agent Systems (LCMAS 2004). ENTCS, vol. 126, pp. 93–114. Elsevier, Amsterdam (2004)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Lomuscio, A., Woźna, B. (2006). A Complete and Decidable Axiomatisation for Deontic Interpreted Systems. In: Goble, L., Meyer, JJ.C. (eds) Deontic Logic and Artificial Normative Systems. DEON 2006. Lecture Notes in Computer Science(), vol 4048. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11786849_20
Download citation
DOI: https://doi.org/10.1007/11786849_20
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-35842-8
Online ISBN: 978-3-540-35843-5
eBook Packages: Computer ScienceComputer Science (R0)