linTAP: a tableau prover for linear logic
First published in
Number in series
Lecture Notes in Computer Science 1617 LNAI: 217-231 (1999)
Contribution to Conference
linTAP is a tableau prover for the multiplicative and exponential fragmentM?LL of Girards linear logic. It proves the validity of a given formula by constructing an analytic tableau and ensures the linear validity using prefix unification. We present the tableau calculus used by linTAP, an algorithm for prefix unification in linear logic, the linTAP implementation, and some experimental results obtained with linTAP.