Journal ArticleDOI
Temporal constraint networks
TLDR
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.About:
This article is published in Artificial Intelligence.The article was published on 1991-05-01. It has received 1989 citations till now. The article focuses on the topics: Constraint satisfaction problem & Constraint satisfaction.read more
Citations
More filters
Proceedings ArticleDOI
An information infrastructure for coordinating Earth science observations
TL;DR: Model-based observing is realized in this paper by an approach based on concepts of distributed planning and scheduling, the idea of linking scheduling observation resources more directly to science goals.
Book ChapterDOI
Temporally Constrained Workflows
TL;DR: This work proposes a temporal process specification model and develops formalism to determine the consistency of the specification and shows that finer control on activities execution can be achieved by exploiting their temporal constraints.
Dissertation
Temporal and Hierarchical Models for Planning and Acting in Robotics
TL;DR: It is argued that a successful integration with a robotic system requires the planner to have capacities for both temporal and hierarchical reasoning, and a model for temporal planning unifying the generative and hierarchical approaches is presented.
Book ChapterDOI
A Symbolic Approach to Interval Constraint Problems
TL;DR: A symbolic approach to solving constraint problems, which uses relation algebra, gives good results for problems with constraints that are relations on intervals, and space performance is affected by the branching factor during search, and time performance by path-consistency calculations.
New Algorithms for the Simple Temporal Problem
TL;DR: The main contribution of this thesis is the proposal of new algorithms for solving the STP by enforcing partial path consistency, which are shown to outperform the best existing algorithms.
References
More filters
Book
The Design and Analysis of Computer Algorithms
Alfred V. Aho,John E. Hopcroft +1 more
TL;DR: This text introduces the basic data structures and programming techniques often used in efficient algorithms, and covers use of lists, push-down stacks, queues, trees, and graphs.
Journal Article
Maintaining knowledge about temporal intervals
TL;DR: An interval-based temporal logic is introduced, together with a computationally effective reasoning algorithm based on constraint propagation, which is notable in offering a delicate balance between space and time.
Journal ArticleDOI
Maintaining knowledge about temporal intervals
TL;DR: In this paper, an interval-based temporal logic is introduced, together with a computationally effective reasoning algorithm based on constraint propagation, which is notable in offering a delicate balance between time and space.
Journal ArticleDOI
Combinatorial optimization: algorithms and complexity
TL;DR: This clearly written, mathematically rigorous text includes a novel algorithmic exposition of the simplex method and also discusses the Soviet ellipsoid algorithm for linear programming; efficient algorithms for network flow, matching, spanning trees, and matroids; the theory of NP-complete problems; approximation algorithms, local search heuristics for NPcomplete problems, more.
Journal ArticleDOI
Consistency in Networks of Relations
TL;DR: The primary aim is to provide an accessible, unified framework, within which to present the algorithms including a new path consistency algorithm, to discuss their relationships and the may applications, both realized and potential of network consistency algorithms.