Artificial Intelligence
An optimal k-consistency algorithm
Artificial Intelligence
Artificial Intelligence - Special issue on knowledge representation
From local to global consistency
Artificial Intelligence
Performance of temporal reasoning systems
ACM SIGART Bulletin
A metric time-point and duration-based temporal model
ACM SIGART Bulletin
Reasoning about temporal relations: a maximal tractable subclass of Allen's interval algebra
Journal of the ACM (JACM)
Efficient algorithms for qualitative reasoning about time
Artificial Intelligence
On the minimality and global consistency of row-convex constraint networks
Journal of the ACM (JACM)
Hierarchisation of the search space in temporal planning
New directions in AI planning
Combining qualitative and quantitative constraints in temporal reasoning
Artificial Intelligence
Processing disjunctions in temporal constraint networks
Artificial Intelligence
Constraint tightness and looseness versus local and global consistency
Journal of the ACM (JACM)
Constraints, consistency and closure
Artificial Intelligence
A unifying approach to temporal constraint reasoning
Artificial Intelligence
Backtracking algorithms for disjunctions of temporal constraints
AAAI '98/IAAI '98 Proceedings of the fifteenth national/tenth conference on Artificial intelligence/Innovative applications of artificial intelligence
Temporal reasoning with qualitative and quantitative information about points and durations
AAAI '98/IAAI '98 Proceedings of the fifteenth national/tenth conference on Artificial intelligence/Innovative applications of artificial intelligence
Computational complexity of relating time points with interval
Artificial Intelligence
A Sufficient Condition for Backtrack-Free Search
Journal of the ACM (JACM)
Maintaining knowledge about temporal intervals
Communications of the ACM
Synthesizing constraint expressions
Communications of the ACM
Later: Managing Temporal Information Efficiently
IEEE Expert: Intelligent Systems and Their Applications
A New Framework for Reasoning about Points, Intervals and Durations
IJCAI '99 Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence
AI '98 Proceedings of the 12th Biennial Conference of the Canadian Society for Computational Studies of Intelligence on Advances in Artificial Intelligence
Hybrid temporal reasoning for planning and scheduling
TIME '96 Proceedings of the 3rd Workshop on Temporal Representation and Reasoning (TIME'96)
Qualitative temporal reasoning with points and durations
IJCAI'97 Proceedings of the Fifteenth international joint conference on Artifical intelligence - Volume 2
Eight maximal tractable subclasses of Allen's algebra with metric time
Journal of Artificial Intelligence Research
A linear-programming approach to temporal reasoning
AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 2
A Mixed Closure-CSP Method to Solve Scheduling Problems
Proceedings of the 14th International conference on Industrial and engineering applications of artificial intelligence and expert systems: engineering of intelligent systems
Efficient solution techniques for disjunctive temporal reasoning problems
Artificial Intelligence
A Mixed Closure-CSP Method for Solving Scheduling Problems
Applied Intelligence
Complexity classification in qualitative temporal constraint reasoning
Artificial Intelligence
Representing flexible temporal behaviors in the situation calculus
IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
Complexity classification in qualitative temporal constraint reasoning
Artificial Intelligence
Computational complexity of linear constraints over the integers
Artificial Intelligence
Hi-index | 0.00 |
We introduce a temporal model for reasoning on disjunctive metric constraints on intervals and time points in temporal contexts. This temporal model is composed of a labeled temporal algebra and its reasoning algorithms. The labeled temporal algebra defines labeled disjunctive metric point-based constraints, where each disjunct in each input disjunctive constraint is univocally associated to a label. Reasoning algorithms manage labeled constraints, associated label lists, and sets of mutually inconsistent disjuncts. These algorithms guarantee consistency and obtain a minimal network. Additionally, constraints can be organized in a hierarchy of alternative temporal contexts. Therefore, we can reason on context-dependent disjunctive metric constraints on intervals and points. Moreover, the model is able to represent non-binary constraints, such that logical dependencies on disjuncts in constraints can be handled. The computational cost of reasoning algorithms is exponential in accordance with the underlying problem complexity, although some improvements are proposed.