Input Proofs and Rank One Cutting Planes
From MaRDI portal
Publication:4018154
Recommendations
- On the rank of cutting-plane proof systems
- Cutting-plane proofs in polynomial space
- On the complexity of cutting-plane proofs
- On the complexity of cutting-plane proofs using split cuts
- Structure of proofs and the complexity of cut elimination
- scientific article; zbMATH DE number 1263234
- Lower bounds for cutting planes proofs with small coefficients
- Rank bounds and integrality gaps for cutting planes procedures
- On the relative complexity of resolution refinements and cutting planes proof systems
- scientific article; zbMATH DE number 515726
Cited in
(16)- Resolution vs. cutting plane solution of inference problems: Some computational experience
- Logic applied to integer programming and integer programming applied to logic
- New methods for computing inferences in first order logic
- Generalized resolution for 0--1 linear inequalities
- Branch-and-cut solution of inference problems in propositional logic
- Mixed logical-linear programming
- On the lengths of tree-like and dag-like cutting plane refutations of Horn constraint systems. Horn constraint systems and cutting plane refutations
- Restricted cutting plane proofs in Horn constraint systems
- MaxSolver: An efficient exact algorithm for (weighted) maximum satisfiability
- What we can learn from conflicts in propositional satisfiability
- Analyzing read-once cutting plane proofs in Horn systems
- Achieving consistency with cutting planes
- Resolution Width and Cutting Plane Rank Are Incomparable
- Learning from conflicts in propositional satisfiability
- Unit refutability of Horn constraint systems -- certification and parallel complexity
- Algorithms for the maximum satisfiability problem
This page was built for publication: Input Proofs and Rank One Cutting Planes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4018154)
