A Fast Algorithm and Datalog Inexpressibility for Temporal Reasoning
Artificial Intelligence
2009-04-11 v2 Logic in Computer Science
Abstract
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 algorithm we present for this language decides whether a given set of constraints is consistent in time that is quadratic in the input size. We also prove that (unlike Ord-Horn) this language cannot be solved by Datalog or by establishing local consistency.
Cite
@article{arxiv.0805.1473,
title = {A Fast Algorithm and Datalog Inexpressibility for Temporal Reasoning},
author = {Manuel Bodirsky and Jan Kara},
journal= {arXiv preprint arXiv:0805.1473},
year = {2009}
}
Comments
19 pages, 1 figure