Which makes the complexity of the entire algorithm quadratic in the size?

a) Clause

b) Inference

c) Resolution

d) Occur check

1 Answer

Answer :

d) Occur check

Related questions

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 problem can frequently occur in backward chaining algorithm? a) Repeated states b) Incompleteness c) Complexity d) Both Repeated states & Incompleteness

Last Answer : d) Both Repeated states & Incompleteness

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 : An inference algorithm that derives only entailed sentences is called sound or truth-preserving. a) True b) False

Last Answer : a) True

Description : Which are needed to compute the logical inference algorithm? a) Logical equivalence b) Validity c) Satisfiability d) All of the mentioned

Last Answer : d) All of the mentioned

Description : Three main basic features involved in characterizing membership function are A. Intution, Inference, Rank Ordering B. Fuzzy Algorithm, Neural network, Genetic Algorithm C. Core, Support , Boundary D. Weighted Average, center of Sums, Median

Last Answer : C. Core, Support , Boundary

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 : Which is also called single inference rule? a) Reference b) Resolution c) Reform d) None of the mentioned

Last Answer : b) Resolution

Description : Which is omitted in prolog unification algorithm? a) Variable check b) Occur check c) Proposition check d) Both Occur & Proposition check

Last Answer : b) Occur check

Description : Which process makes different logical expression looks identical? a) Lifting b) Unification c) Inference process d) None of the mentioned

Last Answer : b) Unification

Description : Quantitative attributes are A. A reference to the speed of an algorithm, which is quadratically dependent on the size of the data B. Attributes of a database table that can take only numerical values C. Tools designed to query a database D. None of these

Last Answer : B. Attributes of a database table that can take only numerical values

Description : What is viewed as problem of probabilistic inference? a) Speech recognition b) Speaking c) Hearing d) Utterance

Last Answer : a) Speech recognition

Description : Which of the following strategies would NOT be effective at improving your communication competence? a) Recognize the people, objects, and situations remain stable over time b) Recognize that each ... frame of perception is unique c) Be active in perceiving d) Distinguish facts from inference

Last Answer : a) Recognize the people, objects, and situations remain stable over time

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 : 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 : The basic inference mechanism in semantic network in which knowledge is represented as Frames is to follow the links between the nodes. a) True b) False

Last Answer : a) True

Description : The basic inference mechanism in semantic network is to follow the links between the nodes. a) True b) False

Last Answer : a) True

Description : There are primarily two modes for an inference engine: forward chaining and backward chaining. a) True b) False

Last Answer : a) True

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 : A) Knowledge base (KB) is consists of set of statements. B) Inference is deriving a new sentence from the KB. Choose the correct option. a) A is true, B is true b) A is false, B is false c) A is true, B is false d) A is false, B is true

Last Answer : a) A is true, B is true

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 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 : 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 : 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 : Which of the following, is a component of an expert system? a) inference engine b) knowledge base c) user interface d) all of the mentioned

Last Answer : d) all of the mentioned

Description : Define a Complete inference procedure

Last Answer : An inference procedure is complete if it can derive all true conditions from a set of premises. 

Description : Define an inference procedure

Last Answer : An inference procedure reports whether or not a sentence is entiled by knowledge base provided a knowledge base and a sentence .An inference procedure i' can be described by the sentences that it can derive. If i ... base, we can write. KB --Alpha is derived from KB or i derives alpha from KB. 

Description : Computational learning theory analyzes the sample complexity and computational complexity of __________ a) Unsupervised Learning b) Inductive learning c) Forced based learning d) Weak learning

Last Answer : b) Inductive learning

Description : How many possible sources of complexity are there in forward chaining? a) 1 b) 2 c) 3 d) 4

Last Answer : c) 3

Description : Which will solve the conjuncts of the rule so that the total cost is minimized? a) Constraint variable b) Conjunct ordering c) Data complexity d) All of the mentioned

Last Answer : b) Conjunct ordering

Description : The main idea of Bidirectional search is to reduce the time complexity by searching two way simultaneously from start node and another from goal node. a) True b) False

Last Answer : a) True

Description : The time and space complexity of BFS is (For time and space complexity problems consider b as branching factor and d as depth of the search tree.) a) O(bd+1) and O(bd+1) b) O(b2) and O(d2) c) O(d2) and O(b2) d) O(d2) and O(d2)

Last Answer : a) O(bd+1) and O(bd+1)

Description : What is the space complexity of Depth-first search? a) O(b) b) O(bl) c) O(m) d) O(bm)

Last Answer : d) O(bm)

Description : What is the major component/components for measuring the performance of problem solving? a) Completeness b) Optimality c) Time and Space complexity d) All of the mentioned

Last Answer : d) All of the mentioned

Description : n(log n) is referred to A. A measure of the desired maximal complexity of data mining algorithms B. A database containing volatile data used for the daily operation of an organization C. Relational database management system D. None of these

Last Answer : A. A measure of the desired maximal complexity of data mining algorithms

Description : Computational learning theory analyzes the sample complexity and computational complexity of a) Unsupervised Learning b) Inductive learning c) Forced based learning d) Weak learning e) Knowledge based learning

Last Answer : b) Inductive learning

Description : Where does the Bayes rule can be used? a) Solving queries b) Increasing complexity c) Decreasing complexity d) Answering probabilistic query

Last Answer : d) Answering probabilistic query

Description : Write the time & space complexity associated with depth limited search.

Last Answer : Time complexity =O (bd) ,  b-branching factor,  d-depth of tree Space complexity=o (bl)

Description : Define Occur check.

Last Answer : When matching a variable in 2 expressions against a complex term, one must check whether the variable itself occurs inside the term, If it does the match fails. This is called occur check.

Description : A Horn clause is a clause with _______ positive literal. a) At least one b) At most one c) None d) All

Last Answer : b) At most one

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 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 : What can be viewed as a single lateral of disjunction? a) Multiple clause b) Combine clause c) Unit clause d) None of the mentioned

Last Answer : c) Unit clause

Description : Among the following which is not a horn clause? a) p b) Øp V q c) p → q d) p → Øq

Last Answer : d) p → Øq

Description : What are the processes of Relative clause.

Last Answer : i. Generating Good English sentences  ii. Over generation  iii. Under generation

Description : .Which one is used for compute the logical inference algorithm? a. Validity b.Satisfiability c. Logical equivalence d.All of these

Last Answer : d.All of these

Description : The goodness of an algorithm is most often expressed in terms of its  (1) Best Case complexity (2) Average Case complexity (3) Worst Case complexity (4) Random case complexity

Last Answer : A

Description : .Single inference rule also called… a. Resolution b. Reference c.Reference d.None of these

Last Answer : a. Resolution

Description : A statistical measure based upon the entire population is called parameter while measure based upon a sample is known as: (A) Sample parameter (B) Inference (C) Statistics (D) None of these

Last Answer : (C) Statistics

Description : What is a perception check? a) a cognitive bias that makes us listen only to information we already agree with b) a method teachers use to reward good listeners in the classroom c) ... that allows you to state your interpretation and ask your partner whether or not that interpretation is correct

Last Answer : d) a response that allows you to state your interpretation and ask your partner whether or not that interpretation is correct