Simplifying clausal satisfiability problems

DOI10.1007/BFb0016842zbMath1495.68156MaRDI QIDQ5096298

Peter Barth

Publication date: 16 August 2022

Published in: Constraints in Computational Logics (Search for Journal in Brave)

zbMATH Keywords

integer programmingpropositional logicsatisfiability problemlinear programming relaxationminimal support

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Boolean programming (90C09) Classical propositional logic (03B05) Computational aspects of satisfiability (68R07)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• 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

This page was built for publication: Simplifying clausal satisfiability problems