Ordered Resolution for Coalition Logic

In this paper we introduce a calculus based on ordered resolution for Coalition Logic CL, improving our previous approach based on unrefined resolution, and discuss the problems associated with imposing an ordering refinement in the context of CL. The calculus operates on 'coalition problems', a normal form for CL where we use coalition vectors that can represent choices made by agents explicitly, and the inference rules of the calculus provide the basis for a decision procedure for the satisfiability problem in CL. We give correctness, termination and complexity results for our calculus. We also present experimental results for an implementation of the calculus and show that it outperforms a tableau-based decision procedure for Alternating-Time Temporal Logici?źCL on two classes of benchmark formulae for CL.

[1]  Amélie David TATL: Implementation of ATL Tableau-Based Decision Procedure , 2013, TABLEAUX.

[2]  Stefano Borgo,et al.  Coalitions in Action Logic , 2007, IJCAI.

[3]  Thomas A. Henzinger,et al.  Alternating-time temporal logic , 1999 .

[4]  Michael Wooldridge,et al.  ATL Satisfiability is Indeed EXPTIME-complete , 2006, J. Log. Comput..

[5]  U. Hustadt,et al.  TRP + + : A temporal resolution prover ⋆ , 2002 .

[6]  Christoph Weidenbach,et al.  SPASS Version 3.5 , 2009, CADE.

[7]  Robert A. Kowalski,et al.  Semantic Trees in Automatic Theorem-Proving , 1983 .

[8]  V. Goranko Coalition games and alternating temporal logics , 2001 .

[9]  Charisma Lee A completeness theorem and a computer program for finding theorems derivable from given axioms , 1967 .

[10]  Krishnendu Chatterjee,et al.  Finitary winning in ω-regular games , 2009, TOCL.

[11]  Maarten de Rijke,et al.  Tree-based Heuristics in Modal Theorem Proving , 2000, ECAI.

[12]  Clare Dixon,et al.  A Refined Resolution Calculus for CTL , 2009, CADE.

[13]  Stephan Schulz,et al.  Simple and Efficient Clause Subsumption with Feature Vector Indexing , 2013, Automated Reasoning and Mathematics.

[14]  Helle Hvid Hansen,et al.  Tableau Games for Coalition Logic and Alternating-time Temporal Logic — theory and implementation , 2022 .

[15]  Clare Dixon,et al.  A resolution calculus for the branching-time temporal logic CTL , 2014, ACM Trans. Comput. Log..

[16]  David A. Plaisted,et al.  A Structure-Preserving Clause Form Translation , 1986, J. Symb. Comput..

[17]  Ian Horrocks,et al.  Computational modal logic , 2007, Handbook of Modal Logic.

[18]  Michael Wooldridge,et al.  Alternating-time temporal logic with explicit strategies , 2007, TARK '07.

[19]  Daniel Gorín,et al.  Resolution with Order and Selection for Hybrid Logics , 2010, Journal of Automated Reasoning.

[20]  Marc Pauly,et al.  A Modal Logic for Coalitional Power in Games , 2002, J. Log. Comput..

[21]  G. van Drimmelen Satisfiability in alternating-time temporal logic , 2003, 18th Annual IEEE Symposium of Logic in Computer Science, 2003. Proceedings..

[22]  Valentin Goranko,et al.  Complete axiomatization and decidability of Alternating-time temporal logic , 2006, Theor. Comput. Sci..

[23]  Marc Pauly,et al.  Logic for social software , 2000 .

[24]  Valentin Goranko,et al.  Optimal Tableaux-Based Decision Procedure for Testing Satisfiability in the Alternating-Time Temporal Logic ATL+ , 2014, IJCAR.

[25]  Clare Dixon,et al.  A Resolution Prover for Coalition Logic , 2014, SR.

[26]  Pierre Wolper,et al.  The tableau method for temporal logic: an overview , 1985 .

[27]  Stephan Schulz,et al.  System Description: E 1.8 , 2013, LPAR.

[28]  J. A. Robinson,et al.  A Machine-Oriented Logic Based on the Resolution Principle , 1965, JACM.

[29]  Clare Dixon,et al.  A resolution-based calculus for Coalition Logic , 2014, J. Log. Comput..

[30]  Harald Ganzinger,et al.  Resolution Theorem Proving , 2001, Handbook of Automated Reasoning.

[31]  Andrei Voronkov,et al.  First-Order Theorem Proving and Vampire , 2013, CAV.

[32]  Valentin Goranko,et al.  Tableau-based decision procedures for logics of strategic ability in multiagent systems , 2008, TOCL.