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

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
by

1 Answer

Answer :

a) True
by

Related questions

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

Description : 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

Last Answer : a) True

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

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)

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

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

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

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

Last Answer : a) True

Define Quantifier and it’s types.

Description : Define Quantifier and it’s types.

Last Answer : Quantifiers are used to express properties of entire collection of objects rather than representing the objects by name. Types: i. Universal Quantifier ii. Existential Quantifier iii. Nested Quantifier.

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

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

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

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

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

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

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 called chronological-backtracking. It is also possible to go all the way to set of variable that caused failure. a) True b) False

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

What is a top-down parser? a) Begins by hypothesizing a sentence (the symbol S) and successively predicting lower level constituents until individual pre-terminal symbols are written b) Begins by hypothesizing a sentence (the symbol S) and successively predicting upper level constituents until individual pre-terminal symbols are written c) Begins by hypothesizing lower level constituents and successively predicting a sentence (the symbol S) d) Begins by hypothesizing upper level constituents and successively predicting a sentence (the symbol S)

Description : What is a top-down parser? a) Begins by hypothesizing a sentence (the symbol S) and successively predicting lower level constituents until individual pre-terminal symbols are written b) ... d) Begins by hypothesizing upper level constituents and successively predicting a sentence (the symbol S)

Last Answer : a) Begins by hypothesizing a sentence (the symbol S) and successively predicting lower level constituents until individual pre-terminal symbols are written

What is a top-down parser? a) Begins by hypothesizing a sentence (the symbol S) and successively predicting lower level constituents until individual preterminal symbols are written b) Begins by hypothesizing a sentence (the symbol S) and successively predicting upper level constituents until individual preterminal symbols are written c) Begins by hypothesizing lower level constituents and successively predicting a sentence (the symbol S) d) Begins by hypothesizing upper level constituents and successively predicting a sentence (the symbol S)

Description : What is a top-down parser? a) Begins by hypothesizing a sentence (the symbol S) and successively predicting lower level constituents until individual preterminal symbols are written b) Begins ... ) Begins by hypothesizing upper level constituents and successively predicting a sentence (the symbol S)

Last Answer : a) Begins by hypothesizing a sentence (the symbol S) and successively predicting lower level constituents until individual preterminal symbols are written

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

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

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

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

Last Answer : a) True

A knowledge engineer has the job of extracting knowledge from an expert and building the expert system knowledge base. a) True b) False

Description : A knowledge engineer has the job of extracting knowledge from an expert and building the expert system knowledge base. a) True b) False

Last Answer : a) True

α |= β ‘(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

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

Which statements about alkenes and alkanes of corresponding chain lengths is true? (I) Alkenes have slightly lower melting points than alkanes (II) Alkenes have slightly higher melting points than alkanes (III) Alkenes have higher boiling points than alkanes (IV) Alkenes have lower boiling points than alkanes (a) I and III (b) II and IV (c) I and IV (d) II and III

Description : Which statements about alkenes and alkanes of corresponding chain lengths is true? (I) Alkenes have slightly lower melting points than alkanes (II) Alkenes have slightly higher melting points than alkanes (III) Alkenes have higher boiling ... (a) I and III (b) II and IV (c) I and IV (d) II and III

Last Answer : I and III

85. The value of K and H should be determined according to the ARL required for the corresponding cusum chart. a) True b) False

Description : 85. The value of K and H should be determined according to the ARL required for the corresponding cusum chart. a) True b) False

Last Answer : true

In the arctic the rate of warming is slower than elsewhere on earth true or false?

Description : In the arctic the rate of warming is slower than elsewhere on earth true or false?

Last Answer : Need answer

Shift-Reduce parsers perform the following : (A) Shift step that advances in the input stream by K(K>1) symbols and Reduce step that applies a completed grammar rule to some recent parse trees, joining them together as one tree with a new root symbol. (B) Shift step that advances in the input stream by one symbol and Reduce step that applies a completed grammar rule to some recent parse trees, joining them together as one tree with a new root symbol. (C) Shift step that advances in the input stream by K(K = 2) symbols and Reduce step that applies a completed grammar rule to form a single tree. (D) Shift step that does not advance in the input stream and Reduce step that applies a completed grammar rule to form a single tree.

