Curved Boolean Logic: A Contextual Generalization of Propositional Logic with Algorithmic Consequences

• URL: http://arxiv.org/abs/2510.04716v3
• Date: Sat, 11 Oct 2025 07:06:25 GMT
• Title: Curved Boolean Logic: A Contextual Generalization of Propositional Logic with Algorithmic Consequences
• Abstract summary: CBL generalizes propositional logic by allowing local truth assignments that do not extend to a single global valuation.<n>We give equivalent sheaf and exclusivity-graph semantics and a context-aware proof calculus that is conservative in the flat limit.<n>We model noise with iid, AR(1)-correlated, and adversarial bounded perturbations and provide permutation-based significance with Benjamini-Hochberg FDR control.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Curved Boolean Logic (CBL) generalizes propositional logic by allowing local truth assignments that do not extend to a single global valuation, analogous to curvature in geometry. We give equivalent sheaf and exclusivity-graph semantics and a context-aware proof calculus that is conservative in the flat limit. We formalize CBL-SAT and basic complexity (NP-complete in general) and present operational operators (CBL-AC and CBL-CONS) that prune contradictions earlier on classical hardware. We model noise with iid, AR(1)-correlated, and adversarial bounded perturbations and provide permutation-based significance with Benjamini-Hochberg FDR control. A Colab-ready notebook (ancillary files) regenerates all figures and statistics. We position CBL relative to KCBS, CSW, and sheaf frameworks and outline links to SAT/CSP and robustness/adapter stability in large language models.

Related papers

• Correlated Coherent Errors in Stabilizer Codes: A General Cumulant Framework and Interference-Based Error Suppression [0.15393457051344298]
  Coherent errors in stabilizer codes are often correlated across qubits and QEC cycles.<n>We derive the exact logical channel induced by repeated QEC cycles under correlated coherent $Z$ noise.<n>We also show that noise correlations, usually assumed to be harmful to QEC, can instead be a resource.
  arXiv  Detail & Related papers  (2026-07-24T17:16:19Z)
• QBism Logic [0.0]
  QBism interprets quantum theory as a normative discipline for an agent's probability assignments.<n>This paper develops a logical formalization of that picture.
  arXiv  Detail & Related papers  (2026-07-19T10:20:53Z)
• Weave of Formal Thought [51.56484100374058]
  We introduce Weave of Formal Thought (WoFT), a paradigm uniting rigorous syntactic validation with learned structural representations.<n>We present a latent-variable fine-tuning method training the language model to interleave non-terminal grammar symbols directly into generation.<n>For Python, fine-tuning StarCoder2-3B with our RWS objective reduces per-token cross-entropy by 14.3% relative to a text-only SFT baseline.
  arXiv  Detail & Related papers  (2026-06-24T15:58:11Z)
• Beyond the Simplex: Balanced Prototype Geometry for Scorer-Agnostic Open-Set Recognition [2.9506547907695997]
  We give a theoretical account of simplex-ratio OSR that holds in every embedding dimension, including d C-1.<n>We show that the prototypes attain one-distance symmetry, behaving like a regular simplex, if and only if d >= C-1.<n>We further show the false-ratio rate decays exponentially in d under natural isotropy assumptions.
  arXiv  Detail & Related papers  (2026-06-01T08:28:24Z)
• When Rule Violations Are Rare: Chimera Training for Logical Anomaly Detection [56.362776482614976]
  We study anomaly detection in a setting where constraints are given as logical rules over learned visual concepts.<n>We propose a neural rule evaluator that compiles each constraint into a directed acyclic graph and learns feature-aware subtree gates.<n>Across CLEVRER, OpenImages, and VidOR, the resulting evaluator improves rule-level anomaly AUROC over independent-events and same-image semantic-training baselines.
  arXiv  Detail & Related papers  (2026-05-25T02:52:36Z)
• Neural Information Causality [0.0]
  We develop a framework called neural information causality (Neural-IC)<n>We show that Neural-IC is an operational diagnostic for query leakage, precision leakage, and episode-specific memory.<n>We also provide an exact one-bit classical RAC benchmark, showing explicitly that the relevant quantum enhancement is not total information beyond the bottleneck.
  arXiv  Detail & Related papers  (2026-05-10T04:25:11Z)
• From Grounding to Skolemization: A Logic-Constrained Vector Symbolic Architecture for Complex Query Answering [14.380920038542287]
  Complex Query Answering (CQA) over incomplete Knowledge Graphs (KGs) faces a fundamental trade-off between logical soundness and computational efficiency.<n>This work establishes the Grounding-Skolemization dichotomy for systematically analyzing CQA methods through the lens of formal logic.<n>We propose the Logic-constrained Symbolic Vector Architecture (LVSA), a neuro-symbolic framework that unifies a differentiable Skolemization module and a neural negator.
  arXiv  Detail & Related papers  (2025-09-13T14:59:00Z)
