Movatterモバイル変換


[0]ホーム

URL:


Bharat  Bhushan, profile picture
Uploaded byBharat Bhushan
PDF, PPTX4,912 views

Problem Characteristics in Artificial Intelligence

The document discusses the characteristics of problems in artificial intelligence, emphasizing the need to categorize problems based on aspects such as decomposability, predictability, and the role of knowledge. It outlines different types of problems, including ignorable, recoverable, and irrecoverable problems, and explains their solutions. Additionally, it covers the necessity of human interaction in problem-solving and the importance of knowledge in AI applications.

In this document
Powered by AI

Presentation introduction by Bharat Bhushan on problem characteristics in Artificial Intelligence.

Classification of AI problems based on characteristics such as decomposability, solution retrievability, predictability, and the need for human interaction.

Decomposable problems can be simplified into smaller, manageable sub-problems for easier resolution.

Differentiation between ignorable, recoverable, and irrecoverable problems through examples like theorems and games.

Exploration of problem outcomes—predictable versus uncertain—and their implications in planning solutions.

Discussion on the Travelling Salesman Problem and the use of heuristics to find optimal paths.

Explanation of path-solution versus state-solution problems using the Water Jug Problem as an example.

The importance of knowledge in AI solutions varies by problem complexity, with examples from chess and newspaper scanning.

Assessment of the necessity for human interaction in AI, distinguishing solitary from conversational problems.

Closing remarks of Bharat Bhushan's presentation on Artificial Intelligence and problem characteristics.

Embed presentation

