English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
Add to Basket
  Local TagsRelease HistoryDetailsSummary

Released
Conference Paper

AC-compatible Knuth-Bendix Order

MPS-Authors
/persons/resource/persons44827

Korovin,  Konstantin
Programming Logics, MPI for Informatics, Max Planck Society;

/persons/resource/persons45678

Voronkov,  Andrei
Programming Logics, MPI for Informatics, Max Planck Society;

/persons/resource/persons44050

Baader,  Franz
Programming Logics, MPI for Informatics, Max Planck Society;

External Resource
No external resources are shared
Fulltext (restricted access)
There are currently no full texts shared for your IP range.
Fulltext (public)
There are no public fulltexts stored in PuRe
Supplementary Material (public)
There is no public supplementary material available
Citation

Korovin, K., & Voronkov, A. (2003). AC-compatible Knuth-Bendix Order. In Automated deduction, CADE-19: 19th International Conference on Automated Deduction (pp. 47-59). Berlin, Germany: Springer.


Cite as: https://hdl.handle.net/11858/00-001M-0000-000F-2BD8-3
Abstract
We introduce a family of AC-compatible Knuth-Bendix simplification orderings which are AC-total on ground terms. Our orderings preserve attractive features of the original Knuth-Bendix orderings such as polynomial algorithm for comparing terms; the orderings admit computationally efficient approximations like checking weights of terms; and prefer light terms to heavy ones. This makes them especially suited for automated deduction where efficient treatment of orderings is desirable.