Professional Documents
Culture Documents
Artificial Intelligence Second Assignment
Artificial Intelligence Second Assignment
Artificial Intelligence Second Assignment
Of
ARTIFICIAL INTELLIGENCE
Part-A
Q=1:- Check whether the following argument is valid:
If Paul lives in Dublin, he lives in Ireland. Paul lives in Ireland.
Therefore Paul lives in Dublin.
(i) Represent the argument formally;
(ii) Use truth tables to prove or disprove the validity of the
argument.
(iii) Build a counterexample is not valid.
Ans:- If Paul lives in Dublin, he lives in Ireland. Paul lives in Ireland.
Therefore Paul lives in Dublin.
(i) Give the keys of your formalization using PL; (ii) represent the
argument for- mally; and (iii) Apply the truth table method to prove or
disprove the validity of the argument. (iv) Build a counterexample if the
argumentation is not valid.
KB |= α
{p → i, i} |= d
KB ∪ {¬α}
{p → i, i, ¬d}
Q=2:- Three boxes are presented to you. One contains gold, the other two
are empty. Each box has imprinted on it a clue as to its contents; the clues
are (Box 1) “The gold is not here”, (Box 2) “The gold is not here”, and
(Box 3) “the gold is in Box 2”. Only one message is true; the other two are
false. Which box has the gold? Formalize the puzzle in PL and find the
solution using a truth table if the argumentation?
Ans:- The gold is in the Box 1.
Part-B
Q=4:- Determine whether each of the following sentence is Satisfiable,
Contradictory or Valid
a. P V Q & ~P V ~ Q & P & Q
Ans:-
P Q ~P ~Q PvQ ~Pv~Q
0 0 1 1 0 1
1 0 0 1 0 0
0 1 1 0 0 0
1 1 0 0 1 0
b. P → ~Q → ~P
Ans:-
P Q ~P ~Q P=>~Q P=>~Q=>~P
0 0 1 1 1 1
1 0 0 1 1 1
0 1 1 0 1 1
1 1 0 0 1 1
d. (P & Q) → R V ~ Q
Ans:-
P Q ~Q Q=>R Q=>Rv~Q
0 0 1 1 1
1 0 1 1 1
0 1 0 1 0
1 1 0 1 0
e. (P & Q) → ~(P V Q)
Ans:-
P Q ~P Q=>~P Q=>~PvQ
0 0 1 1 0
1 0 0 1 0
0 1 1 1 1
1 1 0 1 1
b. P &~Q V P U ~ R
c. Q V P V ~R & S ~U & P R
Ans:- “a” part is the correct answer of this question. That can be describe
in the following tables. Table 1:-
P Q ~P ~PvQ
0 0 1 0
1 0 0 0
0 1 1 1
1 1 0 0
Table 2:-
R S U R->S R->S->U
0 0 0 1 0
0 0 1 1 1
0 1 0 1 0
0 1 1 1 1
1 0 0 0 1
1 0 1 0 1
1 1 0 1 0
1 1 1 1 1