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

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
by

1 Answer

Answer :

b) Sentence is unsatisfiable
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

Which sentence will be unsatisfiable if the CNF sentence is unsatisfiable? a) Search statement b) Reading statement c) Replaced statement d) Original statement

Description : Which sentence will be unsatisfiable if the CNF sentence is unsatisfiable? a) Search statement b) Reading statement c) Replaced statement d) Original statement

Last Answer : d) Original statement

What is Coreference Resolution? a) Anaphora Resolution b) Given a sentence or larger chunk of text, determine which words (“mentions”) refer to the same objects (“entities”) c) All of the mentioned d) None of the mentioned

Description : What is Coreference Resolution? a) Anaphora Resolution b) Given a sentence or larger chunk of text, determine which words (“mentions”) refer to the same objects (“entities”) c) All of the mentioned d) None of the mentioned

Last Answer : b) Given a sentence or larger chunk of text, determine which words (“mentions”) refer to the same objects (“entities”)

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

Which of the following statements is true? (1) The sentence S is a logical consequence of S1,..., Sn if and only if S1˄S2˄........˄Sn→S is satisfiable. (2) The sentence S is a logical consequence of S1,..., Sn if and only if S1˄S2˄........˄Sn→S is valid. (3) The sentence S is a logical consequence of S1,..., Sn if and only if S1˄S2˄........˄Sn˄¬S is consistent. (4) The sentence S is a logical consequence of S1,..., Sn if and only if S1˄S2˄........˄Sn˄S is inconsistent.

Description : Which of the following statements is true? (1) The sentence S is a logical consequence of S1,..., Sn if and only if S1˄S2˄........˄Sn→S is satisfiable. (2) The sentence S is a logical consequence of ... S is a logical consequence of S1,..., Sn if and only if S1˄S2˄........˄Sn˄S is inconsistent.

Last Answer : The sentence S is a logical consequence of S1,..., Sn if and only if S1˄S2˄........˄Sn→S is valid.

What will happen if two literals are identical? a) Remains the same b) Added as three c) Reduced to one d) None of the mentioned

Description : What will happen if two literals are identical? a) Remains the same b) Added as three c) Reduced to one d) None of the mentioned

Last Answer : c) Reduced to one

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

High-resolution, bit-mapped displays are useful for displaying _____________ a) clearer characters b) graphics c) more characters d) all of the mentioned

Description : High-resolution, bit-mapped displays are useful for displaying _____________ a) clearer characters b) graphics c) more characters d) all of the mentioned

Last Answer : c) more characters

Parts-of-Speech tagging determines ___________ a) part-of-speech for each word dynamically as per meaning of the sentence b) part-of-speech for each word dynamically as per sentence structure c) all part-of-speech for a specific word given as input d) all of the mentioned

Description : Parts-of-Speech tagging determines ___________ a) part-of-speech for each word dynamically as per meaning of the sentence b) part-of-speech for each word dynamically as per sentence structure c) all part-of-speech for a specific word given as input d) all of the mentioned

Last Answer : d) all of the mentioned

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

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

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

Human wants are (a) Unsatisfiable ; (b) Unlimited ; (c) Undefined ; (d) Limited

Description : Human wants are (a) Unsatisfiable ; (b) Unlimited ; (c) Undefined ; (d) Limited

Last Answer : ; (b) Unlimited ;

The more general task of coreference resolution also includes identifying so-called “bridging relationships” involving referring expressions. a) True b) False

Description : The more general task of coreference resolution also includes identifying so-called “bridging relationships” involving referring expressions. a) True b) False

Last Answer : a) True

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

For resolution to apply, all sentences must be in conjunctive normal form, a conjunction of disjunctions of literals. a) True b) False

Description : For resolution to apply, all sentences must be in conjunctive normal form, a conjunction of disjunctions of literals. a) True b) False

Last Answer : a) 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

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 is a top-down parser? a) Begins by hypothesizing a sentence (the symbol S) and successively predicting lower level constituents until individual pre-terminal symbols are written b) Begins by hypothesizing a sentence (the symbol S) and successively predicting upper level constituents until individual pre-terminal symbols are written c) Begins by hypothesizing lower level constituents and successively predicting a sentence (the symbol S) d) Begins by hypothesizing upper level constituents and successively predicting a sentence (the symbol S)

Description : What is a top-down parser? a) Begins by hypothesizing a sentence (the symbol S) and successively predicting lower level constituents until individual pre-terminal symbols are written b) ... d) Begins by hypothesizing upper level constituents and successively predicting a sentence (the symbol S)

Last Answer : a) Begins by hypothesizing a sentence (the symbol S) and successively predicting lower level constituents until individual pre-terminal symbols are written

The corresponding Existential Instantiation rule: for the existential quantifier is slightly more complicated. For any sentence a, variable v, and constant symbol k that does not appear elsewhere in the knowledge base. a) True b) False

