2 citations · 3 across the 7 of their papers we have counts for
Showing 2020Show all
2 papers · 1 filter
math.LO2020★ 1 cited
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…
math.LO2020
On the Descriptive Complexity of Temporal Constraint Satisfaction Problems
Manuel Bodirsky, Jakub Rydval
Finite-domain constraint satisfaction problems are either solvable by Datalog, or not even expressible in fixed-point logic with counting. The border between the two regimes coinci…