Computer algorithms: introduction to design and analysis (2nd ed.)
Computer algorithms: introduction to design and analysis (2nd ed.)
Matrix multiplication via arithmetic progressions
Journal of Symbolic Computation - Special issue on computational algebraic complexity
Constraint propagation algorithms for temporal reasoning: a revised report
Readings in qualitative reasoning about physical systems
Reasoning about temporal relations: a maximal tractable subclass of Allen's interval algebra
Journal of the ACM (JACM)
Relations algebras in qualitative spatial reasoning
Fundamenta Informaticae
Building tractable disjunctive constraints
Journal of the ACM (JACM)
Maintaining knowledge about temporal intervals
Communications of the ACM
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Disjunctive Temporal Reasoning in Partially Ordered Models of Time
Proceedings of the Seventeenth National Conference on Artificial Intelligence and Twelfth Conference on Innovative Applications of Artificial Intelligence
Towards a Complete Classification of Tractability in Point Algebras for Nonlinear Time
CP '99 Proceedings of the 5th International Conference on Principles and Practice of Constraint Programming
Refinements and Independence: A Simple Method for Identifying Tractable Disjunctive Constraints
CP '02 Proceedings of the 6th International Conference on Principles and Practice of Constraint Programming
Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency, School/Workshop
Maximal tractable fragments of the region connection calculus: a complete analysis
IJCAI'99 Proceedings of the 16th international joint conference on Artifical intelligence - Volume 1
Point algebras for temporal reasoning: algorithms and complexity
Artificial Intelligence
CASL specifications of qualitative calculi
COSIT'05 Proceedings of the 2005 international conference on Spatial Information Theory
SC'04 Proceedings of the 4th international conference on Spatial Cognition: reasoning, Action, Interaction
| Hi-index | 0.00 |
Temporal reasoning with nonlinear models of time have been used in many areas of artificial intelligence. In this paper we focus on the model of branching time which has been proven successful for problems such as planning. We investigate the computational complexity of the point algebra for branching time extended with disjunctions and show that there are exactly five maximal tractable sets of relations. We also give an improved algorithm for deciding satisfiability of the point algebra with a time complexity comparable to that of path consistency checking algorithms.