FLOC 2018: FEDERATED LOGIC CONFERENCE 2018

This page contains an index consisting of author-provided keywords.

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

Disclaimer | Powered by EasyChair Smart Program