Investigation of Maximum and Minimum Satisfiability Problems Using L-Partition

Authors:
A. V. Adel'shin
Affiliations:
Omsk Affiliated Institute of Mathematics, Siberian Branch, Russian Academy of Sciences, Omsk, Russia
Venue:
Automation and Remote Control
Year:
2004

Citing 2
Cited 0

The Minimum Satisfiability Problem

SIAM Journal on Discrete Mathematics
The complexity of theorem-proving procedures

STOC '71 Proceedings of the third annual ACM symposium on Theory of computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

Problems of the maximum and the minimum satisfiability on the basis of the integer linear programming and L-partition are studied. The L-structure of polyhedrons of the problems is investigated. Families are set up of unweighted problems of the maximum and the minimum satisfiability, the powers of L-coverings of which grow exponentially with an increase in the number of variables in a formula.