Define a Complete inference procedure

Define a Complete inference procedure
by

1 Answer

Answer :

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

Related questions

Which is a refutation complete inference procedure for propositional logic? a) Clauses b) Variables c) Propositional resolution d) Proposition

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

Define an inference procedure

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. 

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

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

Last Answer : a) Speech recognition

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 person’s frame of perception is unique c) Be active in perceiving d) Distinguish facts from inference

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

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

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

Which makes the complexity of the entire algorithm quadratic in the size? a) Clause b) Inference c) Resolution d) Occur check

Description : Which makes the complexity of the entire algorithm quadratic in the size? a) Clause b) Inference c) Resolution d) Occur check

Last Answer : d) Occur check

Which algorithm takes two sentences and returns a unifier? a) Inference b) Hill-climbing search c) Depth-first search d) Unify algorithm

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

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

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

What is the process of capturing the inference process as a single inference rule? a) Ponens b) Clauses c) Generalized Modus Ponens d) Variables

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

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

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

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

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

Last Answer : a) True

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

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

Last Answer : a) True

Lifted inference rules require finding substitutions that make different logical expressions looks identical. a) Existential Instantiation b) Universal Instantiation c) Unification d) Modus Ponen

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

An inference algorithm that derives only entailed sentences is called sound or truth-preserving. a) True b) False

Description : An inference algorithm that derives only entailed sentences is called sound or truth-preserving. a) True b) False

Last Answer : a) True

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

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

Which closely resembles propositional definite clause? a) Resolution b) Inference c) Conjunction d) First-order definite clauses

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

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

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

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

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

Which is also called single inference rule? a) Reference b) Resolution c) Reform d) None of the mentioned

Description : Which is also called single inference rule? a) Reference b) Resolution c) Reform d) None of the mentioned

Last Answer : b) Resolution

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

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

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

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

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

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

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

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

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

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

Define a complete plan.

Description : Define a complete plan.

Last Answer : A complete plan is one in which every precondition of every step is achieved by some other step. 

Artificial intelligence is A . It uses machine-learning techniques. Here program can learn From past experience and adapt themselves to new situations B. Computational procedure that takes some value as input and produces some value as output. C. Science of making machines performs tasks that would require intelligence when performed by humans D . None of these

Description : Artificial intelligence is A . It uses machine-learning techniques. Here program can learn From past experience and adapt themselves to new situations B. Computational procedure that takes some ... performs tasks that would require intelligence when performed by humans D . None of these

Last Answer : C. Science of making machines performs tasks that would require intelligence when performed by humans

What are the principles that are followed by any learning procedure?

Description : What are the principles that are followed by any learning procedure?

Last Answer : i. The wait and see principle. ii. The no altering principle. iii. Martin’s law.

Give the procedure of IDA* search.

Description : Give the procedure of IDA* search.

Last Answer : Minimize f(n)=g(n)+h(n) combines the advantage of uniform cost search + greedy search A* is complete, optimal. Its space complexity is still prohibitive. Iterative improvement algorithms keep only a ... a depth limit. Thus each iteration expands all nodes inside the contour for the current f-cost.

An algorithm is complete if ____________ a) It terminates with a solution when one exists b) It starts with a solution c) It does not terminate with a solution d) It has a loop

Description : An algorithm is complete if ____________ a) It terminates with a solution when one exists b) It starts with a solution c) It does not terminate with a solution d) It has a loop

Last Answer : a) It terminates with a solution when one exists

Which inverts a complete resolution strategy? a) Inverse resolution b) Resolution c) Trilogy d) None of the mentioned

Description : Which inverts a complete resolution strategy? a) Inverse resolution b) Resolution c) Trilogy d) None of the mentioned

Last Answer : a) Inverse resolution

What does the bayesian network provides? a) Complete description of the domain b) Partial description of the domain c) Complete description of the problem d) None of the mentioned

Description : What does the bayesian network provides? a) Complete description of the domain b) Partial description of the domain c) Complete description of the problem d) None of the mentioned

Last Answer : a) Complete description of the domain

Which is the complete specification of the state of the world? a) Atomic event b) Complex event c) Simple event d) None of the mentioned

Description : Which is the complete specification of the state of the world? a) Atomic event b) Complex event c) Simple event d) None of the mentioned

Last Answer : a) Atomic event

What can’t be done in the semantic interpretation? a) Logical term b) Complete logical sentence c) Both Logical term & Complete logical sentence d) None of the mentioned

Description : What can’t be done in the semantic interpretation? a) Logical term b) Complete logical sentence c) Both Logical term & Complete logical sentence d) None of the mentioned

Last Answer : c) Both Logical term & Complete logical sentence

