MetaCartSign in to MyCiteSeer

Include Citations | Advanced Search | Help

Include Citations | Advanced Search | Help

  linTAP: A tableau prover for linear logic (1999)

Download:
Download as a PDF | Download as a PS
by Fachgebiet Intellektik, Fachbereich Informatik, Technische Hochschule Darmstadt, Heiko Mantel, Heiko Mantel, Jens Otten, Jens Otten
International Conference TABLEAUX’99
http://aida.intellektik.informatik.tu-darmstadt.de/~kipr/Pubs/../TR/1999/99-04.ps.gz
Add To MetaCart

Abstract:

Abstract. linTAP is a tableau prover for the multiplicative and exponential fragment M?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.

Citations

340 First-Order Logic and Automated Theorem Proving (2 nd ed – Fitting - 1996
284 An efficient unification algorithm – Martelli, Montanari - 1982
223 Logic programming with focusing proofs in linear logic – Andreoli - 1992
93 Automated Deduction in Nonclassical Logics – Wallen - 1990
73 leanTAP: Lean tableau-based deduction – Beckert, Posegga - 1995
68 Forum: A multiple-conclusion specification logic – Miller - 1996
53 Generating plans in linear logic – Masseron, Tollu, et al. - 1990
52 Efficient resource management for linear logic proof search – Cervesato, Hodas, et al. - 1996
40 Normal process representatives – Gehlot, Gunter - 1990
38 Constant-Only Multiplicative Linear Logic is NP-Complete – Lincoln, Winkler - 1994
36 Free variable tableaux for propositional modal logics – Beckert, Goré - 1997
32 On proof normalization in linear logic – Galmiche, Perrier - 1994
29 Let's plan it deductively – Bibel - 1998
28 Proof strategies in linear logic – Tammet - 1994
24 leanT A P : lean, tableau-based theorem proving – Beckert, Posegga - 1994
24 T-string-unification: unifying prefixes in non-classical proof methods – Otten, Kreitz - 1996
21 Resource-distribution via boolean constraints – Harland, Pym
18 ileanTAP: An intuitionistic theorem prover – Otten - 1997
16 Logic programming in a fragment of linear logic – Hodas, Miller - 1994
13 The action-as-implication paradigm – Fronhofer - 1996
9 Connection methods in linear logic fragments and proof nets – Galmiche - 1996
8 Developing a matrix characterization for MELL – Mantel - 1998
2 User's Guide of a Linear Logic Theorem Prover (llprover – Tamura - 1995
View or Download | Add to My Collection | Correct Errors