Author:
YAMADA AKIHISA,WINKLER SARAH,HIROKAWA NAO,MIDDELDORP AART
Abstract
AbstractEquational theories that contain axioms expressing associativity and commutativity (AC) of certain operators are ubiquitous. Theorem proving methods in such theories rely on well-founded orders that are compatible with the AC axioms. In this paper, 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 version, 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.
Publisher
Cambridge University Press (CUP)
Subject
Artificial Intelligence,Computational Theory and Mathematics,Hardware and Architecture,Theoretical Computer Science,Software
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. ALASCA: Reasoning in Quantified Linear Arithmetic;Tools and Algorithms for the Construction and Analysis of Systems;2023
2. Relaxed Weighted Path Order in Theorem Proving;Mathematics in Computer Science;2020-03-30
3. Certified ACKBO;Proceedings of the 8th ACM SIGPLAN International Conference on Certified Programs and Proofs - CPP 2019;2019