FLOC 2018: FEDERATED LOGIC CONFERENCE 2018

B
Binary Encoding	Resolution and the binary encoding of combinatorial principles (PDF, talk)
bounded arithmetic	Towards theories for positive polynomial time and monotone proofs with extension (PDF, talk) Bounded induction without parameters (PDF, ) Complexity of expander-based reasoning and the power of monotone proofs (PDF, talk)
branching programs	Branching Program Complexity of Canonical Search Problems and Proof Complexity of Formulas (PDF, talk)
C
Cutting planes	Branching Program Complexity of Canonical Search Problems and Proof Complexity of Formulas (PDF, talk)
D
dual-rail encoding	On Dual-Rail Based MaxSAT Solving (PDF, talk)
E
equational theories	Towards theories for positive polynomial time and monotone proofs with extension (PDF, talk)
expander graphs	Complexity of expander-based reasoning and the power of monotone proofs (PDF, talk)
F
Frege systems	Complexity of expander-based reasoning and the power of monotone proofs (PDF, talk)
H
hypercube optimization	Optimization over the Boolean Hypercube via Sums of Nonnegative Circuit Polynomials (PDF, talk)
I
induction rules	Bounded induction without parameters (PDF, )
Intuitionistic logic	Towards theories for positive polynomial time and monotone proofs with extension (PDF, talk)
K
knowledge compilation	Proof systems for #SAT based on restricted circuits (PDF, talk)
L
Lower bound techniques	Size, Cost and Capacity: A Semantic Technique for Hard Random QBFs (PDF)
Lower Bounds	Resolution and the binary encoding of combinatorial principles (PDF, talk) Resolution with Counting: Different Moduli and Tree-Like Lower Bounds (PDF, talk)
M
MaxSAT resolution	On Dual-Rail Based MaxSAT Solving (PDF, talk)
MaxSAT solving	On Dual-Rail Based MaxSAT Solving (PDF, talk)
monotone	Complexity of expander-based reasoning and the power of monotone proofs (PDF, talk)
Monotone complexity	Towards theories for positive polynomial time and monotone proofs with extension (PDF, talk)
Monotone proofs	Towards theories for positive polynomial time and monotone proofs with extension (PDF, talk)
N
nonnegativity certificate	Optimization over the Boolean Hypercube via Sums of Nonnegative Circuit Polynomials (PDF, talk)
O
OBDD	Branching Program Complexity of Canonical Search Problems and Proof Complexity of Formulas (PDF, talk)
P
parameter-free axioms	Bounded induction without parameters (PDF, )
polynomial simulation	On Dual-Rail Based MaxSAT Solving (PDF, talk)
polynomial upper bounds	On Dual-Rail Based MaxSAT Solving (PDF, talk)
proof complexity	Size, Cost and Capacity: A Semantic Technique for Hard Random QBFs (PDF) Proof systems for #SAT based on restricted circuits (PDF, talk) Short Proofs in QBF Expansion (PDF) Branching Program Complexity of Canonical Search Problems and Proof Complexity of Formulas (PDF, talk) Resolution and the binary encoding of combinatorial principles (PDF, talk) Resolution with Counting: Different Moduli and Tree-Like Lower Bounds (PDF, talk)
propositional model counting	Proof systems for #SAT based on restricted circuits (PDF, talk)
Q
Q-Resolution	Short Proofs in QBF Expansion (PDF) The Symmetry Rule for Quantified Boolean Formulas (PDF)
QBF	Short Proofs in QBF Expansion (PDF)
Quantified Boolean Formulas	Size, Cost and Capacity: A Semantic Technique for Hard Random QBFs (PDF) The Symmetry Rule for Quantified Boolean Formulas (PDF)
R
read-once branching programs	Branching Program Complexity of Canonical Search Problems and Proof Complexity of Formulas (PDF, talk)
relative entropy programming	Optimization over the Boolean Hypercube via Sums of Nonnegative Circuit Polynomials (PDF, talk)
Resolution	Branching Program Complexity of Canonical Search Problems and Proof Complexity of Formulas (PDF, talk) Resolution with Counting: Different Moduli and Tree-Like Lower Bounds (PDF, talk)
S
sums of nonnegative circuit polynomials	Optimization over the Boolean Hypercube via Sums of Nonnegative Circuit Polynomials (PDF, talk)
sums of squares	Optimization over the Boolean Hypercube via Sums of Nonnegative Circuit Polynomials (PDF, talk)
Symmetry Rule	The Symmetry Rule for Quantified Boolean Formulas (PDF)
W
Witnessing	Towards theories for positive polynomial time and monotone proofs with extension (PDF, talk)
witnessing theorems	Bounded induction without parameters (PDF, )

Disclaimer | Powered by EasyChair Smart Program