Abstract
Constrained search problems (eg. scheduling, planning, resource allocation, placement, routing etc.) appear frequently at different levels of decisions. They are usually characterized by many types of constraints, which make them unstructured and difficult to solve (NP-complete). Traditional mathematical programming approaches are deficient because their representation of constraints is artificial (using 0-1 variables). Unlike traditional approaches, constraint logic programming (CLP) provides for a natural representation of heterogeneous constraints. In CLP we state the problem requirements by constraints; we do not need to specify how to meet these requirements. In this paper we propose a declarative framework for decision support system (DSS) for constrained search problems implemented by CLP and relational SQL database. We illustrate this concept by the implementation of a DSS for scheduling problems with external resources in different production organization environments.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Liao, S.Y., Wang, H.Q., Liao, L.J.: An extended formalism to constraint logic programming for decision analysis. Knowledge-based Systems 15, 189–202 (2002)
Le, P.C.: Three Mechanisms for Managing Resource Constraints in a Library for Constraint-Based Scheduling Proceedings. In: INRIA/IEEE Conference on Emerging Technologies and Factory Automation (1995)
Young, R.U.: Constraint logic programming framework for integrated decision supports. Decision Support Systems 22, 155–170 (1998)
Bisdorff, R., Laurent, S.: Industrial linear optimization problem solved by constraint logic programming. European Journal of Operational Research 84(1), 82–95 (1995)
Lamma, E., Mello, P., Milano, M.: A distributed constrained-based scheduler. Artificial Intelligence in Engineering 11, 91–105 (1997)
Lee, H.G., Yu, L.G.: Constraint logic programming for qualitative and quantitative constraint satisfaction problems. Decision Support Systems 16(1), 67–83 (1996)
Apt, K.R., Wallace, M.G.: Constraint Logic Programming using ECLiPSe, Cambridge (2007)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Sitek, P., Wikarek, J. (2008). A Declarative Framework for Constrained Search Problems. In: Nguyen, N.T., Borzemski, L., Grzech, A., Ali, M. (eds) New Frontiers in Applied Artificial Intelligence. IEA/AIE 2008. Lecture Notes in Computer Science(), vol 5027. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-69052-8_76
Download citation
DOI: https://doi.org/10.1007/978-3-540-69052-8_76
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-69045-0
Online ISBN: 978-3-540-69052-8
eBook Packages: Computer ScienceComputer Science (R0)