Theoretical Computer Science
Automated deduction in nonclassical logics
Automated deduction in nonclassical logics
Logic programming in a fragment of intuitionistic linear logic
Papers presented at the IEEE symposium on Logic in computer science
On proof normalization in linear logic
MFPS '92 Selected papers of the conference on Meeting on the mathematical foundations of programming semantics, part I : linear logic: linear logic
Constant-only multiplicative linear logic is NP-complete
MFPS '92 Selected papers of the conference on Meeting on the mathematical foundations of programming semantics, part I : linear logic: linear logic
First-order logic and automated theorem proving (2nd ed.)
First-order logic and automated theorem proving (2nd ed.)
Forum: a multiple-conclusion specification logic
ALP Proceedings of the fourth international conference on Algebraic and logic programming
An Efficient Unification Algorithm
ACM Transactions on Programming Languages and Systems (TOPLAS)
A Matrix Characterization for MELL
JELIA '98 Proceedings of the European Workshop on Logics in Artificial Intelligence
Generating Plans in Linear Logic
Proceedings of the Tenth Conference on Foundations of Software Technology and Theoretical Computer Science
T-String Unification: Unifying Prefixes in Non-classical Proof Methods
TABLEAUX '96 Proceedings of the 5th International Workshop on Theorem Proving with Analytic Tableaux and Related Methods
ileanTAP: An Intuitionistic Theorem Prover
TABLEAUX '97 Proceedings of the International Conference on Automated Reasoning with Analytic Tableaux and Related Methods
Free Variable Tableaux for Propositional Modal Logics
TABLEAUX '97 Proceedings of the International Conference on Automated Reasoning with Analytic Tableaux and Related Methods
Efficient Resource Management for Linear Logic Proof Search
ELP '96 Proceedings of the 5th International Workshop on Extensions of Logic Programming
leanTAP: Lean Tableau-Based Theorem Proving (Extended Abstract)
CADE-12 Proceedings of the 12th International Conference on Automated Deduction
Connection-Based Proof Construction in Linear Logic
CADE-14 Proceedings of the 14th International Conference on Automated Deduction
Resource-Distribution via Boolean Constraint (Extended Abstract)
CADE-14 Proceedings of the 14th International Conference on Automated Deduction
IJCAI'97 Proceedings of the Fifteenth international joint conference on Artifical intelligence - Volume 2
Proof-Search and Countermodel Generation in Propositional BI Logic
TACS '01 Proceedings of the 4th International Symposium on Theoretical Aspects of Computer Software
Clausal connection-based theorem proving in intuitionistic first-order logic
TABLEAUX'05 Proceedings of the 14th international conference on Automated Reasoning with Analytic Tableaux and Related Methods
A logical characterization of forward and backward chaining in the inverse method
IJCAR'06 Proceedings of the Third international joint conference on Automated Reasoning
A focusing inverse method theorem prover for first-order linear logic
CADE' 20 Proceedings of the 20th international conference on Automated Deduction
| Hi-index | 0.00 |
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.