Abstract
At present, most of the first-order logic theorem provers use a binary-resolution method, which can effectively solve the general first-order logic problems to a certain extent. However, the cooperative processing ability of this method for multiple clauses is insufficient, and it is easy to cause rapid expansion of clause set in the deductive process. In this paper, we propose a novel first-order logic theorem prover based on the standard contradiction separation (S-CS) rule. This prover can realize the dynamic cooperative deduction of multiple clauses in each deduction process, as well as it can effectively learn and control the deduction process. This paper incorporates the S-CS rule with the well-known prover Prover9, to build a combined system, which effectively integrates the advantages of the two methods, not only improves the binary-resolution prover’s ability, but also solves more than 100 problems that cannot be solved by other provers.
Article PDF
Explore related subjects
Discover the latest articles, news and stories from top researchers in related subjects.Avoid common mistakes on your manuscript.
References
B. Blanchet, Modeling and verifying security protocols with the applied Pi calculus and ProVerif, Found. Trends Privacy Secur. 1 (2016), 1–135.
G. Shi, Toward automated reasoning for analog IC design by symbolic computation – a survey, Integr. VLSI J. 60 (2018), 117–131.
V. D’Silva, D. Kroening, G. Weissenbacher, A survey of automated techniques for formal software verification, IEEE Trans. Comput. Aided Design Integr. Circuits Syst. 27 (2008), 1165–1178.
J.A. Robinson, A machine-oriented logic based on the resolution principle, J. ACM. 12 (1965), 23–41.
S. Schulz, M. Möhrmann, Performance of clause selection heuristics for saturation-based theorem proving, Automated Reasoning, Springer, Cham, Switzerland, 2016, pp. 330–345.
P. Baumgartner, U. Furbach, B. Pelzer, Hyper tableaux with equality, International Conference on Automated Deduction–CADE, Springer, Berlin, Heidelberg, 2007, pp. 492–507.
Y. Xu, J. Liu, S. Chen, Contradiction separation based dynamic multi-clause synergized automated deduction, Inf. Sci. 462 (2018), 93–113.
F. Cao, Y. Xu, S. Chen, A contradiction separation dynamic deduction algorithm based on optimized proof search, Int. J. Comput. Intell. Syst. 12 (2019), 1245–1254.
M. Baaz, U. Egly, A. Leitsch, Normal form transformations, in: Handbook of Automated Reasoning, vol. I, chap. 5, North Holland, 2001, pp. 273–333.
L. Bachmair, H. Ganzinger, Resolution theorem proving, in: Handbook of Automated Reasoning, vol. I, chap. 2, Elsevier Science 2001, pp. 19–99.
A. Voronkov, Automated reasoning: past story and new trends, in Proceedings of the Eighteenth International Joint Conference on Artificial Intelligence, Morgan Kaufmann, Acapulco, Mexico, 2003, pp. 1607–1612. https://www.escholar.manchester.ac.uk/uk-ac-man-scw:2h1156
L. Kovács, A. Voronkov, First-order theorem proving and vampire, in International Conference on Computer Aided Verification, Saint Petersburg, Russia, 2013, pp. 1–35.
Y. Jiang, P. Papapanagiotou, J. Fleuriot, Machine learning for inductive theorem proving, in: J. Fleuriot, D. Wang, J. Calmet (Eds.), Artificial Intelligence and Symbolic Computation, Springer International Publishing, Cham, Switzerland, 2018, pp. 87–103.
S. Loos, G. Irving, C. Szegedy, Deep network guided proof search, arXiv: Artificial Intelligence (2017).
T. Tammet, GKC: a reasoning system for large knowledge bases, in: P. Fontaine (Ed.), Automated Deduction - CADE 27, vol. 11716, Springer International Publishing, Cham, Switzerland, 2019, pp. 538–549.
W. Mccune, OTTER 3.3 reference manual, Office Sci. Tech. Inf. Tech. Rep, 11, (2007), 217–220.
W. Mccune, L. Wos, Otter-the CADE-13 competition incarnations, J. Automat. Reason. 18 (1997), 211–220.
G. Sutcliffe, The CADE ATP system competition, The competition problems, 2020, http://tptp.org/CASC/
G. Sutcliffe, The TPTP problem library and associated infrastructure, J. Automat. Reason. 43 (2009), 337.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
This is an open access article distributed under the CC BY-NC 4.0 license (https://doi.org/creativecommons.org/licenses/by-nc/4.0/).
About this article
Cite this article
Zhong, J., Xu, Y. & Cao, F. A Novel Combinational ATP Based on Contradiction Separation for First-Order Logic. Int J Comput Intell Syst 13, 672–680 (2020). https://doi.org/10.2991/ijcis.d.200521.001
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.2991/ijcis.d.200521.001