Non-Monotonic S4F Standpoint Logic

PublikationenPublications

• Nach AutorBy Author
  • Piotr GorczycaPiotr Gorczyca
  • Hannes StraßHannes Straß
• Nach ForschungsgruppeBy Research Group
  • Computational LogicComputational Logic

Toggle side column

Non-Monotonic S4F Standpoint Logic

Piotr GorczycaPiotr Gorczyca,  Hannes StraßHannes Straß

• Download

Piotr Gorczyca, Hannes Straß
Non-Monotonic S4F Standpoint Logic
Proceedings of the 40th Annual AAAI Conference on Artificial Intelligence (AAAI-26), to appear

• Details
• Bibtex

• KurzfassungAbstract
  Standpoint logics offer unified modal logic-based formalisms for representing multiple heterogeneous viewpoints. At the same time, many non-monotonic reasoning frameworks can be naturally captured using modal logics — in particular using the modal logic S4F. In this work, we propose a novel formalism called S4F Standpoint Logic, which generalises both S4F and propositional standpoint logic and is therefore capable of expressing multi-viewpoint, non-monotonic semantic commitments. We define its syntax and semantics and analyze its computational complexity, obtaining the result that S4F Standpoint Logic is not computationally harder than its constituent logics, whether in monotonic or non-monotonic form. We also outline mechanisms for credulous and sceptical acceptance and illustrate the framework with an example.
• Projekt:Project: KIMEDS, MEDGE, SECAI, SEMECO-Q2
• Forschungsgruppe:Research Group: Computational LogicComputational Logic

@inproceedings{GS2025,
  author    = {Piotr Gorczyca and Hannes Stra{\ss}},
  title     = {Non-Monotonic {S4F} Standpoint Logic},
  booktitle = {Proceedings of the 40th Annual {AAAI} Conference on Artificial
               Intelligence (AAAI-26)},
  year      = {2025},
  month     = {January}
}