06.03.2013 Views

Artificial Intelligence and Soft Computing: Behavioral ... - Arteimi.info

Artificial Intelligence and Soft Computing: Behavioral ... - Arteimi.info

Artificial Intelligence and Soft Computing: Behavioral ... - Arteimi.info

SHOW MORE
SHOW LESS

You also want an ePaper? Increase the reach of your titles

YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.

Here ai , b, ci , <strong>and</strong> xi ∈ ℜ <strong>and</strong> one has to determine xi s for known constants<br />

ai <strong>and</strong> b, so that Z=∑ci xi is maximized. The search space of the solution xi s,<br />

here, is constrained by the set of linear inequalities. Making a change for a<br />

10$ note is also a CSP problem, where the constraints for the solution xi s<br />

are given by ∑ ci xi = 10$ <strong>and</strong> ∃xi ≥ 0, where xi denotes the valid notes 1$, 2$<br />

<strong>and</strong> 5$ <strong>and</strong> ci denotes the count of xi. For example, if we consider x1,x2 <strong>and</strong> x5<br />

to correspond to 1$, 2$ <strong>and</strong> 5$ notes <strong>and</strong> c1,c2, c5 be their respective counts,<br />

then a few possible solutions are {x5 =2} or {x5= 1 ,x2 =2,x1= 1} or {x2=5} or<br />

{x1 =10}or {x2= 4,x1= 2}. The last two examples involve the algebraic<br />

constraints. Many formulations of the problems, however, require satisfying<br />

logical or geometric constraints. For example, finding the gr<strong>and</strong>-fatherhood<br />

relationship between X3 (=d) <strong>and</strong> X1 (=l) from the definition of gr<strong>and</strong>father<br />

<strong>and</strong> father, discussed below, is a CSP. To be more specific, suppose, given the<br />

following set of constraints:<br />

1.Gr<strong>and</strong>father (X3,X1) :-<br />

Father (X2,,X1),<br />

Father (X3,X2).<br />

2. Father (d, r).<br />

3. Father (r, l).<br />

We want to determine: Gr<strong>and</strong>father (X3, X1) ?<br />

The above problem can be solved by constructing an SLD-resolution<br />

tree, which finally yields the solution: Gr<strong>and</strong>-father(d, l). Problems that deal<br />

with such logical constraints also belong to the category of CSP. Before<br />

switching to the next section, we present an example of geometric constraint<br />

satisfaction problem. Suppose, we want a set of three dimensional objects<br />

like a i) Box , ii) Pyramid, iii) Cone (see fig.19.1) <strong>and</strong> we recognize the box<br />

among them by a set of geometric constraints, presented below.<br />

1. (Object = Box) :-<br />

Has-no-of- vertices = 8, No-of-planes-meeting-at-each-vertex =3,<br />

Angle-between-any- two-planes-meeting- long-an-edge =90 0 .<br />

2. (Object = Pyramid) :-<br />

Has-no-of- vertices =4,<br />

No-of-planes- meeting- at-each-vertex ≥ 3,<br />

Angle-between-any-two-planes-meeting-along-an-edge

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!