Constraint Based Information Gathering for a Network Publication

Instructions and help about Constraint based Information Gathering For A Network Publication

Okay so we are looking at constraint satisfaction problems and now let’s start our study of constraint networks, CSPs – as we call them. And we know that a network R is made up of three things. One is a set of variables X, one is a set of domains D and one is a set of constraints C essentially. So let’s just quickly recap this. X is a set of variables. Let’s say that there are n variables and D is a set of domains, one for each variable. So Di is the domain of Xi essentially. And C is a set of constraints. So let’s say C-one, C-two, any number of constraints can be there. So let’s say there are k constraints. Or we’ll use k elsewhere so it’s, say there are r constraints and each constraint is made up of a scope Si and a relation Ri. So Si is the scope of the constraint and it’s a subset of the set of variables X and let us say this Si is equal to xi-one, xi-two, xi-p let us say. That means there are p variables over which the relation holds. And Ri is a subset of the