72 citations · 368 across the 79 of their papers we have counts for
Showing cs.AIShow all
3 papers · 1 filter
cs.AI2011
Tractable Set Constraints
Manuel Bodirsky, Martin Hils, Alex Krimkevich
Many fundamental problems in artificial intelligence, knowledge representation, and verification involve reasoning about sets and relations between sets and can be modeled as set c…
cs.AI2008★ 1 cited
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…
cs.AI2008
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…