Complexity bounds for sum-product logic via additive proof nets and Petri nets
- Submitting institution
-
The University of Bath
- Unit of assessment
- 11 - Computer Science and Informatics
- Output identifier
- 188317979
- Type
- E - Conference contribution
- DOI
-
10.1109/LICS.2015.18
- Title of conference / published proceedings
- Proceedings of the 30th ACM/IEEE Symposium on Logic in Computer Science (LICS), 2015
- First page
- 80
- Volume
- -
- Issue
- -
- ISSN
- 1043-6871
- Open access status
- Out of scope for open access requirements
- Month of publication
- July
- Year of publication
- 2015
- URL
-
-
- Supplementary information
-
-
- Request cross-referral to
- -
- Output has been delayed by COVID-19
- No
- COVID-19 affected output statement
- -
- Forensic science
- No
- Criminology
- No
- Interdisciplinary
- No
- Number of additional authors
-
1
- Research group(s)
-
-
- Citation count
- 2
- Proposed double-weighted
- No
- Reserve for an output with double weighting
- No
- Additional information
- Introduces a new correctness technique for additive proof nets and uses it to prove a range of complexity results. These proof nets embody contraction and co-contraction, two main carriers of complexity in logic and computation. They occur (in some guise) in many models that separate contraction from other semantic content: in game semantics as "thick subtrees" [Boudes 2009], in combinatorial proofs as "skew fibrations" [Hughes 2006; Heijltjes, Hughes, and Strassburger 2019] and even in Herbrand's Theorem for first-order logic, from 1930, and the related Expansion Tree Proofs [Miller 1987]. Our technique and results extend to these models.
- Author contribution statement
- -
- Non-English
- No
- English abstract
- -