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 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 : 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 : 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
Last Answer : c) Extension of propositional logic
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 : Define Inductive Logic Programming (ILP).
Last Answer : ILP techniques perform KBIL on knowledge that is expressed in first order logic. ILP methods can learn relational knowledge that is not expressible in attribute based systems.
Description : Which approach is used for refining a very general rule through ILP? a) Top-down approach b) Bottom-up approach c) Both Top-down & Bottom-up approach d) None of the mentioned
Last Answer : a) Top-down approach
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 : What is used for probability theory sentences? a) Conditional logic b) Logic c) Extension of propositional logic
Description : Planning problem can be described as a propositional logic. a) True b) False
Last Answer : a) True
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 is a refutation complete inference procedure for propositional logic? a) Clauses b) Variables c) Propositional resolution d) Proposition
Last Answer : c) Propositional resolution
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 : 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 : 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 : 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 : How many reasons are available for the popularity of ILP? a) 1 b) 2 c) 3 d) 4
Last Answer : c) 3
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 : First Order Logic is also known as ___________ a) First Order Predicate Calculus b) Quantification Theory c) Lower Order Calculus d) All of the mentioned
Description : The symbols used in describing the syntax of a programming language are __________ a) 0 b) {} c) “” d)
Last Answer : d)
Description : Many words have more than one meaning; we have to select the meaning which makes the most sense in context. This can be resolved by ____________ a) Fuzzy Logic b) Word Sense Disambiguation c) Shallow Semantic Analysis d) All of the mentioned
Last Answer : b) Word Sense Disambiguation
Description : ____________ are algorithms that learn from their more complex environments (hence eco) to generalize, approximate and simplify solution logic. a) Fuzzy Relational DB b) Ecorithms c) Fuzzy Set d) None of the mentioned
Last Answer : c) Fuzzy Set
Description : ______________ is/are the way/s to represent uncertainty. a) Fuzzy Logic b) Probability c) Entropy d) All of the mentioned
Description : The statement comprising the limitations of FOL is/are ____________ a) Expressiveness b) Formalizing Natural Languages c) Many-sorted Logic d) All of the mentioned
Description : Which kind of agent architecture should an agent an use? a) Relaxed b) Logic c) Relational d) All of the mentioned
Description : ______ are algorithms that learn from their more complex environments (hence eco) to generalize, approximate and simplify solution logic. a) Fuzzy Relational DB b) Ecorithms c) Fuzzy Set d) None of the mentioned
Description : Fuzzy logic is usually represented as a) IF-THEN-ELSE rules b) IF-THEN rules c) Both a & b d) None of the mentioned
Last Answer : b) IF-THEN rules
Description : In partial order plan. A. Relationships between the actions of the behavior are set prior to the actions B. Relationships between the actions of the behavior are not set until absolutely necessary Choose the ... ) Either A or B can be true depending upon situation d) Neither A nor B is true
Last Answer : a) A is true
Description : Which is the first AI programming language? a) BASIC b) FORTRAN c) IPL(Inductive logic programming) d) LISP
Last Answer : d) LISP
Description : Decision trees are appropriate for the problems where ___________ a) Attributes are both numeric and nominal b) Target function takes on a discrete number of values. c) Data may have errors d) All of the mentioned
Description : Decision trees are appropriate for the problems where: a) Attributes are both numeric and nominal b) Target function takes on a discrete number of values. c) Data may have errors d) All of the mentioned
Description : Prolog is A. A programming language based on logic B. A computer where each processor has its own operating system, its own memory, and its own hard disk C. Describes the structure of the contents of a database D. None of these
Last Answer : A. A programming language based on logic
Description : Massively parallel machine is A. A programming language based on logic B. A computer where each processor has its own operating system, its own memory, and its own hard disk C. Describes the structure of the contents of a database. D. None of these
Last Answer : B. A computer where each processor has its own operating system, its own memory, and its own hard disk
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 : How many issues are available in describing degree of belief? a) 1 b) 2 c) 3 d) 4
Last Answer : b) 2
Description : What is the term used for describing the judgmental or commonsense part of problem solving? a) Heuristic b) Critical c) Value based d) Analytical
Last Answer : a) Heuristic
Description : Which term is used for describing the judgmental or commonsense part of problem solving? a) Heuristic b) Critical c) Value based d) Analytical
Description : What are the three levels in describing knowledge based agent?
Last Answer : Logical level Implementation level Knowledge level or epistemological level
Description : What is the term used for describing the judgmental or commonsense part of problem solving? A. Heuristic B. Critical C. Value based D. Analytical
Last Answer : A. Heuristic
Description : What is the term used for describing the judgmental or commonsense part of problem solving? A. Heuristic B. Critical C. Value based D. Analytical E. None of the above
Description : Which combines inductive methods with the power of first-order representations? a) Inductive programming b) Logic programming c) Inductive logic programming d) Lisp programming
Last Answer : c) Inductive logic programming
Description : Which is not Familiar Connectives in First Order Logic? a) and b) iff c) or d) not
Last Answer : d) not