Download as PDF, PPTX
PresentationonByBHARAT BHUSHANAsst. Professor, Department of Computer Sc.RLSY College, RanchiBuddha Science and Technical Institute, Ranchiwww.bharatsir.comProblem Characteristics inArtificial Intelligence
www.bharatsir.com || Mo No : 09835376044 || WhtasApp : 09006365889Artificial IntelligenceProblem CharacteristicsA problem may have different aspects ofrepresentation and explanation.In order to choose an appropriate methodfor a particular problem first we need tocategorize the problem based on thefollowing characteristics.1. Is the problem decomposable into smallsub-problems which are easy to solve?
www.bharatsir.com || Mo No : 09835376044 || WhtasApp : 09006365889Artificial IntelligenceProblem Characteristics2. Can solution steps be ignored or undone?3. Is the universe of the problem is predictable?4. Is a good solution to the problem is absoluteor relative?5. Is the solution to the problem a state or apath?6. What is the role of knowledge in solving aproblem using artificial intelligence?7. Does the task of solving a problem requirehuman interaction?
www.bharatsir.com || Mo No : 09835376044 || WhtasApp : 09006365889Artificial Intelligence1. Is the problem decomposable into small sub-problems which are easy to solve?The decomposable problem can be solved easily.Example: In the above case, the problem is divided into smallerproblems. The smaller problems are solved independently.Finally, the result is merged to get the final result.
www.bharatsir.com || Mo No : 09835376044 || WhtasApp : 09006365889Artificial Intelligence2. Can solution steps be ignored or undone?In the Theorem Proving problem, a lemma that has beenproved can be ignored for the next steps.Such problems are called Ignorable problems.In the 8-Puzzle, Moves can be undone and backtracked.Such problems are called Recoverable problems.0
www.bharatsir.com || Mo No : 09835376044 || WhtasApp : 09006365889Artificial IntelligenceIn Playing Chess, moves can be retracted.Such problems are called Irrecoverable problems.0Ignorable problems can be solved using asimple control structure that neverbacktracks. Recoverable problems can besolved using backtracking. Irrecoverableproblems can be solved by recoverablestyle methods via planning.
www.bharatsir.com || Mo No : 09835376044 || WhtasApp : 09006365889Artificial Intelligence3. Is the universe of the problem is predictable?In Playing Bridge, We cannot know exactly where all thecards are or what the other players will do on their turns.Uncertain outcome!For certain-outcome problems, planning can be used togenerate a sequence of operators that is guaranteed tolead to a solution.For uncertain-outcome problems, a sequence ofgenerated operators can only have a good probability ofleading to a solution. Plan revision is made as the plan iscarried out and the necessary feedback is provided.0
www.bharatsir.com || Mo No : 09835376044 || WhtasApp : 09006365889Artificial Intelligence4. Is a good solution to the problem is absoluteor relative?The Travelling Salesman Problem, we have to tryall paths to find the shortest one.Any path problem can be solved using heuristicsthat suggest good paths to explore.For best-path problems, a much more exhaustivesearch will be performed.0
www.bharatsir.com || Mo No : 09835376044 || WhtasApp : 09006365889Artificial Intelligence5. Is the solution to the problem a state or a path?The Water Jug Problem, the path that leads to thegoal must be reported.A path-solution problem can be reformulated as astate-solution problem by describing a state as apartial path to a solution. The question is whetherthat is natural or not.06. What is the role of knowledge in solving aproblem using artificial intelligence?Playing ChessConsider again the problem of playing chess.
www.bharatsir.com || Mo No : 09835376044 || WhtasApp : 09006365889Artificial IntelligenceSuppose you had unlimited computing poweravailable. How much knowledge would be requiredby a perfect program? The answer to this questionis very little—just the rules for determining legalmoves and some simple control mechanism thatimplements an appropriate search procedure.Additional knowledge about such things as goodstrategy and tactics could of course helpconsiderably to constrain the search and speed upthe execution of the program. Knowledge isimportant only to constrain the search for asolution.
www.bharatsir.com || Mo No : 09835376044 || WhtasApp : 09006365889Artificial IntelligenceReading NewspaperNow consider the problem of scanning dailynewspapers to decide which are supporting theDemocrats and which are supporting theRepublicans in some upcoming election. Againassuming unlimited computing power, how muchknowledge would be required by a computer tryingto solve this problem? This time the answer is agreat deal.It would have to know such things as: The names of the candidates in each party.
www.bharatsir.com || Mo No : 09835376044 || WhtasApp : 09006365889Artificial Intelligence The fact that if the major thing you want to seedone is have taxes lowered, you are probablysupporting the Republicans. The fact that if the major thing you want to seedone is improved education for minoritystudents, you are probably supporting theDemocrats. The fact that if you are opposed to biggovernment, you are probably supporting theRepublicans. And so on …
www.bharatsir.com || Mo No : 09835376044 || WhtasApp : 09006365889Artificial Intelligence7. Does the task of solving a problem requirehuman interaction?Sometimes it is useful to program computers tosolve problems in ways that the majority of peoplewould not be able to understand.This is fine if the level of the interaction betweenthe computer and its human users is problem-insolution-out.But increasingly we are building programs thatrequire intermediate interaction with people, bothto provide additional input to the program and toprovide additional reassurance to the user.
www.bharatsir.com || Mo No : 09835376044 || WhtasApp : 09006365889Artificial IntelligenceThe solitary problem, in which there is nointermediate communication and no demand foran explanation of the reasoning process.The conversational problem, in whichintermediate communication is to provide eitheradditional assistance to the computer oradditional information to the user.
Bharat Bhushan, Assistant Professor, RLSY College, RanchiArtificial Intelligence

Recommended

PPTX
Script
PDF
Introduction to ai
PPTX
UNIT1-AI final.pptx
PDF
Compiler design-lab-manual v-cse
PDF
Object Oriented Programming Lab Manual
PDF
C programming for problem solving
DOC
KBS Lecture Notes
 
PPTX
Lecture 13 Criptarithmetic problem
PPTX
Control Strategies in AI
PDF
I. Mini-Max Algorithm in AI
PDF
Artificial Intelligence - Hill climbing.
PPTX
Constraint satisfaction problems (csp)
PPTX
Sum of subset problem.pptx
PPT
Heuristic Search Techniques Unit -II.ppt
PPTX
Minmax Algorithm In Artificial Intelligence slides
PPTX
Water jug problem ai part 6
PDF
I.BEST FIRST SEARCH IN AI
PPT
KNOWLEDGE REPRESENTATION ISSUES.ppt
PPTX
Hill climbing algorithm
PPTX
Problem reduction AND OR GRAPH & AO* algorithm.ppt
PPT
Problems, Problem spaces and Search
PPT
Knowledge Representation & Reasoning
PPT
Heuristic Search Techniques {Artificial Intelligence}
PDF
I. Hill climbing algorithm II. Steepest hill climbing algorithm
PPTX
Means End Analysis (MEA) in Artificial.pptx
PPTX
Knowledge representation in AI
PPTX
Predicate logic
PPT
Artificial intelligence and knowledge representation
PPTX
Problem solving in Artificial Intelligence.pptx
PPTX
Problem solving agents

