Exploiting Game Theory for Analysing Justifications

DOI10.1017/S1471068420000186zbMath1468.68214arXiv2008.01609OpenAlexW3102779922MaRDI QIDQ5140022

Simon Marynissen, Bart Bogaerts, Marc Denecker

Publication date: 13 December 2020

Published in: Theory and Practice of Logic Programming (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2008.01609

zbMATH Keywords

nonmonotonic logiclogic programmingpositional gamesjustification theory

Mathematics Subject Classification ID

Applications of game theory (91A80) Other nonclassical logic (03B60) Logic in artificial intelligence (68T27) Logic programming (68N17) Positional games (pursuit and evasion, etc.) (91A24)

Related Items (2)

On Nested Justification Systems ⋮ Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Improving parity game solvers with justifications
• Borel determinacy
• On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and \(n\)-person games
• Explanation in artificial intelligence: insights from the social sciences
• An infinite-game semantics for well-founded negation in logic programming
• A Formal Theory of Justifications
• Quantitative deduction and its fixpoint theory
• The well-founded semantics for general logic programs
• On the Implementation of Weight Constraint Rules in Conflict-Driven ASP Solvers
• Game characterizations of logic program properties
• Mathematical Foundations of Computer Science 2004
• CONCUR 2005 – Concurrency Theory

This page was built for publication: Exploiting Game Theory for Analysing Justifications