Abstract
Real-world applications of theories for planning, scheduling, and design, call for more powerful and expressive theories than those provided by “classical” methods, which are based on a number of simplifying assumptions. Basic research on theories of constraint solving has made marked progress over the past few years. This paper sets out to show that the declarative nature of this new paradigm has significant advantages in software-engineering terms in the programming and maintenance phases. Moreover, the high efficiency of these methods allows the simulation of different strategies and supplies near-optimal solutions within a short time. However, complex problems require the application of heuristics. Research results in this area are presented.
Chapter PDF
Similar content being viewed by others
References
BT Technl. J. Vol. 13, No. 1, Jan. 1995
H. Baumgärtel. Constraint-based multi-criterial optimization for flow production planning. Proc. IMACS’97. Aug. 1997.
A. Fordan, U. Geske, A. Nareyek. Optimizing Constraint-Intensive Problems Using Early Projection., Proc. JICSLP’96, The MIT Press, 1996.
H.-J. Goltz. Reducing domains for search in CLP(FD) and its application to job-shop scheduling. Proc. CP’95, Springer LNCS 976, pp. 549 – 562, 1995.
P. Van Hentenryck. Constraint Satisfaction in Logic Program-ming. MIT Press, Cambridge (Mass.), London, 1989.
Walter Hower and Zsófia Ruttkay, editors. Non-Standard Con-straint Processing, ECAI-96 workshop W27, Budapest, 1996.
J. Jaffar and J.-L. Lassez. Constraint logic programming. In Proc. 14th Principles of Programming Languages, 1987.
J. Jaffar and S. Michaylov. Methodology and implementation of a CLP system. In J.-L. Lassez (ed.), Proc. 4th Int. Conf. Logic Programming, pp. 196–218. MIT Press, 1987.
J.-P. Jouannaud, editor. Constraints in Computational Logics, Springer-Verlag, Volume 845 of LNCS, 1994.
U. Montanari and F. Rossi, editors. Principles and Practice of Constraint Programming - CP’95, Springer-Verlag, Volume 976 of LNCS. 1995.
A. Podelski, editor. Constraint Programming: Basics and Trends, Springer-Verlag, Volume 910 of LNCS, 1995.
E. Tsang. Foundations of Constraint Satisfaction. Academic Press, 1993.
M. Wallace. Practical applications of contraint programming. Constraints, An International Journal, 1: 139–168, 1996.
M.A. Wilson and A. Borning. Hierarchical constraint logic pro-gramming. The Journal of Logic Programming, 16(3&4) 1993.
A. Wolf. Transforming ordered constraint hierarchies into ordi-nary constraint systems. In LNCS, Vol. 1106, 1996.
A. Wolf. Solving hierarchies of finite-domain constraints. Journal on Experimental and Theoretical Artificial Intelligence, Special issue on non-standard constraint processing, 1997.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1998 IFIP
About this chapter
Cite this chapter
Geske, U., Goltz, HJ., John, U., Wolf, A. (1998). The constraint logic programming paradigm: declarativity, efficiency, and flexibility. In: Horspool, R.N. (eds) Systems Implementation 2000. IFIP Advances in Information and Communication Technology. Springer, Boston, MA. https://doi.org/10.1007/978-0-387-35350-0_5
Download citation
DOI: https://doi.org/10.1007/978-0-387-35350-0_5
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-5041-2873-5
Online ISBN: 978-0-387-35350-0
eBook Packages: Springer Book Archive