Skip to main content
SpringerLink
Log in

Characterising Space Complexity Classes via Knuth-Bendix Orders

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

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

  • 785 Accesses

Abstract

We study three different space complexity classes: LINSPACE, PSPACE, and ESPACE and give complete characterisations for these classes. We employ rewrite systems, whose termination can be shown by Knuth Bendix orders. To capture LINSPACE, we consider positively weighted Knuth Bendix orders. To capture PSPACE, we consider unary rewrite systems, compatible with a Knuth Bendix order, where we allow for padding of the input. And to capture ESPACE, we make use of a non-standard generalisation of the Knuth Bendix order.

This research is partly supported by FWF (Austrian Science Fund) project P20133.

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. Avanzini, M., Moser, G.: Complexity Analysis by Rewriting. In: Garrigue, J., Hermenegildo, M.V. (eds.) FLOPS 2008. LNCS, vol. 4989, pp. 130–146. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  2. Avanzini, M., Moser, G.: Dependency pairs and polynomial path orders. In: Treinen, R. (ed.) RTA 2009. LNCS, vol. 5595, pp. 48–62. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

  3. Baader, F., Nipkow, T.: Term Rewriting and All That. Cambridge University Press, Cambridge (1998)

    Book  MATH  Google Scholar 

  4. Bonfante, G., Cichon, A., Marion, J.Y., Touzet, H.: Algorithms with polynomial interpretation termination proof. JFP 11(1), 33–53 (2001)

    MathSciNet  MATH  Google Scholar 

  5. Bonfante, G., Marion, J.Y., Moyen, J.Y.: Quasi-interpretations and small space bounds. In: Giesl, J. (ed.) RTA 2005. LNCS, vol. 3467, pp. 150–164. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  6. Hofbauer, D.: Termination Proofs and Derivation Lengths in Term Rewriting Systems. Ph.D. thesis, Technische Universität Berlin (1992)

    Google Scholar 

  7. Hofbauer, D.: Termination proofs with multiset path orderings imply primitive recursive derivation lengths. TCS 105(1), 129–140 (1992)

    Article  MATH  Google Scholar 

  8. Hofbauer, D., Lautemann, C.: Termination Proofs and the Length of Derivation. In: Dershowitz, N. (ed.) RTA 1989. LNCS, vol. 355, pp. 167–177. Springer, Heidelberg (1989)

    Chapter  Google Scholar 

  9. Knuth, D., Bendix, P.: Simple word problems in universal algebras. In: Leech, J. (ed.) Computational problems in abstract algebra. Pergamon, Oxford (1970)

    Google Scholar 

  10. Koprowski, A., Waldmann, J.: Arctic Termination ...Below Zero. In: Voronkov, A. (ed.) RTA 2008. LNCS, vol. 5117, pp. 202–216. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  11. Kozen, D.: Theory of Computation. Springer, Heidelberg (2006)

    MATH  Google Scholar 

  12. Lepper, I.: Derivation lengths and order types of Knuth-Bendix orders. TCS 269, 433–450 (2001)

    Article  MathSciNet  MATH  Google Scholar 

  13. Marion, J.Y.: Analysing the Implicit Complexity of Programs. IC 183, 2–18 (2003)

    MathSciNet  MATH  Google Scholar 

  14. Moser, G.: Derivational complexity of Knuth Bendix orders revisited. In: Hermann, M., Voronkov, A. (eds.) LPAR 2006. LNCS (LNAI), vol. 4246, pp. 75–89. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  15. Moser, G., Schnabl, A.: The Derivational Complexity Induced by the Dependency Pair Method. In: Treinen, R. (ed.) RTA 2009. LNCS, vol. 5595, pp. 255–260. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

  16. Moser, G., Schnabl, A., Waldmann, J.: Complexity Analysis of Term Rewriting Based on Matrix and Context Dependent Interpretations. In: Proc. of 28th FSTTICS, pp. 304–315. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, Germany (2008)

    Google Scholar 

  17. TeReSe: Term Rewriting Systems, Cambridge Tracks in Theoretical Computer Science, vol. 55. Cambridge University Press, Cambridge (2003)

    Google Scholar 

  18. Weiermann, A.: Termination proofs by lexicographic path orderings yield multiply recursive derivation lengths. Theoretical Computer Science 139(1), 355–362 (1995)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. INRIA-LORIA, Nancy, France

    Guillaume Bonfante

  2. Institute of Computer Science, University of Innsbruck, Austria

    Georg Moser

Authors
  1. Guillaume Bonfante
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Georg Moser
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Institut für Computersprachen 185.2, Theory and Logic Group, TU Wien, Favoritenstraße 9-11, A-1040, Vienna, Austria

    Christian G. Fermüller

  2. School of Computer Science, University of Manchester, Oxford Road, Kilburn Building, M13 9PL, Manchester, United Kingdom

    Andrei Voronkov

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Bonfante, G., Moser, G. (2010). Characterising Space Complexity Classes via Knuth-Bendix Orders. In: Fermüller, C.G., Voronkov, A. (eds) Logic for Programming, Artificial Intelligence, and Reasoning. LPAR 2010. Lecture Notes in Computer Science, vol 6397. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-16242-8_11

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-16242-8_11

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-16241-1

  • Online ISBN: 978-3-642-16242-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation