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.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
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.
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.
C.k. Chiu and J.H.H. Lee. „Towards Practical Interval Constraint Solving in Logic Programming“. The International Logic Programming Symposium, USA, 1994.
CLP (BNR), User Guide and Reference Applied Logic System Inc., USA, 1996.
P. Codognet and D. Diaz. „Compiling Constraints in clp(FD)“. In the Journal of logic Programming, Vol. 27, pp. 100–199, 1996.
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.
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.
C. Gervet. „Large Combinatorial Optimization Problems: A Methodology for Hybrid Models and Solutions“. In JFPLC’98, Nantes, France, 1998.
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.
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.
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.
C. Holzbaur. „A Specialized, Incremental Solved Form for Systems of Linear Inequalities“. Department of Medical Cybernetics and Artificial Intelligence, University of Vienna, Austria, 1994.
E. Hyvonen. „Constraint Reasoning Based on Interval Arithmetic: The Tolerance Propagation Approach“. The Artificial Intelligence Magazine, Elsevier, Vol. 58, pp. 71–112, 1992.
E. Jacquest-Lagreze. „Hybrid Methods for Large Scale Optimization Problems: an OR perspective. In PAPPACT’98, pp. 1–10, 1998.
J. Jaffar and J. Lassez. „Constraint Logic Programming“. In Proceedings 14th Symposium on Principles of Programming Languages, pp. 111–119. ACM, Munich, 1987.
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.
V. Kumar. „Algorithms for Constraint Satisfaction Problems: A Survey“. The Artificial Intelligence Magazine, Elsevier, Vol. 13(1), pp. 32–44, 1992.
G.F. Luger and W.A. Stubblefield. Artificial Intelligence Structures and Strategies for Complex Problem Solving. The Benjamin/Cummings Publishing Company Inc., USA, 1996.
R. Moore. Interval Analysis. Prentice-Hall Inc., London, 1965.
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.
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.
Sicstus Prolog User’s Manual. Swidish Institute of Computer Science, Sweden, 1997.
H.A. Taha. Operations Research: An Introduction. Prentice-Hall Inc., London, 1997.
P. Van Hentenryck. Constraint Satisfaction in Logic Programming. MIT Press, USA, 1989.
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.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights 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