Discussion
Why is the delete relaxation solvable in polynomial time?
Answer: B
Because nothing is ever deleted, the set of achievable facts grows monotonically and can be computed by a fixed point iteration, so no choice among actions can ever be regretted. Action counts and preconditions are unchanged and the goal is not automatically met. Monotonicity removing the need for search is the same property that makes forward chaining over definite clauses linear, appearing here in a different guise.
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