Decidability of the interval temporal logic ABBar over the natural numbers

Details Decidability of the interval temporal logic ABBar over the natural numbers Decidability of the interval temporal logic ABBar over the natural numbers

2009-12-17

arxiv.org/abs/0912.3429v2

Computer Science

Logic in Computer Science

Scientific paper

In this paper, we focus our attention on the interval temporal logic of the Allen's relations "meets", "begins", and "begun by" (ABBar for short), interpreted over natural numbers. We first introduce the logic and we show that it is expressive enough to model distinctive interval properties,such as accomplishment conditions, to capture basic modalities of point-based temporal logic, such as the until operator, and to encode relevant metric constraints. Then, we prove that the satisfiability problem for ABBar over natural numbers is decidable by providing a small model theorem based on an original contraction method. Finally, we prove the EXPSPACE-completeness of the problem

Affiliated with

Also associated with

No associations

Rating

Decidability of the interval temporal logic ABBar over the natural numbers 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 Decidability of the interval temporal logic ABBar over the natural numbers, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Decidability of the interval temporal logic ABBar over the natural numbers will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-685900