Skip to main content
SpringerLink
Log in

Derivational Complexity of Knuth-Bendix Orders Revisited

  • Conference paper
Logic for Programming, Artificial Intelligence, and Reasoning (LPAR 2006)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 4246))

Abstract

We study the derivational complexity of rewrite systems \(\mathcal{R}\) compatible with KBO, if the signature of \(\mathcal{R}\) is infinite. We show that the known bounds on the derivation height are preserved, if \(\mathcal{R}\) fulfils some mild conditions. This allows us to obtain bounds on the derivational height of non simply terminating TRSs. Furthermore, we re-establish the 2-recursive upper-bound on the derivational complexity of finite rewrite systems \(\mathcal{R}\) compatible with KBO.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

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 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Terese: Term Rewriting Systems. In: Cambridge Tracks in Theoretical Computer Science, vol. 55. Cambridge University Press, Cambridge (2003)

    Google Scholar 

  2. Hirokawa, N., Middeldorp, A.: Tyrolean termination tool. In: Giesl, J. (ed.) RTA 2005. LNCS, vol. 3467, pp. 175–184. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  3. Giesl, J., Thiemann, R., Schneider-Kamp, P., Falke, S.: Automated termination proofs with Aprove. In: van Oostrom, V. (ed.) RTA 2004. LNCS, vol. 3091, pp. 210–220. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  4. Zantema, H.: Termination of string rewriting proved automatically. J. Automated Reasoning 34, 105–109 (2005)

    Article  MATH  MathSciNet  Google Scholar 

  5. Koprowski, A.: TPA: Termination Proved Automatically (System Description). In: Pfenning, F. (ed.) RTA 2006. LNCS, vol. 4098, pp. 257–266. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  6. Koprowski, A., Zantema, H.: Automation of Recursive Path Ordering for Infinite Labelled Rewrite Systems. In: Furbach, U., Shankar, N. (eds.) IJCAR 2006. LNCS, vol. 4130, pp. 332–346. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  7. Hofbauer, D., Lautemann, C.: Termination proofs and the length of derivations. In: RTA 1989. LNCS, vol. 355, pp. 167–177. Springer, Heidelberg (1989)

    Google Scholar 

  8. Hofbauer, D.: Termination Proofs and Derivation Lengths in Term Rewriting Systems. PhD thesis, Technische Universität Berlin (1991)

    Google Scholar 

  9. Hofbauer, D.: Termination proofs by multiset path orderings imply primitive recursive derivation lengths. Theor. Comput. Sci. 105, 129–140 (1992)

    Article  MATH  MathSciNet  Google Scholar 

  10. Weiermann, A.: Termination proofs for term rewriting systems with lexicographic path ordering imply multiply recursive derivation lengths. Theor. Comput. Sci. 139, 355–362 (1995)

    Article  MATH  MathSciNet  Google Scholar 

  11. Lepper, I.: Derivation lengths and order types of Knuth-Bendix order. Theor. Comput. Sci. 269, 433–450 (2001)

    Article  MATH  MathSciNet  Google Scholar 

  12. Bachmair, L.: Proof methods for equational theories. PhD thesis, University of Illionois (1987)

    Google Scholar 

  13. Zantema, H.: Termination of term rewriting by semantic labelling. Fundamenta Informaticae 24, 89–105 (1995)

    MATH  MathSciNet  Google Scholar 

  14. Jech, T.: Set Theory. Springer, Heidelberg (2002)

    Google Scholar 

  15. Martin, U.: How to chose weights in the Knuth-Bendix ordering. In: Lescanne, P. (ed.) RTA 1987. LNCS, vol. 256, pp. 42–53. Springer, Heidelberg (1987)

    Google Scholar 

  16. Dershowitz, N.: Termination of Rewriting. J. Symbolic Computation (1987)

    Google Scholar 

  17. Korovin, K., Voronkov, A.: Orienting rewrite rules with the Knuth-Bendix order. Information and Compuation 183, 165–186 (2003)

    Article  MATH  MathSciNet  Google Scholar 

  18. Rose, H.: Subrecursion: Functions and Hierarchies. Oxford University Press, Oxford (1984)

    MATH  Google Scholar 

  19. Moser, G., Weiermann, A.: Relating derivation lengths with the slow-growing hierarchy directly. In: Nieuwenhuis, R. (ed.) RTA 2003. LNCS, vol. 2706, pp. 296–310. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  20. Hofbauer, D.: Termination proofs by context-dependent interpretations. In: Middeldorp, A. (ed.) RTA 2001. LNCS, vol. 2051, pp. 108–121. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute of Computer Science, University of Innsbruck, 6020, Innsbruck, Austria

    Georg Moser

Authors
  1. Georg Moser
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. LIX (CNRS, UMR 7161), École Polytechnique, 91128, Palaiseau, France

    Miki Hermann

  2. University of Manchester, UK

    Andrei Voronkov

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Moser, G. (2006). Derivational Complexity of Knuth-Bendix Orders Revisited. In: Hermann, M., Voronkov, A. (eds) Logic for Programming, Artificial Intelligence, and Reasoning. LPAR 2006. Lecture Notes in Computer Science(), vol 4246. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11916277_6

Download citation

  • DOI: https://doi.org/10.1007/11916277_6

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-48281-9

  • Online ISBN: 978-3-540-48282-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation