P. Blackburn, M.de Rijke & Y.de Venema (2001):
Modal Logic.
Cambridge Tracts in Theoretical Computer Science 53.
J. Broersen (2003):
Modal Action Logics for Reasoning about Reactive Systems.
Vrije University.
Pablo F. Castro (2009):
Deontic Action Logics for the Specification and Analysis of Fault-Tolerance.
McMaster University, Department of Computing and Software.
Pablo F. Castro & T.S.E. Maibaum (2008):
A Tableaux System for Deontic Action Logic.
In: Proceedings of 9th International Conference on Deontic Logic in Computer Science , Luxembourg..
Springer-Verlag,
doi:10.1007/978-3-540-70525-3_4.
Pablo F. Castro & T.S.E. Maibaum (2009):
Deontic Action Logic, Atomic Boolean Algebra and Fault-Tolerance.
Journal of Applied Logic 7(4),
pp. 441–466,
doi:10.1016/j.jal.2009.02.001.
Brian F. Chellas (1999):
Modal Logic: An Introduction.
Cambridge University Press.
E.A. Emerson (1995):
Temporal and Modal Logic.
In: Handbook of Theoretical Computer Science.
Elsevier,
pp. 995–1072.
Kit Fine (1975):
Normal Forms in Modal Logics.
In: Notre Dame Journal of Formal Logic XVI,
pp. 229–237,
doi:10.1305/ndjfl/1093891703.
M. Fitting (1990):
First-Order Logic and Automated Theorem Proving.
Springer-Verlag,
doi:10.1007/978-1-4684-0357-2.
M. Fitting (April 1972):
Tableau Methods of Proof for Modal Logics.
In: Notre Dame Journal of Formal Logic XIII,
doi:10.1305/ndjfl/1093894722.
Dov M. Gabbay (1996):
Labelled Deductive Systems, Volume 1.
Oxford University Press.
G. Gargov & S. Passy (1990):
A Note on Boolean Logic.
In: P.P.Petkov: Proceedings of the Heyting Summerschool.
Plenum Press,
doi:10.1007/978-1-4613-0609-2_21.
G. Giacomo & F. Massacci (1996):
Tableaux and Algorithms for Propositional Dynamic Logic with Converse.
In: Conference on Automated Deduction,
doi:10.1006/inco.1999.2852.
Rajeev Goré (1995):
Tableau Methods for Modal and Temporal Logics.
Technical Report TR-ARP-15-95.
Australian National University.
D. Harel, D. Kozen & J. Tiuryn (2000):
Dynamic Logic.
MIT Press.
S. Khosla & T.S.E. Maibaum (1985):
The Prescription and Description of State-Based Systems..
In: H.Barringer B.Banieqnal & A.Pnueli: Temporal Logic in Computation.
Springer-Verlag,
doi:10.1007/3-540-51803-7_30.
Carsten Lutz & Ulrike Sattler (2000):
The Complexity of Reasoning with Boolean Modal Logics.
In: Advances in Modal Logic 3.
World Scientific,
pp. 329–348,
doi:10.1142/9789812776471_0018.
Fabio Massacci (2000):
Single Step Tableaux for Modal Logics.
J. Autom. Reasoning 24(3),
pp. 319–364,
doi:10.1023/A:1006155811656.
J.J. Meyer (1988):
A Different Approach to Deontic Logic: Deontic Logic Viewed as Variant of Dynamic Logic.
In: Notre Dame Journal of Formal Logic 29,
doi:10.1305/ndjfl/1093637776.
J.D. Monk (1976):
Mathematical Logic.
Graduate Texts in Mathematics.
Springer-Verlag.
V.R. Pratt (1978):
A Practical Decision Method for Propositional Dynamic Logic.
ACM Symposium on Theory of Computing,
doi:10.1145/800133.804362.
Krister Segerberg (1982):
A Deontic Logic of Action.
Studia Logica 41,
pp. 269–282,
doi:10.1007/BF00370348.
Robert Trypuz & Piotr Kulicki (2010):
Towards Metalogical Systematisation of Deontic Action Logics Based on Boolean Algebra.
In: Deontic Logic in Computer Science, 10th International Conference.
Lecture Notes in Computer Science 6181 Springer,
doi:10.1007/978-3-642-14183-6_11.
eptcs@eptcs.org