A unifying approach to temporal constraint reasoning
Peter Jonsson,Christer Bäckström +1 more
Reads0
Chats0
TLDR
It is proved that most approaches to tractable temporal constraint reasoning can be encoded as Horn DLRs, including the ORD-Horn algebra by Nebel and Burckert and the simple temporal constraints by Dechter et al.About:
This article is published in Artificial Intelligence.The article was published on 1998-06-01 and is currently open access. It has received 90 citations till now.read more
Citations
More filters
Book
Handbook of Constraint Programming
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 Knowledge Representation
TL;DR: The Handbook of Knowledge Representation is an up-to-date review of twenty-five key topics in knowledge representation written by the leaders of each field, an essential resource for students, researchers and practitioners in all areas of Artificial Intelligence.
Journal ArticleDOI
Reasoning about temporal relations: The tractable subalgebras of Allen's interval algebra
TL;DR: This article provides the final step in the classification of complexity for satisfiability problems over constraints expressed in Allen's interval algebra, and shows that this algebra contains exactly eighteen maximal tractable subalgebras, and reasoning in any fragment not entirely contained in one of these subalagbras is NP-complete.
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.
Book ChapterDOI
The Complexity of Constraint Languages
David Cohen,Peter Jeavons +1 more
TL;DR: This chapter investigates how the complexity of solving constraint problems varies with the types of constraints which are allowed, and considers some alternative approaches, including a constructive approach that builds new tractable constraint languages by combining simpler languages.
References
More filters
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
A new polynomial-time algorithm for linear programming
TL;DR: It is proved that given a polytopeP and a strictly interior point a εP, there is a projective transformation of the space that mapsP, a toP′, a′ having the following property: the ratio of the radius of the smallest sphere with center a′, containingP′ to theradius of the largest sphere withCenter a′ contained inP′ isO(n).
Journal ArticleDOI
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.