Simplifying clausal satisfiability problems
From MaRDI portal
Publication:5096298
DOI10.1007/BFb0016842zbMath1495.68156MaRDI QIDQ5096298
Publication date: 16 August 2022
Published in: Constraints in Computational Logics (Search for Journal in Brave)
integer programming; propositional logic; satisfiability problem; linear programming relaxation; minimal support
68Q25: Analysis of algorithms and problem complexity
90C09: Boolean programming
03B05: Classical propositional logic
68R07: Computational aspects of satisfiability
Cites Work
- On the complexity of cutting-plane proofs
- The intractability of resolution
- Resolution vs. cutting plane solution of inference problems: Some computational experience
- Generalized resolution for 0--1 linear inequalities
- Branch-and-cut solution of inference problems in propositional logic
- Running time experiments on some algorithms for solving propositional satisfiability problems
- A Machine-Oriented Logic Based on the Resolution Principle
- A Computing Procedure for Quantification Theory
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item