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 ArticleDOI
A new effcient algorithm for solving the simple temporal problem
Lin Xu,B.Y. Choueiry +1 more
TL;DR: This paper designs the constraint propagation in STP-solver to operate on triangles instead of operating on edges and implicitly guarantee the decomposition of the constraint graph according to its articulation points and provides extensive empirical evaluations of all known algorithms for solving the STP on sets of randomly generated problems.
Posted Content
The Dynamic Controllability of Conditional STNs with Uncertainty
TL;DR: In this paper, the authors define a Conditional Simple Temporal Network with Uncertainty (CSTNU) that combines the simple temporal constraints from a Simple-Temporal Network (STN) with the conditional nodes from a CTP and the contingent links from a STNU.
Journal ArticleDOI
Management of Uncertainty and Spatio-Temporal Aspects for Monitoring and Diagnosis in a Smart Home
TL;DR: This article model a Smart Home scenario, using knowledge in the form of Event-Condition-Action rules together with a new inference scheme which incorporates spatio-temporal reasoning and uncertainty, and extends RIMER to permit the monitoring of situations according to the place where they occur and the specific order and duration of the activities.
Journal ArticleDOI
Temporal reasoning about fuzzy intervals
TL;DR: This paper presents a framework for reasoning about qualitative and metric temporal relations between vague time periods, and demonstrates that all reasoning tasks of interest are NP-complete, which reveals that adding vagueness to temporal reasoning does not increase its computational complexity.
Proceedings ArticleDOI
Inferring Temporal Order of Images From 3D Structure
TL;DR: It is shown how this sorting task can be formulated as a constraint satisfaction problem (CSP) despite the large size of the solution space (factorial in the number of images) and the presence of occlusions.
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.