Question
List - I List - II
(a) Vacuous proof (i) A proof that the implication p→q is true
based on the fact that p is false
(b) Trivial proof (ii) A proof that the implication p→q is true
based on the fact that q is true
(c) Direct proof (iii) A proof that the implication p→q is true
that proceeds by showing that q must be true
when p is true.
(d) Indirect proof (iv) A proof that the implication p→q is true
that proceeds by showing that p must be false
when q is false.
Codes:
(a) (b) (c) (d)
a.
(i) (ii) (iii) (iv)
b.
(ii) (iii) (i) (iv)
c.
(iii) (ii) (iv) (i)
d.
(iv) (iii) (ii) (i)
Engage with the Community - Add Your Comment
Confused About the Answer? Ask for Details Here.
Know the Explanation? Add it Here.
Q. Match the following terms: List - I List - II (a) Vacuous proof (i) A proof that the implication p→q is true...
Similar Questions
Discover Related MCQs
Q. Consider the compound propositions given below as:
(a) p˅~(p˄q) (b) (p˄~q)˅~(p˄q) (c) p˄(q˅r)
Which of the above propositions are tautologies?
View solution
Q. Which of the following property/ies a Group G must hold, in order to be an Abelian group?
(a) The distributive property
(b) The commutative property
(c) The symmetric property
View solution
Q. Given the following set of prolog clauses:
father(X, Y):
parent(X, Y),
male(X),
parent(Sally, Bob),
parent(Jim, Bob),
parent(Alice, Jane),
parent(Thomas, Jane),
male(Bob),
male(Jim),
female(Salley),
female(Alice).
How many atoms are matched to the variable ‘X’ before the query
father(X, Jane) reports a Result?
View solution
Q. Forward chaining systems are ............. where as backward chaining systems are ................
View solution
Q. A horn clause is ......................
View solution
Q. In Propositional Logic, given P and P→Q, we can infer .................
View solution
Q. Reasoning strategies used in expert systems include ...............
View solution
Q. Language model used in LISP is .................
View solution
Q. In constraint satisfaction problem, constraints can be stated as ...................
View solution
Q. Consider the two class classification task that consists of the following points :
Class C1: [-1, -1], [-1, 1], [1, -1]
Class C2: [1, 1]
The decision boundary between the two classes C1 and C2 using single perceptron is given by :
View solution
Q. How many different truth tables of the compound propositions are there that involve the propositions p & q ?
View solution
Q. The notation ∃!xp(x) denotes the proposition "there exists a unique x such that P(x) is true".
Give the truth values of the following statements :
I. ∃!xP(x) → ∃xP(x)
II. ∃!x ¬ P(x) → ¬∀xp(x)
View solution
Q. Give a compound proposition involving propositions p, q and r that is true when exactly two of p, q and r are true and is false otherwise.
View solution
Q. The quantification ∃!x P(x) denotes the proposition “There exists a unique x such that P(x) is true”, express the quantification using universal and existential quantifications and logical operators:
View solution
Q. Which of the following is a correct predicate logic statement for “Every Natural number has one successor” ?
View solution
Q. α – β cutoffs are applied to .............
View solution
Q. Assume that each alphabet can have a value between 0 to 9 in a cryptoarithmetic problem
CROSS+ROADS
--------------
DANGER
--------------
Which of the following statement is true ?
(i) No two alphabets can have the same numeric value.
(ii) Any two alphabets may have the same numeric value.
(iii) D = 0
(iv) D = 1
View solution
Q. Which of the following is not a part of an expert system shell ?
View solution
Q. The Blocks World Problem in Artificial Intelligence is normally discussed to explain a ..................
View solution
Q. Means-Ends Analysis process centres around the detection of difference between the current state and the goal state. Once such a difference is found, then to reduce the difference one applies ..................
View solution
Suggested Topics
Are you eager to expand your knowledge beyond Artificial Intelligence? We've curated a selection of related categories that you might find intriguing.
Click on the categories below to discover a wealth of MCQs and enrich your understanding of Computer Science. Happy exploring!
