Define an inference procedure

Define an inference procedure
by

1 Answer

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 can derive from knowledge base, we can write. KB --Alpha is derived from KB or i derives alpha from KB. 
by

Related questions

Define a Complete inference procedure

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. 

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

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

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.

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.

Define Ambiguity.

Description : Define Ambiguity.

Last Answer :  The sentence that does not provide exact meaning are called ambiguous sentence. 

Define Sub categorization.

Description : Define Sub categorization.

Last Answer : E 2 eliminates VP by mentioning which phrases can allow which verbs which are known as sub categorization.

Define DCG.

Description : Define DCG.

Last Answer : The method of rewriting the existing rules in the grammar by the method of augmentation is called as DCG (Define Clause Grammar). 

Define Augmentation.

Description : Define Augmentation.

Last Answer : The process of adding the existing rules of a grammar instead of introducing new rules. It is called Augmentation.

Define Bottom up parsing.

Description : Define Bottom up parsing.

Last Answer :  We start from the leaf nodes (i.e.) with the words and search for a tree with root S. 

Define Top down parsing.

Description : Define Top down parsing. 

Last Answer :  It starts with root node S and search for a tree that has the words as it leaves. 

Define Parsing.

Description : Define Parsing.

Last Answer : Parsing is the process of finding a parse tree for a given input string. It is also known as syntactic analysis.

Define Semantic Interpretation.

Description : Define Semantic Interpretation.

Last Answer :  The process of extracting the meaning of an utterance an expression in some representation language. 

Define Formal Language.

Description : Define Formal Language.

Last Answer :  A formal language is defined as a set of strings of terminal symbols. It is called as words. 

Define Language.

Description : Define Language. 

Last Answer :  Language enables us to communicate most of what we have observed about the environment. 

Define Communication.

Description : Define Communication.

Last Answer : Communication is the international exchange of information brought about by the production and perception of signs drawn from a shared system of conventional signs.

Define Reification.

Description : Define Reification.

Last Answer : The process of treating something abstract and difficult to talk about as though it were concrete and easy to talk about is called as reification. 

Define Similarity nets.

Description : Define Similarity nets.

Last Answer : Similarity net is an approach for arranging models. Similarity net is a representation in which nodes denotes models, links connect similar models and links are tied to different descriptions. 

Define conditional planning.

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.

Define a consistent plan.

Description : Define a consistent plan.

Last Answer : A consistent plan is one in which there are no contradictions in the ordering or binding constraints. 

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. 

Define a solution

Description : Define a solution

Last Answer : A solution is defined as a plan that an agent can execute and that guarantees the achievement of goal.