Skip to main content
SpringerLink
Log in
Book cover

International Conference on Relational Methods in Computer Science

RelMiCS 2005: Relational Methods in Computer Science pp 225–236Cite as

Knuth-Bendix Completion as a Data Structure

  • Conference paper

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 3929))

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.

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Cormen, T.H., Leiserson, C.E., Rivest, R.L.: Introduction to Algorithms. MIT Press, Cambridge (1990)

    MATH  Google Scholar 

  2. 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)

    Google Scholar 

  3. 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)

    Google Scholar 

  4. Kapur, D.: Shostak’s congruence closure as completion. In: Comon, H. (ed.) RTA 1997. LNCS, vol. 1232, pp. 23–37. Springer, Heidelberg (1997)

    Chapter  Google Scholar 

  5. 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)

    Google Scholar 

  6. Nelson, G.: Techniques for program verification. Technical Report CSL-81-10, Xerox Palo Alto Research Center (1981)

    Google Scholar 

  7. Shmueli, O.: Dynamic cycle detection. Information Processing Letters 17(4), 185–188 (1983)

    Article  MathSciNet  MATH  Google Scholar 

  8. 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)

    Google Scholar 

  9. Terese (ed.): Term Rewriting Systems. Cambridge University Press, Cambridge (2003)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Fakultät für Informatik, Universität der Bundeswehr, München, Germany

    Georg Struth

Authors
  1. Georg Struth
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Mathematics, Statistics and Computer Science, St. Francis Xavier University, Antigonish, NS, Canada

    Wendy MacCaull

  2. Department of Computer Science, Brock University, L2S 3A1, St. Catharines, Ontario, Canada

    Michael Winter

  3. Computer Science Department, Brock University, L2S 3A1, St. Catharines, Ontario, Canada

    Ivo Düntsch

Rights and permissions

Reprints 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)

Publish with us

Policies and ethics

Search

Navigation