Consider a SAT problem where formula F is given by F = (a ∨ ¬b) ∧ (¬a ∨ b ∨ c) ∧ (¬c ∨ d) ∧ d ∧ (¬a ∨ b ∨ d) ∧ (¬a ∨ ¬d) Beam Search with beam width 2 is used to find a satisfying assignment. A state in the state space is represented by an assignment of the form (abcd) with the neighbourhood function toggling one bit. Let the initial state be 1000. The heuristic function h(F) returns the number of satisfied clauses in the formula F. Observe that one has to maximize the heuristic value. Which of the following pairs of states are retained after two stages of expansion? Hint - The neighbours for the state 0000 with one bit change are 0001, 0010, 0100 and 1000.
Answers
Answered by
2
hi
Consider a SAT problem where formula F is given by F = (a ∨ ¬b) ∧ (¬a ∨ b ∨ c) ∧ (¬c ∨ d) ∧ d ∧ (¬a ∨ b ∨ d) ∧ (¬a ∨ ¬d) Beam Search with beam width 2 is used to find a satisfying assignment. A state in the state space is represented by an assignment of the form (abcd) with the neighbourhood function toggling one bit. Let the initial state be 1000. The heuristic function h(F) returns the number of satisfied clauses in the formula F. Observe that one has to maximize the heuristic value. Which of the following pairs of states are retained after two stages of expansion? Hint - The neighbours for the state 0000 with one bit change are 0001, 0010, 0100 and 1000.
Answered by
0
Answer:
Yusjushssiwkjasjuwiwiiwiuwsukwkw
Similar questions