Skip to main content
SpringerLink
Log in

Investigation of Maximum and Minimum Satisfiability Problems Using L-Partition

  • Published:
Automation and Remote Control Aims and scope Submit manuscript

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

REFERENCES

  1. Kolokolov, A.A., Regular Partitions and Truncations in Integer Programming, Sib. Zh. Issl. Operats., 1994, no. 2, pp. 18–39.

  2. Kohli, R., Krishnmurti, R., and Mirchandani, P., The Minimum Satisfiability Problem, SIAM J. Discret. Math., 1994, no. 9, pp. 275–283.

  3. Garey, M. and Johnson, D., Computers and Intractability, San Fransisco: Freeman, 1979. Translated under the title Vychislitel'nye mashiny i trudnoreshaemye zadachi, Moscow: Mir, 1982.

    Google Scholar 

  4. Cook, S.A., The Complexity of Theorem-Proving Procedure, Proc. 3rd Annual ACM-Sympos. Theory Comput., 1971, pp. 151–159.

  5. Gu, J., Purdom, P., Franco, J., and Wah, B., Algorithms for the Satisfiability (SAT) Problem: A Survey, DIMACS Series in Discrete Math. Theor. Comput. Sci., 1996, p. 131.

  6. Cheriyan, J., Conningham, W.H., Tuncel, L. et al., A Linear Programming and Rounding Approach to MAX2-SAT, DIMACS Series in Discrete Math. Theor. Comput. Sci., 1996, vol. 26, pp. 395–414.

    Google Scholar 

  7. Joy, S., Mitchell, J., and Borchers, B., A Branch and Cut Algorithm for MAX-SAT, DIMACS Series in Discrete Math. Theor. Comput. Sci., 1997, vol. 35, pp. 519–536.

    Google Scholar 

  8. Adel'shin, A.V., A Maximum Satisfiability Problem and Some Integer Programming Algorithms. Algebra and Linear Optimization, Proc. International Seminar Devoted to the Ninetieth Birthday of S.N. Chernikov, Ekateringburg, 2002, pp. 235–239.

  9. Adel'shin, A.V., Investigation of a Minimum Satisfiability Problem Using L-Partition, Inform. Byul. Assots. Mat. Program., Ekateringbug, 2003, no. 10, pp. 19–20.

  10. Kolokolov, A.A., Adel'shin, A.V., and Cheredova, Yu.N., Application of the L-Partition to Investigation of Some Satisfiability Problems, Proc. 12th Baikal International Conf., Irkutsk, 2001, vol. 1, pp. 166–172.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Omsk Affiliated Institute of Mathematics, Siberian Branch, Russian Academy of Sciences, Omsk, Russia

    A. V. Adel'shin

Authors
  1. A. V. Adel'shin
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Adel'shin, A.V. Investigation of Maximum and Minimum Satisfiability Problems Using L-Partition. Automation and Remote Control 65, 388–395 (2004). https://doi.org/10.1023/B:AURC.0000019369.16127.34

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/B:AURC.0000019369.16127.34

Keywords

Search

Navigation