Complexity Bounds for Sum-Product Logic via Additive Proof Nets and Petri Nets

DOI10.1109/LICS.2015.18zbMath1394.68251OpenAlexW1583145637MaRDI QIDQ4635793

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) Logic in computer science (03B70) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Structure of proofs (03F07) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Proof-theoretic aspects of linear logic and other substructural logics (03F52)

Related Items (1)

Deep inference and expansion trees for second-order multiplicative linear logic

This page was built for publication: Complexity Bounds for Sum-Product Logic via Additive Proof Nets and Petri Nets