3 citations · 4 across the 5 of their papers we have counts for
Showing cs.LOShow all
2 papers · 1 filter
cs.LO2017
Lazy Automata Techniques for WS1S
Tomáš Fiedor, Lukáš Holík, Petr Janků +2
We present a new decision procedure for the logic WS1S. It originates from the classical approach, which first builds an automaton accepting all models of a formula and then tests…
cs.LO2015★ 3 cited
Nested Antichains for WS1S
Tomas Fiedor, Lukas Holik, Ondrej Lengal +1
We propose a novel approach for coping with alternating quantification as the main source of nonelementary complexity of deciding WS1S formulae. Our approach is applicable within t…