The rule of Universal Instantiation (UI for short) says that we can infer any sentence obtained by

substituting a ground term (a term without variables) for the variable.

a) True

b) False

1 Answer

Answer :

a) True

Related questions

Description : The corresponding Existential Instantiation rule: for the existential quantifier is slightly more complicated. For any sentence a, variable v, and constant symbol k that does not appear elsewhere in the knowledge base. a) True b) False

Last Answer : a) True

Description : Lifted inference rules require finding substitutions that make different logical expressions looks identical. a) Existential Instantiation b) Universal Instantiation c) Unification d) Modus Ponen

Last Answer : c) Unification

Description : What among the following could the universal instantiation of ___________ For all x King(x) ^ Greedy(x) => Evil(x) a) King(John) ^ Greedy(John) => Evil(John) b) King(y) ^ Greedy(y) => Evil(y) c) King(Richard) ^ Greedy(Richard) => Evil(Richard) d) All of the mentioned

Last Answer : d) All of the mentioned

Description : There exists two way to infer using semantic networks in which knowledge is represented as Frames. 1) Intersection Search 2) Inheritance Search a) True b) False

Last Answer : 1) Intersection Search

Description : A knowledge-based agent can combine general knowledge with current percepts to infer hidden aspects of the current state prior to selecting actions. a) True b) False

Last Answer : a) True

Description : What is Transposition rule? a) From P → Q, infer ~Q → P b) From P → Q, infer Q → ~P c) From P → Q, infer Q → P d) From P → Q, infer ~Q → ~P

Last Answer : d) From P → Q, infer ~Q → ~P

Description : Which among the following could the Existential instantiation of ∃x Crown(x) ^ OnHead(x, Johnny)? a) Crown(John) ^ OnHead(John, Jonny) b) Crown(y) ^ OnHead(y, y, x) c) Crown(x) ^ OnHead(x, Jonny) d) None of the mentioned

Last Answer : a) Crown(John) ^ OnHead(John, Jonny)

Description : A Term is either an individual constant (a 0-ary function), or a variable, or an n-ary function applied to n terms: F(t1 t2 ..tn). a) True b) False

Last Answer : a) True

Description : If a hypothesis says it should be positive, but in fact, it is negative, we call it a) A consistent hypothesis b) A false negative hypothesis c) A false positive hypothesis d) A specialized hypothesis e) A true positive hypothesis

Last Answer : c) A false positive hypothesis

Description : What is meant by probability density function? a) Probability distributions b) Continuous variable c) Discrete variable d) Probability distributions for Continuous variables

Last Answer : d) Probability distributions for Continuous variables

Description : A Hybrid Bayesian network contains ___________ a) Both discrete and continuous variables b) Only Discrete variables c) Only Discontinuous variable

Last Answer : a) Both discrete and continuous variables

Description : What is meant by probability density function? a) Probability distributions b) Continuous variable c) Discrete variable d) Probability distributions for Continuous variables

Last Answer : d) Probability distributions for Continuous variables

Description : The primitives in probabilistic reasoning are random variables. a) True b) False

Last Answer : a) True

Description : What is the process of capturing the inference process as a single inference rule? a) Ponens b) Clauses c) Generalized Modus Ponens d) Variables

Last Answer : c) Generalized Modus Ponens

Description : There exist only two types of quantifiers, Universal Quantification and Existential Quantification. a) True b) False

Last Answer : a) True

Description : extendible architecture is A. Modular design of a software application that facilitates the integration of new modules B. Showing a universal law or rule to be invalid by providing a counter example C. ... of attributes in a database table that refers to data in another table D. None of these

Last Answer : A. Modular design of a software application that facilitates the integration of new modules

Description : Falsification is A. Modular design of a software application that facilitates the integration of new modules B. Showing a universal law or rule to be invalid by providing a counter example C. A set of attributes in a database table that refers to data in another table D. None of these

Last Answer : B. Showing a universal law or rule to be invalid by providing a counter example

Description : If a hypothesis says it should be positive, but in fact, it is negative, we call it __________ a) A consistent hypothesis b) A false negative hypothesis c) A false positive hypothesis d) A specialized hypothesis

Last Answer : c) A false positive hypothesis

Description : If a hypothesis says it should be positive, but in fact it is negative, we call it ___________ a) A consistent hypothesis b) A false negative hypothesis c) A false positive hypothesis d) A specialized hypothesis

Last Answer : c) A false positive hypothesis

Description : The BACKTRACKING-SEARCH algorithm in Figure 5.3 has a very simple policy for what to do when a branch of the search fails: back up to the preceding variable and try a different value for it. This is ... also possible to go all the way to set of variable that caused failure. a) True b) False

Last Answer : a) True

Description : Which will solve the conjuncts of the rule so that the total cost is minimized? a) Constraint variable b) Conjunct ordering c) Data complexity d) All of the mentioned

Last Answer : b) Conjunct ordering

Description : A rule-based system consists of a bunch of IF-THEN rules. a) True b) False

Last Answer : a) True

Description : α |= β ‘(to mean that the sentence α entails the sentence β) if and only if, in every model in which α is _____ β is also _____ a) True, true b) True, false c) False, true

