# Computational Complexity of Relating Time Points with Intervals

@article{Jonsson1999ComputationalCO, title={Computational Complexity of Relating Time Points with Intervals}, author={P. Jonsson and Thomas Drakengren and C. B{\"a}ckstr{\"o}m}, journal={Artif. Intell.}, year={1999}, volume={109}, pages={273-295} }

Abstract Several algebras have been proposed for reasoning about qualitative constraints over the time line. One of these algebras is Vilain's point–interval algebra, which can relate time points with time intervals. Apart from being a stand-alone qualitative algebra, it is also used as a subalgebra in Meiri's approach to temporal reasoning, which combines reasoning about metric and qualitative temporal constraints over both time points and time intervals. While the satisfiability problem for… Expand

#### Figures, Tables, and Topics from this paper

#### 25 Citations

Point algebras for temporal reasoning: Algorithms and complexity

- Mathematics, Computer Science
- Artif. Intell.
- 2003

A new time model suitable for reasoning about systems with a bounded number of unsynchronized clocks is presented, connections with spatial reasoning are investigated, and improved algorithms for deciding satisfiability of the tractable point algebras are presented. Expand

Reasoning about temporal relations: The tractable subalgebras of Allen's interval algebra

- Computer Science, Mathematics
- JACM
- 2003

This article provides the final step in the classification of complexity for satisfiability problems over constraints expressed in Allen's interval algebra, and shows that this algebra contains exactly eighteen maximal tractable subalgebras, and reasoning in any fragment not entirely contained in one of these subalagbras is NP-complete. Expand

The Complexity of Reasoning about Spatial Congruence

- Mathematics, Computer Science
- J. Artif. Intell. Res.
- 1999

A novel algebra for reasoning about Spatial Congruence is introduced, it is shown that the satisfiability problem in the spatial algebra MC-4 is NP-complete, and a complete classification of tractability in the algebra is presented, based on the individuation of three maximal tractable subclasses, one containing the basic relations. Expand

A Method for Characterizing Tractable Subsets of Qualitative Fuzzy Temporal Algebrae

- Computer Science
- WILF
- 2005

Rules for identifying fuzzy tractable relations starting from the knowledge of the classic tractable Relations of Allen's interval algebra are shown: numbers are used to verify the rules and quantify expressiveness. Expand

Tractable Fragments of Fuzzy Qualitative Algebra

- Mathematics, Computer Science
- Spatial Cogn. Comput.
- 2008

Fuzzy Qualitative Temporal Algebra, a framework that combines qualitative temporal constraints between points and intervals, and allows modelling vagueness and uncertainty, can be identified by generalizing the results obtained for crisp Constraint Satisfaction Problems to fuzzy CSPs. Expand

Computational Complexity Study of Fuzzy Qualitative Temporal Algebra

- Mathematics, Computer Science
- 2007 IEEE International Fuzzy Systems Conference
- 2007

In order to guarantee the applicability of Path-Consistency algorithm, it is proved that the identified fragments of fuzzy qualitative algebra QAfuz are algebras and the set of the identified tractable fuzzy fragments is maximal. Expand

Reasoning about temporal constraints: classifying the complexity in Allen''''s algebra by using an algebraic technique

- Mathematics
- 2001

Allen''''s interval algebra is one of the best established formalisms for temporal reasoning. We study those fragments of Allen''''s algebra that contain a basic relation distinct from the equality… Expand

From binary temporal relations to non-binary ones and back

- Mathematics, Computer Science
- Artif. Intell.
- 2001

Abstract In this paper a new approach towards temporal reasoning is presented that scales up from the temporal relations commonly used in Allen's qualitative interval calculus and in quantitative… Expand

Complexity classification in qualitative temporal constraint reasoning

- Mathematics, Computer Science
- Artif. Intell.
- 2004

We study the computational complexity of the qualitative algebra which is a temporal constraint formalism that combines the point algebra, the point-interval algebra and Allen's interval algebra. We… Expand

Classical and Fuzzy Neighborhood Relations of the Temporal Qualitative Algebra

- Computer Science
- 2009 16th International Symposium on Temporal Representation and Reasoning
- 2009

The two orthogonal notions of coarseness and fuzziness seem to be quite adequate to manage these two kinds of temporal ignorance and they can be combined to develop a more general model. Expand

#### References

SHOWING 1-10 OF 24 REFERENCES

Tractable Subclasses of the Point-Interval Algebra: A Complete Classification

- Computer Science
- KR
- 1996

A complete classiication of sat-issability for all these subclasses into polynomial and NP-complete respectively is provided and all maximal tractable subalgebras| nine in total are identified. Expand

Complexity and algorithms for reasoning about time: a graph-theoretic approach

- Mathematics, Computer Science
- JACM
- 1993

This work unifies notions of interval algebras in artificial intelligence with those of interval orders and interval graphs in combinatorics and shows that even when the temporal data comprises of subsets of relations based on intersection and precedence only, the satisfiability question is NP-complete. Expand

Eight Maximal Tractable Subclasses of Allen's Algebra with Metric Time

- Mathematics, Computer Science
- J. Artif. Intell. Res.
- 1997

Eight new maximal tractable subclasses of Allen's interval algebra are presented, some of them subsuming previously reported tractable algebras that allow for metric temporal constraints on interval starting or ending points, using the recent framework of Horn DLRs. Expand

Twenty-One Large Tractable Subclasses of Allen's Algebra

- Mathematics, Computer Science
- Artif. Intell.
- 1997

Nine more maximal tractable subclasses of Allen's interval algebra are presented, in addition to their previously reported ORD-Horn subclass, and the path consistency algorithm is shown to decide satisfiability of interval networks using any of the algebras. Expand

Combining Qualitative and Quantitative Constraints in Temporal Reasoning

- Mathematics, Computer Science
- Artif. Intell.
- 1991

A general model for temporal reasoning, capable of handling both qualitative and quantitative information, is presented, involving qualitative networks augmented by quantitative domain constraints, some of which can be solved in polynomial time using arc and path consistency. Expand

A Complete Classification of Tractability in Allen's Algebra Relative to Subsets of Basic Relations

- Mathematics, Computer Science
- Artif. Intell.
- 1998

The conclusion is that no tractable subalgebra dial is not known in the literature can contain more than the three basic relations (≡), (b) and ( b⪰ ), which means that concerning algebras for specifying complete knowledge about temporal information, there is no hope of finding yet unknown classes with much expressivity. Expand

A Unifying Approach to Temporal Constraint Reasoning

- Mathematics, Computer Science
- Artif. Intell.
- 1998

It is proved that most approaches to tractable temporal constraint reasoning can be encoded as Horn DLRs, including the ORD-Horn algebra by Nebel and Burckert and the simple temporal constraints by Dechter et al. Expand

Constraint propagation algorithms for temporal reasoning: a revised report

- Mathematics
- 1989

This paper revises and expands upon a paper presented by two of the present authors at AAAI 1986 [Vilain & Kautz 1986]. As with the original, this revised document considers computational aspects of… Expand

A System for Reasoning About Time

- Computer Science
- AAAI
- 1982

The salient features of a new system for reasoning about time that represents time primarily — though not exclusively — in terms of intervals, and performs deductions on this representation has a mechanism for maintaining consistency in the representation and discovering the origin of inconsistencies. Expand

The Interpretation of Temporal Relations in Narrative

- Computer Science
- AAAI
- 1988

A more rigorous description for time relations of tenses is presented, which is able to express all the 16 tenses in English and incorporate the interval properties of events from the aspectual analysis into the tense relations. Expand