Inference with System W Satisfies Syntax Splitting

• URL: http://arxiv.org/abs/2202.05511v1
• Date: Fri, 11 Feb 2022 08:59:41 GMT
• Title: Inference with System W Satisfies Syntax Splitting
• Authors: Jonas Haldimann, Christoph Beierle
• Abstract summary: System W is an inference system for nonmonotonic reasoning that captures and properly extends system Z as well as c-inference. We show that system W fulfils the syntax splitting postulates for inductive inference operators by showing that it satisfies the required properties of relevance and independence.
• Score: 3.42658286826597
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: In this paper, we investigate inductive inference with system W from conditional belief bases with respect to syntax splitting. The concept of syntax splitting for inductive inference states that inferences about independent parts of the signature should not affect each other. This was captured in work by Kern-Isberner, Beierle, and Brewka in the form of postulates for inductive inference operators expressing syntax splitting as a combination of relevance and independence; it was also shown that c-inference fulfils syntax splitting, while system P inference and system Z both fail to satisfy it. System W is a recently introduced inference system for nonmonotonic reasoning that captures and properly extends system Z as well as c-inference. We show that system W fulfils the syntax splitting postulates for inductive inference operators by showing that it satisfies the required properties of relevance and independence. This makes system W another inference operator besides c-inference that fully complies with syntax splitting, while in contrast to c-inference, also extending rational closure.

Related papers

• On Separation Logic, Computational Independence, and Pseudorandomness (Extended Version) [1.024113475677323]
  This work explores the nature of computational independence in a cryptographic scenario. We show that the semantics of separation logic can be adapted so as to account for complexity bounded adversaries. Remarkably, this allows for a fruitful interplay between independence and pseudorandomness.
  arXiv  Detail & Related papers  (2024-05-20T12:39:28Z)
• A Note on an Inferentialist Approach to Resource Semantics [48.65926948745294]
  'Inferentialism' is the view that meaning is given in terms of inferential behaviour. This paper shows how 'inferentialism' enables a versatile and expressive framework for resource semantics.
  arXiv  Detail & Related papers  (2024-05-10T14:13:21Z)
• Inferentialist Resource Semantics [48.65926948745294]
  In systems modelling, a system typically comprises located resources relative to which processes execute. This paper shows how inferentialism enables a versatile and expressive framework for resource semantics.
  arXiv  Detail & Related papers  (2024-02-14T14:54:36Z)
• A Theory of Unsupervised Speech Recognition [60.12287608968879]
  Unsupervised speech recognition (ASR-U) is the problem of learning automatic speech recognition systems from unpaired speech-only and text-only corpora. We propose a general theoretical framework to study the properties of ASR-U systems based on random matrix theory and the theory of neural tangent kernels.
  arXiv  Detail & Related papers  (2023-06-09T08:12:27Z)
• Certain and Uncertain Inference with Indicative Conditionals [0.3437656066916039]
  We develop a trivalent semantics for the truth conditions and the probability of the natural language conditional. We show systematic correspondences between trivalent and probabilistic representations of inferences in either framework. The result is a unified account of the semantics and indicative of conditionals that can be fruitfully applied to analyzing the validity of conditional inferences.
  arXiv  Detail & Related papers  (2022-07-17T20:06:00Z)
• Dive into Ambiguity: Latent Distribution Mining and Pairwise Uncertainty Estimation for Facial Expression Recognition [59.52434325897716]
  We propose a solution, named DMUE, to address the problem of annotation ambiguity from two perspectives. For the former, an auxiliary multi-branch learning framework is introduced to better mine and describe the latent distribution in the label space. For the latter, the pairwise relationship of semantic feature between instances are fully exploited to estimate the ambiguity extent in the instance space.
  arXiv  Detail & Related papers  (2021-04-01T03:21:57Z)
• Comment on "Strong Quantum Darwinism and Strong Independence are Equivalent to Spectrum Broadcast Structure" [62.997667081978825]
  We show that the mathematical formulation of condition (b) is necessary but not sufficient to ensure the equivalence. We propose a simple counter-example, together with a strengthened formulation of condition (b)
  arXiv  Detail & Related papers  (2021-01-21T16:06:25Z)
• Nonmonotonic Inferences with Qualitative Conditionals based on Preferred Structures on Worlds [3.42658286826597]
  We introduce the preferred structure relation on worlds using conditionals in R. We show that system W exhibits desirable inference properties like satisfying system P and avoiding. In contrast to skeptical c-inference, it does not require to solve a complex constraint satisfaction problem, but is as tractable as system Z.
  arXiv  Detail & Related papers  (2020-05-26T13:32:00Z)
• Logical Inferences with Comparatives and Generalized Quantifiers [18.58482811176484]
  A logical inference system for comparatives has not been sufficiently developed for use in the Natural Language Inference task. We present a compositional semantics that maps various comparative constructions in English to semantic representations via Category Grammar (CCG) We show that the system outperforms previous logic-based systems as well as recent deep learning-based models.
  arXiv  Detail & Related papers  (2020-05-16T11:11:48Z)
• Semantics-Aware Inferential Network for Natural Language Understanding [79.70497178043368]
  We propose a Semantics-Aware Inferential Network (SAIN) to meet such a motivation. Taking explicit contextualized semantics as a complementary input, the inferential module of SAIN enables a series of reasoning steps over semantic clues. Our model achieves significant improvement on 11 tasks including machine reading comprehension and natural language inference.
  arXiv  Detail & Related papers  (2020-04-28T07:24:43Z)
• Putting a Spin on Language: A Quantum Interpretation of Unary Connectives for Linguistic Applications [0.0]
  Lambek Calculus relies on unary modalities to allow controlled application of structural rules. Proposals for compositional interpretation of Lambek Calculus in the compact closed category of FVect and linear maps have been made. Our aim is to turn the modalities into first-class citizens of the vectorial interpretation.
  arXiv  Detail & Related papers  (2020-04-08T17:25: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.