# Extending Defeasibility for Propositional Standpoint Logics

arXiv: https://arxiv.org/abs/2507.10133 · HTML: https://mlsanity.com/paper/2507.10133/

## Key facts

- Cited by 2 papers in the map (data through 14 Oct 2026).
- Builds on 5 of its 25 references that are in the map.
- First posted on arXiv 14 Jul 2025.

## Builds on (most cited first, 5 of 5)

- [How to Agree to Disagree: Managing Ontological Perspectives using Standpoint Logic](https://mlsanity.com/paper/2206.06793/) (2022)
- [Tractable Diversity: Scalable Multiperspective Ontology Management via Standpoint EL](https://mlsanity.com/paper/2302.13187/) (2023)
- [Standpoint Linear Temporal Logic](https://mlsanity.com/paper/2304.14243/) (2023)
- [Towards Propositional KLM-Style Defeasible Standpoint Logics](https://mlsanity.com/paper/2410.04245/) (2024)
- [Pushing the Boundaries of Tractable Multiperspective Reasoning: A Deduction Calculus for Standpoint EL+](https://mlsanity.com/paper/2304.14323/) (2023)

## Built on by (most cited first, 2 of 2)

- [Towards Non-Monotonic Entailment in Propositional Defeasible Standpoint Logic](https://mlsanity.com/paper/2606.03655/) (2026)
- [Standpoint Logics with Defeasible Beliefs](https://mlsanity.com/paper/2606.08503/) (2026)

## Abstract (arXiv)

In this paper, we introduce a new defeasible version of propositional standpoint logic by integrating Kraus et al.'s defeasible conditionals, Britz and Varzinczak's notions of defeasible necessity and distinct possibility, along with Leisegang et al.'s approach to defeasibility into the standpoint logics of G'omez 'Alvarez and Rudolph. The resulting logical framework allows for the expression of defeasibility on the level of implications, standpoint modal operators, and standpoint-sharpening statements. We provide a preferential semantics for this extended language and propose a tableaux calculus, which is shown to be sound and complete with respect to preferential entailment. We also establish the computational complexity of the tableaux procedure to be in PSpace.