Proof search in first-order linear logic and other cut-free sequent calculi
- 17 December 2002
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
Abstract
No abstract availableThis publication has 11 references indexed in Scilit:
- Horn programming in linear logic is NP-completePublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- Logic programming in a fragment of intuitionistic linear logicPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Linearizing intuitionistic implicationPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Constant-only multiplicative linear logic is NP-completeTheoretical Computer Science, 1994
- First-order linear logic without modalities is NEXPTIME-hardTheoretical Computer Science, 1994
- Foundations of proof search strategies design in linear logicPublished by Springer Nature ,1994
- Decision problems for propositional linear logicAnnals of Pure and Applied Logic, 1992
- Proof search in the intuitionistic sequent calculusPublished by Springer Nature ,1992
- Linear logicTheoretical Computer Science, 1987
- An Efficient Unification AlgorithmACM Transactions on Programming Languages and Systems, 1982