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
Optimising bounds in simple temporal networks with uncertainty under dynamic controllability constraints
TL;DR: This work presents a disjunctive linear constraint model of dynamic controllability, shows how it can be used to formulate a range of applications, and compares a mixed-integer, a non-linear programming, and a conflict-directed search solver on the resulting optimisation problems.
Book ChapterDOI
On Reformulating Planning as Dynamic Constraint Satisfaction
TL;DR: It is shown that reformulations involving dynamic variable domains restrict the algorithms which can be used to solve the resulting DCSP, and presented an alternative formulation which does not employ dynamic domains, and the relative merits of the different reformulations are described.
Book
Authoring techniques for temporal scenarios of multimedia documents
TL;DR: This paper presents a meta-modelling framework for solving the problem of how to model the discrete-time component of the response of the central nervous system.
Book ChapterDOI
Constraint Tightness versus Global Consistency
Peter van Beek,Rina Dechter +1 more
TL;DR: This paper presents a new property called constraint tightness that can be used for characterizing the difficulty of problems formulated as constraint networks, and shows that when the constraints are tight they may require less preprocessing in order to guarantee a backtrack-free solution.
Proceedings ArticleDOI
Reasoning with disjunctive fuzzy temporal constraint networks
TL;DR: Methods that can reduce the complexity of the disjunctive fuzzy temporal constraint network based on graph topology and preprocessing are reviewed, with the final goal of integrating all these methods into a general tool for temporal reasoning with DFTCN.
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.