More Related Content

PPTX
Script
PDF
Introduction to ai
PPTX
UNIT1-AI final.pptx
PDF
Compiler design-lab-manual v-cse
PDF
Object Oriented Programming Lab Manual
PDF
C programming for problem solving
DOC
KBS Lecture Notes
 
PPTX
Lecture 13 Criptarithmetic problem
Script
Introduction to ai
UNIT1-AI final.pptx
Compiler design-lab-manual v-cse
Object Oriented Programming Lab Manual
C programming for problem solving
KBS Lecture Notes
 
Lecture 13 Criptarithmetic problem

What's hot

PPTX
Control Strategies in AI
PDF
I. Mini-Max Algorithm in AI
PDF
Artificial Intelligence - Hill climbing.
PPTX
Constraint satisfaction problems (csp)
PPTX
Sum of subset problem.pptx
PPT
Heuristic Search Techniques Unit -II.ppt
PPTX
Minmax Algorithm In Artificial Intelligence slides
PPTX
Water jug problem ai part 6
PDF
I.BEST FIRST SEARCH IN AI
PPT
KNOWLEDGE REPRESENTATION ISSUES.ppt
PPTX
Hill climbing algorithm
PPTX
Problem reduction AND OR GRAPH & AO* algorithm.ppt
PPT
Problems, Problem spaces and Search
PPT
Knowledge Representation & Reasoning
PPT
Heuristic Search Techniques {Artificial Intelligence}
PDF
I. Hill climbing algorithm II. Steepest hill climbing algorithm
PPTX
Means End Analysis (MEA) in Artificial.pptx
PPTX
Knowledge representation in AI
PPTX
Predicate logic
PPT
Artificial intelligence and knowledge representation
Control Strategies in AI
I. Mini-Max Algorithm in AI
Artificial Intelligence - Hill climbing.
Constraint satisfaction problems (csp)
Sum of subset problem.pptx
Heuristic Search Techniques Unit -II.ppt
Minmax Algorithm In Artificial Intelligence slides
Water jug problem ai part 6
I.BEST FIRST SEARCH IN AI
KNOWLEDGE REPRESENTATION ISSUES.ppt
Hill climbing algorithm
Problem reduction AND OR GRAPH & AO* algorithm.ppt
Problems, Problem spaces and Search
Knowledge Representation & Reasoning
Heuristic Search Techniques {Artificial Intelligence}
I. Hill climbing algorithm II. Steepest hill climbing algorithm
Means End Analysis (MEA) in Artificial.pptx
Knowledge representation in AI
Predicate logic
Artificial intelligence and knowledge representation

Similar to Problem Characteristics in Artificial Intelligence

