Theory of linear and integer programming
Theory of linear and integer programming
Artificial Intelligence - Special issue on knowledge representation
Combining qualitative and quantitative constraints in temporal reasoning
Artificial Intelligence
On the algebraic structure of combinatorial problems
Theoretical Computer Science
A unifying approach to temporal constraint reasoning
Artificial Intelligence
Journal of the ACM (JACM)
Building tractable disjunctive constraints
Journal of the ACM (JACM)
A general framework for time granularity and its application to temporal reasoning
Annals of Mathematics and Artificial Intelligence
Constrained Properties, Semilinear Systems, and Petri Nets
CONCUR '96 Proceedings of the 7th International Conference on Concurrency Theory
Constraint Satisfaction Problems on Intervals and Lengths
SIAM Journal on Discrete Mathematics
Handbook of Temporal Reasoning in Artificial Intelligence (Foundations of Artificial Intelligence (Elsevier))
Complexity of Clausal Constraints Over Chains
Theory of Computing Systems
Integer programming with 2-variable equations and 1-variable inequalities
Information Processing Letters
The complexity of temporal constraint satisfaction problems
Journal of the ACM (JACM)
Computational complexity of linear constraints over the integers
Artificial Intelligence
Hi-index | 0.00 |
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.