scispace - formally typeset
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

Activity planning for the Mars Exploration Rovers

TL;DR: The adaptation of constraint-based planning and temporal reasoning to a mixed-initiative setting and the key technical solutions developed for the mission deployment of MAPGEN are described.
Journal ArticleDOI

Discovering frequent event patterns with multiple granularities in time sequences

TL;DR: In this paper, the authors introduce event structures that have temporal constraints with multiple granularities, and define the pattern discovery problem with these structures, and study effective algorithms to solve it.
Book

Handbook of Temporal Reasoning in Artificial Intelligence

TL;DR: This collection brings together the leading researchers in a range of relevant areas and provides an coherent description of the breadth of activity concerning temporal reasoning in the filed of Artificial Intelligence.
Journal ArticleDOI

Methodological Review: Temporal reasoning with medical data-A review with emphasis on medical natural language processing

TL;DR: Broad areas for future research include enhancing functions of current MLP systems on processing temporal information, incorporating medical knowledge into temporal reasoning systems, resolving coreference, integrating narrative data with structured data and evaluating these systems.
Proceedings ArticleDOI

Automatic temporal layout mechanisms

TL;DR: This paper constructs a framework for understanding automatic temporal formatters and explores the basic issues surrounding them, and describes the Firefly multimedia document system, which has been developed to test the potential of automatic temporal formatting.
References
More filters
Book

The Design and Analysis of Computer Algorithms

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

James F. Allen
- 01 Mar 1991 - 
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.