Reasoning with belief functions over Belnap-Dunn logic
From MaRDI portal
Publication:6560993
DOI10.1016/J.APAL.2023.103338MaRDI QIDQ6560993
Daniil Kozhemiachenko, Sabine Frittella, Marta Bílková, Ondrej Majer, Sajad Nazari
Publication date: 24 June 2024
Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)
Fuzzy logic; logic of vagueness (03B52) Logics of knowledge and belief (including belief change) (03B42) Probability and inductive logic (03B48) Paraconsistent logics (03B53)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Belief functions on distributive lattices
- Generalizing functional completeness in Belnap-Dunn logic
- Constructive negations and paraconsistency
- On the Dempster-Shafer framework and new combination rules
- Fuzzy sets as a basis for a theory of possibility
- Notes on \(\eta\)-lattices and constructive logic with strong negation
- Metamathematics of fuzzy logic
- 40 years of FDE: an introductory overview
- Intuitive semantics for first-degree entailments and `coupled trees'
- A logic for reasoning about probabilities
- Nothing but the truth
- Contradictory information: too much of a good thing
- Belief based on inconsistent information
- An epistemic probabilistic logic with conditional probabilities
- Constraint tableaux for two-dimensional fuzzy logics
- Toward a Dempster-Shafer theory of concepts
- Probabilities with gaps and gluts
- On the theory of inconsistent formal systems
- Complexity of fuzzy probability logics
- Paraconsistent probability theory and paraconsistent Bayesianism
- Monotone functions on finite lattices: An ordinal approach to capacities, belief and necessity functions
- Handbook of mathematical fuzzy logic. Volume 1
- Modal Logics of Uncertainty with Two-Layer Syntax: A General Completeness Theorem
- How a Computer Should Think
- Belief functions on lattices
- Constructive negation, implication, and co-implication
- On Ignorance and Contradiction Considered as Truth-Values
- Upper and Lower Probabilities Induced by a Multivalued Mapping
- Constructible falsity
This page was built for publication: Reasoning with belief functions over Belnap-Dunn logic
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6560993)
