lolliCoP -- A Linear Logic Implementation of a Lean Connection-Method Theorem Prover for First-Order Classical Logic

When Prolog programs that manipulate lists to manage a collection of resources are rewritten to take advantage of the linear logic resource management provided by the logic programming language Lolli, they can obtain dramatic speedup. Thus far this has been demonstrated only for "toy" applications, such as n-queens. In this paper we present such a reimplementation of the lean connection method prover leanCoP and obtain a theorem prover for first-order classical logic which rivals or outperforms state-of-the-art provers on a significant body of problems