Tree-Like Justification Systems are Consistent

• URL: http://arxiv.org/abs/2208.03089v1
• Date: Fri, 5 Aug 2022 10:48:08 GMT
• Title: Tree-Like Justification Systems are Consistent
• Authors: Simon Marynissen (KU Leuven, Vrije Universiteit Brussel), Bart Bogaerts (Vrije Universiteit Brussel)
• Abstract summary: Two variants of justification theory exist: one in which justifications are trees and one in which they are graphs. In this work we resolve the consistency problem once and for all for the tree-like setting by showing that all reasonable tree-like justification systems are consistent.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Justification theory is an abstract unifying formalism that captures semantics of various non-monotonic logics. One intriguing problem that has received significant attention is the consistency problem: under which conditions are justifications for a fact and justifications for its negation suitably related. Two variants of justification theory exist: one in which justifications are trees and one in which they are graphs. In this work we resolve the consistency problem once and for all for the tree-like setting by showing that all reasonable tree-like justification systems are consistent.

Related papers

• Why do Random Forests Work? Understanding Tree Ensembles as Self-Regularizing Adaptive Smoothers [68.76846801719095]
  We argue that the current high-level dichotomy into bias- and variance-reduction prevalent in statistics is insufficient to understand tree ensembles. We show that forests can improve upon trees by three distinct mechanisms that are usually implicitly entangled.
  arXiv  Detail & Related papers  (2024-02-02T15:36:43Z)
• Normative Conditional Reasoning as a Fragment of HOL [0.0]
  We discuss the mechanization of (preference-based) conditional normative reasoning. Our focus is on Aqvist's system E for conditional obligation, and its extensions. We consider two possible uses of the framework.
  arXiv  Detail & Related papers  (2023-08-21T12:47:30Z)
• 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)
• NELLIE: A Neuro-Symbolic Inference Engine for Grounded, Compositional, and Explainable Reasoning [59.16962123636579]
  This paper proposes a new take on Prolog-based inference engines. We replace handcrafted rules with a combination of neural language modeling, guided generation, and semi dense retrieval. Our implementation, NELLIE, is the first system to demonstrate fully interpretable, end-to-end grounded QA.
  arXiv  Detail & Related papers  (2022-09-16T00:54:44Z)
• On Nested Justification Systems (full version) [13.76408511310322]
  Nested justification systems, first introduced by Denecker et al., allow for the composition of justification systems. We show in this paper that the original semantics for nested justification systems lead to the loss of information relevant for explanations. Furthermore, we show how nested justification systems allow representing fixpoint definitions.
  arXiv  Detail & Related papers  (2022-05-09T20:23:22Z)
• A natural deduction system for orthomodular logic [0.0]
  Orthomodular logic is a weakening of quantum logic in the sense of Birkhoff and von Neumann. It is shown to be a nonlinear noncommutative logic. It is extended to two systems of predicate logic: the first is sound for Takeuti's quantum set theory, and the second is sound for a variant of Weaver's quantum logic.
  arXiv  Detail & Related papers  (2021-09-11T22:28:17Z)
• Nested Counterfactual Identification from Arbitrary Surrogate Experiments [95.48089725859298]
  We study the identification of nested counterfactuals from an arbitrary combination of observations and experiments. Specifically, we prove the counterfactual unnesting theorem (CUT), which allows one to map arbitrary nested counterfactuals to unnested ones.
  arXiv  Detail & Related papers  (2021-07-07T12:51:04Z)
• A Description Logic for Analogical Reasoning [28.259681405091666]
  We present a mechanism to infer plausible missing knowledge, which relies on reasoning by analogy. This is the first paper that studies analog reasoning within the setting of description logic.
  arXiv  Detail & Related papers  (2021-05-10T19:06:07Z)
• A Weaker Faithfulness Assumption based on Triple Interactions [89.59955143854556]
  We propose a weaker assumption that we call $2$-adjacency faithfulness. We propose a sound orientation rule for causal discovery that applies under weaker assumptions.
  arXiv  Detail & Related papers  (2020-10-27T13:04:08Z)
• Exploiting Game Theory for Analysing Justifications [13.72913891724593]
  We continue the study of justification theory by means of three major contributions. The first is studying the relation between justification theory and game theory. The second contribution is studying under which condition two different dialects of justification theory coincide. The third contribution is establishing a precise criterion of when a semantics induced by justification theory yields consistent results.
  arXiv  Detail & Related papers  (2020-08-04T14:45:08Z)
• Aligning Faithful Interpretations with their Social Attribution [58.13152510843004]
  We find that the requirement of model interpretations to be faithful is vague and incomplete. We identify that the problem is a misalignment between the causal chain of decisions (causal attribution) and the attribution of human behavior to the interpretation (social attribution)
  arXiv  Detail & Related papers  (2020-06-01T16:45:38Z)

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.