Skip to main content

Default Modal Systems as Algebraic Updates

  • Conference paper
  • First Online:
Dynamic Logic. New Trends and Applications (DaLi 2020)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 12569))

Included in the following conference series:

  • 278 Accesses

Abstract

Default Logic refers to a family of formalisms designed to carry out non-monotonic reasoning over a monotonic logic (in general, Classical First-Order or Propositional Logic). Traditionally, default logics have been defined and dealt with via syntactic consequence relations. Here, we introduce a family of default logics defined over modal logics. First, we present these default logics syntactically. Then, we elaborate on an algebraic counterpart. We do the latter by extending the notion of a modal algebra to acommodate for the main elements of default logics: defaults and extensions. Our algebraic treatment of default logics concludes with an algebraic completeness result. To our knowledge, our approach is novel, and it lays the groundwork for studying default logics from a dynamic logic perspective.

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.

    Typically the underlying proof calculi is one for Classical First-Order Logic (\(\mathsf {FOL}\)) (see, e.g., [21]) or for Classical Propositional Logic (\(\mathsf {CPL}\)) (see, e.g., [6, 17, 19, 22]).

  2. 2.

    In the literature on Default Logic well-behaved defaults are called normal. We avoid using this terminology here to avoid any confusion with normality in Modal Logic.

