Notice: Undefined index: linkPowrot in C:\wwwroot\wwwroot\publikacje\publikacje.php on line 1275
[27552] Artykuł: A declarative framework for constrained search problemsCzasopismo: Lecture Notes in Artificial Intelligence Tom: 5027, Strony: 728-737ISSN: 0302-9743 ISBN: 978-3-540-69045-0 Wydawca: SPRINGER-VERLAG BERLIN, HEIDELBERGER PLATZ 3, D-14197 BERLIN, GERMANY Opublikowano: 2008 Seria wydawnicza: LECTURE NOTES IN ARTIFICIAL INTELLIGENCE Autorzy / Redaktorzy / Twórcy Grupa MNiSW: Publikacja w czasopismach wymienionych w wykazie ministra MNiSzW (część A) Punkty MNiSW: 10 Klasyfikacja Web of Science: Proceedings Paper Pełny tekst DOI Web of Science Keywords: DSS  Scheduling  Constraint Logic Programming  |
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.