On Nested Justification Systems (full version)

• URL: http://arxiv.org/abs/2205.04541v1
• Date: Mon, 9 May 2022 20:23:22 GMT
• Title: On Nested Justification Systems (full version)
• Authors: Simon Marynissen, Jesse Heyninck, Bart Bogaerts, Marc Denecker
• Abstract summary: 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.
• Score: 13.76408511310322
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Justification theory is a general framework for the definition of semantics of rule-based languages that has a high explanatory potential. Nested justification systems, first introduced by Denecker et al. (2015), allow for the composition of justification systems. This notion of nesting thus enables the modular definition of semantics of rule-based languages, and increases the representational capacities of justification theory. As we show in this paper, the original semantics for nested justification systems lead to the loss of information relevant for explanations. In view of this problem, we provide an alternative characterization of semantics of nested justification systems and show that this characterization is equivalent to the original semantics. Furthermore, we show how nested justification systems allow representing fixpoint definitions (Hou and Denecker 2009).

Related papers

• 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)
• Inferentialist Resource Semantics [48.65926948745294]
  In systems modelling, a system typically comprises located resources relative to which processes execute. This paper shows how inferentialism enables a versatile and expressive framework for resource semantics.
  arXiv  Detail & Related papers  (2024-02-14T14:54:36Z)
• 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)
• Tree-Like Justification Systems are Consistent [0.0]
  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.
  arXiv  Detail & Related papers  (2022-08-05T10:48:08Z)
• 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)
• Provable Limitations of Acquiring Meaning from Ungrounded Form: What will Future Language Models Understand? [87.20342701232869]
  We investigate the abilities of ungrounded systems to acquire meaning. We study whether assertions enable a system to emulate representations preserving semantic relations like equivalence. We find that assertions enable semantic emulation if all expressions in the language are referentially transparent. However, if the language uses non-transparent patterns like variable binding, we show that emulation can become an uncomputable problem.
  arXiv  Detail & Related papers  (2021-04-22T01:00:17Z)
• Hierarchical Poset Decoding for Compositional Generalization in Language [52.13611501363484]
  We formalize human language understanding as a structured prediction task where the output is a partially ordered set (poset) Current encoder-decoder architectures do not take the poset structure of semantics into account properly. We propose a novel hierarchical poset decoding paradigm for compositional generalization in language.
  arXiv  Detail & Related papers  (2020-10-15T14:34:26Z)
• On a plausible concept-wise multipreference semantics and its relations with self-organising maps [0.0]
  We argue that this proposal satisfies some desired properties, such as KLM, and avoids the drowning problem. We motivate the plausibility of the concept-wise multi-preference semantics by developing a logical semantics of self-organising maps.
  arXiv  Detail & Related papers  (2020-08-30T21:06:06Z)
• 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)

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.