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.
arXiv cs.AI files mainly under ai research. We currently carry 1,128 of its stories.
Story provenance
Source · retrieval · rights · ranking — open for full record
inspect →
Story provenance
Attribution is not the same as permission. This drawer separates discovery metadata, excerpts, WeSearch-generated summaries, reuse status, and whether the publisher receives the visit. Nothing here claims a legal grant the publisher has not made.
Record
| Original publisher | arXiv cs.AI |
| Canonical URL | https://arxiv.org/abs/2606.03655 |
| Publication time | Wed, 03 Jun 2026 00:00:00 -0400 |
| Retrieval time | 2026-06-03T04:11:55.408Z |
| Last seen | 2026-06-03T04:11:55.408Z |
| Headline source | Publisher (no WeSearch rewrite) |
| Excerpt source | publisher body |
| Excerpt method | First ~120 words (~800 chars) of extracted publisher body, fair-use limited. |
| Summary | WeSearch · cerebras-chat (WeSearch summarizer) |
| Summary source text | contentText |
| Citation coverage | Summary is a WeSearch-generated derivative; primary citation is the original publisher URL. |
| Cluster | UwlQStdCnbQL |
| Cluster logic | Grouped by semantic title/content similarity across sources within a rolling window. Same-publisher template collisions are excluded from coverage comparison. |
| Ranking reason | Story pages are not engagement-ranked. Hub feeds use recency, with optional source-diversified chronological ordering (cap consecutive stories per source). No personalized ranking. |
| Publisher visit | Yes — open original |
| Substitutes article? | No — link-out required for full text |
Rights status (four layers)
WeSearch handling by dimension
| Indexing | May the item be indexed (stored, ranked, made findable)? | Allowed |
| Snippet | May a short excerpt of the publisher's text be shown? | Allowed |
| AI summary | May WeSearch generate its own short summary of the article? | Limited |
| Retrieval / RAG | May the content be exposed for third-party retrieval-augmented generation? | Not asserted |
| Model training | May the content be used to train AI models? | Not asserted |
| Commercial reuse | May the content be reused commercially? | Not permitted |
Basis: Derived from the published RSS/Atom feed. Contact: [email protected]. Reviewed: 2026-07-24.
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
