Tree-like justification systems are consistent

MaRDI QIDQ6182223zbMATH OpenFDO

Authors Simon Marynissen, Bart Bogaerts

Publication date 23 January 2024

Full work available at URL https://arxiv.org/abs/2208.03089, https://cgi.cse.unsw.edu.au/~eptcs/paper.cgi?ICLP2022.1

Mathematics Subject Classification ID

Other nonclassical logic (03B60) Logic programming (68N17)

Recommendations

• A formal theory of justifications
• Exploiting Game Theory for Analysing Justifications
• On Nested Justification Systems
• Consistency in assumption-based argumentation
• Impossible and conflicting obligations in justification logic

Cites work

• \(FO(FD)\): extending classical logic with rule-based fixpoint definitions
• A formal theory of justifications
• CONCUR 2005 – Concurrency Theory
• Exploiting Game Theory for Analysing Justifications
• Improving parity game solvers with justifications
• On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and n-person games
• The well-founded semantics for general logic programs

Cited in

(2)

• On Nested Justification Systems
• Embedding justification theory in approximation fixpoint theory

This page was built for publication: Tree-like justification systems are consistent

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6182223)