2 papers
cs.LO2019
On the Power of Symmetric Linear Programs
Albert Atserias, Anuj Dawar, Joanna Ochremiak
We consider families of symmetric linear programs (LPs) that decide a property of graphs (or other relational structures) in the sense that, for each size of graph, there is an LP…
cs.LO2015
Eliminating Recursion from Monadic Datalog Programs on Trees
Filip Mazowiecki, Joanna Ochremiak, Adam Witkowski
We study the problem of eliminating recursion from monadic datalog programs on trees with an infinite set of labels. We show that the boundedness problem, i.e., determining whether…