The Ceteris Paribus Structure of Logics of Game Forms (Extended Abstract)

The Ceteris Paribus Structure of Logics of Game Forms (Extended Abstract)

Davide Grossi, Emiliano Lorini, Fran├žois Schwarzentruber

Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence
Journal track. Pages 5000-5004. https://doi.org/10.24963/ijcai.2017/710

We present a simple Ceteris Paribus Logic (CP) and study its relationship with existing logics that deal with the representation of choice and power in games in normal form including atemporal STIT, Coalition Logic of Propositional Control (CL-PC) and Dynamic Logic of Propositional Assignments (DL-PA). Thanks to the polynomial reduction of the satisfiability problem for atemporal STIT in the satisfiability problem for CP, we obtain a complexity result for the latter problem.
Keywords:
Knowledge Representation, Reasoning, and Logic: Game Theory
Knowledge Representation, Reasoning, and Logic: Logics for Knowledge Representation