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 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 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 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 : 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 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 : Where does the dependance of experience is reflected in prior probability sentences? a) Syntactic distinction b) Semantic distinction c) Both Syntactic & Semantic distinction d) None of the mentioned
Last Answer : a) Syntactic distinction
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 : 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 : 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 : ______________ is/are the way/s to represent uncertainty. a) Fuzzy Logic b) Probability c) Entropy d) All of the mentioned
Last Answer : d) All of the mentioned
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 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 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
Description : Define conditional probability?
Last Answer : Once the agents has obtained some evidence concerning the previously unknown propositions making up the domain conditional or posterior probabilities with the notation p(A/B) is used. This is important that p(A/B) can only be used when all be is known.
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 : Fuzzy logic is extension of Crisp set with an extension of handling the concept of Partial Truth. a) True b) False
Description : Which condition is used to cease the growth of forward chaining? a) Atomic sentences b) Complex sentences c) No further inference d) All of the mentioned
Last Answer : c) No further inference
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 of the following provides commands for defining logic using conditional statements? a) XML b) WS-BPEL c) JSON d) None of the mentioned
Last Answer : WS-BPEL
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 : Which is true for Decision theory? a) Decision Theory = Probability theory + utility theory b) Decision Theory = Inference theory + utility theory c) Decision Theory = Uncertainty + utility theory d) Decision Theory = Probability theory + preference
Last Answer : c) Decision Theory = Uncertainty + utility theory
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 : 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 : Aristotle’s theory of syllogism and Descartes and kant’s critic of pure reasoning made knowledge on _____. A. Logic B. Computation logic C. Cognition logic D. All of above
Last Answer : A. Logic
Description : Incorrect information results in unsatisfied preconditions for actions and plans _____________ detects violations of the preconditions for successful completion of the plan. a) Conditional Plan b) Conformant Planning c) Execution monitoring d) Both Conditional Plan & Execution monitoring
Last Answer : c) Execution monitoring
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 : Define conditional planning.
Last Answer : Conditional planning is a way in which the incompleteness of information is incorporated in terms of adding a conditional step, which involves if – then rules.
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 : Which of these are first, second, & third Conditional sentences?
Last Answer : answer:Here is a very clear and detailed crib sheet that should help you. It gives the rule, the example and the explanation. http://grammar.ccc.commnet.edu/grammar/conditional2.htm if this is how ... had enough money, I would send you to live with an English-speaking family. (Second conditional)>
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
Description : Fuzzy Set theory defines fuzzy operators. Choose the fuzzy operators from the following. a) AND b) OR c) NOT d) All of the mentioned
Description : Which algorithm takes two sentences and returns a unifier? a) Inference b) Hill-climbing search c) Depth-first search d) Unify algorithm
Last Answer : d) Unify algorithm
Description : For resolution to apply, all sentences must be in conjunctive normal form, a conjunction of disjunctions of literals. a) True b) False