1 citations · 1 across the 3 of their papers we have counts for
5 papers
The Complexity of Resilience for Digraph Queries
Manuel Bodirsky, Žaneta Semanišinová
We prove a complexity dichotomy for the resilience problem for unions of conjunctive digraph queries (i.e., for existential positive sentences over the signature of directe…
Identifying Tractable Quantified Temporal Constraints within Ord-Horn
Jakub Rydval, Žaneta Semanišinová, Michał Wrona
The constraint satisfaction problem, parameterized by a relational structure, provides a general framework for expressing computational decision problems. Already the restriction t…
The Complexity of Resilience Problems via Valued Constraint Satisfaction
Manuel Bodirsky, Žaneta Semanišinová, Carsten Lutz
Valued constraint satisfaction problems (VCSPs) constitute a large class of computational optimization problems. It was shown recently that, over finite domains, every VCSP is in P…
Complexity Classification Transfer for CSPs via Algebraic Products
Manuel Bodirsky, Peter Jonsson, Barnaby Martin +2
We study the complexity of infinite-domain constraint satisfaction problems: our basic setting is that a complexity classification for the CSPs of first-order expansions of a struc…
Three concepts of nilpotence in loops
Žaneta Semanišinová, David Stanovský
We introduce the abstract concept of supernilpotence in loop theory, and relate it to existing concepts, namely, central nilpotence and nilpotence of the multiplication group. We p…