Fundamentals of Artificial Intelligence Quiz 3
Formalization of knowledge in a declarative form begins with a ___.
A. conceptualization
B. semantics
C. interpretation
D. model
A. conceptualization
B. semantics
C. interpretation
D. model
Formalization of knowledge in a declarative form begins with a conceptualization.
P, Q, and R are logical propositions. Identify the statements as tautology and/or contradiction?
I. ((P∨Q)∧R)↔((P∧R)∨(Q∧R))
II. (P↔Q)∧(Q↔R)∧¬(P↔R)
I. ((P∨Q)∧R)↔((P∧R)∨(Q∧R))
II. (P↔Q)∧(Q↔R)∧¬(P↔R)
For the given logical propositions:
I. is a tautology; II. is a contradiction.
I. is a tautology; II. is a contradiction.
Consider which of the following statements are correct w.r.t. entailment in first-order logic being semi-decidable.
I. Algorithms exist that say yes to every entailed sentence.
II. No algorithm exists that says no to every non-entailed sentence.
I. Algorithms exist that say yes to every entailed sentence.
II. No algorithm exists that says no to every non-entailed sentence.
Both Statement I and II are correct regarding entailment in first-order logic being semi-decidable.
Skolemization is a procedure for systematic elimination of the __________ in a first-order formula in a prenex form, by introducing new constant and functional symbols.
Skolemization is a procedure for the systematic elimination of the existential quantifiers in a first-order formula in a prenex form, by introducing new constant and functional symbols.
Consider the predicate Likes(x,y): x likes y. Everyone likes ice cream. Is it possible to convey the same meaning using an existential statement? If yes, give the existential statement.
Yes, it is possible to convey the same meaning using an existential statement: ¬ ∃x ¬Likes(x,Icecream).
A definition of a predicate is a biconditional, and can be decomposed into a necessary and sufficient descriptions. Which of the following statements are true with regards to the definition of ‘Brother’?
I. Being a ‘Male’ is a necessary condition for being a ‘Brother’, but it is not sufficient.
II. Being a ‘Male’, ‘Sibling’ is a necessary and sufficient condition for being a ‘Brother’.
I. Being a ‘Male’ is a necessary condition for being a ‘Brother’, but it is not sufficient.
II. Being a ‘Male’, ‘Sibling’ is a necessary and sufficient condition for being a ‘Brother’.
Both Statement I and II is true regarding the definition of ‘Brother’.
Assertion A: Any predicate calculus well-formed formula can be converted to a set of clauses.
Reason R: The prenex form consists of a string of quantifiers called prefix followed by a quantifier-free formula called the matrix.
Reason R: The prenex form consists of a string of quantifiers called prefix followed by a quantifier-free formula called the matrix.
Both A and R are true, but R is not the correct explanation for A.
For the following pair of atomic sentences, give the most general unifier, if it exists:
a. Older(Father(y), y)
b. Cannot unify
a. Older(Father(y), y)
b. Cannot unify
Cannot unify
For the following pair of atomic sentences, give the most general unifier, if it exists:
a. Q(y, G(A, B))
b. Q(G(x, x), y)
a. Q(y, G(A, B))
b. Q(G(x, x), y)
The most general unifier for these atomic sentences is {y/G(A,B), x/A}.
Assertion A: A proof requires axioms to build on i.e., axioms can be used to prove theorems in a given domain.
Reason R: Axioms are facts and rules that attempt to capture all of the foundational principles i.e., important facts and concepts about the domain.
Reason R: Axioms are facts and rules that attempt to capture all of the foundational principles i.e., important facts and concepts about the domain.
Both A and R are true, and R is the correct explanation for A.
A physical symbol system has the necessary and sufficient means for general intelligent action. Identify the correct statements with regards to Symbol System Hypothesis
A. Knowledge may be represented as symbol structures.
B. Represents a computational system inspired by the human brain.
C. Intelligent behaviour cannot be achieved through manipulation of symbol structures.
D. Human thinking is a kind of symbol manipulation.
A. Knowledge may be represented as symbol structures.
B. Represents a computational system inspired by the human brain.
C. Intelligent behaviour cannot be achieved through manipulation of symbol structures.
D. Human thinking is a kind of symbol manipulation.
Knowledge may be represented as symbol structures and Human thinking is a kind of symbol manipulation are the correct statements with regards to the Symbol System Hypothesis.
Identify the correct combination of terms and definitions below.
Terms: Definition:
P. data X. primitive verifiable facts, of any representation.
Q. information Y. relation among sets of data, that is very often used for further information deduction.
R. knowledge Z. interpreted data
Terms: Definition:
P. data X. primitive verifiable facts, of any representation.
Q. information Y. relation among sets of data, that is very often used for further information deduction.
R. knowledge Z. interpreted data
The correct combination of terms and definitions is P:X; Q:Z; R:Y.
A proposition in a KR language does not mean anything on its own. The _________ (i.e. the meaning) of the proposition must be defined by the language author through _________.
The semantics (i.e. the meaning) of the proposition must be defined by the language author through an interpretation.
Which of the following statements are true for Closed World Assumption?
I. Every constant refers to a unique object.
II. Atomic sentences not in the database are assumed to be false.
I. Every constant refers to a unique object.
II. Atomic sentences not in the database are assumed to be false.
Both Statement I and II are true for Closed World Assumption.
Consider which of the following statements are correct w.r.t. satisfiability of logical sentences based on the logical operators involved.
I. Universally quantified sentence is satisfied if and only if the enclosed statement is satisfied for all assignments of the quantified variable.
II. Existentially quantified sentence is satisfied if and only if the enclosed statement is satisfied for some but not all assignments of the quantified variable.
I. Universally quantified sentence is satisfied if and only if the enclosed statement is satisfied for all assignments of the quantified variable.
II. Existentially quantified sentence is satisfied if and only if the enclosed statement is satisfied for some but not all assignments of the quantified variable.
I only is correct with respect to the satisfiability of logical sentences based on the logical operators involved.
Assertion A: Propositional Logic is a weak language.
Reason R: In propositional logic, it is hard to identify “individuals”; can’t directly talk about properties of individuals or relations between individuals; and generalizations, patterns, and regularities can’t easily be represented.
Reason R: In propositional logic, it is hard to identify “individuals”; can’t directly talk about properties of individuals or relations between individuals; and generalizations, patterns, and regularities can’t easily be represented.
Both A and R are true and R is the correct explanation for A.
Assertion A: A knowledge representation is fundamentally a surrogate.
Reason R: A knowledge representation is a substitute for the thing itself; used to enable an entity to determine consequences by reasoning about the world.
Reason R: A knowledge representation is a substitute for the thing itself; used to enable an entity to determine consequences by reasoning about the world.
Both A and R are true and R is the correct explanation for A.
A sentence in a formal language is true if and only if it accurately describes the world according to our conceptualization. ___________ is a mapping between elements of the language and elements of a conceptualization.
Interpretation
An interpretation of a set of FOL sentences, such that every sentence is true, is a ________.
An interpretation of a set of FOL sentences, such that every sentence is true, is a Model.
In _________ strategy of resolution refutation, each resolvent has a parent that is either in the base set or that is an ancestor of the other parent.
Ancestry-filtered Form
Also Available:
