Skip to main content

From Input/Output Logics to Conditional Logics via Sequents – with Provers

  • Conference paper
  • First Online:
Automated Reasoning with Analytic Tableaux and Related Methods (TABLEAUX 2021)

Abstract

We consider cut-free sequent calculi for a number of deontic logics from the family of Input/Output logics. These sequent calculi provide a correspondence to the flat fragment of certain conditional logics. Two of the introduced calculi are non-standard in that they include non-derivability statements, and hence are interesting also from a purely technical perspective. We further modularise the calculi in an extended sequent framework. Proof search in the extended calculi is implemented in Prolog, providing seemingly the first automated reasoning systems for some of the considered logics.

This work has been supported by BRISE-Vienna (UIA04-081), a European Union Urban Innovative Actions project.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Notes

  1. 1.

    See https://www.swi-prolog.org.

  2. 2.

    See http://subsell.logic.at/bprover/iocondprover/.

  3. 3.

    See https://github.com/blellmann/iocondprover.

References

  1. Alenda, R., Olivetti, N., Pozzato, G.L.: Nested sequent calculi for normal conditional logics. J. Log. Comput. 26(1), 7–50 (2013). https://doi.org/10.1093/logcom/ext034

    Article  MathSciNet  MATH  Google Scholar 

  2. Becker, B., Posegga, J.: leanTAP: lean tableau-based deduction. J. Autom. Reason. 15, 339–358 (1995). https://doi.org/10.1007/BF00881804

    Article  MATH  Google Scholar 

  3. Benzmüller, C., Farjami, A., Meder, P., Parent, X.: I/O logics in HOL. J. Appl. Logics 6(5), 715–754 (2019)

    MathSciNet  Google Scholar 

  4. Bonatti, P.A., Olivetti, N.: Sequent calculi for propositional nonmonotonic logics. ACM Trans. Comput. Log. 3, 226–278 (2002)

    Article  MathSciNet  Google Scholar 

  5. Chellas, B.F.: Modal Logic. Cambridge University Press, Cambridge (1980)

    Book  Google Scholar 

  6. Giordano, L., Gliozzi, V., Olivetti, N., Pozzato, G.L.: Analytic tableaux calculi for KLM logics of nonmonotonic reasoning. ACM Trans. Comput. Log. 10(3), 1–47 (2009)

    MathSciNet  MATH  Google Scholar 

  7. Giordano, L., Gliozzi, V., Pozzato, G.L.: KLMLean 2.0: a theorem prover for KLM logics of nonmonotonic reasoning. In: Olivetti, N. (ed.) TABLEAUX 2007. LNCS (LNAI), vol. 4548, pp. 238–244. Springer, Heidelberg (2007). https://doi.org/10.1007/978-3-540-73099-6_19

    Chapter  MATH  Google Scholar 

  8. Girlando, M., Lellmann, B., Olivetti, N., Pozzato, G.L.: Standard sequent calculi for Lewis’ logics of counterfactuals. In: Michael, L., Kakas, A. (eds.) JELIA 2016. LNCS (LNAI), vol. 10021, pp. 272–287. Springer, Cham (2016). https://doi.org/10.1007/978-3-319-48758-8_18

    Chapter  MATH  Google Scholar 

  9. Girlando, M., Lellmann, B., Olivetti, N., Pozzato, G.L., Vitalis, Q.: VINTE: an implementation of internal calculi for Lewis’ logics of counterfactual reasoning. In: Schmidt, R.A., Nalon, C. (eds.) TABLEAUX 2017. LNCS (LNAI), vol. 10501, pp. 149–159. Springer, Cham (2017). https://doi.org/10.1007/978-3-319-66902-1_9

    Chapter  MATH  Google Scholar 

  10. Kraus, S., Lehman, D., Magidor, M.: Nonmonotonic reasoning, preferential models and cumulative logics. Artif. Intell. 44(1–2), 167–207 (1990)

    Article  MathSciNet  Google Scholar 

  11. Lellmann, B.: Sequent calculi with context restrictions and applications to conditional logic. Ph.D. thesis, Imperial College London (2013). http://hdl.handle.net/10044/1/18059

  12. Lellmann, B., Pattinson, D.: Cut elimination for shallow modal logics. In: Brünnler, K., Metcalfe, G. (eds.) TABLEAUX 2011. LNCS (LNAI), vol. 6793, pp. 211–225. Springer, Heidelberg (2011). https://doi.org/10.1007/978-3-642-22119-4_17

    Chapter  Google Scholar 

  13. Lellmann, B., Pattinson, D.: Sequent systems for Lewis’ conditional logics. In: del Cerro, L.F., Herzig, A., Mengin, J. (eds.) JELIA 2012. LNCS (LNAI), vol. 7519, pp. 320–332. Springer, Heidelberg (2012). https://doi.org/10.1007/978-3-642-33353-8_25

    Chapter  MATH  Google Scholar 

  14. Lellmann, B., Pimentel, E.: Modularisation of sequent calculi for normal and non-normal modalities. ACM Trans. Comput. Logic 20(2), 7:1–7:46 (2019)

    Google Scholar 

  15. Lewis, D.: Counterfactuals. Blackwell (1973)

    Google Scholar 

  16. Makinson, D., van der Torre, L.: Input/Output logics. J. Philos. Log. 29, 383–408 (2000). https://doi.org/10.1023/A:1004748624537

    Article  MathSciNet  MATH  Google Scholar 

  17. Makinson, D., van der Torre, L.: Permission from an input/output perspective. J. Philos. Log. 32, 391–416 (2003). https://doi.org/10.1023/A:1024806529939

    Article  MathSciNet  MATH  Google Scholar 

  18. Olivetti, N., Pozzato, G.L.: CondLean 3.0: improving condlean for stronger conditional logics. In: Beckert, B. (ed.) TABLEAUX 2005. LNCS (LNAI), vol. 3702, pp. 328–332. Springer, Heidelberg (2005). https://doi.org/10.1007/11554554_27http://www.springerlink.com/index/835jd3u9fx8klwy9.pdf

    Chapter  Google Scholar 

  19. Olivetti, N., Pozzato, G.L.: A standard internal calculus for Lewis’ counterfactual logics. In: De Nivelle, H. (ed.) TABLEAUX 2015. LNCS (LNAI), vol. 9323, pp. 270–286. Springer, Cham (2015). https://doi.org/10.1007/978-3-319-24312-2_19

    Chapter  Google Scholar 

  20. Olivetti, N., Pozzato, G.L.: NESCOND: an implementation of nested sequent calculi for conditional logics. In: Demri, S., Kapur, D., Weidenbach, C. (eds.) IJCAR 2014. LNCS (LNAI), vol. 8562, pp. 511–518. Springer, Cham (2014). https://doi.org/10.1007/978-3-319-08587-6_39

    Chapter  Google Scholar 

  21. Olszewski, M., Parent, X., van der Torre, L.: Input/Output logic with a consistency check - the case of permission. In: DEON 2020/2021. College Publications (2021)

    Google Scholar 

  22. Parent, X., Gabbay, D., Torre, L.: Intuitionistic basis for input/output logic. In: Hansson, S.O. (ed.) David Makinson on Classical Methods for Non-Classical Problems. OCL, vol. 3, pp. 263–286. Springer, Dordrecht (2014). https://doi.org/10.1007/978-94-007-7759-0_13

    Chapter  Google Scholar 

  23. Parent, X., van der Torre, L.: Input/output logic. In: Gabbay, D., Horty, J., Parent, X., van der Meyden, R., van der Torre, L. (eds.) Handbook of Deontic Logic and Normative Systems, chap. 8, pp. 495–544. College Publications (2013)

    Google Scholar 

  24. Parent, X., van der Torre, L.: The pragmatic oddity in norm-based deontic logics. In: Governatori, G. (ed.) ICAIL 2017, pp. 169–178. Association for Computing Machinery (2017). https://doi.org/10.1145/3086512.3086529

  25. Parent, X., van der Torre, L.: I/O logics with a consistency check. In: Broersen, J., Condoravdi, C., Nair, S., Pigozzi, G. (eds.) Deontic Logic and Normative Systems. DEON 2018, pp. 285–300. College Publications (2018)

    Google Scholar 

  26. Parent, X., van der Torre, L.: Input/Output logics without weakening. Filosofiska Notiser 6(1), 189–208 (2019)

    Google Scholar 

  27. Pattinson, D., Schröder, L.: Generic modal cut elimination applied to conditional logics. Log. Methods Comput. Sci. 7(1:4), 1–28 (2011)

    MathSciNet  MATH  Google Scholar 

  28. Pozzato, G.L.: Conditional and Preferential Logics: Proof Methods and Theorem Proving. Frontiers in Artificial Intelligence and Applications, vol. 208. IOS Press, Amsterdam (2010)

    Google Scholar 

  29. Steen, A.: Goal-directed decision procedures for input/output logics. In: Liu, F., Marra, A., Portner, P., Putte, F.V.D. (eds.) DEON2020/2021. College Publications (2021, to appear)

    Google Scholar 

  30. Stolpe, A.: Normative consequence: the problem of keeping it whilst giving it up. In: van der Meyden, R., van der Torre, L. (eds.) DEON 2008. LNCS (LNAI), vol. 5076, pp. 174–188. Springer, Heidelberg (2008). https://doi.org/10.1007/978-3-540-70525-3_14

    Chapter  Google Scholar 

  31. Sun, X., Robaldo, L.: On the complexity of input/output logic. J. Appl. Logic 25, 69–88 (2017)

    Article  MathSciNet  Google Scholar 

  32. Troelstra, A.S., Schwichtenberg, H.: Basic Proof Theory. Cambridge Tracts in Theoretical Computer Science, vol. 43, 2nd edn. Cambridge University Press, Cambridge (2000)

    Google Scholar 

Download references

Acknowledgements

This article would not have been possible without the many discussions on the topic with Leon van der Torre. I also thank the reviewers for their thorough reading and comments which helped to improve the article.

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2021 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Lellmann, B. (2021). From Input/Output Logics to Conditional Logics via Sequents – with Provers. In: Das, A., Negri, S. (eds) Automated Reasoning with Analytic Tableaux and Related Methods. TABLEAUX 2021. Lecture Notes in Computer Science(), vol 12842. Springer, Cham. https://doi.org/10.1007/978-3-030-86059-2_9

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-86059-2_9

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-86058-5

  • Online ISBN: 978-3-030-86059-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics