Non-Monotonic S4F Standpoint Logic
From International Center for Computational Logic
Non-Monotonic S4F Standpoint Logic
Talk by Piotr Gorczyca
- Location: APB 3027
- Start: 3. July 2025 at 11:00 am
- End: 3. July 2025 at 12:00 pm
- Research group: Computational Logic
- Event series: Research Seminar Logic and AI
- iCal
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 generalizes both S4F and standpoint propositional 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 skeptical acceptance and illustrate the framework with a worked example.
