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 K i j 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]. © Springer-Verlag Berlin Heidelberg 2006.
Cite
CITATION STYLE
Lomuscio, A., & Woźna, B. (2006). A complete and decidable axiomatisation for deontic interpreted systems. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4048 LNAI, pp. 238–254). Springer Verlag. https://doi.org/10.1007/11786849_20
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
