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
A constraint satisfaction approach to makespan scheduling
TL;DR: The hypothesis is two-fold: (1) that CSP scheduling techniques can provide a basis for developing high-performance approximate solution procedures in optimization contexts, and (2) that the representational assumptions underlying CSP models allow these procedures to naturally accommodate the idiosyncratic constraints that complicate most real-world applications.
Journal ArticleDOI
Formal semantics for interactive music scores: a framework to design, specify properties and execute interactive scenarios
TL;DR: This work proposes new semantics for is based on timed event structures (TES) and presents an operational semantics based on the non-deterministic timed concurrent constraint calculus and relates such a semantics to the TES semantics.
Proceedings Article
Managing Temporal Uncertainty Through Waypoint Controllability
Paul Morris,Nicola Muscettola +1 more
TL;DR: It is proved the negation of Weak Controllability is NP-hard, confirming a conjecture in [Vidal and Fargier, 1997] and a more general controllability property of which Weak and Strong Controllable are special cases.
Heuristic Methods for Solving Job-Shop Scheduling Problems.
TL;DR: A more flexible heuristic technique is obtained, which improves empirical efficiency and allows early detection of unfeasible problems.
Book
Automatically Ordering Events and Times in Text
TL;DR: This book presents a theory and data-driven analysis of temporal ordering, leading to the identification of exactly what is difficult about the task, and proposes and evaluates machine-learning solutions for the major difficulties.
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.