PPTX
Problem solving in Artificial Intelligence.pptx
PPTX
Problem solving agents
PPTX
Problem Formulation in Artificial Inteligence Projects
PPTX
problem characterstics.pptx
PDF
Presentation on the artificial intelligenc
PPTX
Introduction of Artificial Intelligence
PPTX
AI Unit-1 PPT.pptx https https plans to go
PPTX
UNIT I Artificial Intelligence :Problem Search and its Characteristics
PDF
Lecture 2 Solving Problems by Searching by Marco Chiarandini
PPTX
Unit-2-search techniques in artificial intelligence
PPTX
Presentation on Artificial Intelligence.
PDF
AI Chapter III for Computer Science Students
PDF
AN INTRODUCTION OF AI & SEARCHING TECHIQUES
PPTX
AI CH 1d.pptx
PDF
Artificial intelligence
PDF
ARTIFICIAL INTELLIGENCE PROBLEM SOLVING AND SEARCH
PPTX
aiMODULE 1.pptx
PPTX
AI3391 ARTIFICAL INTELLIGENCE Session 5 Problem Solving Agent and searching f...
PPTX
Problem Solving Strategies - Artificial Intelligence - Anna University - Regu...
PPTX
Problem Solving Based on Searching Module 2
Problem solving in Artificial Intelligence.pptx
Problem solving agents
Problem Formulation in Artificial Inteligence Projects
problem characterstics.pptx
Presentation on the artificial intelligenc
Introduction of Artificial Intelligence
AI Unit-1 PPT.pptx https https plans to go
UNIT I Artificial Intelligence :Problem Search and its Characteristics
Lecture 2 Solving Problems by Searching by Marco Chiarandini
Unit-2-search techniques in artificial intelligence
Presentation on Artificial Intelligence.
AI Chapter III for Computer Science Students
AN INTRODUCTION OF AI & SEARCHING TECHIQUES
AI CH 1d.pptx
Artificial intelligence
ARTIFICIAL INTELLIGENCE PROBLEM SOLVING AND SEARCH
aiMODULE 1.pptx
AI3391 ARTIFICAL INTELLIGENCE Session 5 Problem Solving Agent and searching f...
Problem Solving Strategies - Artificial Intelligence - Anna University - Regu...
Problem Solving Based on Searching Module 2

More from Bharat Bhushan

PPTX
Problem Characteristics in Artificial Intelligence
PDF
Production System in AI
PDF
Hill Climbing Algorithm in Artificial Intelligence
PPTX
Production System in AI
PPTX
Heuristics Search Techniques in AI
PPTX
Algorithm Design Technique
PDF
Dynamic Programming
PPTX
Introduction to Artificial Intteligence
PDF
Control Strategies in AI
PPTX
Hill Climbing Algorithm in Artificial Intelligence
PDF
Heuristics Search Techniques
PDF
Introduction to Artificial Intteligence
PPTX
ARTIFICIAL INTELLIGENCE
PDF
ARTIFICIAL INTELLIGENCE SYLLABUS
PPTX
DESIGN AND ANALYSIS OF ALGORITHMS
PDF
DESIGN AND ANALYSIS OF ALGORITHMS by Bharat Sir
PDF
NIMCET 2023 : Questions
PPTX
Cyber Security
PDF
Cyber Security
PPTX
Digital Content Creation By Bharat Sir Kokar
Problem Characteristics in Artificial Intelligence
Production System in AI
Hill Climbing Algorithm in Artificial Intelligence
Production System in AI
Heuristics Search Techniques in AI
Algorithm Design Technique
Dynamic Programming
Introduction to Artificial Intteligence
Control Strategies in AI
Hill Climbing Algorithm in Artificial Intelligence
Heuristics Search Techniques
Introduction to Artificial Intteligence
ARTIFICIAL INTELLIGENCE
ARTIFICIAL INTELLIGENCE SYLLABUS
DESIGN AND ANALYSIS OF ALGORITHMS
DESIGN AND ANALYSIS OF ALGORITHMS by Bharat Sir
NIMCET 2023 : Questions
Cyber Security
Cyber Security
Digital Content Creation By Bharat Sir Kokar

Recently uploaded

PDF
Deep Research and Analysis - by Ms. Oceana Wong
PDF
The invasion of Alexander of Macedonia in India
PDF
বাংলাদেশ অর্থনৈতিক সমীক্ষা - ২০২৫ with Bookmark.pdf
PDF
Unit 4_ small scale industries & Entrepreneurship
PPTX
Time Series Analysis - Least Square Method Fitting a Linear Trend Equation
PDF
1. Doing Academic Research: Problems and Issues, 2. Academic Research Writing...
PDF
Past Memories and a New World: Photographs of Stoke Newington from the 70s, 8...
PPTX
Masterclass on Cybercrime, Scams & Safety Hacks.pptx
PPTX
Plant Breeding: Its History and Contribution
PDF
UGC NET Paper 1 Syllabus | 10 Units Complete Guide for NTA JRF
PPTX
Elderly in India: The Changing Scenario.pptx
 
