Artificial Intelligence - Knowledge Representation


(p N
 (applicant ^name <n> ^salary <35000 ^status NIL)
 →
 (modify 1 ^status No)
)
(p LC1
 (applicant ^name <n> ^salary >100000 ^status NIL)
 (stocks ^holder <n> ^worth >20000)
 →
 (modify 1 ^status C1)
)
(p LC2
 (applicant ^name <n> ^salary >85000 ^status NIL)
 (stocks ^holder <n> ^worth >50000)
 (credit ^user <n> ^score >150)
 →
 (modify 1 ^status C2)
)
Consider the following set of working memory elements:
1. (applicant ^name a ^salary 5000 ^status NIL)
2. (applicant ^name b ^salary 1035000 ^status NIL)
3. (applicant ^name c ^salary 95000 ^status NIL)
4. (credit ^user b ^score 100)
5. (credit ^user c ^score 155)
6. (stocks ^holder a ^worth 10000)
7. (stocks ^holder c ^worth 60000)
8. (stocks ^holder b ^worth 25000)

16. Which of the following rule-data combination will NOT be in the Conflict Set?
A. <N,1>
B. <LC2,3,5,7>
C. <LC2,3,5>
D. <LC1,2,4,8>

Cancel reply

Your email address will not be published. Required fields are marked *


Cancel reply

Your email address will not be published. Required fields are marked *



(p N
 (applicant ^name <n> ^salary <35000 ^status NIL)
 →
 (modify 1 ^status No)
)
(p LC1
 (applicant ^name <n> ^salary >100000 ^status NIL)
 (stocks ^holder <n> ^worth >20000)
 →
 (modify 1 ^status C1)
)
(p LC2
 (applicant ^name <n> ^salary >85000 ^status NIL)
 (stocks ^holder <n> ^worth >50000)
 (credit ^user <n> ^score >150)
 →
 (modify 1 ^status C2)
)
Consider the following set of working memory elements:
1. (applicant ^name a ^salary 5000 ^status NIL)
2. (applicant ^name b ^salary 1035000 ^status NIL)
3. (applicant ^name c ^salary 95000 ^status NIL)
4. (credit ^user b ^score 100)
5. (credit ^user c ^score 155)
6. (stocks ^holder a ^worth 10000)
7. (stocks ^holder c ^worth 60000)
8. (stocks ^holder b ^worth 25000)

17. For the Rete network shown below, which of the above rules correspond to the beta node marked X?

Cancel reply

Your email address will not be published. Required fields are marked *


Cancel reply

Your email address will not be published. Required fields are marked *



(p N
 (applicant ^name <n> ^salary <35000 ^status NIL)
 →
 (modify 1 ^status No)
)
(p LC1
 (applicant ^name <n> ^salary >100000 ^status NIL)
 (stocks ^holder <n> ^worth >20000)
 →
 (modify 1 ^status C1)
)
(p LC2
 (applicant ^name <n> ^salary >85000 ^status NIL)
 (stocks ^holder <n> ^worth >50000)
 (credit ^user <n> ^score >150)
 →
 (modify 1 ^status C2)
)
Consider the following set of working memory elements:
1. (applicant ^name a ^salary 5000 ^status NIL)
2. (applicant ^name b ^salary 1035000 ^status NIL)
3. (applicant ^name c ^salary 95000 ^status NIL)
4. (credit ^user b ^score 100)
5. (credit ^user c ^score 155)
6. (stocks ^holder a ^worth 10000)
7. (stocks ^holder c ^worth 60000)
8. (stocks ^holder b ^worth 25000)

18. Which of the following rules along with WMEs corresponding to the beta node Y are part of the Conflict Set for the given data?

Cancel reply

Your email address will not be published. Required fields are marked *


Cancel reply

Your email address will not be published. Required fields are marked *


19. Consider the same OPS5 rule given in above question and working memory contains the following data elements, ordered by increasing timestamps:
1. (thread ^name t1 ^hasTimeout yes)
2. (thread ^name t2 ^hasTimeout no)
3. (thread ^name t3 ^hasTimeout no)
The pair(s) present in the conflict set after the match phase of the inference engine is/are
I. <thread-mangement-rule, 1>
II. <thread-mangement-rule, 2>
III. <thread-mangement-rule, 3>

Cancel reply

Your email address will not be published. Required fields are marked *


Cancel reply

Your email address will not be published. Required fields are marked *