References

  1. Ågotnes, T., Alechina, N.: The dynamics of syntactic knowledge. J. Log. Comput. 17(1), 83–116 (2007)

    Article  MathSciNet  Google Scholar 

  2. Antoniou, G., Wang, K.: Default logic. In: Gabbay, D., Woods, J. (eds.) The Many Valued and Nonmonotonic Turn in Logic. Handbook of the History of Logic, North-Holland, vol. 8, pp. 517–555 (2007)

    Google Scholar 

  3. Baader, F., Hollunder, B.: Embedding defaults into terminological knowledge representation formalisms. In: Nebel, B., Rich, C., Swartout, W. (eds.) 3rd International Conference on Principles of Knowledge Representation and Reasoning (KR 1992), pp. 306–317. Morgan Kaufmann (1992)

    Google Scholar 

  4. Blackburn, P., de Rijke, M., Venema, Y. (eds.): Modal Logic. Cambridge University Press, Cambridge (2002)

    MATH  Google Scholar 

  5. Cassano, V., Fervari, R., Areces, C., Castro, P.F.: Interpolation and beth definability in default logics. In: Calimeri, F., Leone, N., Manna, M. (eds.) JELIA 2019. LNCS (LNAI), vol. 11468, pp. 675–691. Springer, Cham (2019). https://doi.org/10.1007/978-3-030-19570-0_44

    Chapter  MATH  Google Scholar 

  6. Delgrande, J., Schaub, T., Jackson, W.: Alternative approaches to default logic. Artif. Intell. 70(1–2), 167–237 (1994)

    Article  MathSciNet  Google Scholar 

  7. Duc, H.N.: Reasoning about rational, but not logically omniscient, agents. J. Log. Comput. 7(5), 633–648 (1997)

    Article  MathSciNet  Google Scholar 

  8. Fervari, R., Velázquez-Quesada, F.R.: Dynamic epistemic logics of introspection. In: Madeira, A., Benevides, M. (eds.) DALI 2017. LNCS, vol. 10669, pp. 82–97. Springer, Cham (2018). https://doi.org/10.1007/978-3-319-73579-5_6

    Chapter  MATH  Google Scholar 

  9. Fervari, R., Velázquez-Quesada, F.R.: Introspection as an action in relational models. J. Log. Algebraic Methods Program. 108, 1–23 (2019)

    Article  MathSciNet  Google Scholar 

  10. Fitting, M.: Modal proof theory. In: Blackburn, P., van Benthem, J., Wolter, F. (eds.) Handbook of Modal Logic, pages 85–138. Elsevier (2007)

    Google Scholar 

  11. Froidevaux, C., Mengin, J.: Default logics: a unified view. Computat. Intell. 10, 331–369 (1994)

    Article  Google Scholar 

  12. Gabbay, D., Kurucz, A., Wolter, F., Zakharyaschev, M.: Many-Dimensional Modal Logics: Theory and Applications. Elsevier, Amsterdam (2003)

    MATH  Google Scholar 

  13. Givant, S., Halmos, P.: Introduction to Boolean Algebras. Undergraduate Texts in Mathematics. Springer, Heidelberg (2009). https://doi.org/10.1007/978-0-387-68436-9

    Book  MATH  Google Scholar 

  14. Goranko, V., Passy, S.: Using the universal modality: gains and questions. J. Log. Comput. 2(1), 5–30 (1992)

    Article  MathSciNet  Google Scholar 

  15. Grossi, D., Velázquez-Quesada, F.R.: Syntactic awareness in logical dynamics. Synthese 192(12), 4071–4105 (2015). https://doi.org/10.1007/s11229-015-0733-1

    Article  MathSciNet  MATH  Google Scholar 

  16. Jago, M.: Epistemic logic for rule-based agents. J. Log. Lang. Inform. 18(1), 131–158 (2009)

    Article  MathSciNet  Google Scholar 

  17. Łukaszewicz, W.: Considerations on default logic: an alternative approach. Comput. Intell. 4, 1–16 (1988)

    Article  Google Scholar 

  18. Ma, M.: Mathematics of public announcements. In: van Ditmarsch, H., Lang, J., Ju, S. (eds.) LORI 2011. LNCS (LNAI), vol. 6953, pp. 193–205. Springer, Heidelberg (2011). https://doi.org/10.1007/978-3-642-24130-7_14

    Chapter  Google Scholar 

  19. Mikitiuk, A., Truszczynski, M.: Constrained and rational default logics. In: Proceedings of IJCAI 1995, pp. 1509–1517 (1995)

    Google Scholar 

  20. Plaza, J.: Logics of public communications. Synthese 158(2), 165–179 (2007)

    Article  MathSciNet  Google Scholar 

  21. Reiter, R.: A logic for default reasoning. AI 13(1–2), 81–132 (1980)

    MathSciNet  MATH  Google Scholar 

  22. Schaub, T.: On constrained default theories. In: 11th European Conference on Artificial Intelligence (ECAI 1992), pp. 304–308 (1992)

    Google Scholar 

  23. Solaki, A.: Steps out of logical omniscience. Master’s thesis, Institute for Logic, Language and Computation, Amsterdam (2017). MoL-2017-12

    Google Scholar 

  24. van Benthem, J., Pacuit, E.: Dynamic logics of evidence-based beliefs. Stud. Log. 99(1), 61–92 (2011)

    Article  MathSciNet  Google Scholar 

  25. van Benthem, J., Velázquez-Quesada, F.R.: The dynamics of awareness. Synthese (Knowl. Rational. Action) 177(Supplement 1), 5–27 (2010)

    MATH  Google Scholar 

  26. Vardi, M.Y.: On epistemic logic and logical omniscience. In: Proceedings of TARK, pp. 293–305. Morgan Kaufmann (1986)

    Google Scholar 

  27. Velázquez-Quesada, F.R.: Explicit and implicit knowledge in neighbourhood models. In: Grossi, D., Roy, O., Huang, H. (eds.) LORI 2013. LNCS, vol. 8196, pp. 239–252. Springer, Heidelberg (2013). https://doi.org/10.1007/978-3-642-40948-6_19

    Chapter  MATH  Google Scholar 

  28. Venema, Y.: Algebras and general frames. In: Blackburn et al. [4], pp. 263–333

    Google Scholar 

Download references

Acknowledgment

We would like to thank the anonymous reviewers for their helpful comments and suggestions. This work is supported by projects ANPCyT-PICTs-2017-1130 and 2016-0215, Stic-AmSud 20-STIC-03 “DyLo-MPC”, Secyt-UNC, GRFT Mincyt-Cba, and by the Laboratoire International Associé SINFIN.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Valentin Cassano .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2020 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Cassano, V., Fervari, R., Areces, C., Castro, P.F. (2020). Default Modal Systems as Algebraic Updates. In: Martins, M.A., Sedlár, I. (eds) Dynamic Logic. New Trends and Applications. DaLi 2020. Lecture Notes in Computer Science(), vol 12569. Springer, Cham. https://doi.org/10.1007/978-3-030-65840-3_7

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-65840-3_7

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-65839-7

  • Online ISBN: 978-3-030-65840-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics