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

Authors:
Joshua S. Hodas;Naoyuki Tamura
Affiliations:
-;-
Venue:
IJCAR '01 Proceedings of the First International Joint Conference on Automated Reasoning
Year:
2001

Citing 10
Cited 0

Linear logic

Theoretical Computer Science
SETHEO: a high-performance theorem prover

Journal of Automated Reasoning
Logic programming in a fragment of intuitionistic linear logic

Papers presented at the IEEE symposium on Logic in computer science
Efficient implementation of a linear logic programming language

JICSLP'98 Proceedings of the 1998 joint international conference and symposium on Logic programming
SETHEO and E-SETHEO - The CADE-13 Systems

Journal of Automated Reasoning
The TPTP Problem Library

Journal of Automated Reasoning
Programming in Lygon: An Overview

AMAST '96 Proceedings of the 5th International Conference on Algebraic Methodology and Software Technology
KoMeT

CADE-12 Proceedings of the 12th International Conference on Automated Deduction
leanTAP: Lean Tableau-Based Theorem Proving (Extended Abstract)

CADE-12 Proceedings of the 12th International Conference on Automated Deduction
System Description: Teyjus - A Compiler and Abstract Machine Based Implementation of lambda-Prolog

CADE-16 Proceedings of the 16th International Conference on Automated Deduction: Automated Deduction

Quantified Score

Hi-index	0.00

Visualization

Abstract

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-calculus 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.