An Algebraic Notion of Conditional Independence, and Its Application to Knowledge Representation (full version)

• URL: http://arxiv.org/abs/2412.13712v1
• Date: Wed, 18 Dec 2024 10:52:57 GMT
• Title: An Algebraic Notion of Conditional Independence, and Its Application to Knowledge Representation (full version)
• Authors: Jesse Heyninck,
• Abstract summary: The notion of conditional independence is studied in the framework of approximation fixpoint theory. This gives a language-independent account of conditional independence that can be straightforwardly applied to any logic with fixpoint semantics.
• Score: 6.983702226751596
• License:
• Abstract: Conditional independence is a crucial concept supporting adequate modelling and efficient reasoning in probabilistics. In knowledge representation, the idea of conditional independence has also been introduced for specific formalisms, such as propositional logic and belief revision. In this paper, the notion of conditional independence is studied in the algebraic framework of approximation fixpoint theory. This gives a language-independent account of conditional independence that can be straightforwardly applied to any logic with fixpoint semantics. It is shown how this notion allows to reduce global reasoning to parallel instances of local reasoning, leading to fixed-parameter tractability results. Furthermore, relations to existing notions of conditional independence are discussed and the framework is applied to normal logic programming.

Related papers

• The Foundations of Tokenization: Statistical and Computational Concerns [51.370165245628975]
  Tokenization is a critical step in the NLP pipeline. Despite its recognized importance as a standard representation method in NLP, the theoretical underpinnings of tokenization are not yet fully understood. The present paper contributes to addressing this theoretical gap by proposing a unified formal framework for representing and analyzing tokenizer models.
  arXiv  Detail & Related papers  (2024-07-16T11:12:28Z)
• 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)
• Uncovering Meanings of Embeddings via Partial Orthogonality [29.190972879474526]
  Machine learning tools often rely on embedding text as vectors of real numbers. We study how the semantic structure of language is encoded in the algebraic structure of such embeddings.
  arXiv  Detail & Related papers  (2023-10-26T17:34:32Z)
• On the Independencies Hidden in the Structure of a Probabilistic Logic Program [0.0]
  We compute conditional independencies from d-separation in acyclic ground logic programs. We present a correct meta-interpreter that decides whether a certain conditional independence statement is implied by a program structure.
  arXiv  Detail & Related papers  (2023-08-30T08:55:55Z)
• Generative Logic with Time: Beyond Logical Consistency and Statistical Possibility [0.6853165736531939]
  We propose a temporal probabilistic model that generates symbolic knowledge from data. The correctness of the model is justified in terms of consistency with Kolmogorov's axioms, Fenstad's theorems and maximum likelihood estimation.
  arXiv  Detail & Related papers  (2023-01-20T10:55:49Z)
• Logical Satisfiability of Counterfactuals for Faithful Explanations in NLI [60.142926537264714]
  We introduce the methodology of Faithfulness-through-Counterfactuals. It generates a counterfactual hypothesis based on the logical predicates expressed in the explanation. It then evaluates if the model's prediction on the counterfactual is consistent with that expressed logic.
  arXiv  Detail & Related papers  (2022-05-25T03:40:59Z)
• Logical Credal Networks [87.25387518070411]
  This paper introduces Logical Credal Networks, an expressive probabilistic logic that generalizes many prior models that combine logic and probability. We investigate its performance on maximum a posteriori inference tasks, including solving Mastermind games with uncertainty and detecting credit card fraud.
  arXiv  Detail & Related papers  (2021-09-25T00:00:47Z)
• Transitional Conditional Independence [0.0]
  We introduce transition probability spaces and transitional random variables. These constructions will generalize, strengthen and previous notions of (conditional) random variables and non-stochastic variables.
  arXiv  Detail & Related papers  (2021-04-23T11:52:15Z)
• Measuring Association Between Labels and Free-Text Rationales [60.58672852655487]
  In interpretable NLP, we require faithful rationales that reflect the model's decision-making process for an explained instance. We demonstrate that pipelines, existing models for faithful extractive rationalization on information-extraction style tasks, do not extend as reliably to "reasoning" tasks requiring free-text rationales. We turn to models that jointly predict and rationalize, a class of widely used high-performance models for free-text rationalization whose faithfulness is not yet established.
  arXiv  Detail & Related papers  (2020-10-24T03:40:56Z)
• Logical Neural Networks [51.46602187496816]
  We propose a novel framework seamlessly providing key properties of both neural nets (learning) and symbolic logic (knowledge and reasoning) Every neuron has a meaning as a component of a formula in a weighted real-valued logic, yielding a highly intepretable disentangled representation. Inference is omni rather than focused on predefined target variables, and corresponds to logical reasoning.
  arXiv  Detail & Related papers  (2020-06-23T16:55:45Z)

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.