Abstract
We propose a cooperating Knuth-Bendix completion procedure for transitive relations and equivalences and apply it as a data structure for novel dynamic strongly connected component algorithms. Benefits are separation of declarative and procedural concerns, simple generic specifications and flexible optimisation via execution strategies.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Cormen, T.H., Leiserson, C.E., Rivest, R.L.: Introduction to Algorithms. MIT Press, Cambridge (1990)
Demetrescu, C., Italiano, G.: Fully dynamic transitive closure: Breaking through the O(n 2) barrier. In: Proc. 41th IEEE Symp. on Foundations of Computer Science, pp. 381–389. IEEE Computer Society Press, Los Alamitos (2000)
Henzinger, M., King, V.: Fully dynamic biconnectivity and transitive closure. In: Proc. 36th Symp. on Foundations of Computer Science, pp. 664–672. IEEE Computer Society Press, Los Alamitos (1995)
Kapur, D.: Shostak’s congruence closure as completion. In: Comon, H. (ed.) RTA 1997. LNCS, vol. 1232, pp. 23–37. Springer, Heidelberg (1997)
King, V.: Fully dynamic algorithms for maintaining all-time shortest paths and transitive closure in digraphs. In: Proc. 40th IEEE Symp. on Foundations of Computer Science, pp. 81–89. IEEE Computer Society Press, Los Alamitos (1999)
Nelson, G.: Techniques for program verification. Technical Report CSL-81-10, Xerox Palo Alto Research Center (1981)
Shmueli, O.: Dynamic cycle detection. Information Processing Letters 17(4), 185–188 (1983)
Struth, G.: Knuth-Bendix completion for non-symmetric transitive relations. In: van den Brand, M., Verma, R. (eds.) Second International Workshop on Rule-Based Programming (RULE 2001). Electronic Notes in Theoretical Computer Science, vol. 59. Elsevier Science Publishers, Amsterdam (2001)
Terese (ed.): Term Rewriting Systems. Cambridge University Press, Cambridge (2003)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Struth, G. (2006). Knuth-Bendix Completion as a Data Structure. In: MacCaull, W., Winter, M., Düntsch, I. (eds) Relational Methods in Computer Science. RelMiCS 2005. Lecture Notes in Computer Science, vol 3929. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11734673_18
Download citation
DOI: https://doi.org/10.1007/11734673_18
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-33339-5
Online ISBN: 978-3-540-33340-1
eBook Packages: Computer ScienceComputer Science (R0)