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., 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 characterization of semantics for nested justification systems leads to the loss of information relevant for explanations. In view of this problem, we provide an alternative characterization of their semantics and show that it is equivalent to the original one. Furthermore, we show how nested justification systems allow representing fixpoint definitions.
|Number of pages||17|
|Journal||Theory and Practice of Logic Programming|
|Publication status||Published - Sept 2022|
|Event||38th International Conference on Logic Programming - Haifa, Israel|
Duration: 31 Jul 2022 → 6 Aug 2022