Skip to main content
SpringerLink
Log in

An AC-Compatible Knuth-Bendix Order

  • Conference paper
Automated Deduction – CADE-19 (CADE 2003)

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

Included in the following conference series:

Abstract

We introduce a family of AC-compatible Knuth-Bendix simplification orders which are AC-total on ground terms. Our orders preserve attractive features of the original Knuth-Bendix orders such as existence of a polynomial-time algorithm for comparing terms; computationally efficient approximations, for instance comparing weights of terms; and preference of light terms over heavy ones. This makes these orders especially suited for automated deduction where efficient algorithms on orders are desirable.

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. Baader, F., Nipkow, T.: Term Rewriting and All That. Cambridge University Press, Cambridge (1998)

    Google Scholar 

  2. Bachmair, L.: Associative-commutative reduction orderings. Information Processing Letters 43(1), 21–27 (1992)

    Article  MATH  MathSciNet  Google Scholar 

  3. Bachmair, L., Plaisted, D.: Associative path orderings. In: Jouannaud, J.-P. (ed.) RTA 1985. LNCS, vol. 202, pp. 241–254. Springer, Heidelberg (1985)

    Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  5. Dershowitz, N., Hsiang, J., Josephson, A., Plaisted, D.: Associative-commutative rewriting. In: Proc. International Joint Conference on Artificial Intelligence (IJCAI), pp. 940–944 (1983)

    Google Scholar 

  6. Dershowitz, N., Manna, Z.: Proving termination with multiset orderings. Communications of the ACM (CACM) 22(8), 465–476 (1979)

    Article  MATH  MathSciNet  Google Scholar 

  7. Dick, J., Kalmus, J., Martin, U.: Automating the Knuth-Bendix ordering. Acta Informatica 28(2), 95–119 (1990)

    Article  MATH  MathSciNet  Google Scholar 

  8. Gnaedig, I., Lescanne, P.: Proving termination of associative commutative rewriting systems by rewriting. In: Siekmann, J.H. (ed.) CADE 1986. LNCS, vol. 230, pp. 52–61. Springer, Heidelberg (1986)

    Google Scholar 

  9. Kapur, D., Sivakumar, G.: A total, ground path ordering for proving termination of ac-rewrite systems. In: Comon, H. (ed.) RTA 1997. LNCS, vol. 1232, pp. 142–156. Springer, Heidelberg (1997)

    Google Scholar 

  10. Kapur, D., Sivakumar, G.: Proving associative-communicative termination using rpo-compatible orderings. In: Caferra, R., Salzer, G. (eds.) FTP 1998. LNCS (LNAI), vol. 1761, pp. 39–61. Springer, Heidelberg (2000)

    Chapter  Google Scholar 

  11. Kapur, D., Sivakumar, G., Zhang, H.: A new method for proving termination of ac-rewrite systems. In: Veni Madhavan, C.E., Nori, K.V. (eds.) FSTTCS 1990. LNCS, vol. 472, pp. 133–148. Springer, Heidelberg (1990)

    Google Scholar 

  12. Kapur, D., Sivakumar, G., Zhang, H.: A path ordering for proving termination of ac rewrite systems. Journal of Automated Reasoning 14(2), 293–316 (1995)

    Article  MATH  MathSciNet  Google Scholar 

  13. Korovin, K., Voronkov, A.: Verifying orientability of rewrite rules using the Knuth-Bendix order. In: Middeldorp, A. (ed.) RTA 2001. LNCS, vol. 2051, pp. 137–153. Springer, Heidelberg (2001); full version to appear in Information and Computation

    Chapter  Google Scholar 

  14. Korovin, K., Voronkov, A.: Orienting equalities using the Knuth–Bendix order. In: Proceedings of the 18th IEEE Symposium on Logic in Computer Science, LICS 2003 (2003) (to appear)

    Google Scholar 

  15. Marché, C.: Associative-commutative reduction orderings via head-preserving interpretations. Technical Report 95-2, E.N.S. de Cachan (1995)

    Google Scholar 

  16. Narendran, P., Rusinowitch, M.: Any ground associative-commutative theory has a finite canonical system. In: Book, R.V. (ed.) RTA 1991. LNCS, vol. 488, pp. 423–434. Springer, Heidelberg (1991)

    Google Scholar 

  17. Nieuwenhuis, R., Rubio, A.: A precedence-based total AC-compatible ordering. In: Kirchner, C. (ed.) RTA 1993. LNCS, vol. 690, pp. 374–388. Springer, Heidelberg (1993)

    Google Scholar 

  18. Rubio, A.: A fully syntactic AC-RPO. To appear in Information and Computation

    Google Scholar 

  19. Rubio, A.: A fully syntactic AC-RPO. In: Narendran, P., Rusinowitch, M. (eds.) RTA 1999. LNCS, vol. 1631, pp. 133–147. Springer, Heidelberg (1999)

    Chapter  Google Scholar 

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

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. MPI für Informatik,  

    Konstantin Korovin

  2. University of Manchester,  

    Andrei Voronkov

Authors
  1. Konstantin Korovin
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Andrei Voronkov
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Theoretical Computer Science, TU Dresden, Germany

    Franz Baader

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Korovin, K., Voronkov, A. (2003). An AC-Compatible Knuth-Bendix Order. In: Baader, F. (eds) Automated Deduction – CADE-19. CADE 2003. Lecture Notes in Computer Science(), vol 2741. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-45085-6_5

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-45085-6_5

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-40559-7

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation