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

Simple item page
dc.creatorPiechowiak, S.
dc.creatorRodriguez, J.
dc.date2000-06-30
dc.date.accessioned2026-07-07T03:16:19Z
dc.date.available2026-07-07T03:16:19Z
dc.descriptionIn 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
dc.description14 pages
dc.identifierhttps://arxiv.org/abs/cs/0006043
dc.identifierhttp://arxiv.org/abs/cs/0006043
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/30309
dc.subjectArtificial Intelligence
dc.subjectF.4.1
dc.titleConstraint compiling into rules formalism constraint compiling into rules formalism for dynamic CSPs computing
dc.typetext

Files

Collections

arXiv