Optimal tableaux-based decision procedure for testing satisfiability in the alternating-time temporal logic ATL+

Serenella Cerrito 1 Amélie David 1 Valentin Goranko 2, 3
1 IBISC - Informatique, Biologie Intégrative et Systèmes Complexes
2 Department of Applied Mathematics and Computer Science
3 UJ - University of Johannesburg
Abstract : We develop a sound, complete and practically implementable tableaux-based decision method for constructive satisfiability testing and model synthesis in the fragment ATL+ of the full Alternating time temporal logic ATL*. The method extends in an essential way a previously developed tableaux-based decision method for ATL and works in 2EXPTIME, which is the optimal worst case complexity of the satisfiability problem for ATL +. We also discuss how suitable parameterizations and syntactic restrictions on the class of input ATLP formulae can reduce the complexity of the satisfiability problem.
Document type :
Conference papers
Complete list of metadatas
https://hal.archives-ouvertes.fr/hal-01054932
Contributor : Frédéric Davesne <>
Submitted on : Sunday, August 10, 2014 - 1:26:39 PM
Last modification on : Monday, October 28, 2019 - 11:00:24 AM

Identifiers

Collections

IBISC | IBISC-COSMO | UNIV-EVRY

Citation

Serenella Cerrito, Amélie David, Valentin Goranko. Optimal tableaux-based decision procedure for testing satisfiability in the alternating-time temporal logic ATL+. 7th International Joint Conference on Automated Reasoning (IJCAR 2014), Jul 2014, Vienna, Austria. pp.277--291, ⟨10.1007/978-3-319-08587-6-21⟩. ⟨hal-01054932⟩

Export

BibTeX TEI DC DCterms EndNote

Share

Metrics

Record views

94

Contact

Informations

CCSD