On Nested Justification Systems (full version)

by   Simon Marynissen, et al.

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).


page 1

page 2

page 3

page 4


On expressive rule-based logics

We investigate a family of rule-based logics. The focus is on very expre...

On the Axiomatisability of Parallel Composition

This paper studies the existence of finite equational axiomatisations of...

Proof systems: from nestings to sequents and back

In this work, we explore proof theoretical connections between sequent, ...

Rule Formats for Nominal Process Calculi

The nominal transition systems (NTSs) of Parrow et al. describe the oper...

Revisiting Semiring Provenance for Datalog

Data provenance consists in bookkeeping meta information during query ev...

Commutators for Stochastic Rewriting Systems: Theory and Implementation in Z3

In the semantics of stochastic rewriting systems (SRSs) based on rule al...

Contextual Abductive Reasoning with Side-Effects

The belief bias effect is a phenomenon which occurs when we think that w...