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

First Author: Heijltjes W

Attributed to: Efficient and Natural Proof Systems funded by EPSRC

Abstract

No abstract provided

Bibliographic Information

Digital Object Identifier: http://dx.doi.org/10.1109/lics.2015.18

Publication URI: http://dx.doi.org/10.1109/lics.2015.18

Type: Conference/Paper/Proceeding/Abstract