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

1 Answer

Answer :

a) Reduction to propositional logic, Manipulate rules directly

Related questions

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 : 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 : 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 : 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

Last Answer : c) Extension of propositional logic

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 : 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 : 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 : What is the process of capturing the inference process as a single inference rule? a) Ponens b) Clauses c) Generalized Modus Ponens d) Variables

Last Answer : c) Generalized Modus Ponens

Description : In order to utilize generalized Modus Ponens, all sentences in the KB must be in the form of Horn sentences. a) True b) False

Last Answer : a) True

Description : Which are more suitable normal form to be used with definite clause? a) Positive literal b) Negative literal c) Generalized modus ponens d) Neutral literal

Last Answer : c) Generalized modus ponens

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

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 : Fuzzy logic is usually represented as ___________ a) IF-THEN-ELSE rules b) IF-THEN rules c) Both IF-THEN-ELSE rules & IF-THEN rules

Last Answer : b) IF-THEN rules

Description : Using logic to represent and reason we can represent knowledge about the world with facts and rules. a) True b) False

Last Answer : a) True

Description : In default logic, which of the following inference rules of the form is allowed? a) (A : B) / C b) A / (B : C) c) A / B d) A / B : C

Last Answer : a) (A : B) / C

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 : Which is the first AI programming language? a) BASIC b) FORTRAN c) IPL(Inductive logic programming) d) LISP

Last Answer : d) LISP

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 : 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 process by which accountants use their knowledge of accounting rules to manipulate the figures reported in the accounts of a business in known as- (a) Financial accounting (b) creative accounting (c) cost accounting (d) fair value accounting

Last Answer : B. CREATIVE ACVOUNTING

Description : Why do some people directly misquote or manipulate what a person has said in order to validate their point?

Last Answer : answer:What do you mean by trouble making? Are you being racist?

Description : Evolutionary computation is A . Combining different types of method or information B. Approach to the design of learning algorithms that is structured along the lines of the theory of evolution. C. ... the knowledge of an expert formulated in terms of if-then rules. D . None of these

Last Answer : B. Approach to the design of learning algorithms that is structured along the lines of the theory of evolution.

Description : Expert systems A . Combining different types of method or information B. Approach to the design of learning algorithms that is structured along the lines of the theory of evolution C. an information base ... the knowledge of an expert formulated in terms of if-then rules D . None of these

Last Answer : C. an information base filled with the knowledge of an expert formulated in terms of if-then rules

Description : What are the 2 types of synchronic rules?

Last Answer : i. Diagnostic rules ii. Casual rules.

Description : What is the form of Fuzzy logic? a) Two-valued logic b) Crisp set logic c) Many-valued logic d) Binary set logic

Last Answer : c) Many-valued logic

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 : Fuzzy logic is a form of a) Two-valued logic b) Crisp set logic c) Many-valued logic d) Binary set logic

Last Answer : c) Many-valued logic

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 : 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 : 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 : How is Fuzzy Logic different from conventional control methods? a) IF and THEN Approach b) FOR Approach c) WHILE Approach d) DO Approach

Last Answer : a) IF and THEN Approach

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

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

Last Answer : a) True