What are the 2 types of frame problem?

What are the 2 types of frame problem?
by

1 Answer

Answer :

i. Representational Frame Problem

 ii. Inferential Frame Problem
by

Related questions

The CAI (Computer-Assisted Instruction) technique based on programmed instruction is __________ a) frame-based CAI b) generative CAI c) problem-solving CAI d) intelligent CAI

Description : The CAI (Computer-Assisted Instruction) technique based on programmed instruction is __________ a) frame-based CAI b) generative CAI c) problem-solving CAI d) intelligent CAI

Last Answer : a) frame-based CAI

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 of the following elements constitutes the frame structure? a) Facts or Data b) Procedures and default values c) Frame names d) Frame reference in hierarchy

Description : Which of the following elements constitutes the frame structure? a) Facts or Data b) Procedures and default values c) Frame names d) Frame reference in hierarchy

Last Answer : a) Facts or Data

What is the frame? a) A way of representing knowledge b) Data Structure c) Data Type d) None of the mentioned

Description : What is the frame? a) A way of representing knowledge b) Data Structure c) Data Type d) None of the mentioned

Last Answer : a) A way of representing knowledge

Semantic Network is also known as Frame networks. a) True b) False

Description : Semantic Network is also known as Frame networks. a) True b) False

Last Answer : a) True

What are the different types of problem?

Description : What are the different types of problem?

Last Answer :  Single state problem, multiple state problems, Contingency problem, Exploration problem. 

The component of an ICAI (Intelligent Computer Assisted Instruction) presenting information to the student is the? a) Student model b) Problem solving expertise c) Tutoring module d) All of the mentioned

Description : The component of an ICAI (Intelligent Computer Assisted Instruction) presenting information to the student is the? a) Student model b) Problem solving expertise c) Tutoring module d) All of the mentioned

Last Answer : c) Tutoring module

The Newell and Simon program that proved theorems of Principal Mathematical was ____________ a) Elementary Perceiver b) General Problem Solver c) Logic Theorist d) Boolean Algebra

Description : The Newell and Simon program that proved theorems of Principal Mathematical was ____________ a) Elementary Perceiver b) General Problem Solver c) Logic Theorist d) Boolean Algebra

Last Answer : c) Logic Theorist

Computers normally solve problem by breaking them down into a series of yes-or-no decisions represented by 1s and 0s. What is the name of the logic that allows computers to assign numerical values that fail somewhere between 0 and 1? a) Human logic b) Fuzzy logic c) Boolean logic d) Operational logic

Description : Computers normally solve problem by breaking them down into a series of yes-or-no decisions represented by 1s and 0s. What is the name of the logic that allows computers to assign numerical values that fail ... 0 and 1? a) Human logic b) Fuzzy logic c) Boolean logic d) Operational logic

Last Answer : b) Fuzzy logic

What is the problem space of means-end analysis? a) An initial state and one or more goal states b) One or more initial states and one goal state c) One or more initial states and one or more goal state d) One initial state and one goal state

Description : What is the problem space of means-end analysis? a) An initial state and one or more goal states b) One or more initial states and one goal state c) One or more initial states and one or more goal state d) One initial state and one goal state

Last Answer : a) An initial state and one or more goal states

The traveling salesman problem involves n cities with paths connecting the cities. The time taken for traversing through all the cities, without knowing in advance the length of a minimum tour, is ___________ a) O(n) b) O(n2) c) O(n!) d) O(n/2)

Description : The traveling salesman problem involves n cities with paths connecting the cities. The time taken for traversing through all the cities, without knowing in advance the length of a minimum tour, is ___________ a) O(n) b) O(n2) c) O(n!) d) O(n/2)

Last Answer : c) O(n!)

Which approach to speech recognition avoids the problem caused by the differences in the way words are pronounced according to context? a) continuous speech recognition b) connected word recognition c) isolated word recognition d) speaker-dependent recognition

Description : Which approach to speech recognition avoids the problem caused by the differences in the way words are pronounced according to context? a) continuous speech recognition b) connected word recognition c) isolated word recognition d) speaker-dependent recognition

Last Answer : c) isolated word recognition

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

Why is the XOR problem exceptionally interesting to neural network researchers? a) Because it can be expressed in a way that allows you to use a neural network b) Because it is complex binary operation that cannot be solved using neural networks c) Because it can be solved by a single layer perceptron d) Because it is the simplest linearly inseparable problem that exists.

Description : Why is the XOR problem exceptionally interesting to neural network researchers? a) Because it can be expressed in a way that allows you to use a neural network b) Because it is complex ... solved by a single layer perceptron d) Because it is the simplest linearly inseparable problem that exists.

