An elementary belief function logic
- URL: http://arxiv.org/abs/2303.13168v1
- Date: Thu, 23 Mar 2023 10:39:18 GMT
- Title: An elementary belief function logic
- Authors: Didier Dubois, Lluis Godo, Henri Prade
- Abstract summary: duality between possibility and necessity measures, belief and plausibility functions and imprecise probabilities share a common feature with modal logic.
This paper shows that a simpler belief function logic can be devised by adding Lukasiewicz logic on top of MEL.
- Score: 6.091096843566857
- License: http://creativecommons.org/licenses/by/4.0/
- Abstract: Non-additive uncertainty theories, typically possibility theory, belief
functions and imprecise probabilities share a common feature with modal logic:
the duality properties between possibility and necessity measures, belief and
plausibility functions as well as between upper and lower probabilities extend
the duality between possibility and necessity modalities to the graded
environment. It has been shown that the all-or-nothing version of possibility
theory can be exactly captured by a minimal epistemic logic (MEL) that uses a
very small fragment of the KD modal logic, without resorting to relational
semantics. Besides, the case of belief functions has been studied
independently, and a belief function logic has been obtained by extending the
modal logic S5 to graded modalities using {\L}ukasiewicz logic, albeit using
relational semantics. This paper shows that a simpler belief function logic can
be devised by adding {\L}ukasiewicz logic on top of MEL. It allows for a more
natural semantics in terms of Shafer basic probability assignments.
Related papers
- 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) - A Simple Generative Model of Logical Reasoning and Statistical Learning [0.6853165736531939]
Statistical learning and logical reasoning are two major fields of AI expected to be unified for human-like machine intelligence.
We here propose a simple Bayesian model of logical reasoning and statistical learning.
We simply model how data causes symbolic knowledge in terms of its satisfiability in formal logic.
arXiv Detail & Related papers (2023-05-18T16:34:51Z) - MetaLogic: Logical Reasoning Explanations with Fine-Grained Structure [129.8481568648651]
We propose a benchmark to investigate models' logical reasoning capabilities in complex real-life scenarios.
Based on the multi-hop chain of reasoning, the explanation form includes three main components.
We evaluate the current best models' performance on this new explanation form.
arXiv Detail & Related papers (2022-10-22T16:01:13Z) - Discourse-Aware Graph Networks for Textual Logical Reasoning [142.0097357999134]
Passage-level logical relations represent entailment or contradiction between propositional units (e.g., a concluding sentence)
We propose logic structural-constraint modeling to solve the logical reasoning QA and introduce discourse-aware graph networks (DAGNs)
The networks first construct logic graphs leveraging in-line discourse connectives and generic logic theories, then learn logic representations by end-to-end evolving the logic relations with an edge-reasoning mechanism and updating the graph features.
arXiv Detail & Related papers (2022-07-04T14:38:49Z) - Transfinite Modal Logic: a Semi-quantitative Explanation for Bayesian
Reasoning [1.6916260027701393]
We introduce transfinite modal logic, which combines modal logic with ordinal arithmetic.
We suggest that transfinite modal logic captures the essence of Bayesian reasoning in a rather clear and simple form.
arXiv Detail & Related papers (2022-04-02T17:58:14Z) - 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) - Uncertain Linear Logic via Fibring of Probabilistic and Fuzzy Logic [0.0]
probabilistic and fuzzy logic correspond to two different assumptions regarding the combination of propositions whose evidence bases are not currently available.
It is shown that these two sets of formulas provide a natural grounding for the multiplicative and additive operator-sets in linear logic.
The concept of linear logic as a logic of resources" is manifested here via the principle of conservation of evidence"
arXiv Detail & Related papers (2020-09-28T00:19:42Z) - Foundations of Reasoning with Uncertainty via Real-valued Logics [70.43924776071616]
We give a sound and strongly complete axiomatization that can be parametrized to cover essentially every real-valued logic.
Our class of sentences are very rich, and each describes a set of possible real values for a collection of formulas of the real-valued logic.
arXiv Detail & Related papers (2020-08-06T02:13:11Z) - 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.