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

TL;DR

This paper introduces a rule-based formalism for filtering variable domains in dynamic CSPs, demonstrated through diagnosis problems involving minimal constraint relaxations.

Contribution

It presents a novel rule-based approach tailored for dynamic CSPs, specifically applied to diagnosis scenarios for identifying minimal constraint relaxations.

Findings

Effective filtering of variable domains in dynamic CSPs

Application to diagnosis problems with minimal constraint relaxations

Formalism adaptable to various dynamic constraint scenarios

Abstract

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