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
Journal ArticleDOI
The complexity of constraint satisfaction problems for small relation algebras
Matteo Cristani,Robin Hirsch +1 more
TL;DR: This paper gives a complete classification of the complexities of the general constraint satisfaction problem for small relation algebras, and classify the complexity of the constraint satisfaction problems over fixed finite representations of any relation algebra.
Dissertation
Enhancing sequential pattern mining with time and reasoning
TL;DR: HAL is a multi-disciplinary open access archive for the deposit and dissemination of scientific research documents, whether they are published or not, for teaching and research institutions in France or abroad.
Patent
Method for the machine learning of frequent chronicles in an alarm log for the monitoring of dynamic systems
TL;DR: In this article, an automatic method for learning frequent chronicles in an alarm log of a dynamic system for supervision of the system, and a learning system for using the method in a supervision system is presented.
Book ChapterDOI
Conditional Uncertainty in Constraint Networks
Matteo Zavatteri,Luca Viganò +1 more
TL;DR: This paper proposes Constraint Networks Under Conditional Uncertainty (CNCUs), and it defines weak, strong and dynamic controllability of a CNCU, and provides algorithms to check each of these types of controllable.
Journal ArticleDOI
Adaptable Data Download Schedules for Agile Earth-Observing Satellites
Adrien Maillard,Gérard Verfaillie,Cédric Pralet,Jean Jaubert,Isabelle Sebbag,Frédéric Fontanari,Julien L'Hermitte +6 more
TL;DR: In this paper, it is shown how decision making on data download schedules can be shared between ground and onboard to face uncertainty about the volumes of data generated by observations.
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.