32 search results - page 2 / 7 » On the complexity of cutting plane proofs using split cuts |
ISSAC
1994
Springer
13 years 9 months ago
1994
Springer
Many standard functions, such as the logarithm and square root functions, cannot be de ned continuously on the complex plane. Mistaken assumptions about the properties of these fu...
SAT
2007
Springer
13 years 11 months ago
2007
Springer
Abstract. We continue a study initiated by Kraj´ıˇcek of a Resolutionlike proof system working with clauses of linear inequalities, R(CP). For all proof systems of this kind Kra...
LICS
2008
IEEE
13 years 11 months ago
2008
IEEE
Using appropriate notation systems for proofs, cutreduction can often be rendered feasible on these notations. Explicit bounds can be given. Developing a suitable notation system ...
STOC
2010
ACM
14 years 2 months ago
2010
ACM
We present a generic method for converting any family of unsatisfiable CNF formulas that require large resolution rank into CNF formulas whose refutation requires large rank for p...
UAI
2008
13 years 6 months ago
2008
In this work we present Cutting Plane Inference (CPI), a Maximum A Posteriori (MAP) inference method for Statistical Relational Learning. Framed in terms of Markov Logic and inspi...