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
Fuzzy Temporal Constraint Networks for Clinical Information
TL;DR: An extension of TimeText, a temporal reasoning system designed to represent, extract, and reason about temporal information in clinical text, to include the use of fuzzy temporal constraints to increase TimeTexts ability to handle uncertainty in temporal relations.
Dissertation
Pilotage d'algorithmes pour la reconnaissance en ligne d'arythmies cardiaques
TL;DR: L'objectif de cette these est la realisation du systeme de monitorage cardiaque intelligent IP-Calicot capable, grâce a un module de pilotage d'algorithmes, d'utiliser les informations du contexte courant pour modifier sa chaine de traitements afin d'obtenir un diagnostic medical fiable meme en milieu bruite.
Book ChapterDOI
Constraint Satisfaction for Planning and Scheduling
TL;DR: This chapter introduces constraint satisfaction technology with emphasis on its applications in planning and scheduling, including a brief survey of mainstream solving techniques, that is, constraint propagation combined with search.
Journal ArticleDOI
Schedulability Analysis of Task Sets with Upper- and Lower-Bound Temporal Constraints
TL;DR: A polynomial-time test is presented that is known to be the first to handle nonpreemptive self- Suspension task sets with hard deadlines, where each task has any number of self-suspensions.
Proceedings ArticleDOI
Inferring Context and Goals for Online Human-Aware Planning
TL;DR: This work uses an approach whereby human-awareness is enforced through so-called interaction constraints to infer context and appropriate goals online and modified at run time so as to achieve courses of action that are continuously human-aware.
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.