Discussion
What limits the propositional encoding of a first order problem?
Answer: D
Grounding a first order theory requires enumerating the objects, so the domain must be finite and known, and the number of clauses grows rapidly with it. Planning encodings bound the horizon for exactly this reason. Negation is handled correctly, satisfiability is the question being asked, and no world assumption is required. Knowing precisely which generality is surrendered by an encoding is what determines whether the encoding answers the question actually being asked.
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