Skip to main content
SpringerLink
Log in

A Tableaux System for Deontic Action Logic

  • Conference paper
Deontic Logic in Computer Science (DEON 2008)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 5076))

Included in the following conference series:

Abstract

In [1] and [2] we have introduced a novel deontic action logic for reasoning about fault-tolerance. In this paper we present a tableaux method for this logic; this proof system is sound and complete, and because the logic has the usual boolean operators on actions, it also allows us to deal successfully with action complement and parallel execution of actions. Finally, we describe an example of application of this proof system which shows how the tableaux system can be used to obtain (counter-) models of specifications.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 74.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Castro, P., Maibaum, T.: An ought-to-do deontic logic for reasoning about fault-tolerance: The diarrheic philosophers. In: 5th IEEE International Conference on Software Engineering and Formal Methods. IEEE, Los Alamitos (2007)

    Google Scholar 

  2. Castro, P., Maibaum, T.: A complete and compact deontic action logic. In: Jones, C.B., Liu, Z., Woodcock, J. (eds.) ICTAC 2007. LNCS, vol. 4711, pp. 109–123. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  3. Kent, S., Quirk, B., Maibaum, T.: Specifying deontic behavior in modal action logic. Technical report, Forest Research Project (1991)

    Google Scholar 

  4. Meyer, J.: A different approach to deontic logic: Deontic logic viewed as variant of dynamic logic. Notre Dame Journal of Formal Logic 29 (1988)

    Google Scholar 

  5. Fiadeiro, J., Maibaum, T.: Temporal theories as modularization units for concurrent system specification. Formal Aspects of Computing 4, 239–272 (1992)

    Article  MATH  Google Scholar 

  6. Broersen, J.: Modal Action Logics for Reasoning about Reactive Systems. PhD thesis, Vrije University (2003)

    Google Scholar 

  7. Castro, P., Maibaum, T.: Reasoning about system-degradation and fault-recovery with deontic logic. In: Workshop on Methods, Models and Tools for Fault-Tolerance (2007)

    Google Scholar 

  8. Smullyian, R.: First-Order Logic. Springer, New York (1968)

    Google Scholar 

  9. Fitting, M.: First-Order Logic and Automated Theorem Proving. Springer, Heidelberg (1990)

    MATH  Google Scholar 

  10. Pratt, V.: A Practical Decision Method for Propositional Dynamic Logic. In: ACM Symposium on Theory of Computing (1978)

    Google Scholar 

  11. Fitting, M.: Tableau methods of proof for modal logics. Notre Dame Journal of Formal Logic XIII (April 1972)

    Google Scholar 

  12. Giacomo, G., Massacci, F.: Tableaux and algorithms for propositional dynamic logic with converse. In: Conference on Automated Deduction (1996)

    Google Scholar 

  13. Maibaum, T.: Temporal reasoning over deontic specifications. In: Sons, J.W. (ed.) Deontic Logic in Computer Science (1993)

    Google Scholar 

  14. Meyer, J., Wieringa, R., Dignum, F.: The paradoxes of deontic logic revisited: A computer science perspective. Technical Report UU-CS-1994-38, Utrecht University (1994)

    Google Scholar 

  15. Khosla, S., Maibaum, T.: The prescription and description of state-based systems. In: Banieqnal, B., Pnueli, H.A. (eds.) Temporal Logic in Computation. Springer, Heidelberg (1985)

    Google Scholar 

  16. Gargov, G., Passy, S.: A note on boolean logic. In: Petkov, P.P. (ed.) Proceedings of the Heyting Summerschool. Plenum Press (1990)

    Google Scholar 

  17. Fitch, F.B.: Tree proofs in modal logics. Journal of Symbolic Logic (1966)

    Google Scholar 

  18. Monk, J.: Mathematical Logic. Graduate Texts in Mathematics. Springer, Heidelberg (1976)

    MATH  Google Scholar 

  19. Ehrig, H., Mahr, B.: Fundamentals of Algebraic Specification 1: Equations and Initial Semantics. Springer, Heidelberg (1985)

    MATH  Google Scholar 

  20. Belzer, M.: Legal reasoning in 3-d. In: ICAIL, pp. 155–163 (1987)

    Google Scholar 

  21. Artosi, A., Governatori, G.: A tableau methodology for deontic conditional. In: DEON 1998, International Workshop on Deontic Logic in Computer Science, pp. 65–81 (1998)

    Google Scholar 

  22. Governatori, G., Lomuscio, A., Sergot, M.J.: A tableaux system for deontic interpreted systems. In: Gedeon, T.D., Fung, L.C.C. (eds.) AI 2003. LNCS (LNAI), vol. 2903, pp. 339–351. Springer, Heidelberg (2003)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computing & Software, McMaster University, Hamilton, Canada

    Pablo F. Castro & T. S. E. Maibaum

Authors
  1. Pablo F. Castro
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. T. S. E. Maibaum
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Ron van der Meyden Leendert van der Torre

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Castro, P.F., Maibaum, T.S.E. (2008). A Tableaux System for Deontic Action Logic. In: van der Meyden, R., van der Torre, L. (eds) Deontic Logic in Computer Science. DEON 2008. Lecture Notes in Computer Science(), vol 5076. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-70525-3_4

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-70525-3_4

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-70524-6

  • Online ISBN: 978-3-540-70525-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation