Theory of linear and integer programming
Theory of linear and integer programming
A quantitative approach to logical inference
Decision Support Systems
Extended Horn sets in propositional logic
Journal of the ACM (JACM)
Propositional lower bounds: Algorithms and complexity
Annals of Mathematics and Artificial Intelligence
Easy Cases of Probabilistic Satisfiability
Annals of Mathematics and Artificial Intelligence
Propositional Lower Bounds: Generalization and Algorithms
JELIA '98 Proceedings of the European Workshop on Logics in Artificial Intelligence
Discrete Applied Mathematics
On Exact Selection of Minimally Unsatisfiable Subformulae
Annals of Mathematics and Artificial Intelligence
Probability Logic and Optimization SAT: The PSAT and CPA Models
Annals of Mathematics and Artificial Intelligence
Solving peptide sequencing as satisfiability
Computers & Mathematics with Applications
| Hi-index | 0.00 |
In propositional logic, several problems, such as satisfiability, MAX SAT and logical inference, can be formulated as integer programs. In this paper, we consider sets of clauses for which the corresponding integer programs can be solved as linear programs. We prove that balanced sets of clauses have this property.