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
Adaptive cognitive orthotics: combining reinforcement learning and constraint-based temporal reasoning
TL;DR: This work integrates temporal constraint reasoning with reinforcement learning (RL) to build an adaptive reminder system and in a simulated environment demonstrates that it can personalize to a user and adapt to both short- and long-term changes.
Journal ArticleDOI
Temporal abstraction and inductive logic programming for arrhythmia recognition from electrocardiograms
TL;DR: This paper proposes to learn automatically from symbolic ECG examples the chronicles discriminating the arrhythmias belonging to some specific subset, demonstrating that integrating numerical techniques for low level perception and symbolic techniques for high level classification is very valuable.
Book
A Short Introduction to Preferences: Between AI and Social Choice
TL;DR: This book provides a concise introduction to the main research lines in this field, covering aspects such as preference modelling, uncertainty reasoning, social choice, stable matching, and computational aspects of preference aggregation and manipulation.
Proceedings Article
On-line planning and scheduling for high-speed manufacturing
TL;DR: A hybrid algorithm is presented for this problem that combines techniques from partial-order scheduling and state-space planning, and enables high productivity even for complex plants.
Journal ArticleDOI
Solving multi-granularity temporal constraint networks
TL;DR: A sound and complete algorithm for consistency checking and for deriving a solution is presented, and the algorithm's computational complexity and several optimization techniques specific to the multigranularity context are investigated.
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.