2 papers
cs.LO2020
SAT-Based ATL Satisfiability Checking
Magdalena Kacprzak, Artur Niewiadomski, Wojciech Penczek
Synthesis of models and strategies is a very important problem in software engineering. The main element here is checking the satisfiability of formulae expressing the specificatio…
math.CO2019
Extremal Square-free Words
Jarosław Grytczuk, Hubert Kordulewski, Artur Niewiadomski
A word is \emph{square-free} if it does not contain non-empty factors of the form . In 1906 Thue proved that there exist arbitrarily long square-free words over -letter alph…