Constraint compiling into rules formalism constraint compiling into rules formalism for dynamic CSPs computing - Archive ouverte HAL Accéder directement au contenu
Pré-Publication, Document De Travail Année : 2000

Constraint compiling into rules formalism constraint compiling into rules formalism for dynamic CSPs computing

Résumé

In this paper we present a rule based formalism for filtering variables domains of constraints. This formalism is well adapted for solving dynamic CSP. We take diagnosis as an instance problem to illustrate the use of these rules. A diagnosis problem is seen like finding all the minimal sets of constraints to be relaxed in the constraint network that models the device to be diagnosed

Dates et versions

hal-00132141 , version 1 (20-02-2007)

Identifiants

Citer

Sylvain Piechowiak, J. Rodriguez. Constraint compiling into rules formalism constraint compiling into rules formalism for dynamic CSPs computing. 2000. ⟨hal-00132141⟩
52 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Mastodon Facebook X LinkedIn More