Theoretical Computer Science
Logic programming in a fragment of intuitionistic linear logic
Papers presented at the IEEE symposium on Logic in computer science
Efficient resource management for linear logic proof search
Theoretical Computer Science - Special issue on proof-search in type-theoretic languages
Connection methods in linear logic and proof nets construction
Theoretical Computer Science - Special issue on proof-search in type-theoretic languages
Term Indexing
Foundations of Proof Search Strategies Design in Linear Logic
LFCS '94 Proceedings of the Third International Symposium on Logical Foundations of Computer Science
linTAP: A Tableau Prover for Linear Logic
TABLEAUX '99 Proceedings of the International Conference on Automated Reasoning with Analytic Tableaux and Related Methods
Resource-Distribution via Boolean Constraint (Extended Abstract)
CADE-14 Proceedings of the 14th International Conference on Automated Deduction
CADE-15 Proceedings of the 15th International Conference on Automated Deduction: Automated Deduction
Focusing the inverse method for linear logic
CSL'05 Proceedings of the 19th international conference on Computer Science Logic
A Logical Characterization of Forward and Backward Chaining in the Inverse Method
Journal of Automated Reasoning
Magically constraining the inverse method using dynamic polarity assignment
LPAR'10 Proceedings of the 17th international conference on Logic for programming, artificial intelligence, and reasoning
A logical characterization of forward and backward chaining in the inverse method
IJCAR'06 Proceedings of the Third international joint conference on Automated Reasoning
Focusing the inverse method for linear logic
CSL'05 Proceedings of the 19th international conference on Computer Science Logic
ILC: a foundation for automated reasoning about pointer programs
ESOP'06 Proceedings of the 15th European conference on Programming Languages and Systems
| Hi-index | 0.00 |
We present the theory and implementation of a theorem prover for first-order intuitionistic linear logic based on the inverse method. The central proof-theoretic insights underlying the prover concern resource management and focused derivations, both of which are traditionally understood in the domain of backward reasoning systems such as logic programming. We illustrate how resource management, focusing, and other intrinsic properties of linear connectives affect the basic forward operations of rule application, contraction, and forward subsumption. We also present some preliminary experimental results obtained with our implementation.