14 citations · 26 across the 14 of their papers we have counts for
Showing 2019Show all
2 papers · 1 filter
cs.CC2019
Knowledge compilation languages as proof systems
Florent Capelli
In this paper, we study proof systems in the sense of Cook-Reckhow for problems that are higher in the polynomial hierarchy than coNP, in particular, #SAT and maxSAT. We start by e…
cs.DB2019
Solving linear programs on factorized databases
Florent Capelli, Nicolas Crosetti, Joachim Niehren +1
A typical workflow for solving a linear programming problem is to first write a linear program parametrized by the data in a language such as Math GNU Prog or AMPL then call the so…