A Fast Algorithm and Datalog Inexpressibility for Temporal Reasoning

Details A Fast Algorithm and Datalog Inexpressibility for Temporal Reasoning A Fast Algorithm and Datalog Inexpressibility for Temporal Reasoning

2008-05-10

arxiv.org/abs/0805.1473v2

Computer Science

Artificial Intelligence

19 pages, 1 figure

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

A Fast Algorithm and Datalog Inexpressibility for Temporal Reasoning does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with A Fast Algorithm and Datalog Inexpressibility for Temporal Reasoning, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A Fast Algorithm and Datalog Inexpressibility for Temporal Reasoning will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-188754