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

Which sentence will be unsatisfiable if the CNF sentence is unsatisfiable?

a) Search statement

b) Reading statement

c) Replaced statement

d) Original statement
by

1 Answer

Answer :

d) Original statement
by

Related questions

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

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

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 primary method that people use to sense their environment is ____________ a) reading b) writing c) speaking d) seeing

Description : The primary method that people use to sense their environment is ____________ a) reading b) writing c) speaking d) seeing

Last Answer : d) seeing

Which provides agents with information about the world they inhabit? a) Sense b) Perception c) Reading d) Hearing

Description : Which provides agents with information about the world they inhabit? a) Sense b) Perception c) Reading d) Hearing

Last Answer : b) Perception

What is the primary interactive method of communication used by humans? a) reading b) writing c) speaking d) all of the mentioned

Description : What is the primary interactive method of communication used by humans? a) reading b) writing c) speaking d) all of the mentioned

Last Answer : c) speaking

The original LISP machines produced by both LMI and Symbolics were based on research performed at? a) CMU b) MIT c) Stanford University d) RAMD

Description : The original LISP machines produced by both LMI and Symbolics were based on research performed at? a) CMU b) MIT c) Stanford University d) RAMD

Last Answer : b) MIT

The original LISP machines produced by both LMI and Symbolics were based on research performed at __________ a) CMU b) MIT c) Stanford University d) RAMD

Description : The original LISP machines produced by both LMI and Symbolics were based on research performed at __________ a) CMU b) MIT c) Stanford University d) RAMD

Last Answer : b) MIT

____________ is/are useful when the original formulation of a problem is altered in some way, typically because the set of constraints to consider evolves because of the environment. a) Static CSPs b) Dynamic CSPs c) Flexible CSPs d) None of the mentioned

Description : ____________ is/are useful when the original formulation of a problem is altered in some way, typically because the set of constraints to consider evolves because of the environment. a) Static CSPs b) Dynamic CSPs c) Flexible CSPs d) None of the mentioned

Last Answer : b) Dynamic CSPs

Neurons or artificial neurons have the capability to model networks of original neurons as found in brain A. True B. False

Description : Neurons or artificial neurons have the capability to model networks of original neurons as found in brain A. True B. False

Last Answer : A. True

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

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

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

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

In which of the following situations might a blind search be acceptable? a) Real life situation b) Complex game c) Small search space d) All of the mentioned

Description : In which of the following situations might a blind search be acceptable? a) Real life situation b) Complex game c) Small search space d) All of the mentioned

Last Answer : c) Small search space

Which is true regarding BFS (Breadth First Search)? a) BFS will get trapped exploring a single path b) The entire tree so far been generated must be stored in BFS c) BFS is not guaranteed to find a solution if exists d) BFS is nothing but Binary First Search

Description : Which is true regarding BFS (Breadth First Search)? a) BFS will get trapped exploring a single path b) The entire tree so far been generated must be stored in BFS c) BFS is not guaranteed to find a solution if exists d) BFS is nothing but Binary First Search

Last Answer : b) The entire tree so far been generated must be stored in BFS

Which algorithm is used for solving temporal probabilistic reasoning? a) Hill-climbing search b) Hidden markov model c) Depth-first search d) Breadth-first search

Description : Which algorithm is used for solving temporal probabilistic reasoning? a) Hill-climbing search b) Hidden markov model c) Depth-first search d) Breadth-first search

Last Answer : b) Hidden markov model

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

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

To eliminate the inaccuracy problem in planning problem or partial order planning problem we can use ___________________ data structure/s. a) Stacks b) Queue c) BST (Binary Search Tree) d) Planning Graphs

Description : To eliminate the inaccuracy problem in planning problem or partial order planning problem we can use ___________________ data structure/s. a) Stacks b) Queue c) BST (Binary Search Tree) d) Planning Graphs

Last Answer : d) Planning Graphs

Which is used to extract solution directly from the planning graph? a) Planning algorithm b) Graphplan c) Hill-climbing search d) All of the mentioned

Description : Which is used to extract solution directly from the planning graph? a) Planning algorithm b) Graphplan c) Hill-climbing search d) All of the mentioned

Last Answer : b) Graphplan

Which strategy is used for delaying a choice during search? a) First commitment b) Least commitment c) Both First & Least commitment d) None of the mentioned

Description : Which strategy is used for delaying a choice during search? a) First commitment b) Least commitment c) Both First & Least commitment d) None of the mentioned

Last Answer : b) Least commitment

Which cannot be taken as advantage for totally ordered plan search? a) Composition b) State search c) Problem decomposition d) None of the mentioned

