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

Computer Science – Artificial Intelligence

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

14 pages

Scientific paper

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

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Constraint compiling into rules formalism constraint compiling into rules formalism for dynamic CSPs computing does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Constraint compiling into rules formalism constraint compiling into rules formalism for dynamic CSPs computing, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Constraint compiling into rules formalism constraint compiling into rules formalism for dynamic CSPs computing will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-287924

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.