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
Book
Constraint Processing
TL;DR: Rina Dechter synthesizes three decades of researchers work on constraint processing in AI, databases and programming languages, operations research, management science, and applied mathematics to provide the first comprehensive examination of the theory that underlies constraint processing algorithms.
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.
Journal ArticleDOI
PDDL2.1: an extension to PDDL for expressing temporal planning domains
Maria Fox,Derek Long +1 more
TL;DR: PDDL2.1 as discussed by the authors is a modelling language capable of expressing temporal and numeric properties of planning domains and has been used in the International Planning Competitions (IPC) since 1998.
Journal ArticleDOI
Algorithms for constraint-satisfaction problems: a survey
TL;DR: A large number of problems in AI and other areas of computer science can be viewed as special cases of the constraint-satisfaction problem, and a number of different approaches have been developed for solving them.
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.
References
More filters
Journal ArticleDOI
Enhancement schemes for constraint processing: backjumping, learning, and cutset decomposition
TL;DR: An integrated strategy is described which utilizes the distinct advantages of each scheme and shows that, in hard problems, the average improvement realized by the integrated scheme is 20–25% higher than any of the individual schemes.
Journal ArticleDOI
Tree clustering for constraint networks (research note)
Rina Dechter,Judea Pearl +1 more
TL;DR: A systematic way of regrouping constraints into hierarchical structures capable of supporting search without backtracking is offered.
A Temporal Logic for Reasoning about Processes and Plans.
TL;DR: A common disclaimer by an AI author is that he has neglected temporal considerations to avoid complication; the implication is nearly made that adding a temporal dimension to the research would be a familiar but tedious exercise that would obscure the new material presented by the author.
Journal ArticleDOI
Efficient algorithms for combinatorial problems on graphs with bounded, decomposability—a survey
Journal ArticleDOI
Temporal data base management
Thomas Dean,Drew McDermott +1 more
TL;DR: The system described in this paper extends classical predicate-calculus data bases, such as those used by PROLOG, to deal with time in an efficient and natural manner to perform the temporal analog of (static) reason maintenance.