1 citations · 1 across the 3 of their papers we have counts for
Showing 2020Show all
2 papers · 1 filter
math.LO2020
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…
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…