Assignment 4 Page 1 of 9 Due: May 31, 11:00am
1. Use the algorithm described on page 9 of the Week 4 Slides to decide
whether each of the following sets of Horn formulas are satisfiable.
(a) {P, ¬(S ∧ Q), ((P ∧ R) → S), ((Q ∧ R) → P ), (P → R)}.
This study source was downloaded by 100000899606070 from CourseHero.com on 09-29-2025 12:29:49 GMT -05:00
https://www.coursehero.com/file/23342696/assignment04/
, Assignment 4 Page 2 of 9 Due: May 31, 11:00am
(b) {S, U, ¬(S ∧ Q), (S → R), ((P ∧ R ∧ U ) → Q), ((S ∧ U ) → Q),
((P ∧ R) → U ), ((Q ∧ S ∧ U ) → P )}
This study source was downloaded by 100000899606070 from CourseHero.com on 09-29-2025 12:29:49 GMT -05:00
https://www.coursehero.com/file/23342696/assignment04/
1. Use the algorithm described on page 9 of the Week 4 Slides to decide
whether each of the following sets of Horn formulas are satisfiable.
(a) {P, ¬(S ∧ Q), ((P ∧ R) → S), ((Q ∧ R) → P ), (P → R)}.
This study source was downloaded by 100000899606070 from CourseHero.com on 09-29-2025 12:29:49 GMT -05:00
https://www.coursehero.com/file/23342696/assignment04/
, Assignment 4 Page 2 of 9 Due: May 31, 11:00am
(b) {S, U, ¬(S ∧ Q), (S → R), ((P ∧ R ∧ U ) → Q), ((S ∧ U ) → Q),
((P ∧ R) → U ), ((Q ∧ S ∧ U ) → P )}
This study source was downloaded by 100000899606070 from CourseHero.com on 09-29-2025 12:29:49 GMT -05:00
https://www.coursehero.com/file/23342696/assignment04/