# Tree-Like Justification Systems are Consistent

arXiv: https://arxiv.org/abs/2208.03089 · HTML: https://mlsanity.com/paper/2208.03089/

## Key facts

- No citing papers in the map yet (data through 14 Oct 2026).
- Builds on 1 of its 14 references that are in the map.
- First posted on arXiv 5 Aug 2022.

## Builds on (most cited first, 1 of 1)

- [Exploiting Game Theory for Analysing Justifications](https://mlsanity.com/paper/2008.01609/) (2020)

## Abstract (arXiv)

Justification theory is an abstract unifying formalism that captures semantics of various non-monotonic logics. One intriguing problem that has received significant attention is the consistency problem: under which conditions are justifications for a fact and justifications for its negation suitably related. 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.