Deciding ATL* satisfiability by tableaux - Archive ouverte HAL Access content directly
Conference Papers Year : 2015

Deciding ATL* satisfiability by tableaux


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:// ATL star/.
Fichier principal
Vignette du fichier
David2015.pdf (431.6 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-01367780 , version 1 (12-05-2023)


Attribution - NonCommercial



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⟩
74 View
1 Download



Gmail Facebook Twitter LinkedIn More