Description : Which kind of problem are suitable for planning graph? a) Propositional planning problem b) Planning problem c) Action problem d) None of the mentioned
Last Answer : a) Propositional planning problem
Description : What is Morphological Segmentation? a) Does Discourse Analysis b) Separate words into individual morphemes and identify the class of the morphemes c) Is an extension of propositional logic d) None of the mentioned
Last Answer : b) Separate words into individual morphemes and identify the class of the morphemes
Description : Which produces hypotheses that are easy to read for humans? a) ILP b) Artificial intelligence c) Propositional logic d) First-order logic
Last Answer : a) ILP
Description : Which is an appropriate language for describing the relationships? a) First-order logic b) Propositional logic c) ILP d) None of the mentioned
Last Answer : a) First-order logic
Description : What is used for probability theory sentences? a) Conditional logic b) Logic c) Extension of propositional logic
Last Answer : c) Extension of propositional logic
Description : What are the two basic types of inferences? a) Reduction to propositional logic, Manipulate rules directly b) Reduction to propositional logic, Apply modus ponen c) Apply modus ponen, Manipulate rules directly
Last Answer : a) Reduction to propositional logic, Manipulate rules directly
Description : Which can be converted to inferred equivalent CNF sentence? a) Every sentence of propositional logic b) Every sentence of inference c) Every sentence of first-order logic d) All of the mentioned
Last Answer : c) Every sentence of first-order logic
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 : What is not represented by using propositional logic? a) Objects b) Relations c) Both Objects & Relations d) None of the mentioned
Last Answer : c) Both Objects & Relations
Description : Which of the following is used for probability theory sentences? a) Conditional logic b) Logic c) Extension of propositional logic d) None of the mentioned
Description : Define AND –Elimination rule in propositional logic
Last Answer : AND elimination rule states that from a given conjunction it is possible to inference any of the conjuncts.
Description : Define Modus Ponen’s rule in Propositional logic?
Last Answer : The standard patterns of inference that can be applied to derive chains of conclusions that lead to the desired goal is said to be Modus Ponen’s rule.
Description : What are the basic Components of propositional logic?
Last Answer : i. Logical Constants (True, False)
Description : PROLOG is an AI programming language which solves problems with a form of symbolic logic known as ______. A. Propositional logic B. Tautology C. Predicate calculus D. Temporal logic
Last Answer : C. Predicate calculus
Description : The concept derived from ________ level are propositional logic, tautology, predicate calculus, model, temporal logic. A. Cognition level B. Logic level C. Functional level D. All of above
Last Answer : B. Logic level
Description : What are the two major aspects which combines AI Planning problem? a) Search & Logic b) Logic & Knowledge Based Systems c) FOL & Logic d) Knowledge Based Systems
Last Answer : a) Search & Logic
Description : Claude Shannon described the operation of electronic switching circuits with a system of mathematical logic called _____________ a) LISP b) XLISP c) Neural networking d) Boolean algebra
Last Answer : c) Neural networking
Description : Which knowledge base is called as fixed point? a) First-order definite clause are similar to propositional forward chaining b) First-order definite clause are mismatch to propositional forward chaining c) All of the mentioned d) None of the mentioned
Last Answer : a) First-order definite clause are similar to propositional forward chaining
Description : Which closely resembles propositional definite clause? a) Resolution b) Inference c) Conjunction d) First-order definite clauses
Last Answer : d) First-order definite clauses
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
Description : Which of the following is the model used for learning? a) Decision trees b) Neural networks c) Propositional and FOL rules d) All of the mentioned
Last Answer : d) All of the mentioned
Description : Japanese were the first to utilize fuzzy logic practically on high-speed trains in Sendai. a) True b) False
Last Answer : a) True
Description : Fuzzy logic is extension of Crisp set with an extension of handling the concept of Partial Truth. 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 : Planning graphs works only for prepositional planning problems. a) True b) False
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
Last Answer : 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
Description : In propositional logic P↔Q is equivalent to (Where ~ denotes NOT): (A) ~(P∨Q)∧~(Q∨P) (B) (~P∨Q)∧(~Q∨P) (C) (P∨Q)∧(Q∨P) (D) ~(P∨Q)→~(Q∨P)
Last Answer : (B) (~P∨Q)∧(~Q∨P)
Description : In Propositional Logic, given P and P→Q, we can infer ........... (A) ~Q (B) Q (C) P∧Q (D) ~P∧Q
Last Answer : (B) Q
Description : The Newell and Simon program that proved theorems of Principal Mathematical was ____________ a) Elementary Perceiver b) General Problem Solver c) Logic Theorist d) Boolean Algebra
Last Answer : c) Logic Theorist
Description : Computers normally solve problem by breaking them down into a series of yes-or-no decisions represented by 1s and 0s. What is the name of the logic that allows computers to assign numerical values that fail ... 0 and 1? a) Human logic b) Fuzzy logic c) Boolean logic d) Operational logic
Last Answer : b) Fuzzy logic
Description : Constraint Propagation technique actually modifies the CSP problem. a) True b) False
Description : A solution to a problem is a path from the initial state to a goal state. Solution quality is measured by the path cost function, and an optimal solution has the highest path cost among all solutions. a) True b) False
Description : The problem-solving agent with several immediate options of unknown value can decide what to do by just examining different possible sequences of actions that lead to states of known value, and then choosing the ... . This process of looking for such a sequence is called Search. a) True b) False
Description : Having multiple perceptrons can actually solve the XOR problem satisfactorily: this is because each perceptron can partition off a linear part of the space itself, and they can then combine their results. ... have to be explicitly hand-coded d) False - just having a single perceptron is enough
Last Answer : c) True – perceptrons can do this but are unable to learn to do it – they have to be explicitly hand-coded
Description : Which of the following statement is not true? a) The union and concatenation of two context-free languages is context-free b) The reverse of a context-free language is context-free, but the ... it can be described by a regular grammar d) The intersection two context-free languages is context-free
Last Answer : d) The intersection two context-free languages is context-free
Description : Which of the following statement is not true? a) The union and concatenation of two context-free languages is context-free b) The reverse of a context-free language is context-free, but ... a regular language is always context-free e) The intersection two context-free languages is context-free
Last Answer : e) The intersection two context-free languages is context-free
Description : __________ algorithm translates a planning problem in to prepositional axioms. a) GraphPlan b) SatPlan c) Greedy d) None of the mentioned
Last Answer : b) SatPlan
Description : To eliminate the inaccuracy problem in planning problem or partial order planning problem we can use ___________________ data structure/s. a) Stacks b) Queue c) BST (Binary Search Tree) d) Planning Graphs
Last Answer : d) Planning Graphs
Description : The famous spare tire problem or Scheduling classes for bunch of students or Air cargo transport are the best example of ____________ a) Planning problem b) Partial Order planning problem c) Total order planning d) None of the mentioned
Last Answer : a) Planning problem
Description : The process by which the brain orders actions needed to complete a specific task is referred as ____________ a) Planning problem b) Partial order planning c) Total order planning d) Both Planning problem & Partial order planning
Last Answer : d) Both Planning problem & Partial order planning
Description : A plan that describe how to take actions in levels of increasing refinement and specificity is ____________ a) Problem solving b) Planning c) Non-hierarchical plan d) Hierarchical plan
Last Answer : d) Hierarchical plan