Defeasibility in Propositional Standpoint Logics
Aus International Center for Computational Logic
Defeasibility in Propositional Standpoint Logics
Vortrag von Nicholas Leisegang
- Veranstaltungsort: APB-2026
- Beginn: 27. November 2025 um 11:00
- Ende: 27. November 2025 um 12:00
- Forschungsgruppe: Computational Logic
- Event series: Research Seminar Logic and AI
- iCal
Standpoint logics are a recent family of modal logics introduced to KR, which provide a mechanism for representing potentially conflicting beliefs of different viewpoints into a single logical framework. In the classical setting, standpoint logics allows for one to express information about beliefs which are necessary or possible to a given standpoint. However, this case is not sufficiently expressive but to reason about the prototypical (or usual) behaviour and beliefs of a given standpoint. This talk will introduce Propositional Defeasible Standpoint Logic (PDSL) which extends propositional standpoint logics with KLM style defeasible modalities and implications, allowing us to reason about standpoints’ prototypical behaviours. The authors define a semantics and a notion of preferential entailment for PDSL, and show that satisfiability and preferential entailment can be computed using a semantic tableaux algorithm. They also consider an alternative means of incorporating KLM-style defeasibility, in which standpoints can hold defeasible beliefs, rather than exhibit defeasible behaviours.
