Exact and approximate reasoning about temporal relations1
- 1 August 1990
- journal article
- Published by Wiley in Computational Intelligence
- Vol. 6 (3), 132-144
- https://doi.org/10.1111/j.1467-8640.1990.tb00130.x
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- The complexity of some polynomial network consistency algorithms for constraint satisfaction problemsArtificial Intelligence, 1985
- Towards a general theory of action and timeArtificial Intelligence, 1984
- Maintaining knowledge about temporal intervalsCommunications of the ACM, 1983
- A Sufficient Condition for Backtrack-Free SearchJournal of the ACM, 1982
- Synthesizing constraint expressionsCommunications of the ACM, 1978
- Consistency in networks of relationsArtificial Intelligence, 1977
- Networks of constraints: Fundamental properties and applications to picture processingInformation Sciences, 1974
- A Note on Dijkstra's Shortest Path AlgorithmJournal of the ACM, 1973
- Theoretical Improvements in Algorithmic Efficiency for Network Flow ProblemsJournal of the ACM, 1972
- A note on two problems in connexion with graphsNumerische Mathematik, 1959