Advertisement

The Phase Transition of the Linear Inequalities Problem

  • Alessandro Armando
  • Felice Peccia
  • Silvio Ranise
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2239)

Abstract

One of the most important problems in the polynomial class is checking the satisfiabilityof systems of linear inequalities over the rationals. In this paper, we investigate the phase-transition behavior of this problem by adopting a methodology which has been proved very successful on NP-complete problems. The methodology is based on the concept of constrainedness, which characterizes an ensemble of randomly generated problems and allows to predict the location of the phase transition in solving such problems. Our work complements and confirms previous results obtained for other polynomial problems. The approach provides a new characterization of the performance of the Phase I of the Simplex algorithm and allows us to predict its behavior on very large instances by exploiting the technique of finite size scaling.

Keywords

Phase Transition Constraint Satisfaction Problem Simplex Algorithm Size Scaling Finite Size Scaling 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [BBC+99]
    B. Bollobas, C. Borgs, J. Chayes, J. Kim, and D. Wilson. The scaling window of the 2-sat transition. Technical report, Microsoft Research, 1999.Google Scholar
  2. [Ber]
    Michel Berkelaar. LP Solve 3.2. Available at the URL: ftp://ftp.es.ele.tue.nl/pub/lp_solve/.
  3. [BM88]
    R.S. Boyer and J S. Moore. Integrating Decision Procedures into Heuristic Theorem Provers: A Case Studyof Linear Arithmetic. Machine Intelligence, 11:83–124, 1988.MathSciNetGoogle Scholar
  4. [Chv83]
    Vavšek Chvátal. Linear Programming. W. H. Freeman and Company, New York, 1983.zbMATHGoogle Scholar
  5. [Dan63]
    G. B. Dantzig. Linear Programming and Extensions. Princeton University Press, Princeton, New Jersey, 1963.zbMATHGoogle Scholar
  6. [GMPS97]
    I. P. Gent, E. MacIntyre, P. Prosser, and P. Shaw. The constrainedness of arc consistency. Lecture Notes in Computer Science, 1330:327–340, 1997.Google Scholar
  7. [GMPW95]
    I. P. Gent, E. MacIntyre, P. Prosser, and T. Walsh. Scaling effiects in the CSP phase transition. Lecture Notes in Computer Science, 976:70–87, 1995.Google Scholar
  8. [GMPW96]
    Ian P. Gent, Ewan MacIntyre, Patrick Prosser, and Toby Walsh. The constrainedness of search. In Proceedings of the Thirteenth National Conference on Artificial Intelligence and the Eighth Innovative Applications of Artificial Intelligence Conference, pages 246–252, Menlo Park, August 4-8 1996. AAAI Press / MIT Press.Google Scholar
  9. [GS96]
    S. A. Grant and B. M. Smith. The arc and path consistencyphase transitions. Lecture Notes in Computer Science, 1118:541–542, 1996.Google Scholar
  10. [HHWT97]
    T. A. Henzinger, P-H. Ho, and H. Wong-Toi. HYTECH: A model checker for hybrid systems. In Proc. 9th International Computer Aided Verification Conference, pages 460–463, 1997.Google Scholar
  11. [JMSY92]
    Joxan Jaffar, Spiro Michaylov, Peter J. Stuckey, and Roland H. C. Yap. The CLP(R) language and system. TOPLAS, 14(3):339–395, July1992.CrossRefGoogle Scholar
  12. [KS94]
    S. Kirkpatrick and B. Selman. Critical behavior in the satisfiability of random boolean expressions. Science, 264:1297–1301, 1994.CrossRefMathSciNetGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2001

Authors and Affiliations

  • Alessandro Armando
    • 1
  • Felice Peccia
    • 1
  • Silvio Ranise
    • 1
    • 2
  1. 1.DIST-Università degli Studi di GenovaGenovaItaly
  2. 2.LORIA-INRIA-LorraineVillers les NancyCedexFrance

Personalised recommendations