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
Chance-constrained scheduling via conflict-directed risk allocation
Andrew J. Wang,Brian C. Williams +1 more
TL;DR: Through a set of simulated car-sharing scenarios, it is empirically shown that conflict-directed risk allocation computes solutions nearly an order of magnitude faster than prior art does, which considers all constraints in a single lump-sum optimization.
The Twofold Integration of CBR in Decision Support Systems
TL;DR: This short paper presents the experience in facing different levels of integration of CBR techniques with other system components and techniques inside decision support systems for controlling environmental emergencies.
Book ChapterDOI
An Incremental and Non-binary CSP Solver: The Hyperpolyhedron Search Algorithm
Miguel A. Salido,Federico Barber +1 more
TL;DR: This work proposes an algorithm called “Hyperpolyhedron Search Algorithm (HSA)” that solves non- binary constraint satisfaction problems in a natural way as an incremental and non-binary CSP solver.
Book ChapterDOI
Simple temporal problems in route scheduling for the dial---a---ride problem with transfers
TL;DR: This paper addresses a variant of the DARP where requests can change of vehicle during their trip, and proposes necessary and sufficient conditions to fasten the detection of unfeasible or feasible routes.
ReportDOI
Probabilistic Temporal Networks.
Eugene Santos,Joel D. Young +1 more
TL;DR: A new model is defined, the Probabilistic Temporal Network, for representing temporal and atemporal information while fully embracing probabilistic semantics, which allows representation of time constrained causality, of when and if events occur, and of the periodic and recurrent nature of processes.
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.