Towards Non-Monotonic Entailment in Propositional Defeasible Standpoint Logic
The paper discusses advancements in propositional defeasible standpoint logic, focusing on non-monotonic entailment. It proposes a method to extend the expressivity of this logic through situated standpoint conditionals. The authors aim to facilitate entailment-checking using algorithms from the propositional case while maintaining complexity bounds.
- ▪The research addresses non-monotonic entailment in propositional defeasible standpoint logic.
- ▪It introduces situated standpoint conditionals to enhance the expressivity of the logic.
- ▪The paper demonstrates that entailment-checking can leverage existing propositional algorithms.
Opening excerpt (first ~120 words) tap to expand
Computer Science > Artificial Intelligence arXiv:2606.03655 (cs) [Submitted on 2 Jun 2026] Title:Towards Non-Monotonic Entailment in Propositional Defeasible Standpoint Logic Authors:Nicholas Leisegang, Thomas Meyer, Ivan Varzniczak View a PDF of the paper titled Towards Non-Monotonic Entailment in Propositional Defeasible Standpoint Logic, by Nicholas Leisegang and 2 other authors View PDF HTML (experimental) Abstract:Recent work in defeasible reasoning has seen notions of preferential semantics and entailment in the style of Kraus et al. applied to modal logics. However, work in this field has focussed primarily on satisfiability checking, and monotonic notions of entailment, which may be inferentially weak.
…
Excerpt limited to ~120 words for fair-use compliance. The full article is at arXiv cs.AI.
Discussion
0 commentsMore from arXiv cs.AI
