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

@article{Drakengren1998ACC, title={A Complete Classification of Tractability in Allen's Algebra Relative to Subsets of Basic Relations}, author={Thomas Drakengren and Peter Jonsson}, journal={Artif. Intell.}, year={1998}, volume={106}, pages={205-219} }

Abstract We characterise the set of subalgebras of Allen's algebra which have a tractable satisfiability problem, and in addition contain certain basic relations. 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⪰ ), where bϵd, o, s, f. This means that concerning algebras for specifying complete knowledge about temporal information, there is no hope of finding yet unknown classes with much…

## Topics from this paper

## 44 Citations

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

- Computer Science, MathematicsJACM
- 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.

A Complete Classification of Complexity in Allens Algebra in the Presence of a Non-Trivial Basic Relation

- Mathematics, Computer ScienceIJCAI
- 2001

It is proved that a fragment of Allen's algebra that contain a basic relation distinct from the equality relation is either NP-complete or else contained in some already known tractable subalgebra.

Classifying the Complexity of Constraints Using Finite Algebras

- Mathematics, Computer ScienceSIAM J. Comput.
- 2005

It is shown that any set of relations used to specify the allowed forms of constraints can be associated with a finite universal algebra and how the computational complexity of the corresponding constraint satisfaction problem is connected to the properties of this algebra is explored.

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…

Minimal Consistency Problem of Temporal Qualitative Constraint Networks

- Computer Science2013 20th International Symposium on Temporal Representation and Reasoning
- 2013

It is proved that this problem is NP-complete for both PA and IA, in the general case, and it is shown that for TQCNs defined on the convex relations, MinCons is polynomial.

CONSTRAINT SATISFACTION PROBLEMS ON INTERVALS AND LENGTHS∗

- 2020

We study interval-valued constraint satisfaction problems (CSPs), in which the aim is to find an assignment of intervals to a given set of variables subject to constraints on the relative positions…

Constraint Satisfaction Problems on Intervals and Length

- Mathematics, Computer ScienceSIAM J. Discret. Math.
- 2004

The qualitative framework of Allen's interval algebra is extended with additional constraints on the lengths of intervals, allowing these length constraints to be expressed as Horn disjunctive linear relations, a well-known tractable and sufficiently expressive form of constraints.

The Complexity of Constraints on Intervals and Lengths

- Computer Science, MathematicsSTACS
- 2001

This work completely characterize sets of qualitative relations for which the constraint satisfaction problem augmented with arbitrary length constraints of the above form is tractable and shows that all the remaining cases are NP-complete.

On (Maximal, Tractable) Fragments of the Branching Algebra

- Mathematics, Computer ScienceCILC
- 2020

This paper identifies three interesting fragments of the Branching Algebra: the Horn fragment, which was already known, the Pointsable fragment, and the Linear fragment, whose tractability is studied as well as their tractability via Path-Consistency, and their maximality is discussed.

Spatial and temporal reasoning: beyond Allen's calculus

- Computer ScienceAI Commun.
- 2004

The main object of this paper is to examine some of the new questions which arise when considering analogous calculi and use the idea of weak representations of the algebras as a unifying concept.

## References

SHOWING 1-10 OF 27 REFERENCES

Towards a Complete Classification of Tractability in Allen's Algebra

- Mathematics, Computer ScienceIJCAI
- 1997

The conclusion is that no tractable subalgebra that is not known in the literature can contain more than the three basic relations (≡), (b) and (b-), which means there is no hope of finding yet unknown classes with much expressivity.

Twenty-One Large Tractable Subclasses of Allen's Algebra

- Mathematics, Computer ScienceArtif. 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.

Reasoning about temporal relations: a maximal tractable subclass of Allen's interval algebra

- Mathematics, Computer ScienceJACM
- 1995

Using an extensive machine-generated case analysis, it is shown that the ORD-Horn subclass is a maximal tractable subclass of the full algebra (assuming P <inline-equation> ≠</f> </inline-Equation> NP).

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

- Computer ScienceKR
- 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.

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

- Mathematics, Computer ScienceJ. 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.

Exact and approximate reasoning about temporal relations 1

- Computer ScienceComput. Intell.
- 1990

This paper addresses a fundamental reasoning task that arises in applications of the algebra: Given (possibly indefinite) knowledge about the relationships between intervals, find all feasible relationships between two intervals, called the minimal labels problem.

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

- Mathematics, Computer ScienceJACM
- 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.

A Complete Classification of Tractability in RCC-5

- Mathematics, Computer ScienceJ. Artif. Intell. Res.
- 1997

This work investigates the computational properties of the spatial algebra RCC-5 which is a restricted version of the RCC framework for spatial reasoning and identifies all maximal tractable subalgebras which are four in total.

Temporal Constraint Networks

- Computer Science, MathematicsArtif. Intell.
- 1989

It is shown that the STP, which subsumes the major part of Vilain and Kautz's point algebra, can be solved in polynomial time and the applicability of path consistency algorithms as preprocessing of temporal problems is studied, to demonstrate their termination and bound their complexities.

Temporal reasoning in Timegraph I–II

- Computer ScienceSGAR
- 1993

We describe two temporal reasoning systems called Timegraph I and II, which can efficiently manage large sets of relations in the Point Algebra as well as metric information. Our representation is…