Skip to main content
SpringerLink
Log in

Tableau Systems for Deontic Action Logics Based on Finite Boolean Algebras, and Their Complexity

  • Published:
Studia Logica Aims and scope Submit manuscript

Abstract

We introduce a family of tableau calculi for deontic action logics based on finite boolean algebras (or DAL for short), these logics provide deontic operators (e.g., obligation, permission, prohibition) which are applied to a finite number of actions (the vocabulary of the logic); furthermore, in these formalisms, actions can be combined by means of boolean operators, this provides an expressive algebra of actions. We define a tableau calculus for the basic logic and then we extend this calculus to cope with extant variations of this formalism; we prove the soundness and completeness of these proof systems. In addition, we investigate the computational complexity of the satisfiability problem for DAL and its extensions; we show this problem is NP-complete when the number of actions considered is fixed, and it is \({\Sigma^p_2}\)-Hard (in Stockmeyer’s polynomial hierarchy) when the number of actions is taken as an extra parameter. The tableau systems introduced here can be implemented in PSPACE, this seems reasonable taking into consideration the computational complexity of the logics.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Arora, S., and B. Barak, Computational Complexity: A Modern Approach, Cambridge University Press, New York, 2009.

  2. Castro, P.F., and T.S.E. Maibaum, A tableaux system for deontic action logic, in 9th International Conference DEON, Lecture Notes in Computer Science, Vol. 5076, Springer, 2008, pp. 34–48.

  3. Castro P.F., Maibaum T.S.E.: Deontic action logic, atomic Boolean algebras and fault-tolerance. Journal of Applied Logic 7(4), 441–466 (2009)

    Article  Google Scholar 

  4. Emerson, E.A., Temporal and modal logic, in J. van Leeuwen, (ed.), Handbook of Theoretical Computer Science, Vol. B, MIT Press, Cambridge, 1990.

  5. Fitting, M., First-Order Logic and Automated Theorem Proving, Springer, Berlin, 1996.

  6. Pratt, V., A Practical decision method for propositional dynamic logic, in Proceedings of the 10th Annual ACM Symposium on Theory of Computing, ACM, New York, pp. 326–337.

  7. Segerberg K.: A deontic logic of action. Studia Logica 41, 269–282 (1982)

    Article  Google Scholar 

  8. Sikorski, R., Boolean Algebras, Springer, Berlin, 1969.

  9. Smullyan, R.M., First-order logic, Springer, Heidelberg, 1968.

  10. Trypuz, R., and P. Kulicki, On deontic logics based in Boolean algebra, The Journal of Logic and Computation 25:1241–1260, 2015.

Download references

Author information

Authors and Affiliations

  1. Departamento de Computación, Universidad Nacional de Rio Cuarto, Ruta 36 Km 601, Rio Cuarto, Argentina

    Pablo F. Castro

Authors
  1. Pablo F. Castro
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Pablo F. Castro.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Castro, P.F. Tableau Systems for Deontic Action Logics Based on Finite Boolean Algebras, and Their Complexity. Stud Logica 105, 229–251 (2017). https://doi.org/10.1007/s11225-016-9688-6

Download citation

  • Received:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11225-016-9688-6

Keywords

Search

Navigation