Last Answer : d) Because it is the simplest linearly inseparable problem that exists.

What is used in determining the nature of the learning problem? a) Environment b) Feedback c) Problem d) All of the mentioned

Description : What is used in determining the nature of the learning problem? a) Environment b) Feedback c) Problem d) All of the mentioned

Last Answer : b) Feedback

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

__________ algorithm translates a planning problem in to prepositional axioms. a) GraphPlan b) SatPlan c) Greedy d) None of the mentioned

Description : __________ algorithm translates a planning problem in to prepositional axioms. a) GraphPlan b) SatPlan c) Greedy d) None of the mentioned

Last Answer : b) SatPlan

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

Planning problem can be described as a propositional logic. a) True b) False

Description : Planning problem can be described as a propositional logic. a) True b) False

Last Answer : a) True

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

The famous spare tire problem or Scheduling classes for bunch of students or Air cargo transport are the best example of ____________ a) Planning problem b) Partial Order planning problem c) Total order planning d) None of the mentioned

Description : The famous spare tire problem or Scheduling classes for bunch of students or Air cargo transport are the best example of ____________ a) Planning problem b) Partial Order planning problem c) Total order planning d) None of the mentioned

Last Answer : a) Planning problem

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

Which kind of problem are suitable for planning graph? a) Propositional planning problem b) Planning problem c) Action problem d) None of the mentioned

Description : Which kind of problem are suitable for planning graph? a) Propositional planning problem b) Planning problem c) Action problem d) None of the mentioned

Last Answer : a) Propositional planning problem

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

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

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

Wumpus World is a classic problem, best example of _______ a) Single player Game b) Two player Game c) Reasoning with Knowledge d) Knowledge based Game

Description : Wumpus World is a classic problem, best example of _______ a) Single player Game b) Two player Game c) Reasoning with Knowledge d) Knowledge based Game

Last Answer : c) Reasoning with Knowledge

Which problem can frequently occur in backward chaining algorithm? a) Repeated states b) Incompleteness c) Complexity d) Both Repeated states & Incompleteness

Description : Which problem can frequently occur in backward chaining algorithm? a) Repeated states b) Incompleteness c) Complexity d) Both Repeated states & Incompleteness

Last Answer : d) Both Repeated states & Incompleteness

Which algorithm will work backward from the goal to solve a problem? a) Forward chaining b) Backward chaining c) Hill-climb algorithm d) None of the mentioned

Description : Which algorithm will work backward from the goal to solve a problem? a) Forward chaining b) Backward chaining c) Hill-climb algorithm d) None of the mentioned

Last Answer : b) Backward chaining

What will happen if a predecessor description is generated that is satisfied by the initial state of the planning problem? a) Success b) Error c) Compilation d) Termination

Description : What will happen if a predecessor description is generated that is satisfied by the initial state of the planning problem? a) Success b) Error c) Compilation d) Termination

Last Answer : d) Termination

A game can be formally defined as a kind of search problem with the following components. a) Initial State b) Successor Function c) Terminal Test d) All of the mentioned

Description : A game can be formally defined as a kind of search problem with the following components. a) Initial State b) Successor Function c) Terminal Test d) All of the mentioned

Last Answer : d) All of the mentioned

Constraint Propagation technique actually modifies the CSP problem. a) True b) False

Description : Constraint Propagation technique actually modifies the CSP problem. a) True b) False

Last Answer : a) True

____________ 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

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

Consider a problem of preparing a schedule for a class of student. What type of problem is this? a) Search Problem b) Backtrack Problem c) CSP d) Planning Problem

Description : Consider a problem of preparing a schedule for a class of student. What type of problem is this? a) Search Problem b) Backtrack Problem c) CSP d) Planning Problem

Last Answer : c) CSP

To overcome the need to backtrack in constraint satisfaction problem can be eliminated by ____________ a) Forward Searching b) Constraint Propagation c) Backtrack after a forward search d) Omitting the constraints and focusing only on goals

Description : To overcome the need to backtrack in constraint satisfaction problem can be eliminated by ____________ a) Forward Searching b) Constraint Propagation c) Backtrack after a forward search d) Omitting the constraints and focusing only on goals

Last Answer : a) Forward Searching

Which of the Following problems can be modeled as CSP? a) 8-Puzzle problem b) 8-Queen problem c) Map coloring problem d) All of the mentioned

Description : Which of the Following problems can be modeled as CSP? a) 8-Puzzle problem b) 8-Queen problem c) Map coloring problem d) All of the mentioned

Last Answer : d) All of the mentioned

Which search uses the problem specific knowledge beyond the definition of the problem? a) Informed search b) Depth-first search c) Breadth-first search d) Uninformed search

