1 citations · 1 across the 3 of their papers we have counts for
4 papers
Tractable Combinations of Theories via Sampling
Manuel Bodirsky, Johannes Greiner
For a first-order theory , the Constraint Satisfaction Problem of is the computational problem of deciding whether a given conjunction of atomic formulas is satisfiable in s…
Tractable Combinations of Temporal CSPs
Manuel Bodirsky, Johannes Greiner, Jakub Rydval
The constraint satisfaction problem (CSP) of a first-order theory T is the computational problem of deciding whether a given conjunction of atomic formulas is satisfiable in some m…
The Complexity of Combinations of Qualitative Constraint Satisfaction Problems
Manuel Bodirsky, Johannes Greiner
The CSP of a first-order theory is the problem of deciding for a given finite set of atomic formulas whether is satisfiable. Let and be two theories…
Generating clones with conservative near-unanimity operation
Johannes Greiner
Due to the Baker-Pixley theorem we know that every clone over a finite domain containing a near-unanimity operation is finitely generated. Therefore there exists an integer…