Proof-search in implicative linear logic as a matching problem

DOI10.1007/3-540-44404-1_17MaRDI QIDQ2767024zbMATH OpenFDO

Authors Philippe de Groote

Publication date 22 July 2002

Published in Lecture Notes in Artificial Intelligence (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-44404-1_17

Mathematics Subject Classification ID

Substructural logics (including relevance, entailment, linear logic, Lambek calculus, BCK and BCI logics) (03B47) Proof-theoretic aspects of linear logic and other substructural logics (03F52)

Recommendations

• scientific article; zbMATH DE number 1231522
• Decision problems for propositional linear logic
• On structuring proof search for first order linear logic
• Proof finding algorithms for implicational logics
• Connection-based proof construction in linear logic

Cited in

(5)

• Proof finding algorithms for implicational logics
• SAT-based proof search in intermediate propositional logics
• Resource management in linear logic proof search revisited
• scientific article; zbMATH DE number 7199586 (Why is no real title available?)
• Partial matching for analogy discovery in proofs and counter-examples

This page was built for publication: Proof-search in implicative linear logic as a matching problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2767024)