Generalized resolution for 0--1 linear inequalities

DOI10.1007/BF01531033zbMath0955.68503MaRDI QIDQ1354004

John N. Hooker

Publication date: 13 May 1997

Published in: Annals of Mathematics and Artificial Intelligence (Search for Journal in Brave)

Mathematics Subject Classification ID

Boolean programming (90C09)

Related Items

Projection, consistency, and George Boole, Many-valued logic and mixed integer programming, Simplifying clausal satisfiability problems, Achieving consistency with cutting planes, Logic cuts for multilevel generalized assignment problems., Projecting systems of linear inequalities with binary variables, Mixed logical-linear programming, Non-clausal redundancy properties, Learn to relax: integrating \(0-1\) integer linear programming with pseudo-Boolean conflict-driven search, A branching algorithm to solve binary problem in uncertain environment: an application in machine allocation problem, Logic cuts for processing networks with fixed charges

Cites Work

• Unnamed Item
• The intractability of resolution
• Edmonds polytopes and a hierarchy of combinatorial problems
• A Way to Simplify Truth Functions
• Solving 0-1 Integer Programming Problems Arising from Large Scale Planning Models
• Logical Reduction Methods in Zero-One Programming—Minimal Preferred Variables
• Input Proofs and Rank One Cutting Planes
• Coefficient reduction for inequalities in 0–1 variables
• The complexity of theorem-proving procedures
• The Problem of Simplifying Truth Functions