Deciding ATL* satisfiability by tableaux

Amélie David (1)

1 IBISC - Informatique, Biologie Intégrative et Systèmes Complexes

We propose a tableau-based decision procedure for the full Alternating-time Temporal Logic ATL∗. We extend our procedure for ATL+ in order to deal with nesting of temporal operators. As a side effect, we obtain a new and conceptually simple tableau method for CTL∗. The worst case complexity of our procedure is 3EXPTIME, which is suboptimal compared to the 2EXPTIME complexity of the problem. However our method is human-readable and easily implementable. A web application and binaries for our procedure are available at http:// atila.ibisc.univ-evry.fr/tableau ATL star/.

Mots clés: Alternating-time temporal logic; ATL∗; Automated theorem prover; Satisfiability; Tableaux

Domaines: Logique en informatique [cs.LO]

Amélie David. Deciding ATL* satisfiability by tableaux. 25th International Conference on Automated Deduction (CADE 2015), Aug 2015, Berlin, Germany. pp.214--228, ⟨10.1007/978-3-319-21401-6_14⟩. ⟨hal-01367780⟩