Description : Which cannot be taken as advantage for totally ordered plan search? a) Composition b) State search c) Problem decomposition d) None of the mentioned

Last Answer : c) Problem decomposition

Which of the following search belongs to totally ordered plan search? a) Forward state-space search b) Hill-climbing search c) Depth-first search d) Breadth-first search

Description : Which of the following search belongs to totally ordered plan search? a) Forward state-space search b) Hill-climbing search c) Depth-first search d) Breadth-first search

Last Answer : a) Forward state-space search

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

There exists two way to infer using semantic networks in which knowledge is represented as Frames. 1) Intersection Search 2) Inheritance Search a) True b) False

Description : There exists two way to infer using semantic networks in which knowledge is represented as Frames. 1) Intersection Search 2) Inheritance Search a) True b) False

Last Answer : 1) Intersection Search

Inheritance Search a) True b) False

Description : Inheritance Search a) True b) False

Last Answer : a) True

Which algorithm are in more similar to backward chaining algorithm? a) Depth-first search algorithm b) Breadth-first search algorithm c) Hill-climbing search algorithm d) All of the mentioned

Description : Which algorithm are in more similar to backward chaining algorithm? a) Depth-first search algorithm b) Breadth-first search algorithm c) Hill-climbing search algorithm d) All of the mentioned

Last Answer : a) Depth-first search algorithm

A _________ is used to demonstrate, on a purely syntactic basis, that one formula is a logical consequence of another formula. a) Deductive Systems b) Inductive Systems c) Reasoning with Knowledge Based Systems d) Search Based Systems

Description : A _________ is used to demonstrate, on a purely syntactic basis, that one formula is a logical consequence of another formula. a) Deductive Systems b) Inductive Systems c) Reasoning with Knowledge Based Systems d) Search Based Systems

Last Answer : a) Deductive Systems

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

Which search is similar to minimax search? a) Hill-climbing search b) Depth-first search c) Breadth-first search d) All of the mentioned

Description : Which search is similar to minimax search? a) Hill-climbing search b) Depth-first search c) Breadth-first search d) All of the mentioned

Last Answer : b) Depth-first search

Which values are independant in minimax search algorithm? a) Pruned leaves x and y b) Every states are dependant c) Root is independant d) None of the mentioned

Description : Which values are independant in minimax search algorithm? a) Pruned leaves x and y b) Every states are dependant c) Root is independant d) None of the mentioned

Last Answer : a) Pruned leaves x and y

Which search is equal to minimax search but eliminates the branches that can’t influence the final decision? a) Depth-first search b) Breadth-first search c) Alpha-beta pruning d) None of the mentioned

Description : Which search is equal to minimax search but eliminates the branches that can’t influence the final decision? a) Depth-first search b) Breadth-first search c) Alpha-beta pruning d) None of the mentioned

Last Answer : c) Alpha-beta pruning

What is the other name of the backward state-space search? a) Regression planning b) Progression planning c) State planning d) Test planning

Description : What is the other name of the backward state-space search? a) Regression planning b) Progression planning c) State planning d) Test planning

Last Answer : a) Regression planning

What is the main advantage of backward state-space search? a) Cost b) Actions c) Relevant actions d) All of the mentioned

Description : What is the main advantage of backward state-space search? a) Cost b) Actions c) Relevant actions d) All of the mentioned

Last Answer : c) Relevant actions

How many states are available in state-space search? a) 1 b) 2 c) 3 d) 4

Description : How many states are available in state-space search? a) 1 b) 2 c) 3 d) 4

Last Answer : d) 4

What is the other name for forward state-space search? a) Progression planning b) Regression planning c) Test planning d) None of the mentioned

Description : What is the other name for forward state-space search? a) Progression planning b) Regression planning c) Test planning d) None of the mentioned

Last Answer : a) Progression planning

How many ways are available to solve the state-space search? a) 1 b) 2 c) 3 d) 4

Description : How many ways are available to solve the state-space search? a) 1 b) 2 c) 3 d) 4

Last Answer : b) 2

What are taken into account of state-space search? a) Postconditions b) Preconditions c) Effects d) Both Preconditions & Effects

Description : What are taken into account of state-space search? a) Postconditions b) Preconditions c) Effects d) Both Preconditions & Effects

Last Answer : d) Both Preconditions & Effects

Which is the most straightforward approach for planning algorithm? a) Best-first search b) State-space search c) Depth-first search d) Hill-climbing search

Description : Which is the most straightforward approach for planning algorithm? a) Best-first search b) State-space search c) Depth-first search d) Hill-climbing search

Last Answer : b) State-space search