Discussion
Match each technique with what it contributes.
List I
A. Unit propagation
B. Clause learning
C. Set of support
D. Subsumption
List II
P. forced assignments without search
Q. preventing a conflict recurring
R. restricting resolution to goal descendants
S. deleting redundant clauses
Select the correct match.
Answer: D
Two of these belong to propositional satisfiability and two to first order resolution, yet all four address the same underlying problem of keeping a combinatorial search tractable. Two restrict what is explored and two remove what has been shown useless, which is a classification worth carrying to any search procedure.
No comment is present. Be the first to comment.
Loading…
Post your comment
Please log in or register to post a comment.
Examination Categories
- SSC Exams
- Banking Exams
- Teaching Exams
- Civil Services Exams
- Railways Exams
- Engineering Recruitment Exams
- Defence Exams
- State Government Exams
- Police Exams
- Insurance Exams
- Nursing Exams
- Other Government Exams
- NRA CET
- PG Entrance Exams
- Campus Placement
- MBA Entrance Exams
- CUET and UG Entrance
- Judiciary Exams
- Regulatory Body Exams
- Software Development