Discrete-Time Temporal Reasoning with Horn DLRs

Temporal reasoning problems arise in many areas of AI, including planning, natural language understanding, and reasoning about physical systems. The computational complexity of continuous-time temporal constraint reasoning is fairly well understood. There are, however, many different cases where discrete time must be considered; various scheduling problems and reasoning about sampled physical systems are two examples. Here, the complexity of temporal reasoning is not as well-studied nor as well-understood. In order to get a better understanding, we consider the powerful Horn DLR formalism adapted for discrete time and study its computational complexity. We show that the full formalism is NP-hard and identify several maximal tractable subclasses. We also 'lift' the maximality results to obtain hardness results for other families of constraints. Finally, we discuss how the results and techniques presented in this paper can be used for studying even more expressive classes of temporal constraints.

[1]  Peter Jonsson,et al.  Horn versus full first-order: Complexity dichotomies in algebraic constraint satisfaction , 2010, J. Log. Comput..

[2]  Rohit Parikh,et al.  On Context-Free Languages , 1966, JACM.

[3]  Michael Pinsker,et al.  The reducts of equality up to primitive positive interdefinability , 2010, J. Symb. Log..

[4]  David Eisenstat,et al.  The computational power of population protocols , 2006, Distributed Computing.

[5]  Rina Dechter,et al.  Temporal Constraint Networks , 1989, Artif. Intell..

[6]  Manuel Bodirsky,et al.  The complexity of temporal constraint satisfaction problems , 2008, STOC.

[7]  Peter Jeavons,et al.  Constraint Satisfaction Problems on Intervals and Length , 2004, SIAM J. Discret. Math..

[8]  Ahmed Bouajjani,et al.  Constrained Properties, Semilinear Systems, and Petri Nets , 1996, CONCUR.

[9]  Gernot Salzer,et al.  Complexity of Clausal Constraints Over Chains , 2008, Theory of Computing Systems.

[10]  Ravi Kannan,et al.  Polynomial Algorithms for Computing the Smith and Hermite Normal Forms of an Integer Matrix , 1979, SIAM J. Comput..

[11]  Gustav Nordh,et al.  Integer programming with 2-variable equations and 1-variable inequalities , 2009, Inf. Process. Lett..

[12]  Itay Meiri,et al.  Combining Qualitative and Quantitative Constraints in Temporal Reasoning , 1991, Artif. Intell..

[13]  Peter Jeavons,et al.  Building tractable disjunctive constraints , 2000, J. ACM.

[14]  Peter Jeavons,et al.  On the Algebraic Structure of Combinatorial Problems , 1998, Theor. Comput. Sci..

[15]  Christer Bäckström,et al.  A Unifying Approach to Temporal Constraint Reasoning , 1998, Artif. Intell..

[16]  Sushil Jajodia,et al.  A general framework for time granularity and its application to temporal reasoning , 1998, Annals of Mathematics and Artificial Intelligence.

[17]  David K. Smith.  Theory of Linear and Integer Programming , 1987 .