Proof Search Optimizations for Non-Clausal Connection Calculi.
Jens Otten · NORA - Norwegian Open Research Archives · 2018
The paper presents several proof search optimization techniques for non-clausal connection calculi. These techniques are implemented and integrated into the non-clausal connection prover nanoCoP. Their effectiveness is evaluated on the problems in the TPTP library. Together with a fixed strategy scheduling, these techniques are the basis of the new version 1.1 of nanoCoP. https://nbn-resolving.org/urn:nbn:de:0074-2162-4