Description : Shift-Reduce parsers perform the following : (A) Shift step that advances in the input stream by K(K>1) symbols and Reduce step that applies a completed grammar rule to some recent parse trees, ... in the input stream and Reduce step that applies a completed grammar rule to form a single tree.

Last Answer : (B) Shift step that advances in the input stream by one symbol and Reduce step that applies a completed grammar rule to some recent parse trees, joining them together as one tree with a new root symbol.

An expert system is a computer program that contains some of the subject-specific knowledge of one or more human experts. a) True b) False

Description : An expert system is a computer program that contains some of the subject-specific knowledge of one or more human experts. a) True b) False

Last Answer : a) True

Define true sentence

Description : Define true sentence

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

Which method can’t be used for expressing relational knowledge? a) Literal system b) Variable-based system c) Attribute-based system d) None of the mentioned

Description : Which method can’t be used for expressing relational knowledge? a) Literal system b) Variable-based system c) Attribute-based system d) None of the mentioned

Last Answer : c) Attribute-based system

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

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

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

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

The basic inference mechanism in semantic network in which knowledge is represented as Frames is to follow the links between the nodes. a) True b) False

Description : The basic inference mechanism in semantic network in which knowledge is represented as Frames is to follow the links between the nodes. a) True b) False

Last Answer : a) True

A semantic network is used when one has knowledge that is best understood as a set of concepts that are related to one another. a) True b) False

Description : A semantic network is used when one has knowledge that is best understood as a set of concepts that are related to one another. a) True b) False

Last Answer : a) True

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

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

In a rule-based system, procedural domain knowledge is in the form of __________ a) production rules b) rule interpreters c) meta-rules d) control rules

Description : In a rule-based system, procedural domain knowledge is in the form of __________ a) production rules b) rule interpreters c) meta-rules d) control rules

Last Answer : a) production rules

Difference between object instantiation and construction ?

Description : Difference between object instantiation and construction ?

Last Answer : Ans. Though It's often confused with each other, Object Creation ( Instantiation ) and Initialization ( Construction ) are different things in Java. Construction follows object creation. Object ... provides one default implementation to set the default values according to the member data types.

In LISP, which of the following function assigns the value 10 to the symbol a? a) (setq a 10) b) (a = b) where b = 10 c) (a = 10) (d) (setq 10 a) d) All of the mentioned

Description : In LISP, which of the following function assigns the value 10 to the symbol a? a) (setq a 10) b) (a = b) where b = 10 c) (a = 10) (d) (setq 10 a) d) All of the mentioned

Last Answer : a) (setq a 10)

In LISP, what is the function assigns the symbol x to y? a) (setq y x) b) (set y = ‘x’) c) (setq y = ‘x’) d) (setq y ‘x’)

Description : In LISP, what is the function assigns the symbol x to y? a) (setq y x) b) (set y = ‘x’) c) (setq y = ‘x’) d) (setq y ‘x’)

Last Answer : d) (setq y ‘x’)

Which is created by using single propositional symbol? a) Complex sentences b) Atomic sentences c) Composition sentences d) None of the mentioned

Description : Which is created by using single propositional symbol? a) Complex sentences b) Atomic sentences c) Composition sentences d) None of the mentioned

Last Answer : b) Atomic sentences

Which of the following function returns t If the object is a symbol m LISP? a) (* <object>) b) (symbolp <object>) c) (nonnumeric <object>) d) (constantp <object>)

Description : Which of the following function returns t If the object is a symbol m LISP? a) (* ) b) (symbolp ) c) (nonnumeric ) d) (constantp )

Last Answer : b) (symbolp )

What are the 3 types of symbol which is used to indicate objects, relations and functions?

Description : What are the 3 types of symbol which is used to indicate objects, relations and functions?

Last Answer : i) Constant symbols for objects  ii) Predicate symbols for relations  iii) Function symbols for functions

There are also other operators, more linguistic in nature, called __________ that can be applied to fuzzy set theory. a) Hedges b) Lingual Variable c) Fuzz Variable d) None of the mentioned

Description : There are also other operators, more linguistic in nature, called __________ that can be applied to fuzzy set theory. a) Hedges b) Lingual Variable c) Fuzz Variable d) None of the mentioned

Last Answer : a) Hedges

There are also other operators, more linguistic in nature, called __________ that can be applied to fuzzy set theory. a) Hedges b) Lingual Variable c) Fuzz Variable d) None of the mentione

