|
| << vorige | volgende >> |
Tijdschrift beschrijving
Alle jaargangen van het bijbehorende tijdschrift
Alle afleveringen van het bijbehorende jaargang
Alle artikelen van de bijbehorende aflevering
Details van artikel 7 van 11 gevonden artikelen
| Titel: |
Fine-grained conflict resolution in constraint satisfaction problems |
| Auteur: |
Jacobi, Walter Hower Stephan |
| Verschenen in: |
Journal of experimental & theoretical artificial intelligence |
| Paginering: | Jaargang 10 (1998) nr. 1 pagina's 37-47 |
| Jaar: |
1998-01-01 |
| Inhoud: |
. Constraint relaxation is the modification of a constraint network such that the network permits more solutions; for instance, a formerly inconsistent network may become consistent. Most of the algorithms in this area try to localize constraints or even whole levels (of priority) of constraints that must be removed to allow global consistency. However, the problem when removing entire (levels of) constraints is the high degree of violation of the original problem. (It is often the case that constraints do not permit only a few tuples which are essential to form a globally consistent solution. Removing whole (levels of) constraints is much farther away from the original problem than additionally permitting just the necessary tuples.) The present approach does not work on a constraint level, but on a tuple level. This greatly reduces the distance of the modified (relaxed) problem from the original (hard) one. In this paper an 'intelligent' approach is pursued where only the constraints explicitly given are considered; therefore, no redundant constraints are synthesized. Furthermore, only that part of the constraint network that is actually affected by the modifications is recomputed which is especially effective in the frequent cases when only a few tuples are changed. |
| Uitgever: |
Taylor & Francis |
| Bronbestand: |
Elektronische Wetenschappelijke Tijdschriften |
Details van artikel 7 van 11 gevonden artikelen
| << vorige | volgende >> |