Non-commutative proof construction: a constraint-based approach
From MaRDI portal
Publication:2503402
DOI10.1016/J.APAL.2006.01.002zbMATH Open1175.03038OpenAlexW2125048030MaRDI QIDQ2503402FDOQ2503402
Authors: Jean-Marc Andreoli, Roberto Maieli, Paul Ruet
Publication date: 14 September 2006
Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.apal.2006.01.002
Recommendations
Cites Work
- Logic programming in a fragment of intuitionistic linear logic
- Quantales and (noncommutative) linear logic
- An Efficient Unification Algorithm
- The Mathematics of Sentence Structure
- Une théorie combinatoire des séries formelles
- A new constructive logic: classic logic
- Logic Programming with Focusing Proofs in Linear Logic
- Title not available (Why is that?)
- Focussing and proof construction
- Uniform proofs as a foundation for logic programming
- Forum: A multiple-conclusion specification logic
- Non-commutative logic. I: The multiplicative fragment
- A proof procedure for the logic of hereditary Harrop formulas
- Non-commutative logic II: sequent calculus and phase semantics
- Non-commutative logic. III: Focusing proofs.
- Title not available (Why is that?)
Cited In (6)
Uses Software
This page was built for publication: Non-commutative proof construction: a constraint-based approach
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2503402)