You are a detective in charge of bringing down drug dealers (D). A tip has led you to a small apartment complex where you believe one or more D might be hiding out. There are five apartments in a row. Each apartment could contain a drug dealer D or could contain innocent people: adults (A), families with babies (B), or with teenagers (T). Before you break down a door, you need to be absolutely sure that a dealer D is inside, otherwise you could get sued for police sub-optimality. 1 2 3 4 5 m с m To help you narrow down where drug dealers D might be (if any are there at all), you use the fact that different people make different noises. Every time you walk between two apartments, you can hear the louder of the two noises that are being made in those apartments. The loudest people are teenagers T, who blast music (m), the next loudest are babies B who cry (c), the next loudest is the drug dealer D, who makes a rustling sound (r), and the quietest people are adults A, who are totally silent (s). For example, if there were a baby in one house and a teenager in next, you would hear music (m) when standing between those apartments. Walking by the five apartments, you hear the noises shown in the diagram above. You decide to try solving this problem as a CSP. Anewer the following questfons: 1. Varlables and Domalns: For each variable Apartment 1 to 5 below, write down its domain as a subset of the values (A, B, D, T}. Variable = Apt1, Domain = Variable = Apt2, Domain = Variable = Apt3, Domain = Variable = Apt4, Domain = Variable = Apts, Domain = 2. Constralnts: Write below all constraints that are associated with this CSP. Write each unary constraint implicitly as Apti = Domain_Value, where i = Apartment number and

Database System Concepts
7th Edition
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Chapter1: Introduction
Section: Chapter Questions
Problem 1PE
icon
Related questions
Question
You are a detective in charge of bringing down drug dealers (D). A tip has led you to a small
apartment complex where you believe one or more D might be hiding out.
There are five apartments in a row. Each apartment could contain a drug dealer Dor could
contain innocent people: adults (A), families with babies (B), or with teenagers (T). Before you
break down a door, you need to be absolutely sure that a dealer D is inside, otherwise you could
get sued for police sub-optimality.
1
2
3
4
5
m
To help you narrow down where drug dealers D might be (if any are there at all!), you use the
fact that different people make different noises. Every time you walk between two apartments,
you can hear the louder of the two noises that are being made in those apartments. The loudest
people are teenagers T, who blast music (m), the next loudest are babies B who cry (e), the next
loudest is the drug dealer D, who makes a rustling sound (r), and the quietest people are adults
A. who are totally silent (s). For example, if there were a baby in one house and a teenager in
next, you would hear music (m) when standing between those apartments.
Walking by the five apartments, you hear the noises shown in the diagram above. You decide to
try solving this problem as a CSP.
Answer the followIng questfons:
1.
Varlables and Domalns: For each variable Apartment 1 to 5 below, write down its
domain as a subset of the values (A, B, D. T}
Variable = Apt1, Domain =
Variable = Apt2, Domain =
Variable = Apt3, Domain =
Variable = Apt4, Domain =
Variable = Apt5, Domain =
2.
Constralnts: Write below all constraints that are associated with this CSP. Write
each unary constraint implicitly as Apti = Domain_Value, where i = Apartment number and
Domain_Value is a value from Domain Set {A, B. D, T3(Comma separate all your implicit
constraints)
Arc-Consistency: Run Arc Consistency on the domains in (1). using the constraints
in (2). Write down the reduced domains that result when all inconsistent domain values are
removed by Arc Consistency.
Variable = Apt1, Domain =
Variable = Apt2, Domain =
Variable = Apt3, Domain =
Variable = Apt4, Domain =
Variable = Apt5, Domain =
Transcribed Image Text:You are a detective in charge of bringing down drug dealers (D). A tip has led you to a small apartment complex where you believe one or more D might be hiding out. There are five apartments in a row. Each apartment could contain a drug dealer Dor could contain innocent people: adults (A), families with babies (B), or with teenagers (T). Before you break down a door, you need to be absolutely sure that a dealer D is inside, otherwise you could get sued for police sub-optimality. 1 2 3 4 5 m To help you narrow down where drug dealers D might be (if any are there at all!), you use the fact that different people make different noises. Every time you walk between two apartments, you can hear the louder of the two noises that are being made in those apartments. The loudest people are teenagers T, who blast music (m), the next loudest are babies B who cry (e), the next loudest is the drug dealer D, who makes a rustling sound (r), and the quietest people are adults A. who are totally silent (s). For example, if there were a baby in one house and a teenager in next, you would hear music (m) when standing between those apartments. Walking by the five apartments, you hear the noises shown in the diagram above. You decide to try solving this problem as a CSP. Answer the followIng questfons: 1. Varlables and Domalns: For each variable Apartment 1 to 5 below, write down its domain as a subset of the values (A, B, D. T} Variable = Apt1, Domain = Variable = Apt2, Domain = Variable = Apt3, Domain = Variable = Apt4, Domain = Variable = Apt5, Domain = 2. Constralnts: Write below all constraints that are associated with this CSP. Write each unary constraint implicitly as Apti = Domain_Value, where i = Apartment number and Domain_Value is a value from Domain Set {A, B. D, T3(Comma separate all your implicit constraints) Arc-Consistency: Run Arc Consistency on the domains in (1). using the constraints in (2). Write down the reduced domains that result when all inconsistent domain values are removed by Arc Consistency. Variable = Apt1, Domain = Variable = Apt2, Domain = Variable = Apt3, Domain = Variable = Apt4, Domain = Variable = Apt5, Domain =
Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 2 steps

Blurred answer
Knowledge Booster
Time complexity
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.
Similar questions
  • SEE MORE QUESTIONS
Recommended textbooks for you
Database System Concepts
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education