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
Branching and pruning: An optimal temporal POCL planner based on constraint programming
Vincent Vidal,Hector Geffner +1 more
TL;DR: In this paper, a domain-independent formulation of temporal planning based on Constraint Programming is introduced that successfully combines a Partial Order Causal Link (POCL) branching scheme with powerful and sound pruning rules.
Patent
Method and system for temporally formatting data presentation in time-dependent documents
TL;DR: In this article, a method and system automatically produces a temporal layout for controlling the presentation of a multimedia document, or schedule, which is produced during a compile-time phase of the method from duration information about the media items included in the document, and from the temporal relationships between media items, as specified by a document author.
Journal ArticleDOI
Planning as constraint satisfaction: solving the planning graph by compiling it into CSP
TL;DR: GP-CSP is described, a system that does planning by automatically converting Graphplan's planning graph into a CSP encoding and solving it using standard CSP solvers, demonstrating that it is superior to both the Blackbox system and an ILP-based planner in a wide range of planning domains.
Journal ArticleDOI
Fuzzy constraints in job-shop scheduling
TL;DR: An extension of the constraint-based approach to job-shop scheduling that accounts for the flexibility of temporal constraints and the uncertainty of operation durations is proposed, including fuzzy extensions of well-known look-ahead schemes.
Journal ArticleDOI
Probe Backtrack Search for Minimal Perturbation in DynamicScheduling
Hani El Sakkout,Mark Wallace +1 more
TL;DR: An algorithm designed to minimally reconfigure schedules in response to a changing environment is described, conjecture that analogous probebacktracking strategies may obtain performance improvements over conventional backtrack algorithms for a broad range of constraints satisfaction and optimization problems.
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.