Skip to main content
SpringerLink
Log in
Book cover

International Computing and Combinatorics Conference

COCOON 1995: Computing and Combinatorics pp 591–596Cite as

A physical model for the satisfiability problem

  • Session 10B: Algorithms
  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 959))

Abstract

An one to one and onto mapping between the set of conjunctive normal forms and a subset of the potential functions of static electricity fields is constructed; and it has been further proved that a conjunctive normal form is satisfiable if and only if the minimum of the corresponding potential function is zero. It is also shown that the local search method has the same physical model as the gradient method given in this paper.

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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Gu, J., Efficient Local Search for Very Large-Scale Satisfiability Problem, SIGART Bulletin, Vol. 3, No. 1, Jan. 1992, pp.8–12.

    Google Scholar 

  2. Gu, J., Local Search For Satisfiability (SAT) Problem, IEEE Transactions on Systems, Man, and Cybernetics, Vol. 23, No. 4, July/August 1993.

    Google Scholar 

  3. Gu, J., Global Optimization For Satisfiability (SAT) Problem, IEEE Transactions on Knowledge and Data Engineering, Vol.6, No. 3, June 1994.

    Google Scholar 

  4. Li, W., Huang, W., A mathematical-physical approach to the satisfiability problem, Science in China, Vol.38, No.1, 1995.

    Google Scholar 

  5. Mitchell,D.,Selman,B.,and Levesque,H.J.(1992),Hard and easy distributions of SAT problems. Proceedings AAAI-92,San Jose,CA,459–465.

    Google Scholar 

  6. Selman,B.and Levesque,H.J.,and Mitchell,D.G.(1992), A New Method for Solving Hard Satisfiability Problems, Proc. AAAI-92,San Jose,CA,440–446.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dept. of Computer Science, Huazhong University of Science and Technology, 430074, Wu Han, P.R.China

    Huang Wenqi

  2. Dept. of Computer Science, Beijing University of Aeronautics and Astronautics, 100083, Beijing, P.R.China

    Li Wei, Lu Weifeng & Zhang Yuping

Authors
  1. Huang Wenqi
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Li Wei
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Lu Weifeng
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Zhang Yuping
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Ding-Zhu Du Ming Li

Rights and permissions

Reprints and permissions

Copyright information

© 1995 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Wenqi, H., Wei, L., Weifeng, L., Yuping, Z. (1995). A physical model for the satisfiability problem. In: Du, DZ., Li, M. (eds) Computing and Combinatorics. COCOON 1995. Lecture Notes in Computer Science, vol 959. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0030881

Download citation

  • DOI: https://doi.org/10.1007/BFb0030881

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-60216-3

  • Online ISBN: 978-3-540-44733-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation