Multi-clause dynamic deduction algorithm based on clause adequacy evaluation and its application

被引:0
|
作者
Cao, Feng [1 ]
Pan, Shicheng [1 ]
Yi, Jianbing [1 ]
Li, Jun [1 ]
机构
[1] School of Information Engineering, Jiangxi University of Science and Technology, Jiangxi, Ganzhou
来源
Huazhong Keji Daxue Xuebao (Ziran Kexue Ban)/Journal of Huazhong University of Science and Technology (Natural Science Edition) | 2024年 / 52卷 / 11期
关键词
automated theorem prover; backtracking mechanism; deduction path; first-order logic; multi-clause dynamic deduction;
D O I
10.13245/j.hust.240468
中图分类号
学科分类号
摘要
To fully reflect the flexibility,synergies,and adequacy of clauses participating in multi-clause dynamic deduction,clauses participating in multi-clause deduction were divided into active clauses and passive clauses,and a different type of clause adequacy evaluation method was proposed,which could effectively reflect clause adequacy deduction and avoid searching for repetitive paths.Based on this clause evaluation method,a multi-clause dynamic deduction algorithm based on full use of clauses was proposed,which could search for optimized deduction paths through backtracking mechanism.The algorithm was applied to the international top prover—Eprover.Taking the 2020 and 2021 international first-order logic automated theorem prover competition problems as test objects,in the standard test time of 300 s,Epover2.4 with the proposed multi-clause dynamic deduction algorithm outperformed the original Epover2.4,which solved 11 theorems and 9 theorems more than the original Epover2.4,respectively,and could solve 14 theorems and 13 theorems respectively that Epover2.4 couldn't solve. Taking problems with a rating of 1 in the thousands of problems for theorem provers (TPTP) as the test object,Eprover2.4 with the proposed multi-clause dynamic deduction algorithm could solve 7 theorems that was not proved by all other provers.Experiment results show that the proposed multi-clause dynamic deduction algorithm can be effectively applied to the first-order logic automated theorem proving. © 2024 Huazhong University of Science and Technology. All rights reserved.
引用
收藏
页码:153 / 160
页数:7
相关论文
共 14 条
  • [1] 50, 2, pp. 82-95, (2022)
  • [2] 50, 2, pp. 105-111, (2022)
  • [3] 33, 6, pp. 2113-2114
  • [4] XU R Q,, LI L M,, ZHAN B H., Verified interactive computation of definite integrals[C], Proc of International Conference on Automated Deduction, pp. 485-503, (2021)
  • [5] KOVACS L, Symbolic computation and automated reasoning for program analysis[C], Proc of Integrated Formal Methods, pp. 20-27, (2016)
  • [6] (2017)
  • [7] (2020)
  • [8] SLANEY J, PALEO B W., Conflict resolution:a first-order resolution calculus with decision literals and conflict-driven clause learning[J], Journal of Automated Reasoning, 12, 4, pp. 1-24, (2016)
  • [9] XU Y, LIU J, CHEN S W, Contradiction separation based dynamic multi-clause synergized automated deduction[J], Information Sciences, 462, 1, pp. 93-113, (2018)
  • [10] (2006)