Satisfiability Checking of Strategy Logic with Simple Goals
Keyword(s):
In this paper, we introduce a new method of the satisfiability (SAT) checking for Simple-Goal Strategy Logic (SL[SG]), using symbolic Boolean model encoding and the SAT Modulo Monotonic Theories techniques, which was implemented into the tool SGSAT. To the best of our knowledge, this is the only tool solving the SAT problem for SL[SG]. Its applications include process synthesis, developing controllers as well as automatic planners in multi-agent scenarios.
Keyword(s):
2014 ◽
Vol 7
(19)
◽
pp. 4008-4017
Keyword(s):
2017 ◽
Vol 21
(5)
◽
pp. 930-938
◽
2020 ◽
Vol 11
(1)
◽
pp. 23-41
2019 ◽
Keyword(s):
Keyword(s):
2016 ◽
Vol 13
(2)
◽
pp. 1369-1375
Keyword(s):