• SAT-Based Bounded Fitting for the Description Logic ALC [7.193373053157516]
  We investigate bounded fitting for the description logic ALC and its syntactic fragments.<n>We show that the underlying size-restricted fitting problem is NP-complete for all studied fragments.<n>We present an implementation of bounded fitting in ALC and its fragments based on a SAT solver.
  arXiv  Detail & Related papers  (2025-07-29T12:32:16Z)
• Large Language Models Meet Symbolic Provers for Logical Reasoning Evaluation [24.081573908824353]
  First-order logic (FOL) reasoning is pivotal for intelligent systems.<n>Existing benchmarks often rely on extensive human annotation or handcrafted templates.<n>We propose a novel framework called ProverGen that synergizes the generative strengths of Large Language Models with the rigor and precision of symbolic provers.
  arXiv  Detail & Related papers  (2025-02-10T15:31:54Z)
• TabVer: Tabular Fact Verification with Natural Logic [11.002475880349452]
  We propose a set-theoretic interpretation of numerals and arithmetic functions in the context of natural logic. We leverage large language models to generate arithmetic expressions by generating questions about salient parts of a claim which are answered by executing functions on tables. In a few-shot setting on FEVEROUS, we achieve an accuracy of 71.4, outperforming both fully neural and symbolic reasoning models by 3.4 points.
  arXiv  Detail & Related papers  (2024-11-02T00:36:34Z)
• LINC: A Neurosymbolic Approach for Logical Reasoning by Combining Language Models with First-Order Logic Provers [60.009969929857704]
  Logical reasoning is an important task for artificial intelligence with potential impacts on science, mathematics, and society. In this work, we reformulating such tasks as modular neurosymbolic programming, which we call LINC. We observe significant performance gains on FOLIO and a balanced subset of ProofWriter for three different models in nearly all experimental conditions we evaluate.
  arXiv  Detail & Related papers  (2023-10-23T17:58:40Z)
• Efficient Computation of Counterfactual Bounds [44.4263314637532]
  We compute exact counterfactual bounds via algorithms for credal nets on a subclass of structural causal models. We evaluate their accuracy by providing credible intervals on the quality of the approximation.
  arXiv  Detail & Related papers  (2023-07-17T07:59:47Z)
• Modeling Hierarchical Reasoning Chains by Linking Discourse Units and Key Phrases for Reading Comprehension [80.99865844249106]
  We propose a holistic graph network (HGN) which deals with context at both discourse level and word level, as the basis for logical reasoning. Specifically, node-level and type-level relations, which can be interpreted as bridges in the reasoning process, are modeled by a hierarchical interaction mechanism.
  arXiv  Detail & Related papers  (2023-06-21T07:34:27Z)
• Contextual Bandits with Packing and Covering Constraints: A Modular Lagrangian Approach via Regression [65.8785736964253]
  We consider contextual bandits with linear constraints (CBwLC), a variant of contextual bandits in which the algorithm consumes multiple resources subject to linear constraints on total consumption. This problem generalizes contextual bandits with knapsacks (CBwK), allowing for packing and covering constraints, as well as positive and negative resource consumption. We provide the first algorithm for CBwLC (or CBwK) that is based on regression oracles. The algorithm is simple, computationally efficient, and statistically optimal under mild assumptions.
  arXiv  Detail & Related papers  (2022-11-14T16:08:44Z)
• Structural Learning of Probabilistic Sentential Decision Diagrams under Partial Closed-World Assumption [127.439030701253]
  Probabilistic sentential decision diagrams are a class of structured-decomposable circuits. We propose a new scheme based on a partial closed-world assumption: data implicitly provide the logical base of the circuit. Preliminary experiments show that the proposed approach might properly fit training data, and generalize well to test data, provided that these remain consistent with the underlying logical base.
  arXiv  Detail & Related papers  (2021-07-26T12:01:56Z)
• Tractable Inference in Credal Sentential Decision Diagrams [116.6516175350871]
  Probabilistic sentential decision diagrams are logic circuits where the inputs of disjunctive gates are annotated by probability values. We develop the credal sentential decision diagrams, a generalisation of their probabilistic counterpart that allows for replacing the local probabilities with credal sets of mass functions. For a first empirical validation, we consider a simple application based on noisy seven-segment display images.
  arXiv  Detail & Related papers  (2020-08-19T16:04:34Z)
• Best Arm Identification for Cascading Bandits in the Fixed Confidence Setting [81.70513857417106]
  We design and analyze CascadeBAI, an algorithm for finding the best set of $K$ items. An upper bound on the time complexity of CascadeBAI is derived by overcoming a crucial analytical challenge. We show, through the derivation of a lower bound on the time complexity, that the performance of CascadeBAI is optimal in some practical regimes.
  arXiv  Detail & Related papers  (2020-01-23T16:47:52Z)

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.