Updating <=, <-chains

@article{Delgrande2002Updating,
  title={Updating <=, <-chains},
  author={James P. Delgrande and Arvind Gupta},
  journal={Inf. Process. Lett.},
  year={2002},
  volume={82},
  pages={261-268}
}
We address the problem of very efficient reasoning and update in ≤, <-chains, where a ≤, <-chain is a directed acyclic graph such that there is a directed path between every pair of vertices, and edges are consistently labelled by ≤ or <. It is easy to show that, subsequent to an O(n) labelling scheme, queries concerning implied ≤ and < relations can be answered in O(1) time. However this scheme does not allow for efficient updates to a chain. We show via a novel encoding of precedence… CONTINUE READING

Citations

Publications citing this paper.

Chapter 19 Temporal CSPs

View 4 Excerpts
Highly Influenced

References

Publications referenced by this paper.
Showing 1-8 of 8 references

74(2):207–248

A. Gerevini, L. K. Schubert. Efficient algorithms for qualitative Intelligence
April • 1995
View 5 Excerpts
Highly Influenced

In Proceedings of the 17th International Conference on Data Engineering

J. Yang, J. Widom. Incremental computation, maintenance of temporal aggregates
pages 51–60, Heidelberg, Germany, • 2001
View 1 Excerpt

editors

S. Geffner, D. Agrawal, +3 authors T. Grust
Advances in Database Technology - EDBT 2000, 7th International Conference on Extending Database Technology, volume 1777 of Lecture Notes in Computer Science, pages 237–253, Konstanz, Germany, • 2000
View 1 Excerpt

Time revisited

Computational Intelligence • 1990

A dichromatic framework for balanced trees

19th Annual Symposium on Foundations of Computer Science (sfcs 1978) • 1978
View 2 Excerpts

Similar Papers

Loading similar papers…