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 : 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 core components are constituents of AI are derived from A. Concept of logic B. Cognition C. Computation D. All of above
Last Answer : D. All of above
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 : The ____ level contains constituents at the third level which are knowledge based system, heuristic search, automatic theorem proving, multi-agent system. A. Cognition level B. Gross level C. Functional level D. All of above
Last Answer : B. Gross level
Description : Charles Babbage and Boole who demonstrate the power of _______ A. Logic B. Computation logic C. Cognition logic D. All of above
Last Answer : B. Computation logic
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 : 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 : 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 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 predicate calculus. It was developed in 1972 at the University of Marseilles by a team of specialists. Can you ... this team? A : Alain colmerauer B : Niklaus Wirth C : Seymour papert D : John McCarthy
Last Answer : A : Alain colmerauer
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 : 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 : 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 : Which algorithm is used for solving temporal probabilistic reasoning? a) Hill-climbing search b) Hidden markov model c) Depth-first search d) Breadth-first search
Last Answer : b) Hidden markov model
Description : The first widely used commercial form of Artificial Intelligence (Al) is being used in many popular products like microwave ovens, automobiles and plug in circuit boards for desktop PCs. What is name of AI? A. Boolean logic B. Human logic C. Fuzzy logic D. Functional logic
Last Answer : C. Fuzzy logic
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 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 : .............. predicate calculus allows quantified variables to refer to objects in the domain of discourse and not to predicates or functions. (A) Zero-order (B) First-order (C) Second-order (D) High-order
Last Answer : (B) First-order
Description : Fuzzy logic is extension of Crisp set with an extension of handling the concept of Partial Truth. a) True b) False
Description : _____ model were developed and incorporated in machines which mimicked the functionalities of human origin. A. Functional model B. Neural model C. Computational model D. None of above
Last Answer : C. Computational model
Description : _____ Model should reflect how results were obtained. A. Design model B. Logic model C. Computational model D. None of above
Description : How the buckets are stored in predicate indexing? a) Lists b) Stack c) Hashes d) None of the mentioned
Last Answer : c) Hashes
Description : What is meant by predicate indexing? a) All the one kind of facts in one bucket and another kind in other bucket b) Acts like index for facts c) All of the mentioned d) None of the mentioned
Last Answer : a) All the one kind of facts in one bucket and another kind in other bucket
Description : Define fluent calculus.
Last Answer : Discard Situation Calculus and invent a new formalism for writing axioms is Called Fluent Calculus.
Description : The concept of connect intelligence is derived from: (A) virtual reality (B) fuzzy logic (C) bluetooth technology (D) value added networks
Last Answer : (D) value added networks
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 : Having used both Mum and Sure deodorants, Ann feels that Sure is a good product and the one that best meets her needs. She has formed __________ about Sure. A)a motive B)an evoked set C)a cognition D)an attitude E)a self-concept
Last Answer : D)an attitude
Description : Language model used in LISP is ................. (A) Functional programming (B) Logic programming (C) Object oriented programming (D) All of the above
Last Answer : (A) Functional programming
Description : Predicate logic: is this notation correct?
Last Answer : answer:First, I'd say the phrase neither X nor Y should be translated as not-X and not-Y = ¬X ∧ ¬Y rather than not (X or Y) = ¬(X V Y). They are equivalent by DeMorgan's ... might be wrong. Can't find it at Wikipedia or Wolfram mathworld. I'd work from examples given in your reading material.
Description : Need Help with Predicate Logic( True Or False)
Last Answer : answer:Having not studied Logic formally, I have no understanding at all of the symbols or application of them that you show in a. and b. That's a total mystery to me, and I'm not going to attempt to figure ... either Mary or Sue), and then also kissed the other girl. So B can also be a subset of C.
Description : Frames in artificial intelligence is derived from semantic nets. a) True b) False
Description : From where did the new fact inferred on new iteration is derived? a) Old fact b) Narrow fact c) New fact d) All of the mentioned
Last Answer : c) New fact
Description : From which rule does the modus ponens are derived? a) Inference rule b) Module rule c) Both Inference & Module rule d) None of the mentioned
Last Answer : a) Inference rule