11 citations · 39 across the 9 of their papers we have counts for
Showing cs.LOShow all
2 papers · 1 filter
cs.LO2023
Right-Adjoints for Datalog Programs, and Homomorphism Dualities over Restricted Classes
Balder ten Cate, Víctor Dalmau, Jakub Opršal
A Datalog program can be viewed as a syntactic specification of a functor from database instances over some schema to database instances over another schema. The same holds more ge…
cs.LO2019★ 5 cited
Topology is relevant (in a dichotomy conjecture for infinite-domain constraint satisfaction problems)
Manuel Bodirsky, Antoine Mottet, Miroslav Olšák +3
The algebraic dichotomy conjecture for Constraint Satisfaction Problems (CSPs) of reducts of (infinite) finitely bounded homogeneous structures states that such CSPs are polynomial…