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
TIGER: real-time situation assessment of dynamic systems
Robert Milne,Charlie Nicol,Malik Ghallab,Louise Travé-Massuyès,Kouamana Bousson,C. Dousson,Joseba Quevedo,J. Aguilar,Antoni Guasch +8 more
TL;DR: The TIGER ESPRIT Project is investigating a variety of tools and techniques for real-time situation assessment of dynamic systems, including a high-speed rule-based compiler, a situation assessment tool able to monitor dynamic responses over time, qualitative and numerical prediction of turbine response, and model-based diagnosis to help identify unknown faults.
Book ChapterDOI
A Probabilistic Approach to Robust Execution of Temporal Plans with Uncertainty
TL;DR: A new more general formalism called the Probabilistic Simple Temporal Problem (PSTP) is developed following a probabilistic approach and used to solve the problem of finding an optimal execution strategy, i.e. a dynamic schedule where scheduling decisions are made on-line.
Book ChapterDOI
A SAT-based decision procedure for the boolean combination of difference constraints
TL;DR: TSAT++, a system implementing a SAT-based decision procedure for Boolean combinations of difference constraints, and the techniques implemented in it; in particular, TSAT++ takes full advantage of recent SAT techniques.
Journal ArticleDOI
Verification of temporal scheduling constraints in clinical practice guidelines
TL;DR: This paper presents a suitable verification method that is based on calculating the minimal network of temporal constraints on the execution of guideline activities and yields suggestions for an equivalent, yet more explicit representation of non-minimal constraints.
Proceedings Article
On-line planning and scheduling: an application to controlling modular printers
TL;DR: In this article, the authors present an on-line algorithm that combines techniques from state-space planning and partial-order scheduling for the control of production printing equipment, which is the first successful industrial application of embedded domain-independent temporal planning.
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.