Deciding ATL* satisfiability by tableaux

Abstract : 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/.
Document type :
Conference papers
Complete list of metadatas

https://hal.archives-ouvertes.fr/hal-01367780
Contributor : Frédéric Davesne <>
Submitted on : Friday, September 16, 2016 - 4:19:23 PM
Last modification on : Monday, October 28, 2019 - 10:50:22 AM

Identifiers

Citation

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⟩

Share

Metrics

Record views

96