Description : There are also other operators, more linguistic in nature, called __________ that can be applied to fuzzy set theory. a) Hedges b) Lingual Variable c) Fuzz Variable d) None of the mentione

Last Answer : a) Hedges

The more general task of coreference resolution also includes identifying so-called “bridging relationships” involving referring expressions. a) True b) False

Description : The more general task of coreference resolution also includes identifying so-called “bridging relationships” involving referring expressions. a) True b) False

Last Answer : a) True

Which of the following is false for the programming language PROLOG? (A) A PROLOG variable can only be assigned to a value once (B) PROLOG is a Strongly Typed Language. (C) The scope of a variable in PROLOG is a single clause or rule. (D) the scope of a variable in PROLOG is a Single Query

Description : Which of the following is false for the programming language PROLOG? (A) A PROLOG variable can only be assigned to a value once (B) PROLOG is a Strongly Typed Language. (C) The scope of a variable in PROLOG is a single clause or rule. (D) the scope of a variable in PROLOG is a Single Query

Last Answer : (B) PROLOG is a Strongly Typed Language.

What is meant by predicting the value of a state variable from the past? a) Specular reflection b) Diffuse reflection c) Gaussian filter d) Smoothing

Description : What is meant by predicting the value of a state variable from the past? a) Specular reflection b) Diffuse reflection c) Gaussian filter d) Smoothing

Last Answer : d) Smoothing

Which variable can give the concrete form to the representation of the transition model? a) Single variable b) Discrete state variable c) Random variable d) Both Single & Discrete state variable

Description : Which variable can give the concrete form to the representation of the transition model? a) Single variable b) Discrete state variable c) Random variable d) Both Single & Discrete state variable

Last Answer : d) Both Single & Discrete state variable

How does the state of the process is described in HMM? a) Literal b) Single random variable c) Single discrete random variable d) None of the mentioned

Description : How does the state of the process is described in HMM? a) Literal b) Single random variable c) Single discrete random variable d) None of the mentioned

Last Answer : c) Single discrete random variable

The room temperature is hot. Here the hot (use of linguistic variable is used) can be represented by _______ a) Fuzzy Set b) Crisp Set c) Fuzzy & Crisp Set d) None of the mentioned

Description : The room temperature is hot. Here the hot (use of linguistic variable is used) can be represented by _______ a) Fuzzy Set b) Crisp Set c) Fuzzy & Crisp Set d) None of the mentioned

Last Answer : a) Fuzzy Set

Which condition is used to influence a variable directly by all the others? a) Partially connected b) Fully connected c) Local connected d) None of the mentioned

Description : Which condition is used to influence a variable directly by all the others? a) Partially connected b) Fully connected c) Local connected d) None of the mentioned

Last Answer : b) Fully connected

What is meant by probability density function? a) Probability distributions b) Continuous variable c) Discrete variable d) Probability distributions for 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

Which variable cannot be written in entire distribution as a table? a) Discrete b) Continuous c) Both Discrete & Continuous d) None of the mentioned

Description : Which variable cannot be written in entire distribution as a table? a) Discrete b) Continuous c) Both Discrete & Continuous d) None of the mentioned

Last Answer : b) Continuous

What is the basic element of a language? a) Literal b) Variable c) Random variable d) All of the mentioned

Description : What is the basic element of a language? a) Literal b) Variable c) Random variable d) All of the mentioned

Last Answer : c) Random variable

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

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

Which can be adapted for planning algorithms? a) Most-constrained variable b) Most-constrained literal

Description : Which can be adapted for planning algorithms? a) Most-constrained variable b) Most-constrained literal

Last Answer : a) Most-constrained variable

Which is omitted in prolog unification algorithm? a) Variable check b) Occur check c) Proposition check d) Both Occur & Proposition check

Description : Which is omitted in prolog unification algorithm? a) Variable check b) Occur check c) Proposition check d) Both Occur & Proposition check

Last Answer : b) Occur check

What is meant by factoring? a) Removal of redundant variable b) Removal of redundant literal c) Addition of redundant literal d) Addition of redundant variable

Description : What is meant by factoring? a) Removal of redundant variable b) Removal of redundant literal c) Addition of redundant literal d) Addition of redundant variable

Last Answer : b) Removal of redundant literal