Skip to main content
SpringerLink
Log in

AC-KBO Revisited

  • Conference paper
Functional and Logic Programming (FLOPS 2014)

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

Included in the following conference series:

Abstract

We consider various definitions of AC-compatible Knuth-Bendix orders. The orders of Steinbach and of Korovin and Voronkov are revisited. The former is enhanced to a more powerful AC-compatible order and we modify the latter to amend its lack of monotonicity on non-ground terms. We further present new complexity results. An extension reflecting the recent proposal of subterm coefficients in standard Knuth-Bendix orders is also given. The various orders are compared on problems in termination and completion.

The research described in this paper is supported by the Austrian Science Fund (FWF) international project I963, the bilateral programs of the Japan Society for the Promotion of Science and the KAKENHI Grant No. 25730004.

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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Alarcón, B., Lucas, S., Meseguer, J.: A dependency pair framework for A ∨ C-termination. In: Ölveczky, P.C. (ed.) WRLA 2010. LNCS, vol. 6381, pp. 35–51. Springer, Heidelberg (2010)

    Chapter  Google Scholar 

  2. Arts, T., Giesl, J.: Termination of term rewriting using dependency pairs. TCS 236(1-2), 133–178 (2000)

    Article  MATH  MathSciNet  Google Scholar 

  3. Bachmair, L., Plaisted, D.A.: Termination orderings for associative-commutative rewriting systems. JSC 1, 329–349 (1985)

    MATH  MathSciNet  Google Scholar 

  4. Ben Cherifa, A., Lescanne, P.: Termination of rewriting systems by polynomial interpretations and its implementation. SCP 9(2), 137–159 (1987)

    MATH  MathSciNet  Google Scholar 

  5. Codish, M., Giesl, J., Schneider-Kamp, P., Thiemann, R.: SAT solving for termination proofs with recursive path orders and dependency pairs. JAR 49(1), 53–93 (2012)

    Article  MATH  MathSciNet  Google Scholar 

  6. Dershowitz, N.: Orderings for term-rewriting systems. TCS 17(3), 279–301 (1982)

    Article  MATH  MathSciNet  Google Scholar 

  7. Giesl, J., Kapur, D.: Dependency pairs for equational rewriting. In: Middeldorp, A. (ed.) RTA 2001. LNCS, vol. 2051, pp. 93–107. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  8. Knuth, D., Bendix, P.: Simple word problems in universal algebras. In: Leech, J. (ed.) Computational Problems in Abstract Algebra, pp. 263–297. Pergamon Press, New York (1970)

    Google Scholar 

  9. Korovin, K., Voronkov, A.: An AC-compatible Knuth-Bendix order. In: Baader, F. (ed.) CADE-19. LNCS (LNAI), vol. 2741, pp. 47–59. Springer, Heidelberg (2003)

    Google Scholar 

  10. Korovin, K., Voronkov, A.: Orienting rewrite rules with the Knuth-Bendix order. I&C 183(2), 165–186 (2003)

    MATH  MathSciNet  Google Scholar 

  11. Kusakari, K.: AC-Termination and Dependency Pairs of Term Rewriting Systems. PhD thesis, JAIST (2000)

    Google Scholar 

  12. Kusakari, K., Toyama, Y.: On proving AC-termination by AC-dependency pairs. IEICE Transactions on Information and Systems E84-D(5), 439–447 (2001)

    Google Scholar 

  13. Löchner, B.: Things to know when implementing KBO. JAR 36(4), 289–310 (2006)

    Article  MATH  Google Scholar 

  14. Ludwig, M., Waldmann, U.: An extension of the Knuth-Bendix ordering with LPO-like properties. In: Dershowitz, N., Voronkov, A. (eds.) LPAR 2007. LNCS (LNAI), vol. 4790, pp. 348–362. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  15. Marché, C., Urbain, X.: Modular and incremental proofs of AC-termination. JSC 38(1), 873–897 (2004)

    Google Scholar 

  16. Rubio, A.: A fully syntactic AC-RPO. I&C 178(2), 515–533 (2002)

    MATH  MathSciNet  Google Scholar 

  17. Steinbach, J.: AC-termination of rewrite systems: A modified Knuth-Bendix ordering. In: Kirchner, H., Wechler, W. (eds.) ALP 1990. LNCS, vol. 463, pp. 372–386. Springer, Heidelberg (1990)

    Chapter  Google Scholar 

  18. Thiemann, R., Allais, G., Nagele, J.: On the formalization of termination techniques based on multiset orderings. In: Proc. RTA-23. LIPIcs, vol. 15, pp. 339–354 (2012)

    Google Scholar 

  19. Winkler, S.: Termination Tools in Automated Reasoning. PhD thesis, UIBK (2013)

    Google Scholar 

  20. Winkler, S., Zankl, H., Middeldorp, A.: Ordinals and Knuth-Bendix orders. In: Bjørner, N., Voronkov, A. (eds.) LPAR-18 2012. LNCS, vol. 7180, pp. 420–434. Springer, Heidelberg (2012)

    Chapter  Google Scholar 

  21. Yamada, A., Winkler, S., Hirokawa, N., Middeldorp, A.: AC-KBO revisited. CoRR abs/1403.0406 (2014)

    Google Scholar 

  22. Zankl, H., Hirokawa, N., Middeldorp, A.: KBO orientability. JAR 43(2), 173–201 (2009)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Graduate School of Information Science, Nagoya University, Japan

    Akihisa Yamada

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

    Sarah Winkler & Aart Middeldorp

  3. School of Information Science, JAIST, Japan

    Nao Hirokawa

Authors
  1. Akihisa Yamada
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Sarah Winkler
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Nao Hirokawa
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Aart Middeldorp
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, Ben-Gurion University of the Negev, P.O. Box 653, 84105, Beer Sheva, Israel

    Michael Codish

  2. Graduate School of Information Sciences, Tohoku University, Aza-aoba 6-3-09, 980-8579, Sendai, Japan

    Eijiro Sumii

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer International Publishing Switzerland

About this paper

Cite this paper

Yamada, A., Winkler, S., Hirokawa, N., Middeldorp, A. (2014). AC-KBO Revisited. In: Codish, M., Sumii, E. (eds) Functional and Logic Programming. FLOPS 2014. Lecture Notes in Computer Science, vol 8475. Springer, Cham. https://doi.org/10.1007/978-3-319-07151-0_20

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-07151-0_20

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-07150-3

  • Online ISBN: 978-3-319-07151-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation