Temporal constraint networks
- 1 May 1991
- journal article
- Published by Elsevier in Artificial Intelligence
- Vol. 49 (1-3) , 61-95
- https://doi.org/10.1016/0004-3702(91)90006-6
Abstract
No abstract availableKeywords
This publication has 28 references indexed in Scilit:
- Constraint propagation with interval labelsArtificial Intelligence, 1987
- Efficient algorithms for combinatorial problems on graphs with bounded decomposability — A surveyBIT Numerical Mathematics, 1985
- Steiner trees, partial 2–trees, and minimum IFI networksNetworks, 1983
- An Algorithm to Compact a VLSI Symbolic Layout with Mixed ConstraintsIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 1983
- Search rearrangement backtracking and polynomial average timeArtificial Intelligence, 1983
- Deciding Linear Inequalities by Computing Loop ResiduesJournal of the ACM, 1981
- Fast Algorithms for Solving Path ProblemsJournal of the ACM, 1981
- A Unified Approach to Path ProblemsJournal of the ACM, 1981
- Synthesizing constraint expressionsCommunications of the ACM, 1978
- Regular Algebra Applied to Path-finding ProblemsIMA Journal of Applied Mathematics, 1975