AI_Test_3

Which of the following is/are the component(s) of a Knowledge Representation Language?

• Syntax

• Semantics

• Inference Procedure

• Knowledge Base

Choose the CORRECT statements -

• Syntax is the mapping between symbols and worlds.

• A sentence S is unsatisfiable if it is false in some world(s).

• Sentence S₁ entails S₂ if whenever S₁ is false, S₂ is also false.

• A sentence S is valid if it is true in all worlds.

Choose the correct CNF form for the expression (¬q → r) ∧ (r → ¬p)

• (q ∨ r) ∧ (¬p ∨ ¬r)

• (q ∨ p) ∧ (¬q ∨ ¬r)

• (p ∨ r) ∧ (q ∨ ¬r)

• (r ∨ p) ∧ (¬p ∨ r)

What is the number of INCORRECT statements among the following?

i. If Knowledge Base has only horn clauses and the query is a conjunction of literals, then forward chaining is both sound and complete.
ii. An algorithm that can prove anything and everything is sound.
iii. Sound algorithm is the one that proves nothing but the truth.
iv. An algorithm that proves nothing but one true fact is not a sound algorithm.
v. A complete algorithm is the one that proves some but not all truth.
vi. A sound and complete algorithm is one that proves the truth and nothing but the truth.
vii. The zero of a disjunction operator is False.
viii. The zero of a conjunction operator is True.

We are given the following set of clauses {(a, ¬b, c), (c), (¬c, d, ¬e), (¬a, ¬b, e), (a, ¬b, ¬c), (d, b), (e, a)}. We repeatedly apply unit propagation and removal of pure literals (till we can no longer do so). What is the number of remaining clauses?

Given the following set of clauses ({¬a ∨ b}, {¬b}, {¬c ∨ b}, {a ∨ d}, {c ∨ ¬d}). Which of the following clause(s) can be derived by resolution using the given clauses?

• {¬a}

• {¬c}

• {¬d}

• {} (Empty Clause)

Given the following boolean expressions

i. a
ii. b ∧ a ⇒ c
iii. a ⇒ b
iv. c ∧ b ⇒ d
v. d ∧ b ⇒ e

How many of the following can be inferred if we apply forward chaining based on the Modus Ponens rule?

i. b
ii. c
iii. d
iv. e

{Answer in the format " b, c, "}

Which statements about the ontological and epistemological characteristics of First-order logic (FOL) and Probabilistic Propositional Logic/Bayesian Networks (BN) are correct?

• FOL and BN have similar ontological commitments

• FOL and BN have different ontological commitments

• FOL and BN have similar epistemological commitments

• FOL and BN have different epistemological commitments

A knowledge base in AI is a collection of ________ that represent facts and relationships about a particular domain.

The process of converting information into a standard, formal representation suitable for knowledge-based systems is known as ________.