PDF
Unit 1- Basics of Management Cha. of Magmt
PDF
Integrated Circuits: Lithography Techniques - Fundamentals and Advanced Metho...
PPTX
kklklklklklklklk;lkpoipor[3rjdkjoe99759893058085
PPTX
Time Series Analysis - Weighted (Unequal) Moving Average Method
PDF
Hybrid Electric Vehicles Descriptive Questions
PDF
IMPATT Diodes: Theory, Construction, Operation, and Microwave Applications"
PDF
Photoperiod Classification of Vegetable Plants.pdf
PPTX
Chapter 3. Pharmaceutical Aids (pharmaceutics)
PPTX
G-Protein-Coupled Receptors (GPCRs): Structure, Mechanism, and Functions
Deep Research and Analysis - by Ms. Oceana Wong
The invasion of Alexander of Macedonia in India
বাংলাদেশ অর্থনৈতিক সমীক্ষা - ২০২৫ with Bookmark.pdf
Unit 4_ small scale industries & Entrepreneurship
Time Series Analysis - Least Square Method Fitting a Linear Trend Equation
1. Doing Academic Research: Problems and Issues, 2. Academic Research Writing...
Past Memories and a New World: Photographs of Stoke Newington from the 70s, 8...
Masterclass on Cybercrime, Scams & Safety Hacks.pptx
Plant Breeding: Its History and Contribution
UGC NET Paper 1 Syllabus | 10 Units Complete Guide for NTA JRF
Elderly in India: The Changing Scenario.pptx
 
Unit 1- Basics of Management Cha. of Magmt
Integrated Circuits: Lithography Techniques - Fundamentals and Advanced Metho...
kklklklklklklklk;lkpoipor[3rjdkjoe99759893058085
Time Series Analysis - Weighted (Unequal) Moving Average Method
Hybrid Electric Vehicles Descriptive Questions
IMPATT Diodes: Theory, Construction, Operation, and Microwave Applications"
Photoperiod Classification of Vegetable Plants.pdf
Chapter 3. Pharmaceutical Aids (pharmaceutics)
G-Protein-Coupled Receptors (GPCRs): Structure, Mechanism, and Functions

Problem Characteristics in Artificial Intelligence

  • 1.
    PresentationonByBHARAT BHUSHANAsst. Professor,Department of Computer Sc.RLSY College, RanchiBuddha Science and Technical Institute, Ranchiwww.bharatsir.comProblem Characteristics inArtificial Intelligence
  • 2.
    www.bharatsir.com || MoNo : 09835376044 || WhtasApp : 09006365889Artificial IntelligenceProblem CharacteristicsA problem may have different aspects ofrepresentation and explanation.In order to choose an appropriate methodfor a particular problem first we need tocategorize the problem based on thefollowing characteristics.1. Is the problem decomposable into smallsub-problems which are easy to solve?
  • 3.
    www.bharatsir.com || MoNo : 09835376044 || WhtasApp : 09006365889Artificial IntelligenceProblem Characteristics2. Can solution steps be ignored or undone?3. Is the universe of the problem is predictable?4. Is a good solution to the problem is absoluteor relative?5. Is the solution to the problem a state or apath?6. What is the role of knowledge in solving aproblem using artificial intelligence?7. Does the task of solving a problem requirehuman interaction?
  • 4.
    www.bharatsir.com || MoNo : 09835376044 || WhtasApp : 09006365889Artificial Intelligence1. Is the problem decomposable into small sub-problems which are easy to solve?The decomposable problem can be solved easily.Example: In the above case, the problem is divided into smallerproblems. The smaller problems are solved independently.Finally, the result is merged to get the final result.
  • 5.
    www.bharatsir.com || MoNo : 09835376044 || WhtasApp : 09006365889Artificial Intelligence2. Can solution steps be ignored or undone?In the Theorem Proving problem, a lemma that has beenproved can be ignored for the next steps.Such problems are called Ignorable problems.In the 8-Puzzle, Moves can be undone and backtracked.Such problems are called Recoverable problems.0
  • 6.
    www.bharatsir.com || MoNo : 09835376044 || WhtasApp : 09006365889Artificial IntelligenceIn Playing Chess, moves can be retracted.Such problems are called Irrecoverable problems.0Ignorable problems can be solved using asimple control structure that neverbacktracks. Recoverable problems can besolved using backtracking. Irrecoverableproblems can be solved by recoverablestyle methods via planning.
  • 7.
    www.bharatsir.com || MoNo : 09835376044 || WhtasApp : 09006365889Artificial Intelligence3. Is the universe of the problem is predictable?In Playing Bridge, We cannot know exactly where all thecards are or what the other players will do on their turns.Uncertain outcome!For certain-outcome problems, planning can be used togenerate a sequence of operators that is guaranteed tolead to a solution.For uncertain-outcome problems, a sequence ofgenerated operators can only have a good probability ofleading to a solution. Plan revision is made as the plan iscarried out and the necessary feedback is provided.0
  • 8.
    www.bharatsir.com || MoNo : 09835376044 || WhtasApp : 09006365889Artificial Intelligence4. Is a good solution to the problem is absoluteor relative?The Travelling Salesman Problem, we have to tryall paths to find the shortest one.Any path problem can be solved using heuristicsthat suggest good paths to explore.For best-path problems, a much more exhaustivesearch will be performed.0
  • 9.
    www.bharatsir.com || MoNo : 09835376044 || WhtasApp : 09006365889Artificial Intelligence5. Is the solution to the problem a state or a path?The Water Jug Problem, the path that leads to thegoal must be reported.A path-solution problem can be reformulated as astate-solution problem by describing a state as apartial path to a solution. The question is whetherthat is natural or not.06. What is the role of knowledge in solving aproblem using artificial intelligence?Playing ChessConsider again the problem of playing chess.
  • 10.
    www.bharatsir.com || MoNo : 09835376044 || WhtasApp : 09006365889Artificial IntelligenceSuppose you had unlimited computing poweravailable. How much knowledge would be requiredby a perfect program? The answer to this questionis very little—just the rules for determining legalmoves and some simple control mechanism thatimplements an appropriate search procedure.Additional knowledge about such things as goodstrategy and tactics could of course helpconsiderably to constrain the search and speed upthe execution of the program. Knowledge isimportant only to constrain the search for asolution.
  • 11.
    www.bharatsir.com || MoNo : 09835376044 || WhtasApp : 09006365889Artificial IntelligenceReading NewspaperNow consider the problem of scanning dailynewspapers to decide which are supporting theDemocrats and which are supporting theRepublicans in some upcoming election. Againassuming unlimited computing power, how muchknowledge would be required by a computer tryingto solve this problem? This time the answer is agreat deal.It would have to know such things as: The names of the candidates in each party.
  • 12.
    www.bharatsir.com || MoNo : 09835376044 || WhtasApp : 09006365889Artificial Intelligence The fact that if the major thing you want to seedone is have taxes lowered, you are probablysupporting the Republicans. The fact that if the major thing you want to seedone is improved education for minoritystudents, you are probably supporting theDemocrats. The fact that if you are opposed to biggovernment, you are probably supporting theRepublicans. And so on …
  • 13.
    www.bharatsir.com || MoNo : 09835376044 || WhtasApp : 09006365889Artificial Intelligence7. Does the task of solving a problem requirehuman interaction?Sometimes it is useful to program computers tosolve problems in ways that the majority of peoplewould not be able to understand.This is fine if the level of the interaction betweenthe computer and its human users is problem-insolution-out.But increasingly we are building programs thatrequire intermediate interaction with people, bothto provide additional input to the program and toprovide additional reassurance to the user.
  • 14.
    www.bharatsir.com || MoNo : 09835376044 || WhtasApp : 09006365889Artificial IntelligenceThe solitary problem, in which there is nointermediate communication and no demand foran explanation of the reasoning process.The conversational problem, in whichintermediate communication is to provide eitheradditional assistance to the computer oradditional information to the user.
  • 15.
    Bharat Bhushan, AssistantProfessor, RLSY College, RanchiArtificial Intelligence

[8]ページ先頭

©2009-2025 Movatter.jp