Exploiting Game Theory for Analysing Justifications

DOI10.1017/S1471068420000186MaRDI QIDQ5140022zbMATH OpenOpenAlexFDO

Authors 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

positional gameslogic programmingnonmonotonic logicjustification theory

Mathematics Subject Classification ID

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

Abstract: Justification theory is a unifying semantic framework. While it has its roots in non-monotonic logics, it can be applied to various areas in computer science, especially in explainable reasoning; its most central concept is a justification: an explanation why a property holds (or does not hold) in a model. In this paper, we continue the study of justification theory by means of three major contributions. The first is studying the relation between justification theory and game theory. We show that justification frameworks can be seen as a special type of games. The established connection provides the theoretical foundations for our next two contributions. The second contribution is studying under which condition two different dialects of justification theory (graphs as explanations vs trees as explanations) coincide. The third contribution is establishing a precise criterion of when a semantics induced by justification theory yields consistent results. In the past proving that such semantics were consistent took cumbersome and elaborate proofs. We show that these criteria are indeed satisfied for all common semantics of logic programming. This paper is under consideration for acceptance in Theory and Practice of Logic Programming (TPLP).

Recommendations

• On the concepts of rationalizability in games
• On the use (and abuse) of logic in game theory
• Equilibrium in Justifiable Strategies: A Model of Reason-based Choice in Extensive-form Games
• A game-theoretic logic of norms and actions
• Reasoning about coalitional games
• scientific article; zbMATH DE number 1453155
• On rationalizability in extensive games
• scientific article; zbMATH DE number 437512
• Explaining games. The epistemic programme in game theory
• Rationalizability in multicriteria games

Cites work

• scientific article; zbMATH DE number 1696767 (Why is no real title available?)
• A formal theory of justifications
• An infinite-game semantics for well-founded negation in logic programming
• Approximations, stable operators, well-founded fixpoints and applications in nonmonotonic reasoning
• Borel determinacy
• CONCUR 2005 – Concurrency Theory
• Explanation in artificial intelligence: insights from the social sciences
• Game characterizations of logic program properties
• Improving parity game solvers with justifications
• Mathematical Foundations of Computer Science 2004
• On the Implementation of Weight Constraint Rules in Conflict-Driven ASP Solvers
• On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and n-person games
• Quantitative deduction and its fixpoint theory
• The well-founded semantics for general logic programs

Cited in

(7)

• Embedding justification theory in approximation fixpoint theory
• scientific article; zbMATH DE number 3966013 (Why is no real title available?)
• Handling threats, rewards, and explanatory arguments in a unified setting
• On Nested Justification Systems
• Game justification of the rule of self-consistent choice
• Tree-like justification systems are consistent
• A formal theory of justifications

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

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