In an AI class,
Below, the following symbols are used:
& for conjunction
| for disjunction
~ for negation
=> for implication
Prove that the following statements logically entail the proposition:
(p∣q)( p∣ q)=>(s∣t),(p | q) (~p | ~q) => (s | t),(p∣q)( p∣ q)=>(s∣t),
s => (p & ~t).
A. Using the resolution rule.
B. Using the DPLL algorithm.
How would you convert a satisfiability problem into a constraint satisfaction problem? Show this using the following example:
[(p & q) | r] & [~s => (~r & ~p)] & [~s].
Show the application of your proposed solution by implementing:
A. The backtracking search algorithm.
B. The arc-consistency algorithm.
This should be solved written down and not with algo.