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
Supporting a distributed execution of clinical guidelines
TL;DR: This paper describes how GLARE (Guideline Acquisition, Representation, and Execution), a computerized GL management system, has been extended in order to support such a need by guaranteeing treatment continuity and responsibility assignment support in the various steps of a coordinated and distributed patient care process.
Journal ArticleDOI
Time–dependent Simple Temporal Networks: Properties and Algorithms
Cédric Pralet,Gérard Verfaillie +1 more
TL;DR: An extension of STN called Time-dependent STN (TSTN) is introduced, which covers temporal constraints for which the temporal distance required between two time-points is not necessarily constant.
Proceedings Article
On the use of temporal landmarks for planning with deadlines
TL;DR: The experimental results will show that this approach is helpful to quickly detect unsolvable problems and it is also very effective to solve problems with deadlines in comparison to other state-of-the-art planners.
Journal ArticleDOI
A finite relation algebra with undecidable network satisfaction problem
TL;DR: The network satisfaction problem is undecidable for this relation algebra because the atom a of A is a minimal, non-zero element.
Book ChapterDOI
The roles of knowledge and representation in problem solving
TL;DR: This paper argues for the importance of distinguishing between the concepts of knowledge and representation, and describes advantages and pitfalls of using multiple knowledge sources and representations.
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.