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.
CITATION STYLE
Korovin, K., & Voronkov, A. (2003). An Ac-compatible Knuth-Bendix order. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2741, pp. 47–59). Springer Verlag. https://doi.org/10.1007/978-3-540-45085-6_5
Mendeley helps you to discover research relevant for your work.