Input Proofs and Rank One Cutting Planes
From MaRDI portal
Publication:4018154
DOI10.1287/ijoc.1.3.137zbMath0752.90051OpenAlexW2017351350MaRDI QIDQ4018154
Publication date: 16 January 1993
Published in: ORSA Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/ijoc.1.3.137
resolutioncutting plane algorithmcomplete inference methodsHorn clauses in propositional logicnon-Horn inference problems
Related Items
What we can learn from conflicts in propositional satisfiability, Generalized resolution for 0--1 linear inequalities, Resolution vs. cutting plane solution of inference problems: Some computational experience, Branch-and-cut solution of inference problems in propositional logic, Logic applied to integer programming and integer programming applied to logic, Analyzing read-once cutting plane proofs in Horn systems, Achieving consistency with cutting planes, Learning from conflicts in propositional satisfiability, Mixed logical-linear programming, MaxSolver: An efficient exact algorithm for (weighted) maximum satisfiability, Algorithms for the maximum satisfiability problem, New methods for computing inferences in first order logic
