Define a complete plan.

Define a complete plan.
by

1 Answer

Answer :

A complete plan is one in which every precondition of every step is achieved by some other step. 
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. 

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. 

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

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

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

Which kind of planning consists of successive representations of different levels of a plan? a) Hierarchical planning b) Non-hierarchical planning c) Project planning

Description : Which kind of planning consists of successive representations of different levels of a plan? a) Hierarchical planning b) Non-hierarchical planning c) Project planning

Last Answer : a) Hierarchical planning

Incorrect information results in unsatisfied preconditions for actions and plans _____________ detects violations of the preconditions for successful completion of the plan. a) Conditional Plan b) Conformant Planning c) Execution monitoring d) Both Conditional Plan & Execution monitoring

Description : Incorrect information results in unsatisfied preconditions for actions and plans _____________ detects violations of the preconditions for successful completion of the plan. a) Conditional Plan b) Conformant Planning c) Execution monitoring d) Both Conditional Plan & Execution monitoring

Last Answer : c) Execution monitoring

Conditional Plans allows the agent to sense the world during execution to decide what branch of plan to follow. a) True b) False

Description : Conditional Plans allows the agent to sense the world during execution to decide what branch of plan to follow. a) True b) False

Last Answer : a) True

What is the other name of each plan resulted in partial order planning? a) Polarization b) Linearization c) Solarization d) None of the mentioned

Description : What is the other name of each plan resulted in partial order planning? a) Polarization b) Linearization c) Solarization d) None of the mentioned

Last Answer : b) Linearization

_____________ algorithms is used to extract the plan directly from the planning graph, rather than using graph to provide heuristic. a) BFS/DFS b) A* c) Graph-Plan d) Greedy

Description : _____________ algorithms is used to extract the plan directly from the planning graph, rather than using graph to provide heuristic. a) BFS/DFS b) A* c) Graph-Plan d) Greedy

Last Answer : c) Graph-Plan

What are present in the empty plan? a) Start b) Finish c) Modest d) Both Start & Finish

Description : What are present in the empty plan? a) Start b) Finish c) Modest d) Both Start & Finish

Last Answer : d) Both Start & Finish

Which algorithm places two actions into a plan without specifying which should come first? a) Full-order planner b) Total-order planner c) Semi-order planner d) Partial-order planner

Description : Which algorithm places two actions into a plan without specifying which should come first? a) Full-order planner b) Total-order planner c) Semi-order planner d) Partial-order planner

Last Answer : d) Partial-order planner

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

A plan that describe how to take actions in levels of increasing refinement and specificity is ____________ a) Problem solving b) Planning c) Non-hierarchical plan d) Hierarchical plan

Description : A plan that describe how to take actions in levels of increasing refinement and specificity is ____________ a) Problem solving b) Planning c) Non-hierarchical plan d) Hierarchical plan

Last Answer : d) Hierarchical plan

In partial order plan. A. Relationships between the actions of the behavior are set prior to the actions B. Relationships between the actions of the behavior are not set until absolutely necessary Choose the correct option. a) A is true b) B is true c) Either A or B can be true depending upon situation d) Neither A nor B is true

Description : In partial order plan. A. Relationships between the actions of the behavior are set prior to the actions B. Relationships between the actions of the behavior are not set until absolutely necessary Choose the ... ) Either A or B can be true depending upon situation d) Neither A nor B is true

Last Answer : a) A is true

Which action sequences are used to achieve the agent’s goal? a) Search b) Plan c) Retrieve d) Both Search & Plan

Description : Which action sequences are used to achieve the agent’s goal? a) Search b) Plan c) Retrieve d) Both Search & Plan

Last Answer : d) Both Search & Plan

Which kind of planning consists of successive representations of different levels of a plan? a) hierarchical planning b) non-hierarchical planning c) project planning d) all of the mentioned

Description : Which kind of planning consists of successive representations of different levels of a plan? a) hierarchical planning b) non-hierarchical planning c) project planning d) all of the mentioned

Last Answer : a) hierarchical planning

Which kind of planning consists of successive representations of different levels of a plan? a. hierarchical planning b. non-hierarchical planning c. All of the above d. project planning

Description : Which kind of planning consists of successive representations of different levels of a plan? a. hierarchical planning b. non-hierarchical planning c. All of the above d. project planning

Last Answer : a. hierarchical planning

What are the components that are needed for representing a plan?

Description : What are the components that are needed for representing a plan?

Last Answer : The components that are needed for representing a plan are: A set of plans steps. A set of ordering constraints.

Ability to think, puzzle, make judgments, plan, learn, communication by its own is known as ___ AI. A. Narrow AI B. General AI C. Super AI D. None of above

Description : Ability to think, puzzle, make judgments, plan, learn, communication by its own is known as ___ AI. A. Narrow AI B. General AI C. Super AI D. None of above

Last Answer : C. Super AI 

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.