Scribd
Upload
59 views3 pages

SP22 Bse 009 Ai CSP Task 2

The document discusses a constraint satisfaction problem (CSP) involving assigning colors to geographical regions in Pakistan. It defines the variables as regions, domain as colors, and constraint as no duplicate colors. It shows the constraint graph and describes removing a variable and its adjacent constraints. It also provides a tree decomposition of the CSP into independent subproblems.

Uploaded by

ayeshaefgh60
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
59 views3 pages

SP22 Bse 009 Ai CSP Task 2

The document discusses a constraint satisfaction problem (CSP) involving assigning colors to geographical regions in Pakistan. It defines the variables as regions, domain as colors, and constraint as no duplicate colors. It shows the constraint graph and describes removing a variable and its adjacent constraints. It also provides a tree decomposition of the CSP into independent subproblems.

Uploaded by

ayeshaefgh60
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 3

Page |1

COMSATS University, Islamabad


Department of Computer Science
Student Name: Ayesha Siddiqa Reg. SP22-BSE-009

Subject: Artificial Intelligence Class/Section: BSE-5A

Date: 25/03/2024 Instructor: Waqas Ali

CSP:

Figure 1. Map of Pakistan

The graph represents different geographical regions within a country, Pakistan

1. Variable:
The variable in this scenario represents the geographical regions of Pakistan. Each region is assigned a
variable name such as {“A”, "B" "C," "D," "E "F "G," “H” and "I"}
2. Domain:
Each variable can be assigned one of three colors
Domain = {Red, Green, Blue}
3. Constraint:
Page |2

The constraint is that no two regions can have the same color. This ensures that each region is uniquely
identified by its assigned color, maintaining clarity and distinction on the map.

Constraint Graph: I H

C D

F
B E

Cut set:
 Variable I is adjacent to variables D, C, H, G, and E.
 So removing I will relax the constraints for its adjacent variables.
 For each adjacent variable to I, the constraint will no longer include I. Solve the modified CSP without
variable I, considering the adjusted constraints.

D H
C
G

A B E
Page |3

Tree Decomposition:

The tree decomposition represents a valid decomposition of the problem into smaller subproblems, which can
be solved independently. It ensures that the constraints between variables are preserved while simplifying the
problem structure.

Unit 1: Bag {A, C, D}

Unit 2: Bag {F, G, H}

Unit 3: Bag {G, E, F}

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy