Skip to main content
SpringerLink
Log in

Combining Constraint Logic Programming Techniques for Solving Linear Problems

  • Conference paper
  • First Online:
Book cover New Trends in Constraints (WC 1999)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 1865))

Included in the following conference series:

  • 216 Accesses

Abstract

This paper presents a system for solving mixed infinite and finite domains linear problem using a Constraint Logic Programming (CLP) Environment. The contributions of our system are introduced in two directions. Firstly, unlike existing systems, the splitting of a variable’s domain is based on the right hand side value of the first constraint in which it is involved rather than the splitting over an arbitrary value. Also, the splitting process is automatically performed by the system, when needed, rather than being the user’s responsibility. Secondly, a relatively transparent integration is met between two Constraint Logic Programming solvers. The former is a Partial Look Ahead solver over rationals as well as integers with the support of the aforementioned domain splitting mechanism, while the latter is a Simplex-Like solver named CLP(Q). Each counterpart submits some services to the other in order that the coherent system improves the search efficiency and tackles their individual main defects.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. S.E. Abdel-Rahman. Investigating a New Constraint solving Approach within Constraint Logic Programming M.Sc, Computer and Information Sciences Dept., Institute of Statistical Studies and Research, Cairo University, 1999.

    Google Scholar 

  2. R. Beckmann and J. Hermann. „Using Constraint Logic Programming in memory synthesis for General Purpose Computer“. In Proceedings of European Design and Test Conference IEEE, pp. 619–629, USA, 1997.

    Google Scholar 

  3. C.k. Chiu and J.H.H. Lee. „Towards Practical Interval Constraint Solving in Logic Programming“. The International Logic Programming Symposium, USA, 1994.

    Google Scholar 

  4. CLP (BNR), User Guide and Reference Applied Logic System Inc., USA, 1996.

    Google Scholar 

  5. P. Codognet and D. Diaz. „Compiling Constraints in clp(FD)“. In the Journal of logic Programming, Vol. 27, pp. 100–199, 1996.

    Article  MathSciNet  Google Scholar 

  6. M. Dincbas; P. Van Hentenryck; H. Simonis; A. Aggoun; T. Graft and F. Bertheir. „The Constraint Logic Programming Language CHIP“. In Proceedings of the Fifth Generation Computer Systems-88 Tokyo, Japan, 1988.

    Google Scholar 

  7. V. Gaede and M.G. Wallace. „An Informal Introduction to Constraint Database Systems, in Constraint Databases and Applications“. Lecture Notes in Computer Science, Vol. 1191, pp. 7–52, Springer-Verlag ISBN 3-540-62501-1, 1996.

    Google Scholar 

  8. C. Gervet. „Large Combinatorial Optimization Problems: A Methodology for Hybrid Models and Solutions“. In JFPLC’98, Nantes, France, 1998.

    Google Scholar 

  9. P. Girodias and E. Cerney. “Interface Timing Verification with Delay Correlation using Constraint Logic Programming“. In Proceedings of European Design and Test Conference IEEE, pp. 12–19, USA, 1997.

    Google Scholar 

  10. M.T. Hajian; H. El-Sakkout; M. Wallace; J.M. Lever and E.B. Richards. „Towards a Closer Integration of Finite Domain Propagation and Simplex-Based Algorithm“. IC-Parc, Imperial College, London, England, 1995.

    Google Scholar 

  11. C. Holzbaur. „Metastructure vs. Attributed Variables in the Context of Extensible Unification“. Programming Language Implementation and Logic Programming, Springer, LNCS 631, pp. 260–268, 1992.

    Chapter  Google Scholar 

  12. C. Holzbaur. „A Specialized, Incremental Solved Form for Systems of Linear Inequalities“. Department of Medical Cybernetics and Artificial Intelligence, University of Vienna, Austria, 1994.

    Google Scholar 

  13. E. Hyvonen. „Constraint Reasoning Based on Interval Arithmetic: The Tolerance Propagation Approach“. The Artificial Intelligence Magazine, Elsevier, Vol. 58, pp. 71–112, 1992.

    MathSciNet  Google Scholar 

  14. E. Jacquest-Lagreze. „Hybrid Methods for Large Scale Optimization Problems: an OR perspective. In PAPPACT’98, pp. 1–10, 1998.

    Google Scholar 

  15. J. Jaffar and J. Lassez. „Constraint Logic Programming“. In Proceedings 14th Symposium on Principles of Programming Languages, pp. 111–119. ACM, Munich, 1987.

    Book  Google Scholar 

  16. J. Jaffar; S. Michaylov; P. Stuckey and R. Yap. „The CLP(R) Language and System“. Technical report, RC 126292 (#72336) 11/15/90, IBM Research Division, 1992.

    Google Scholar 

  17. V. Kumar. „Algorithms for Constraint Satisfaction Problems: A Survey“. The Artificial Intelligence Magazine, Elsevier, Vol. 13(1), pp. 32–44, 1992.

    Google Scholar 

  18. G.F. Luger and W.A. Stubblefield. Artificial Intelligence Structures and Strategies for Complex Problem Solving. The Benjamin/Cummings Publishing Company Inc., USA, 1996.

    Google Scholar 

  19. R. Moore. Interval Analysis. Prentice-Hall Inc., London, 1965.

    Google Scholar 

  20. T.L. Provost and M. Wallace. „Generalized Constraint Propagation Over The CLP Scheme“. The Journal of Logic Programming, Elsevier, Vol. 16(3–4), pp. 319–360, 1993.

    Article  MATH  Google Scholar 

  21. R. Rodosek; M.G. Wallace and M.T. Hajian. „A New Approach to Integrating Mixed Integer Programming and Constraint Logic Programming“. IC-Parc, Imperial College, London, England, 1998.

    Google Scholar 

  22. Sicstus Prolog User’s Manual. Swidish Institute of Computer Science, Sweden, 1997.

    Google Scholar 

  23. H.A. Taha. Operations Research: An Introduction. Prentice-Hall Inc., London, 1997.

    MATH  Google Scholar 

  24. P. Van Hentenryck. Constraint Satisfaction in Logic Programming. MIT Press, USA, 1989.

    Google Scholar 

  25. P. Van Hentenryck; V. Saraswat and Y. Deville. „Constraint Logic Programming over Finite Domains: the Design, Implementation, and Applications of cc(FD)“. Technical report, Computer Science Department, Brown University, 1992.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Associate Professor, Department of Computer Science, Faculty of Computers and Information, Cairo University, Cairo, Egypt

    Reem Bahgat

  2. Research Student, Department of Computer and Information Sciences, Institut of Satistical Studies and Research, Cairo University, Cairo, Egypt

    Samir E. Abdel-Rahman

Authors
  1. Reem Bahgat
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Samir E. Abdel-Rahman
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. CWI, Kruislaan 413, 1090, GB Amsterdam, The Netherlands

    Krzysztof R. Apt  & Eric Monfroy  & 

  2. Department of Computer Science, University of Cyprus, 75 Kallipoleos Str., 1678, Nicosia, Cyprus

    Antonis C. Kakas

  3. Department of Pure and Applied Mathematics, University of Padua, Via G. B. Belzoni 7, 35131, Padua, Italy

    Francesca Rossi

Rights and permissions

Reprints and permissions

Copyright information

© 2000 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Bahgat, R., Abdel-Rahman, S.E. (2000). Combining Constraint Logic Programming Techniques for Solving Linear Problems. In: Apt, K.R., Monfroy, E., Kakas, A.C., Rossi, F. (eds) New Trends in Constraints. WC 1999. Lecture Notes in Computer Science(), vol 1865. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44654-0_10

Download citation

  • DOI: https://doi.org/10.1007/3-540-44654-0_10

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-67885-4

  • Online ISBN: 978-3-540-44654-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation