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
Journal ArticleDOI
VHPOP: Versatile Heuristic Partial Order Planner
Reid Simmons,Håkan L. S. Younes +1 more
TL;DR: VHPOP is a partial order causal link (POCL) planner loosely based on UCPOP that draws from the experience gained in the early to mid 1990's on flaw selection strategies, and combines this with more recent developments in the field of domain independent planning.
Proceedings Article
When is temporal planning really temporal
TL;DR: A complete state-space temporal planning algorithm is designed, which the authors hope will be able to achieve high performance by leveraging the heuristics that power decision epoch planners.
Book
Introduction to Constraint Databases
TL;DR: This book reveals how constraint databases bring together techniques from a variety of fields, such as logic and model thoery, algebraic and computational geometry, and symbolic computation, to the design and analysis of data models and query languages.
Proceedings Article
Planning and Scheduling for Fleets of Earth Observing Satellites
TL;DR: This paper presents a constraint-based approach to solving the Earth Observing Satellites (EOS) scheduling problem, and proposes a stochastic heuristic search method for solving it.
Journal ArticleDOI
VHPOP: versatile heuristic partial order planner
Håkan L. S. Younes,Reid Simmons +1 more
TL;DR: VHPOP as mentioned in this paper is a partial order causal link (POCL) planner loosely based on UCPOP, which combines the experience gained in the early to mid 1990's on flaw selection strategies for POCL planning, and combines this with recent developments in the field of domain independent planning such as distance based heuristics and reachability analysis.
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.