Classical Propositional Linear Logic Theorem Prover on a Linear Logic Programming Language Compiler System

Abstract

This paper describes a theorem prover of propositional classical linear logic implemented on a linear logic programming language developed by the authors. In this LL2LLP system, efficient proof search is realized by transforming classical linear logic formulas into intuitionistic linear logic formulas, and by compiling them into LLP abstract machine instructions. The evaluated performance of LL2LLP was better than other existing provers for most of the benchmark problems.