Author of the publication

Satisfiability in Strategy Logic Can Be Easier than Model Checking.

, , and . AAAI, page 2638-2645. AAAI Press, (2019)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

Reasoning About Strategies: On the Model-Checking Problem, , , and . CoRR, (2011)Relentful Strategic Reasoning in Alternating-Time Temporal Logic., , and . LPAR (Dakar), volume 6355 of Lecture Notes in Computer Science, page 371-386. Springer, (2010)Preface to the Special Issue on SR 2014., , and . Inf. Comput., (2017)SHACL Satisfiability and Containment., , , and . ISWC (1), volume 12506 of Lecture Notes in Computer Science, page 474-493. Springer, (2020)Attacking Diophantus: Solving a Special Case of Bag Containment., and . PODS, page 399-413. ACM, (2019)Reformulating Queries: Theory and Practice., , , and . IJCAI, page 837-843. ijcai.org, (2017)Synthesis of Hierarchical Systems., , and . FACS, volume 7253 of Lecture Notes in Computer Science, page 42-60. Springer, (2011)On Promptness in Parity Games., , and . Fundam. Informaticae, 139 (3): 277-305 (2015)Relentful strategic reasoning in alternating-time temporal logic., , and . J. Log. Comput., 26 (5): 1663-1695 (2016)Taming Strategy Logic: Non-Recurrent Fragments., , and . TIME, volume 247 of LIPIcs, page 14:1-14:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)