The process by which the brain orders actions needed to complete a specific task is referred as ____________ a) Planning problem b) Partial order planning c) Total order planning d) Both Planning problem & Partial order planning

Description : The process by which the brain orders actions needed to complete a specific task is referred as ____________ a) Planning problem b) Partial order planning c) Total order planning d) Both Planning problem & Partial order planning

Last Answer : d) Both Planning problem & Partial order planning

The process by which the brain incrementally orders actions needed to complete a specific task is referred as ______________ a) Planning problem b) Partial order planning c) Total order planning d) Both Planning problem & Partial order planning

Description : The process by which the brain incrementally orders actions needed to complete a specific task is referred as ______________ a) Planning problem b) Partial order planning c) Total order planning d) Both Planning problem & Partial order planning

Last Answer : b) Partial order planning

Graph used to represent semantic network is _____________ a) Undirected graph b) Directed graph c) Directed Acyclic graph (DAG) d) Directed complete graph

Description : Graph used to represent semantic network is _____________ a) Undirected graph b) Directed graph c) Directed Acyclic graph (DAG) d) Directed complete graph

Last Answer : b) Directed graph

When the resolution is called as refutation-complete? a) Sentence is satisfiable b) Sentence is unsatisfiable c) Sentence remains the same d) None of the mentioned

Description : When the resolution is called as refutation-complete? a) Sentence is satisfiable b) Sentence is unsatisfiable c) Sentence remains the same d) None of the mentioned

Last Answer : b) Sentence is unsatisfiable

Solving a constraint satisfaction problem on a finite domain is an/a ___________ problem with respect to the domain size. a) P complete b) NP complete c) NP hard

Description : Solving a constraint satisfaction problem on a finite domain is an/a ___________ problem with respect to the domain size. a) P complete b) NP complete c) NP hard

Last Answer : b) NP complete

A complete, local search algorithm always finds goal if one exists, an optimal algorithm always finds a global minimum/maximum. a) True b) False

Description : A complete, local search algorithm always finds goal if one exists, an optimal algorithm always finds a global minimum/maximum. a) True b) False

Last Answer : a) True

Which search is complete and optimal when h(n) is consistent? a) Best-first search b) Depth-first search c) Both Best-first & Depth-first search d) A* search

Description : Which search is complete and optimal when h(n) is consistent? a) Best-first search b) Depth-first search c) Both Best-first & Depth-first search d) A* search

Last Answer : d) A* search

What is meant by agent’s percept sequence? a) Used to perceive the environment b) Complete history of actuator c) Complete history of perceived things d) None of the mentioned

Description : What is meant by agent’s percept sequence? a) Used to perceive the environment b) Complete history of actuator c) Complete history of perceived things d) None of the mentioned

Last Answer : c) Complete history of perceived things

A network with named nodes and labeled arcs that can be used to represent certain natural language grammars to facilitate parsing. a) Tree Network b) Star Network c) Transition Network d) Complete Network

Description : A network with named nodes and labeled arcs that can be used to represent certain natural language grammars to facilitate parsing. a) Tree Network b) Star Network c) Transition Network d) Complete Network

Last Answer : c) Transition Network

The region of universe that is characterized by complete membership in the set is called A. Core B. Support C. Boundary D. Fuzzy

Description : The region of universe that is characterized by complete membership in the set is called A. Core B. Support C. Boundary D. Fuzzy

Last Answer : A. Core

What does the Bayesian network provides? a) Complete description of the domain b) Partial description of the domain c) Complete description of the problem d) None of the mentioned

Description : What does the Bayesian network provides? a) Complete description of the domain b) Partial description of the domain c) Complete description of the problem d) None of the mentioned

Last Answer : a) Complete description of the domain

The initial state and the legal moves for each side define the __________ for the game. a) Search Tree b) Game Tree c) State Space Search d) Forest

Description :  The initial state and the legal moves for each side define the __________ for the game. a) Search Tree b) Game Tree c) State Space Search d) Forest

Last Answer : b) Game Tree

Define Information Extraction.

Description : Define Information Extraction.

Last Answer : It is a process of creating database entries by skimming a text and looking for occurrences of a particular class of object.

Define Information Retrieval (IR).

Description : Define Information Retrieval (IR).

Last Answer :  IR is the task of finding documents that are relevant to user’s need for information. 

Define Segmentation?

Description : Define Segmentation?

Last Answer :  The process of finding the words boundaries in a text with no spaces. 

Define Discourse understanding.

Description : Define Discourse understanding.

Last Answer :  A discourage is any string of language usually one that is more than one sentence long. 

Define Disambiguation.

Description : Define Disambiguation.

Last Answer : The speaker’s aim is to communicate some words in utterance and hearer work is to get back the meaning of the world from the knowledge of situation.