Towards Non-Monotonic Entailment in Propositional Defeasible Standpoint Logic

• URL: http://arxiv.org/abs/2606.03655v1
• Date: Tue, 02 Jun 2026 13:44:37 GMT
• Title: Towards Non-Monotonic Entailment in Propositional Defeasible Standpoint Logic
• Abstract summary: We show that a large fragment of propositional defeasible standpoint logic is expressible as a set of situated conditionals.<n>We then focus on characterising non-monotonic entailment in this fragment, defining a method to transport any ranking-based entailment relation from the propositional case into the P case.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• 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. One particular modal logic where this has been introduced is propositional standpoint logics, where modalities can express the views of different viewpoints. This has resulted in the formalisation of propositional defeasible standpoint logic (PDSL). In this paper, we propose a means of lifting the class of (non-monotonic) rational entailment relations from traditional KLM-style reasoning to a fragment of PDSL. In order to do so, we extend the expressivity of PDSL via situated standpoint conditionals, allowing us to talk about a defeasible conditional holding in the context of a given standpoint. This allows us to re-characterise the syntax of PDSL in terms of situated conditionals, and shows that a large fragment of PDSL is expressible as a set of situated conditionals. We then focus on characterising non-monotonic entailment in this fragment, defining a method to transport any ranking-based entailment relation from the propositional case into the PDSL case. This is first described in the general case and then considered in the specific cases of rational and lexicographic closures, providing a faithful translation of each inference into PDSL. We also show that entailment-checking in this fragment of PDSL can be done largely using algorithms from the propositional case, while preserving complexity bounds.

Related papers

• Standpoint Logics with Defeasible Beliefs [2.3722749986774403]
  We integrate the defeasible logic of Kraus, Lehmann and Magidor with the standpoint logic framework of Gmez lvarez and Rudolph.<n>This is done with the goal of formally expressing knowledge taking into account multiple (possibly contradicting) viewpoints.<n>We show that, for each considered form of entailment, the complexity class of entailment checking does not change when moving from propositional KLM to DRSL.
  arXiv  Detail & Related papers  (2026-06-07T08:05:30Z)
• Do It for HER: First-Order Temporal Logic Reward Specification in Reinforcement Learning (Extended Version) [49.462399222747024]
  We propose a novel framework for the logical specification of non-Markovian rewards in Decision Processes (MDPs) with large state spaces.<n>Our approach leverages Linear Temporal Logic Modulo Theories over finite traces (LTLfMT)<n>We introduce a method based on reward machines and Hindsight Experience Replay (HER) to translate first-order logic specifications and address reward sparsity.
  arXiv  Detail & Related papers  (2026-02-05T22:11:28Z)
• Explainable Chain-of-Thought Reasoning: An Empirical Analysis on State-Aware Reasoning Dynamics [69.00587226225232]
  We introduce a state-aware transition framework that abstracts CoT trajectories into structured latent dynamics.<n>To characterize the global structure of reasoning, we model their progression as a Markov chain.<n>This abstraction supports a range of analyses, including semantic role identification, temporal pattern visualization, and consistency evaluation.
  arXiv  Detail & Related papers  (2025-08-29T18:53:31Z)
• Extending Defeasibility for Propositional Standpoint Logics [3.4410212782758043]
  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.<n>The resulting logical framework allows for the expression of defeasibility on the level of implications, standpoint modal operators, and standpoint-sharpening statements.
  arXiv  Detail & Related papers  (2025-07-14T10:23:49Z)
• Rational Inference in Formal Concept Analysis [0.4499833362998487]
  Defeasible conditionals are a form of non-monotonic inference.<n>KLM framework defines a semantics for the propositional case of defeasible conditionals.
  arXiv  Detail & Related papers  (2025-04-07T20:15:20Z)
• Few-shot Policy (de)composition in Conversational Question Answering [54.259440408606515]
  We propose a neuro-symbolic framework to detect policy compliance using large language models (LLMs) in a few-shot setting.<n>We show that our approach soundly reasons about policy compliance conversations by extracting sub-questions to be answered, assigning truth values from contextual information, and explicitly producing a set of logic statements from the given policies.<n>We apply this approach to the popular PCD and conversational machine reading benchmark, ShARC, and show competitive performance with no task-specific finetuning.
  arXiv  Detail & Related papers  (2025-01-20T08:40:15Z)
• Towards Propositional KLM-Style Defeasible Standpoint Logics [3.8097021295196414]
  We introduce the logical system of Defeasible Restricted Standpoint Logic (DRSL) and define its syntax and semantics. Specifically, we integrate ranked interpretations and standpoint structures, which provide the semantics for propositional KLM and propositional standpoint logic respectively. We extend the non-monotonic entailment relation of rational closure from the propositional KLM case to the DRSL case.
  arXiv  Detail & Related papers  (2024-10-05T18:07:03Z)
• A Primer for Preferential Non-Monotonic Propositional Team Logics [0.0]
  We show that team-based propositional logics naturally give rise to cumulative non-monotonic entailment relations. Motivated by the non-classical interpretation of disjunction in team semantics, we give a precise characterization for preferential models for propositional dependence logic.
  arXiv  Detail & Related papers  (2024-05-11T09:53:15Z)
• Rationale-Augmented Ensembles in Language Models [53.45015291520658]
  We reconsider rationale-augmented prompting for few-shot in-context learning. We identify rationale sampling in the output space as the key component to robustly improve performance. We demonstrate that rationale-augmented ensembles achieve more accurate and interpretable results than existing prompting approaches.
  arXiv  Detail & Related papers  (2022-07-02T06:20:57Z)
• A Formalisation of Abstract Argumentation in Higher-Order Logic [77.34726150561087]
  We present an approach for representing abstract argumentation frameworks based on an encoding into classical higher-order logic. This provides a uniform framework for computer-assisted assessment of abstract argumentation frameworks using interactive and automated reasoning tools.
  arXiv  Detail & Related papers  (2021-10-18T10:45:59Z)
• Superposition with Lambdas [59.87497175616048]
  We design a superposition calculus for a clausal fragment of extensional polymorphic higher-order logic that includes anonymous functions but excludes Booleans. The inference rules work on $betaeta$-equivalence classes of $lambda$-terms and rely on higher-order unification to achieve refutational completeness.
  arXiv  Detail & Related papers  (2021-01-31T13:53:17Z)
• Reasoning about Typicality and Probabilities in Preferential Description Logics [0.15749416770494704]
  We describe preferential Description Logics of typicality, a nonmonotonic extension of standard Description Logics by means of a typicality operator T. This extension is based on a minimal model semantics corresponding to a notion of rational closure. We consider other strengthening of the rational closure semantics and construction to avoid the so-called blocking of property inheritance problem.
  arXiv  Detail & Related papers  (2020-04-20T14:50:31Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.