Efficient Algorithms for Qualitative Reasoning about Time
92
TL;DR: This paper addresses the problem of scalability in temporal reasoning by providing a collection of new algorithms for efficiently managing large sets of qualitative temporal relations, focusing on the class of relations forming the Point Algebra (PA-relations) and on a major extension to include binary disjunctions of PA-relations ( PA-disjunctions).
read more
About: This article is published in Artificial Intelligence. The article was published on 01 Apr 1995. and is currently open access. The article focuses on the topics: Qualitative reasoning & Temporal logic.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
•Book
Handbook of Constraint Programming
Francesca Rossi,Peter van Beek,Toby Walsh +2 more
- 01 Jan 2006
TL;DR: Researchers from other fields should find in this handbook an effective way to learn about constraint programming and to possibly use some of the constraint programming concepts and techniques in their work, thus providing a means for a fruitful cross-fertilization among different research areas.
•Book
Handbook of Temporal Reasoning in Artificial Intelligence
Michael Fisher,Dov M. Gabbay,Lluis Vila +2 more
- 01 Mar 2005
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.
198
•Proceedings Article
Backtracking algorithms for disjunctions of temporal constraints
Kostas Stergiou,Manolis Koubarakis +1 more
- 01 Jul 1998
TL;DR: This work extends the framework of simple temporal problems studied originally by Dechter, Meiri and Pearl to consider constraints of the form x1 - y1 ?
Automated test case generation for the stress testing of multimedia systems
Jian Zhang,Shing-Chi Cheung +1 more
TL;DR: An automatable method of test case generation is presented for the stress testing of multimedia systems that adapts constraint solving techniques to generate test cases that lead to potential resource saturation in a multimedia system.
73
•Dissertation
Representation and recognition of action in interactive spaces
Aaron F. Bobick,Claudio S. Pinhanez +1 more
- 01 Jan 1999
TL;DR: The PNF propagation algorithm has been applied to an action recognition vision system that handles actions composed of multiple, parallel threads of sub-actions, in situations that can not be efficiently dealt by the commonly used temporal representation schemes such as finite-state machines and HMMs.
47
References
•Book
Introduction to Algorithms
Thomas H. Cormen,Charles E. Leiserson,Ronald L. Rivest +2 more
- 01 Jan 1990
TL;DR: The updated new edition of the classic Introduction to Algorithms is intended primarily for use in undergraduate or graduate courses in algorithms or data structures and presents a rich variety of algorithms and covers them in considerable depth while making their design and analysis accessible to all levels of readers.
24.8K
•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.
7.9K
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.
Depth-First Search and Linear Graph Algorithms
TL;DR: The value of depth-first search or “backtracking” as a technique for solving problems is illustrated by two examples of an improved version of an algorithm for finding the strongly connected components of a directed graph.
6.9K
Temporal constraint networks
TL;DR: 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.
2.1K
Related Papers (5)
Marc Vilain,Henry Kautz +1 more
- 11 Aug 1986
Malik Ghallab,Amine Mounir Alaoui +1 more
- 20 Aug 1989