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 Article
Continuously relaxing over-constrained conditional temporal problems through generalized conflict learning and resolution
Peng Yu,Brian C. Williams +1 more
TL;DR: The Best-first Conflict-Directed Relaxation (BCDR) algorithm for enumerating the best continuous relaxation for an over-constrained conditional temporal problem with controllable choices is presented.
Journal ArticleDOI
Integrated Temporal Reasoning with Periodic Events
TL;DR: An integrated framework to deal with both qualitative temporal constraints on classes of actions and temporal constraints between instances of actions is proposed, in which temporal reasoning is used to amalgamate both types of constraints and to check their consistency.
Book ChapterDOI
Resource-Based vs. Task-Based Approaches for Scheduling Problems
TL;DR: Two main types of approaches, both based on constraint satisfaction, can be adopted to formulate a scheduling problem and are compared to a case study, the “Train Scheduling Problem”.
Proceedings Article
HiPOP: Hierarchical Partial-Order Planning.
TL;DR: A new planner, HiPOP (Hierarchical Partial-Order Planner), which is domain-configurable and uses POP techniques to create hierarchical time-flexible plans that follows the given methods.
Proceedings Article
Incremental dynamic controllability revisited
TL;DR: It is shown that FastIDC is not sound when new constraints are added, sometimes labeling networks as dynamically controllable when they are not, and how the algorithm can be modified to correctly detect uncontrollable networks is shown.
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.