Automated Deduction—CADE-11
Automated Deduction—CADE-11
复制标题
自动推导—CADE-11
DOI:
10.1007/3-540-55602-8
复制
发表时间:
1992
影响因子:
1.3
通讯作者:
A. Bundy
中科院分区:
文献类型:
--
作者:
T. Walsh;A. Nunes;A. Bundy
We describe a program for finding closed form solutions to finite sums. The program was built to test the applicability of theproof planningsearch control technique in a domain of mathematics outwith induction. This experiment was successful. The series summing program extends previous work in this area and was built in a short time just by providing new series summing methods to our existing inductive theorem proving systemCLAM.One surprising discovery was the usefulness of therippletactic in summing series. Rippling is the key tactic for controlling inductive proofs, and was previously thought to be specialised to such proofs. However, it turns out to be the key sub-tactic used by all the main tactics for summing series. The only change required was that it had to be supplemented by adifference matchingalgorithm to set up some initial meta-level annotations to guide the rippling process. In inductive proofs these annotations are provided by the application of mathematical induction. This evidence suggests that rippling, supplemented by difference matching, will find wide application in controlling mathematical proofs.