Description : The corresponding Existential Instantiation rule: for the existential quantifier is slightly more complicated. For any sentence a, variable v, and constant symbol k that does not appear elsewhere in the knowledge base. a) True b) False

Last Answer : a) True

The rule of Universal Instantiation (UI for short) says that we can infer any sentence obtained by substituting a ground term (a term without variables) for the variable. a) True b) False

Description : The rule of Universal Instantiation (UI for short) says that we can infer any sentence obtained by substituting a ground term (a term without variables) for the variable. a) True b) False

Last Answer : a) True

α |= β ‘(to mean that the sentence α entails the sentence β) if and only if, in every model in which α is _____ β is also _____ a) True, true b) True, false c) False, true

Description : α |= β ‘(to mean that the sentence α entails the sentence β) if and only if, in every model in which α is _____ β is also _____ a) True, true b) True, false c) False, true

Last Answer : a) True, 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

What is a top-down parser? a) Begins by hypothesizing a sentence (the symbol S) and successively predicting lower level constituents until individual preterminal symbols are written b) Begins by hypothesizing a sentence (the symbol S) and successively predicting upper level constituents until individual preterminal symbols are written c) Begins by hypothesizing lower level constituents and successively predicting a sentence (the symbol S) d) Begins by hypothesizing upper level constituents and successively predicting a sentence (the symbol S)

Description : What is a top-down parser? a) Begins by hypothesizing a sentence (the symbol S) and successively predicting lower level constituents until individual preterminal symbols are written b) Begins ... ) Begins by hypothesizing upper level constituents and successively predicting a sentence (the symbol S)

Last Answer : a) Begins by hypothesizing a sentence (the symbol S) and successively predicting lower level constituents until individual preterminal symbols are written

Define true sentence

Description : Define true sentence

Last Answer : A sentence is true under a particular interpretation if the state of affairs it represents is the case. 

Define Satistiability of a sentence

Description : Define Satistiability of a sentence

Last Answer : A sentence is satisfiable if and only if there is some interpretation in some world for which it is true

Define Validity of a sentence

Description : Define Validity of a sentence

Last Answer : A sentence is valid or necessarily true if and only if it is true under all possible interpretation in all posssible world.

Define synchronic and diachronic sentence.

Description : Define synchronic and diachronic sentence.

Last Answer : Sentences dealing with same time are called synchronic sentences. Sentences that allow reasoning “a cross time” are called diachronic sentence.

Define Atomic sentence.

Description : Define Atomic sentence.

Last Answer : Atomic sentence is formed by both objects and relations. Example  Brother (William, Richard)  William is the brother of Richard.

Define a Sentence?

Description : Define a Sentence?

Last Answer : Each individual representation of facts is called a sentence. The sentences are expressed in a language called as knowledge representation language.

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

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

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

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

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

What is called as the properties of the signal that extend over interval? a) Hops b) Rate c) Frames d) All of the mentioned

Description : What is called as the properties of the signal that extend over interval? a) Hops b) Rate c) Frames d) All of the mentioned

Last Answer : c) Frames

MCC is investigating the improvement of the relationship between people and computers through a technology called ___________ a) computer-aided design b) human factors c) parallel processing d) all of the mentioned

Description : MCC is investigating the improvement of the relationship between people and computers through a technology called ___________ a) computer-aided design b) human factors c) parallel processing d) all of the mentioned

Last Answer : b) human factors

There are also other operators, more linguistic in nature, called __________ that can be applied to fuzzy set theory. a) Hedges b) Lingual Variable c) Fuzz Variable d) None of the mentioned

Description : There are also other operators, more linguistic in nature, called __________ that can be applied to fuzzy set theory. a) Hedges b) Lingual Variable c) Fuzz Variable d) None of the mentioned

Last Answer : a) Hedges

What is called inconsistent support? a) If two literals are not negation of other b) If two literals are negation of other c) Mutually exclusive d) None of the mentioned

Description : What is called inconsistent support? a) If two literals are not negation of other b) If two literals are negation of other c) Mutually exclusive d) None of the mentioned

Last Answer : b) If two literals are negation of other

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

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

Which form is called as a conjunction of disjunction of literals? a) Conjunctive normal form b) Disjunctive normal form c) Normal form d) All of the mentioned

Description : Which form is called as a conjunction of disjunction of literals? a) Conjunctive normal form b) Disjunctive normal form c) Normal form d) All of the mentioned

Last Answer : a) Conjunctive normal form

What is called as transposition table? a) Hash table of next seen positions b) Hash table of previously seen positions c) Next value in the search d) None of the mentioned

Description : What is called as transposition table? a) Hash table of next seen positions b) Hash table of previously seen positions c) Next value in the search d) None of the mentioned

Last Answer : b) Hash table of previously seen positions