A Contradiction Separation Dynamic Deduction Algorithm Based on Optimized Proof Search
Most of the advanced first-order logic automated theorem proving (ATP) systems adopt binary resolution methods as the core inference mechanism, where only two clauses are involved and a complementary pair of literals are eliminated during each deduction step. Recently, a novel multi-clause inference...
Main Authors: | Feng Cao, Yang Xu, Shuwei Chen, Jian Zhong, Guanfeng Wu |
---|---|
Format: | Article |
Language: | English |
Published: |
Springer
2019-11-01
|
Series: | International Journal of Computational Intelligence Systems |
Subjects: | |
Online Access: | https://www.atlantis-press.com/article/125921753/view |
Similar Items
-
A Novel Combinational ATP Based on Contradiction Separation for First-Order Logic
by: Jian Zhong, et al.
Published: (2020-06-01) -
Automated Deduction, Les Arcs, France, July 8-11, 1980 /
by: Conference on Automated Deduction, (5th : 1980 : Les Arcs), et al.
Published: (1980) -
Automated Deduction -- CADE-21 [electronic resource] : 21st International Conference on Automated Deduction Bremen, Germany, July 17-20, 2007 Proceedings /
by: International Conference on Automated Deduction (21st : 2007 : Bremen, Germany), et al.
Published: (2007) -
Bayesian probability estimates are not necessary to make choices satisfying Bayes’ rule in elementary situations
by: Artur eDomurat, et al.
Published: (2015-08-01) -
Observations on Cognitive Judgments
by: McAllester, David
Published: (2004)