Complexity bounds for sum-product logic via additive proof nets and Petri nets

DOI10.1109/LICS.2015.18zbMATH Open1394.68251OpenAlexW1583145637WikidataQ130866213 ScholiaQ130866213MaRDI QIDQ4635793FDOQ4635793

Authors Willem Heijltjes, Dominic J. D. Hughes

Publication date 23 April 2018

Published in 2015 30th Annual ACM/IEEE Symposium on Logic in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/lics.2015.18

zbMATH Keywords

computational complexitygame theoryPetri netsformal logicsearch problems

Mathematics Subject Classification ID

Applications of game theory (91A80) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Logic in computer science (03B70) Structure of proofs (03F07) Proof-theoretic aspects of linear logic and other substructural logics (03F52) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• Petri nets, Horn programs, linear logic and vector games
• Linear logic by levels and bounded time complexity
• Completeness results for linear logic on Petri nets
• scientific article; zbMATH DE number 1231522
• On the computational complexity of cut-elimination in linear logic.

Cited in

(4)

• The sum-product algorithm for quantitative multiplicative linear logic
• On intuitionistic proof nets with additional rewrite rules and their approximations
• Deep inference and expansion trees for second-order multiplicative linear logic
• scientific article; zbMATH DE number 1948160 (Why is no real title available?)

This page was built for publication: Complexity bounds for sum-product logic via additive proof nets and Petri nets

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