72 citations · 368 across the 79 of their papers we have counts for
4 papers · 1 filter
The reducts of equality up to primitive positive interdefinability
Manuel Bodirsky, Hubie Chen, Michael Pinsker
We initiate the study of reducts of relational structures up to primitive positive interdefinability: After providing the tools for such a study, we apply these tools in order to o…
Datalog and Constraint Satisfaction with Infinite Templates
Manuel Bodirsky, Victor Dalmau
On finite structures, there is a well-known connection between the expressive power of Datalog, finite variable logics, the existential pebble game, and bounded hypertree duality.…
Peek Arc Consistency
Manuel Bodirsky, Hubie Chen
This paper studies peek arc consistency, a reasoning technique that extends the well-known arc consistency technique for constraint satisfaction. In contrast to other more costly e…
A Fast Algorithm and Datalog Inexpressibility for Temporal Reasoning
Manuel Bodirsky, Jan Kara
We introduce a new tractable temporal constraint language, which strictly contains the Ord-Horn language of Buerkert and Nebel and the class of AND/OR precedence constraints. The a…