Description : A common convention is: • is evaluated first • and are evaluated next • Quantifiers are evaluated next • is evaluated last. 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 : 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
Description : How many types of quantification are available in artificial intelligence? a) 1 b) 2 c) 3 d) 4
Last Answer : b) 2
Description : The adjective first-order distinguishes first-order logic from ___________ in which there are predicates having predicates or functions as arguments, or in which one or both of ... Representational Verification b) Representational Adequacy c) Higher Order Logic d) Inferential Efficiency
Last Answer : c) Higher Order Logic
Description : First Order Logic is also known as ___________ a) First Order Predicate Calculus b) Quantification Theory c) Lower Order Calculus d) All of the mentioned
Last Answer : d) All 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)
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
Description : Planning graphs works only for prepositional planning problems. a) True b) False
Description : An inference algorithm that derives only entailed sentences is called sound or truth-preserving. a) True b) False
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 : 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 : 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 : A Goal is an open ended statement of what one wants to accomplish with no quantification of what is to be achieved and no time criteria for completion
Last Answer : False
Description : Explain the simple steps that can be followed in shop – floor for quantification of compressed air leakages.
Last Answer : The following steps can be followed for quantification of compressed air leakages. Shut off compressed air operated equipments (or conduct test when no equipment is using compressed air). Run the compressor to ... per minute (cmm) T = Time on load in minutes T = Time unload in minutes
Description : The number of strings of length 4 that are generated by the regular expression (0|∈) 1+2* (3|∈), where | is an alternation character, {+, *} are quantification characters, and ∈ is the null string, is: (A) 08 (B) 10 (C) 11 (D) 12
Last Answer : (D) 12
Description : The number of strings of length 4 that are generated by the regular expression (0+1 +|2+3 + )*, where | is an alternation character and {+, *} are quantification characters, is: (A) 08 (B) 09 (C) 10 (D) 12
Last Answer : (C) 10
Description : Third component of a planning system is to ___________ a) Detect when a solution has been found b) Detect when solution will be found c) Detect whether solution exists or not d) Detect whether multiple solutions exist
Last Answer : a) Detect when a solution has been found
Description : IR (information Retrieval) and IE (Information Extraction) are the two same thing. a) True b) False
Last Answer : 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
Description : There are primarily two modes for an inference engine: forward chaining and backward chaining. a) True b) False
Description : Zero sum games are the one in which there are two agents whose actions must alternate and in which the utility values at the end of the game are always the same. a) True b) False
Description : A genetic algorithm (or GA) is a variant of stochastic beam search in which successor states are generated by combining two parent states, rather than by modifying a single state. a) True b) False
Description : The main idea of Bidirectional search is to reduce the time complexity by searching two way simultaneously from start node and another from goal node. a) True b) False
Description : Speech Segmentation is a subtask of Speech Recognition. a) True b) False
Description : OCR (Optical Character Recognition) uses NLP. a) True b) False
Description : Natural Language generation is the main task of Natural language processing. a) True b) False
Description : Given a stream of text, Named Entity Recognition determines which pronoun maps to which noun. a) False b) True
Last Answer : a) False
Description : The more general task of coreference resolution also includes identifying so-called “bridging relationships” involving referring expressions. a) True b) False
Description : Modern NLP algorithms are based on machine learning, especially statistical machine learning. a) True b) False
Description : NLP is concerned with the interactions between computers and human (natural) languages. a) True b) False
Description : Decision Trees can be used for Classification Tasks. a) True b) False
Description : Decision Tree is a display of an algorithm. a) True b) False
Description : A perceptron adds up all the weighted inputs it receives, and if it exceeds a certain value, it outputs a 1, otherwise it just outputs a 0. a) True b) False c) Sometimes – it can also output intermediate values as well d) Can’t say
Description : Like relational databases there does exists fuzzy relational databases. a) True b) False
Description : Japanese were the first to utilize fuzzy logic practically on high-speed trains in Sendai. a) True b) False
Description : Fuzzy logic is extension of Crisp set with an extension of handling the concept of Partial Truth. a) True b) False
Description : Traditional set theory is also known as Crisp Set theory. a) True b) False
Description : The primitives in probabilistic reasoning are random variables. 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
Description : A re-planning agent uses execution monitoring and splices in repairs as needed. a) True b) False
Description : Conditional Plans allows the agent to sense the world during execution to decide what branch of plan to follow. a) True b) False
Description : Planning problem can be described as a propositional logic. a) True b) False
Description : What is meant by persistence actions? a) Allow a literal to remain false b) Allow a literal to remain true c) Allow a literal to remain false & true d) None of the mentioned
Last Answer : b) Allow a literal to remain true
Description : One the main drawback of this type of planning system is that it requires a lot of computational powers at each node. a) True b) False
Description : Sussman Anomaly illustrates a weakness of interleaved planning algorithm. a) True b) False
Description : Sussman Anomaly can be easily and efficiently solved by partial order planning. a) True b) False
Description : Partial-order planning is the opposite of total-order planning. a) True b) False
Description : Partial-order planning exhibits the Principle of Least Commitment, which contributes to the efficiency of this planning system as a whole. a) True b) False