On Nested Justification Systems (full version)
Not on the map. Why?
Abstract (arXiv)
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).
Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). Builds on 4 of its 24 references that are in the map. First posted on arXiv 9 May 2022.
Builds on
4 of 24 references.
References · 4
- 2021Analyzing Semantics of Aggregate Answer Set Programming Using Approximation Fixpoint Theorycited by 6
- 2021Aggregate Semantics for Propositional Answer Set Programscited by 5
- 2020Exploiting Game Theory for Analysing Justificationscited by 2
- 2016Reactive Multi-Context Systems: Heterogeneous Reasoning in Dynamic Environmentscited by 1
Built on by
Citing papers per year: 2023: 1.
1 paper.
- 2023Explanations for Answer Set Programmingcited by 1
- 2023Explanations for Answer Set Programming30 Aug 2023