Complexity and algorithms for reasoning about time
- 1 November 1993
- journal article
- Published by Association for Computing Machinery (ACM) in Journal of the ACM
- Vol. 40 (5), 1108-1133
- https://doi.org/10.1145/174147.169675
Abstract
No abstract availableKeywords
This publication has 17 references indexed in Scilit:
- Counting endpoint sequences for interval orders and interval graphsDiscrete Mathematics, 1993
- Temporal query processing with indefinite informationArtificial Intelligence in Medicine, 1991
- Recognizing circle graphs in polynomial timeJournal of the ACM, 1989
- Containment Graphs, Posets, and Related Classes of GraphsAnnals of the New York Academy of Sciences, 1989
- Chronological orderings of interval graphsDiscrete Applied Mathematics, 1984
- Maintaining knowledge about temporal intervalsCommunications of the ACM, 1983
- On the detection of structure in attitudes and developmental processes.Psychological Review, 1973
- Partial orders of dimension 2Networks, 1972
- A Characterization of Comparability Graphs and of Interval GraphsCanadian Journal of Mathematics, 1964
- Partially Ordered SetsAmerican Journal of Mathematics, 1941