The Open UniversitySkip to content

Assigning satisfaction values to constraints: an algorithm to solve dynamic meta-constraints

van der Linden, Janet (2001). Assigning satisfaction values to constraints: an algorithm to solve dynamic meta-constraints. In: Proceedings of the European Research Consortium for Informatics and Mathematics, 18-20 June 2001, Prague, Czech Republic.

Google Scholar: Look up in Google Scholar


The model of Dynamic Meta-Constraints has special activity constraints which can activate other constraints. It also has meta-constraints which range over other constraints. An algorithm is presented in which constraints can be assigned one of five different satisfaction values, which leads to the assignment of domain values to the variables in the CSP. An outline of the model and the algorithm is presented, followed by some initial results for two problems: a simple classic CSP and the Car Configuration Problem. The algorithm is shown to perform few backtracks per solution, but to have overheads in the form of historical records required for the implementation of state.

Item Type: Conference Item
Extra Information: Workshop presentation for the Working Group on Constraints.
Keywords: programming languages; artificial intelligence
Academic Unit/Department: Mathematics, Computing and Technology > Computing & Communications
Interdisciplinary Research Centre: Centre for Research in Computing (CRC)
Item ID: 4915
Depositing User: Michelle Bailey
Date Deposited: 31 Aug 2006
Last Modified: 02 Dec 2010 19:52
Share this page:

Actions (login may be required)

Policies | Disclaimer

© The Open University   + 44 (0)870 333 4340