activity
20052011
most citedComplexity of Existential Positive First-Order Logic

1 citations · 1 across the 5 of their papers we have counts for

collaborators
Showing 2008 · cs.AIShow all

1 paper · 2 filters

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…