Description : Which search uses the problem specific knowledge beyond the definition of the problem? a) Informed search b) Depth-first search c) Breadth-first search d) Uninformed search

Last Answer : a) Informed search

Which algorithm is used to solve any kind of problem? a) Breadth-first algorithm b) Tree algorithm c) Bidirectional search algorithm d) None of the mentioned

Description : Which algorithm is used to solve any kind of problem? a) Breadth-first algorithm b) Tree algorithm c) Bidirectional search algorithm d) None of the mentioned

Last Answer : b) Tree algorithm

Which is the best way to go for Game playing problem? a) Linear approach b) Heuristic approach (Some knowledge is stored) c) Random approach d) An Optimal approach

Description : Which is the best way to go for Game playing problem? a) Linear approach b) Heuristic approach (Some knowledge is stored) c) Random approach d) An Optimal approach

Last Answer : b) Heuristic approach (Some knowledge is stored)

A production rule consists of ____________ a) A set of Rule b) A sequence of steps c) Set of Rule & sequence of steps d) Arbitrary representation to problem

Description : A production rule consists of ____________ a) A set of Rule b) A sequence of steps c) Set of Rule & sequence of steps d) Arbitrary representation to problem

Last Answer : c) Set of Rule & sequence of steps

What is the major component/components for measuring the performance of problem solving? a) Completeness b) Optimality c) Time and Space complexity d) All of the mentioned

Description : What is the major component/components for measuring the performance of problem solving? a) Completeness b) Optimality c) Time and Space complexity d) All of the mentioned

Last Answer : d) All of the mentioned

Web Crawler is a/an ____________ a) Intelligent goal-based agent b) Problem-solving agent

Description : Web Crawler is a/an ____________ a) Intelligent goal-based agent b) Problem-solving agent

Last Answer : a) Intelligent goal-based agent

The _______ is a touring problem in which each city must be visited exactly once. The aim is to find the shortest tour. a) Finding shortest path between a source and a destination b) Travelling Salesman problem c) Map coloring problem d) Depth first search traversal on a given map represented as a graph

Description : The _______ is a touring problem in which each city must be visited exactly once. The aim is to find the shortest tour. a) Finding shortest path between a source and a destination b) Travelling ... c) Map coloring problem d) Depth first search traversal on a given map represented as a graph

Last Answer : b) Travelling Salesman problem

A problem solving approach works well for ______________ a) 8-Puzzle problem b) 8-queen problem c) Finding a optimal path from a given source to a destination d) Mars Hover (Robot Navigation)

Description : A problem solving approach works well for ______________ a) 8-Puzzle problem b) 8-queen problem c) Finding a optimal path from a given source to a destination d) Mars Hover (Robot Navigation)

Last Answer : d) Mars Hover (Robot Navigation)

A solution to a problem is a path from the initial state to a goal state. Solution quality is measured by the path cost function, and an optimal solution has the highest path cost among all solutions. a) True b) False

Description : A solution to a problem is a path from the initial state to a goal state. Solution quality is measured by the path cost function, and an optimal solution has the highest path cost among all solutions. a) True b) False

Last Answer : a) True

The Set of actions for a problem in a state space is formulated by a ___________ a) Intermediate states b) Initial state c) Successor function, which takes current action and returns next immediate state d) None of the mentioned

Description : The Set of actions for a problem in a state space is formulated by a ___________ a) Intermediate states b) Initial state c) Successor function, which takes current action and returns next immediate state d) None of the mentioned

Last Answer : c) Successor function, which takes current action and returns next immediate state

A problem in a search space is defined by one of these state. a) Initial state b) Last state c) Intermediate state d) All of the mentioned

Description : A problem in a search space is defined by one of these state. a) Initial state b) Last state c) Intermediate state d) All of the mentioned

Last Answer : a) Initial state

A search algorithm takes _________ as an input and returns ________ as an output. a) Input, output b) Problem, solution c) Solution, problem d) Parameters, sequence of actions

Description : A search algorithm takes _________ as an input and returns ________ as an output. a) Input, output b) Problem, solution c) Solution, problem d) Parameters, sequence of actions

Last Answer : b) Problem, solution

The problem-solving agent with several immediate options of unknown value can decide what to do by just examining different possible sequences of actions that lead to states of known value, and then choosing the best sequence. This process of looking for such a sequence is called Search. a) True b) False

Description : The problem-solving agent with several immediate options of unknown value can decide what to do by just examining different possible sequences of actions that lead to states of known value, and then choosing the ... . This process of looking for such a sequence is called Search. a) True b) False

Last Answer : a) True