Presumptive Reasoning in a Paraconsistent Setting
From MaRDI portal
Publication:6199612
DOI10.4204/eptcs.379.19arXiv2303.15276OpenAlexW4383618553MaRDI QIDQ6199612
Daniil Kozhemiachenko, Bart Verheij, Sabine Frittella
Publication date: 28 February 2024
Published in: Electronic Proceedings in Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2303.15276
Cites Work
- Unnamed Item
- Unnamed Item
- Generalizing functional completeness in Belnap-Dunn logic
- Metamathematics of fuzzy logic
- An abstract, argumentation-theoretic approach to default reasoning
- 40 years of FDE: an introductory overview
- Intuitive semantics for first-degree entailments and `coupled trees'
- On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and \(n\)-person games
- Contradictory information: too much of a good thing
- Belief based on inconsistent information
- Probabilities with gaps and gluts
- How a Computer Should Think
- Axiomatization of qualitative belief structure
- Defeasible logic programming: an argumentative approach
- An expansion of first-order Belnap-Dunn logic
- Intuitive Probability on Finite Sets
- Measurement Theory
- A logic-based theory of deductive arguments
- Measuring evidence: a probabilistic approach to an extension of Belnap-Dunn logic
- Qualitative reasoning in a two-layered framework
This page was built for publication: Presumptive Reasoning in a Paraconsistent Setting
