Enter T or F depending on whether the formula is a literal or not. (You must enter T or F -- True (true) and False (false) will not work.)

 1. p
 2. $p \vee q$
 3. $\neg p$

Enter T or F depending on whether the formula is a clause or not. (You must enter T or F -- True (true) and False (false) will not work.)

 1. $(p \vee q) \wedge p$
 2. $(p \vee q) \wedge (\neg p \vee r)$
 3. p
 4. $(p \vee q)$

Enter T or F depending on whether the formula is a Horn clause or not. (You must enter T or F -- True (true) and False (false) will not work.)

 1. $\neg p \vee \neg q \vee \neg r \vee \neg s$
 2. $\neg p$
 3. $\neg (p \vee q)$
 4. $(p \vee q) \wedge (\neg p \vee r)$

How to represent $\neg p$ in a logic program?

A. $\leftarrow p$
B. $\rightarrow p$
C. $p$
D. $p \leftarrow$
E. impossible

How to represent $p$ in a logic program?

A. $\rightarrow p$
B. $p$
C. $p \leftarrow$
D. impossible
E. $\leftarrow p$

How to represent $\neg p \vee \neg q$ in a logic program?

A. $p, q \leftarrow$
B. impossible
C. $\leftarrow p, q$
D. $\leftarrow p \wedge q$
E. $p \vee q$
F. $\rightarrow p,q$

How to represent $\neg p \vee \neg q \vee \neg r \vee s$ in a logic program?

A. $s \leftarrow p \wedge q \wedge r$
B. $p, q, s \leftarrow r$
C. impossible
D. $s \rightarrow p,q,r$
E. $s \leftarrow p, q, r$
F. $\neg ( p \wedge q \wedge r) \rightarrow s$

How to represent $\neg p \vee \neg q \vee r \vee s$ in a logic program?

A. $s \leftarrow p \wedge q \wedge r$
B. $s \rightarrow p,q,r$
C. $p, q, s \leftarrow r$
D. $s \leftarrow p, q, r$
E. impossible
F. $\neg ( p \wedge q \wedge r) \rightarrow s$