MsATL: a Tool for SAT-Based ATL Satisfiability Checking

Artur Niewiadomski, Magdalena Kacprzak, Damian Kurpiewski, Michał Knapik, Wojciech Penczek +1 more
10/25/2023
cs.LOcs.MA

No confident code implementation found for this paper.

Abstract

We present MsATL: the first tool for deciding the satisfiability of Alternating-time Temporal Logic (ATL) with imperfect information. MsATL combines SAT Modulo Monotonic Theories solvers with existing ATL model checkers: MCMAS and STV. The tool can deal with various semantics of ATL, including perfect and imperfect information, and can handle additional practical requirements. MsATL can be applied for synthesis of games that conform to a given specification, with the synthesised game often being minimal.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. Any repos shown below are weak matches — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Cite this paper

@article{niewiadomski2023msatl,
  title  = {MsATL: a Tool for SAT-Based ATL Satisfiability Checking},
  author = {Artur Niewiadomski and Magdalena Kacprzak and Damian Kurpiewski and Michał Knapik and Wojciech Penczek and Wojciech Jamroga},
  year   = {2023},
  eprint = {2310.16519},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2310.16519v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2310.16519.svg)](https://codeofpaper.com/paper/2310.16519)

Discussion