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
Temporal Database Entries for the Springer Encyclopedia of Database Systems
TL;DR: Temporal query languages are a family of query languages designed to query (and access in general) time-dependent information stored in temporal databases with temporal features, and the meaning of temporal queries is defined in terms of temporal values and operations, and their interactions with data (non-temporal) values in a temporal database.
Journal ArticleDOI
Strong temporal planning with uncontrollable durations
TL;DR: A dedicated planning method is discussed, that generalizes the state-space temporal planning framework, leveraging SMT-based techniques for temporal networks under uncertainty, and a compilation-based method is presented, that reduces any STPUD problem to an ordinary temporal planning problem.
Proceedings Article
Towards Finding Robust Execution Strategies for RCPSP/max with Durational Uncertainty
TL;DR: The performance of local search is improved with the new fitness evaluation over the best known existing approach and the fitness function that is used to guide the local search towards robust schedules is derived.
Proceedings Article
Configuration Planning with Multiple Dynamic Goals
TL;DR: An approach to configuration planning for robotic systems in which plans are represented as constraint networks and planning is defined as search in the space of such networks is proposed.
Journal ArticleDOI
Hierarchical task network planning with resources and temporal constraints
TL;DR: An HTN planning algorithm named GSCCB-SHOP2 is proposed to handle multi-capacity discrete resources and complex temporal constraints simultaneously during planning to handle hierarchical task decomposition principle and expressiveness for domain knowledge representation.
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.