Broadening the Applicability of Conditional Syntax Splitting for Reasoning from Conditional Belief Bases

• URL: http://arxiv.org/abs/2604.12660v1
• Date: Tue, 14 Apr 2026 12:27:05 GMT
• Title: Broadening the Applicability of Conditional Syntax Splitting for Reasoning from Conditional Belief Bases
• Abstract summary: In nonmonotonic reasoning from conditional belief bases, an inference operator satisfying syntax splitting postulates allows for taking only the relevant parts of a belief base into account.<n>Recently this overlap of conditionals has been shown to be limited to trivial, self-fulfilling conditionals.<n>We propose a generalization of safe conditional syntax splittings that broadens the applicability of splitting postulates.
• Score: 17.087561406710723
• License: http://creativecommons.org/licenses/by-nc-nd/4.0/
• Abstract: In nonmonotonic reasoning from conditional belief bases, an inference operator satisfying syntax splitting postulates allows for taking only the relevant parts of a belief base into account, provided that the belief base splits into subbases based on disjoint signatures. Because such disjointness is rare in practice, safe conditional syntax splitting has been proposed as a generalization of syntax splitting, allowing the conditionals in the subbases to share some atoms. Recently this overlap of conditionals has been shown to be limited to trivial, self-fulfilling conditionals. In this article, we propose a generalization of safe conditional syntax splittings that broadens the applicability of splitting postulates. In contrast to safe conditional syntax splitting, our generalized notion supports syntax splittings of a belief base Δ where the subbases of Δ may share atoms and nontrivial conditionals. We illustrate how this new notion overcomes limitations of previous splitting concepts, and we identify genuine splittings, separating them from simple splittings that do not provide benefits for inductive inference from Δ. We introduce adjusted inference postulates based on our generalization of conditional syntax splitting, and we evaluate several popular inductive inference operators with respect to these postulates. Furthermore, we show that, while every inductive inference operator satisfying generalized conditional syntax splitting also satisfies conditional syntax splitting, the reverse does not hold.

Related papers

• On the Proper Treatment of Units in Surprisal Theory [50.52310749207036]
  We show that surprisal-based predictors depend implicitly on ad hoc procedures that conflate two distinct modeling choices.<n>We argue that surprisal-based analyses should make these choices explicit and treat tokenization as an implementation detail.
  arXiv  Detail & Related papers  (2026-04-30T17:33:58Z)
• LOGICAL-COMMONSENSEQA: A Benchmark for Logical Commonsense Reasoning [6.8658995041250455]
  LOGICAL-COMMONSENSEQA re-frames commonsense reasoning as logical composition over pairs of atomic statements.<n>We find that while models perform reasonably on conjunctive and moderately on disjunctive reasoning, performance degrades sharply on negation-based questions.
  arXiv  Detail & Related papers  (2026-01-23T07:07:19Z)
• 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)
• Learning Visual-Semantic Subspace Representations [49.17165360280794]
  We introduce a nuclear norm-based loss function, grounded in the same information theoretic principles that have proved effective in self-supervised learning.<n>We present a theoretical characterization of this loss, demonstrating that, in addition to promoting classity, it encodes the spectral geometry of the data within a subspace lattice.
  arXiv  Detail & Related papers  (2024-05-25T12:51:38Z)
• Unsupervised Mapping of Arguments of Deverbal Nouns to Their Corresponding Verbal Labels [52.940886615390106]
  Deverbal nouns are verbs commonly used in written English texts to describe events or actions, as well as their arguments. The solutions that do exist for handling arguments of nominalized constructions are based on semantic annotation. We propose to adopt a more syntactic approach, which maps the arguments of deverbal nouns to the corresponding verbal construction.
  arXiv  Detail & Related papers  (2023-06-24T10:07:01Z)
• Abductive Commonsense Reasoning Exploiting Mutually Exclusive Explanations [118.0818807474809]
  Abductive reasoning aims to find plausible explanations for an event. Existing approaches for abductive reasoning in natural language processing often rely on manually generated annotations for supervision. This work proposes an approach for abductive commonsense reasoning that exploits the fact that only a subset of explanations is correct for a given context.
  arXiv  Detail & Related papers  (2023-05-24T01:35:10Z)
• Unifying different notions of quantum incompatibility into a strict hierarchy of resource theories of communication [60.18814584837969]
  We introduce the notion of q-compatibility, which unifies different notions of POVMs, channels, and instruments incompatibility. We are able to pinpoint exactly what each notion of incompatibility consists of, in terms of information-theoretic resources.
  arXiv  Detail & Related papers  (2022-11-16T21:33:31Z)
• 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)
• Situated Conditional Reasoning [10.828616610785524]
  We show that situation-based conditionals can be described in terms of a set of postulates. We then define a form of entailment for situated conditional knowledge bases, which we refer to as minimal closure.
  arXiv  Detail & Related papers  (2021-09-03T14:23:18Z)
• A Conditional Splitting Framework for Efficient Constituency Parsing [14.548146390081778]
  We introduce a generic seq2seq parsing framework that casts constituency parsing problems (syntactic and discourse parsing) into a series of conditional splitting decisions. Our parsing model estimates the conditional probability distribution of possible splitting points in a given text span and supports efficient top-down decoding. For discourse analysis we show that in our formulation, discourse segmentation can be framed as a special case of parsing.
  arXiv  Detail & Related papers  (2021-06-30T00:36:34Z)
• A Weaker Faithfulness Assumption based on Triple Interactions [89.59955143854556]
  We propose a weaker assumption that we call $2$-adjacency faithfulness. We propose a sound orientation rule for causal discovery that applies under weaker assumptions.
  arXiv  Detail & Related papers  (2020-10-27T13:04:08Z)
• Constraint Monotonicity, Epistemic Splitting and Foundedness Could in General Be Too Strong in Answer Set Programming [32.60523531309687]
  We consider the notions of subjective constraint monotonicity, epistemic splitting, and foundedness as main criteria respectively intuitions to compare different answer set semantics. In this note, we demonstrate on some examples that they may be too strong in general and may exclude some desired answer sets respectively world views.
  arXiv  Detail & Related papers  (2020-10-01T04:03:11Z)

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.