Sherali-Adams relaxations and indistinguishability in counting logics.
Albert AtseriasElitza N. ManevaPublished in: ITCS (2012)
Keyphrases
- lp relaxation
- expressive power
- lower bound
- mixed integer
- modal logic
- semidefinite
- conditional logic
- encryption scheme
- linear programming
- inference rules
- np hard
- linear program
- propositional calculus
- default reasoning
- propositional dynamic logic
- database views
- t norm
- linear programming relaxation
- convex relaxation
- neural network
- knapsack problem
- feasible solution