Projects per year
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., 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.
Original language | English |
---|---|
Pages (from-to) | 641-657 |
Number of pages | 17 |
Journal | Theory and Practice of Logic Programming |
Volume | 22 |
Issue number | 5 |
DOIs | |
Publication status | Published - 11 Sept 2022 |
Event | 38th International Conference on Logic Programming - Haifa, Israel Duration: 31 Aug 2021 → 6 Sept 2022 Conference number: 38 https://software.imdea.org/Conferences/ICLP2022/ |
Bibliographical note
Funding Information:This research was supported by the Flemish Government in the “Onderzoeksprogramma ArtificiËle Intelligentie (AI) Vlaanderen” programme and by the FWO Flanders project G0B2221N.
Publisher Copyright:
© 2022 Cambridge University Press. All rights reserved.
Copyright:
Copyright 2022 Elsevier B.V., All rights reserved.
Fingerprint
Dive into the research topics of 'On Nested Justification Systems'. Together they form a unique fingerprint.-
VLAAI1: Flanders Artificial Intelligence Research program (FAIR) – second cycle
1/01/24 → 31/12/28
Project: Applied
-
FWOAL990: Approximation Fixpoint Theory as a General Algebraic Theory of Constructive Knowledge
1/01/21 → 31/12/24
Project: Fundamental