Skip to main content

linTAP: A tableau prover for linear logic

Citations of this article
Mendeley users who have this article in their library.
Get full text


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.




Mantel, H., & Otten, J. (1999). linTAP: A tableau prover for linear logic. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1617, pp. 217–231). Springer Verlag.

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free