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
A Polynomial Time Algorithm for Solving Systems of Linear Inequalities with Two Variables Per Inequality
Bengt Aspvall,Yossi Shiloach +1 more
TL;DR: A constructive algorithm for solving systems of linear inequalities (LI) with at most two variables per inequality with time complexity O(mn^3 I) on a random access machine.
Proceedings Article
Reasoning in time and space
Jitendra Malik,Thomas O. Binford +1 more
TL;DR: A wide variety of temporal and spatial specifications can be converted into linear inequalities relating the midpoints of events or boundary surfaces of objects respectively, Linear programming is then used to represent these constraints and perform deductions.
Proceedings ArticleDOI
A polynomial time algorithm for solving systems of linear inequalities with two variables per inequality
Bengt Aspvall,Yossi Shiloach +1 more
TL;DR: A constructive algorithm for solving systems of linear inequalities (LI) with at most two variables per inequality with polynomial in the size of the input is presented.
Proceedings Article
Reasoning about qualitative temporal information
TL;DR: In this article, the authors address two related reasoning tasks that arise in interval and point algebras: given (possibly indefinite) knowledge of the relationships between some intervals or points, (1) find one or more scenarios that are consistent with the information provided, and (2) find all the feasible relations between every pair of interval or points.
Journal ArticleDOI
A mixed-integer linear programming problem which is efficiently solvable
TL;DR: An efficient solution to the mixed-integer linear programming variant where some, but not necessarily all, of the unknowns are required to be integers is given.