Last Answer : a) True, true

Description : A) Knowledge base (KB) is consists of set of statements. B) Inference is deriving a new sentence from the KB. Choose the correct option. a) A is true, B is true b) A is false, B is false c) A is true, B is false d) A is false, B is true

Last Answer : a) A is true, B is true

Description : If you're asked to solve a system of equations in which there is no linear equation to start with you can sometimes begin by isolating and substituting a variable that is squared in both equations?

Last Answer : 1

Description : Internal validity refers to which of the following? a. The ability to infer that a casual relationship exists between 2 variables b. The extent to which study results can be generalized to and ... the study d. The ability to generalize the study results to individuals not included in the study

Last Answer : b. The extent to which study results can be generalized to and across populations of persons, settings, and times

Description : Which type of validity refers to the degree to which you can infer that the relationship between two variables is causal? a. Internal validity b. Population validity c. Ecological validity d. Statistical conclusion validity

Last Answer : a. Internal validity

Description : A quadratic equation whose roots are 2 moe than the roots of the quadratic equation `2x^(2) +3x + 5 = 0`, can be obtained by substituting `"_____"` fo

Last Answer : A quadratic equation whose roots are 2 moe than the roots of the quadratic equation `2x^(2) +3x + 5 = 0`, can be ... `"_____"` for x. `[(x-2)//(x+2)]`

Description : In quadrantal bearing system, back bearing of a line may be obtained from its forward bearing, by (A) Adding 180°, if the given bearing is less than 180° (B) Subtracting 180°, if the given bearing, is more ... cardinal points, i.e. substituting N for S and E for W and vice-versa (D) None of these

Last Answer : (C) Changing the cardinal points, i.e. substituting N for S and E for W and vice-versa

Description : A figure obtained by dividing the sum of all variable by their total number of variables.

Last Answer : Ans. Averages/Arithmetic Mean

Description : The term ___________ is used for a depth-first search that chooses values for one variable at a time and returns when a variable has no legal values left to assign. a) Forward search b) Backtrack search c) Hill algorithm d) Reverse-Down-Hill search

Last Answer : b) Backtrack search

Description : What can’t be done in the semantic interpretation? a) Logical term b) Complete logical sentence c) Both Logical term & Complete logical sentence d) None of the mentioned

Last Answer : c) Both Logical term & Complete logical sentence

Description : Which of the following is FALSE in C? A) Keywords can be used as variable names B) Variable names can contain a digit C) Variable names do not contain a blank space D) Capital letters can be used in variables

Last Answer : A) Keywords can be used as variable names

Description : Where does the additional variables are added in HMM? a) Temporal model b) Reality model c) Probability model d) All of the mentioned

Last Answer : a) Temporal model

Description : How the entries in the full joint probability distribution can be calculated? a) Using variables b) Using information c) Both Using variables & information d) None of the mentioned

Last Answer : b) Using information

Description : How many types of random variables are available? a) 1 b) 2 c) 3 d) 4

Last Answer : c) 3

Description : Where does the degree of belief is applied? a) Propositions b) Literals c) Variables d) Statements

Last Answer : a) Propositions

Description : What are present in each level of planning graph? a) Literals b) Actions c) Variables d) Both Literals & Actions

Last Answer : d) Both Literals & Actions

Description : Which is unique up to renaming of variables? a) Unifier b) Most general unifier c) Unifier & Most general unifier d) None of the mentioned

Last Answer : b) Most general unifier

Description : Which will be the instance of the class datalog knowledge bases? a) Variables b) No function symbols c) First-order definite clauses d) None of the mentioned

Last Answer : b) No function symbols

Description : What is the condition of variables in first-order literals? a) Existentially quantified b) Universally quantified c) Both Existentially & Universally quantified d) None of the mentioned

Last Answer : b) Universally quantified

Description : What kind of clauses are available in Conjunctive Normal Form? a) Disjunction of literals b) Disjunction of variables c) Conjunction of literals d) Conjunction of variables

Last Answer : a) Disjunction of literals

Description : Which is a refutation complete inference procedure for propositional logic? a) Clauses b) Variables c) Propositional resolution d) Proposition

Last Answer : c) Propositional resolution

Description : How many types of random variables are available? a) 1 b) 2 c) 3 d) 4

Last Answer : c) 3

Description : Define runtime variables.

Last Answer : Plans to gather and use information are represented using short hand  Notation called runtime variables (n).  Example  [Look up (Agent, “Phone number (Divya)”.N), Dial (n)]

Description : Using logic to represent and reason we can represent knowledge about the world with facts and rules. a) True b) False

Last Answer : a) True

Description : The name best-first search is a venerable but inaccurate one. After all, if we could really expand the best node first, it would not be a search at all; it would be a straight march to the ... is choose the node that appears to be best according to the evaluation function. a) True b) False

Last Answer : a) True

Description : Define true sentence

Last Answer : A sentence is true under a particular interpretation if the state of affairs it represents is the case. 

Description : Suppose you read a short story about two brothers who work together to create a town where everyone loves and respects one another What can you infer about the culture this story's author comes from?

Last Answer : Cooperation is an important value in this culture. (APEX)