An efficient contradiction separation based automated deduction algorithm for enhancing reasoning capability
Automated theorem prover (ATP) for first-order logic (FOL), as a significant inference engine,
is one of the hot research areas in the field of knowledge representation and automated …
is one of the hot research areas in the field of knowledge representation and automated …
An empirical assessment of progress in automated theorem proving
An Empirical Assessment of Progress in Automated Theorem Proving | SpringerLink Skip to
main content Advertisement SpringerLink Account Menu Find a journal Publish with us Track …
main content Advertisement SpringerLink Account Menu Find a journal Publish with us Track …
The 9th IJCAR automated theorem proving system competition–CASC-J9
G Sutcliffe - Ai communications, 2018 - content.iospress.com
Abstract The CADE ATP System Competition (CASC) is the annual evaluation of fully
automatic, classical logic Automated Theorem Proving (ATP) systems. CASC-J9 was the …
automatic, classical logic Automated Theorem Proving (ATP) systems. CASC-J9 was the …
A multi-clause dynamic deduction algorithm based on standard contradiction separation rule
In the past decades, automated theorem proving (ATP) for first-order logic has made good
progress, in which binary resolution inference rule plays a crucial role. However, as shown …
progress, in which binary resolution inference rule plays a crucial role. However, as shown …
Fully reusing clause deduction algorithm based on standard contradiction separation rule
An automated theorem proving (ATP) system's capacity for reasoning is significantly
influenced by the inference rules it uses. The recently introduced standard contradiction …
influenced by the inference rules it uses. The recently introduced standard contradiction …
GRUNGE: A grand unified ATP challenge
This paper describes a large set of related theorem proving problems obtained by
translating theorems from the HOL4 standard library into multiple logical formalisms. The …
translating theorems from the HOL4 standard library into multiple logical formalisms. The …
A complementary ratio based clause selection method for contradiction separation dynamic deduction
Automated reasoning is a key research area of Artificial Intelligence (AI) and has attracted
much greater attention in recent years due to the demands of trustworthy AI, where binary …
much greater attention in recent years due to the demands of trustworthy AI, where binary …
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 …
binary resolution methods as the core inference mechanism, where only two clauses are …
Some synergized clause selection strategies for contradiction separation based automated deduction
The synergized dynamic contradiction separation based automated deduction theory has
provided a novel logic based automated deduction reasoning framework, which extends the …
provided a novel logic based automated deduction reasoning framework, which extends the …
A novel algorithmic construction for deductions of categorical polysyllogisms by Carroll's diagrams
In this work, with the help of a calculus system syllogistic logic with Carroll's diagrams
(SLCD), we construct a useful algorithm for the possible deductions of polysyllogisms …
(SLCD), we construct a useful algorithm for the possible deductions of polysyllogisms …