6 citations · 9 across the 6 of their papers we have counts for
Showing 2015 · cs.LOShow all
2 papers · 2 filters
cs.LO2015★ 2 cited
Memoization for Unary Logic Programming: Characterizing PTIME
Clément Aubert, Marc Bagnol, Thomas Seiller
We give a characterization of deterministic polynomial time computation based on an algebraic structure called the resolution semiring, whose elements can be understood as logic pr…
cs.LO2015★ 1 cited
MALL proof equivalence is Logspace-complete, via binary decision diagrams
Marc Bagnol
Proof equivalence in a logic is the problem of deciding whether two proofs are equivalent modulo a set of permutation of rules that reflects the commutative conversions of its cut-…