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
Dissertation
Texture measurements as a basis for heuristic commitment techniques in constraint-directed scheduling
TL;DR: This dissertation develops the concept of a generalized measure of constraint criticality that enables the construction of dynamic, opportunistic heuristic commitment techniques and suggests the probability of breakage of a constraint as such a measure.
Journal ArticleDOI
Time representation: a taxonomy of temporal models
Brian Knight,Jixin Ma +1 more
TL;DR: A taxonomy of temporal systems according to three fundamental considerations: the assumed axiomatic theory, the expressiveness, and the mechanisms for inference which are provided is provided.
Proceedings ArticleDOI
A human factors analysis of proactive support in human-robot teaming
TL;DR: An analysis of human factors on the effectiveness of proactive support in human-robot teaming in a simulated Urban Search and Rescue task, in which the efficacy of teaming is not only dependent on individual performance but also on teammates' interactions with each other.
Book ChapterDOI
Global Consistency for Continuous Constraints
Djamila Haroud,Boi Faltings +1 more
TL;DR: It is shown that, in analogy to convex temporal problems and discrete row-convex problems, convexity properties of the solution spaces can be exploited to compute minimal and decomposable networks using path consistency algorithms.
Book ChapterDOI
Strong controllability of disjunctive temporal problems with uncertainty
TL;DR: This work develops the first sound and complete algorithm to determine whether Strong Controllability holds for a DTPU, and analyzes the complexity of the algorithm with respect to the number of constraints in different classes, showing that, for several common subclasses of DTPUs, determining Strong Controllers has the same complexity as solving DTPs.
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.