Soft CLP(FD)

RUDOVÁ, Hana. Soft CLP(FD). In FLAIRS'03, Recent Advances in Artificial Intelligence: Proceedings of the Sixteenth International FLAIRS Conference. Menlo Park, California (USA): AAAI Press, 2003, p. 202-206. ISBN 1-57735-177-0.

Basic information

• Original name: Soft CLP(FD)
• Authors: RUDOVÁ, Hana (203 Czech Republic, guarantor).
• Edition: Menlo Park, California (USA), FLAIRS'03, Recent Advances in Artificial Intelligence: Proceedings of the Sixteenth International FLAIRS Conference, p. 202-206, 2003.
• Publisher: AAAI Press

Other information

• Original language: English
• Type of outcome: Proceedings paper
• Field of Study: 20200 2.2 Electrical engineering, Electronic engineering, Information engineering
• Country of publisher: United States of America
• Confidentiality degree: is not subject to a state or trade secret
• WWW: URL
• RIV identification code: RIV/00216224:14330/03:00008038
• Organization unit: Faculty of Informatics
• ISBN: 1-57735-177-0
• Keywords in English: soft constraints; solver; constraint satisfaction; constraint logic programming
• Tags: constraint logic programming, constraint satisfaction, soft constraints, solver

Abstract

Over-constrained problems can be solved with the help of soft constraints. Weighted constraints are a typical representation of soft constraints used to minimize weights of unsatisfied constraints. A natural extension of the CLP(FD) approach is presented which allows handling of weighted soft constraints. To achieve this goal, the costs associated with unsatisfied constraints is accumulated for each problem variable and its value. For the approach proposed, implementation of the soft constraint solver on top of the existing CLP(FD) library of SICStus Prolog is described. A large scale timetabling implementation demonstrates practical application of the approach presented.

Links

• GA201/01/0942, research and development project: Name: Pokročilé plánování a rozvrhování

Investor: Czech Science Foundation, Advanced Planning and Scheduling