Fundamentals of artificial intelligence: problem solving and automated reasoning
"This comprehensive textbook focuses on the core techniques employed by today's artificial intelligence, including problem-solving by search techniques and swarm intelligence, and further knowledge representation, logic, automated reasoning, and uncertainty processing. Some information abo...
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
New York
McGraw Hill
[2023]
|
| Schlagworte: | |
| Zusammenfassung: | "This comprehensive textbook focuses on the core techniques employed by today's artificial intelligence, including problem-solving by search techniques and swarm intelligence, and further knowledge representation, logic, automated reasoning, and uncertainty processing. Some information about planning techniques and expert systems is also provided. Fundamentals of Artificial Intelligence: Problem Solving and Automated Reasoning is written in a concise format, with a view to optimizing learning. Each chapter contains a brief historical overview and a Practice Makes Perfect section to encourage independent thought. The book includes many visuals that illustrate the essential ideas. Also, many easy-to-follow examples show how to use these ideas in practical implementations"-- |
| Beschreibung: | xxv, 294 Seiten Illustrationen, Diagramme 25 cm |
| ISBN: | 9781260467789 1260467783 |
Internformat
MARC
| LEADER | 00000nam a2200000 c 4500 | ||
|---|---|---|---|
| 001 | BV048997376 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | t | ||
| 008 | 230613s2023 a||| |||| 00||| eng d | ||
| 015 | |a GBC319071 |2 dnb | ||
| 020 | |a 9781260467789 |9 978-1-260-46778-9 | ||
| 020 | |a 1260467783 |9 1-260-46778-3 | ||
| 035 | |a (OCoLC)1385287529 | ||
| 035 | |a (DE-599)BVBBV048997376 | ||
| 040 | |a DE-604 |b ger |e rda | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-1050 |a DE-1102 | ||
| 084 | |a ST 300 |0 (DE-625)143650: |2 rvk | ||
| 100 | 1 | |a Kubat, Miroslav |d 1958- |e Verfasser |0 (DE-588)1140076752 |4 aut | |
| 245 | 1 | 0 | |a Fundamentals of artificial intelligence |b problem solving and automated reasoning |c Miroslav Kubat |
| 264 | 1 | |a New York |b McGraw Hill |c [2023] | |
| 300 | |a xxv, 294 Seiten |b Illustrationen, Diagramme |c 25 cm | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 505 | 8 | |a 1 Core AI: Problem Solving and Automated Reasoning -- 1.1 Early Milestones -- 1.2 Problem Solving -- 1.3 Automated Reasoning -- 1.4 Structure and Method -- 2 Blind Search -- 2.1 Motivation and Terminology -- 2.2 Depth-First and Breadth-First Search -- 2.3 Practical Considerations -- 2.4 Aspects of Search Performance -- 2.5 Iterative Deepening (and Broadening) -- 2.6 Practice Makes Perfect -- 2.7 Concluding Remarks -- 3 Heuristic Search and Annealing -- 3.1 Hill Climbing and Best-First Search -- 3.2 Practical Aspects of Evaluation Functions -- 3.3 A-Star and IDA-Star -- 3.4 Simulated Annealing -- 3.5 Role of Background Knowledge -- 3.6 Continuous Domains -- 3.7 Practice Makes Perfect -- 3.8 Concluding Remarks -- 4 Adversary Search -- 4.1 Typical Problems -- 4.2 Baseline Mini-Max -- 4.3 Heuristic Mini-Max -- 4.4 Alpha-Beta Pruning -- 4.5 Additional Game-Programming Techniques -- 4.6 Practice Makes Perfect -- 4.7 Concluding Remarks -- 5 Planning -- 5.1 Toy Blocks -- | |
| 505 | 8 | |a 5.2 Available Actions -- 5.3 Planning with STRIPS -- 5.4 Numeric Example -- 5.5 Advanced Applications of AI Planning -- 5.6 Practice Makes Perfect -- 5.7 Concluding Remarks -- 6 Genetic Algorithm -- 6.1 General Schema -- 6.2 Imperfect Copies and Survival -- 6.3 Alternative GA Operators -- 6.4 Potential Problems -- 6.5 Advanced Variations -- 6.6 GA and the Knapsack Problem -- 6.7 GA and the Prisoner's Dilemma -- 6.8 Practice Makes Perfect -- 6.9 Concluding Remarks -- 7 Artificial Life -- 7.1 Emergent Properties -- 7.2 L-Systems -- 7.3 Cellular Automata -- 7.4 Conways' Game of Life -- 7.5 Practice Makes Perfect -- 7.6 Concluding Remarks -- 8 Emergent Properties and Swarm Intelligence -- 8.1 Ant-Colony Optimization -- 8.2 ACO Addressing the Traveling Salesman -- 8.3 Particle-Swarm Optimization -- 8.4 Artificial-Bees Colony, ABC -- 8.5 Practice Makes Perfect -- 8.6 Concluding Remarks -- 9 Elements of Automated Reasoning -- 9.1 Facts and Queries -- 9.2 Rules and Knowledge-Based Systems -- | |
| 505 | 8 | |a 9.3 Simple Reasoning with Rules -- 9.4 Practice Makes Perfect -- 9.5 Concluding Remarks -- 10 Logic and Reasoning, Simplified -- 10.1 Entailment, Inference, Theorem Proving -- 10.2 Reasoning with Modus Ponens -- 10.3 Reasoning Using the Resolution Principle -- 10.4 Expressing Knowledge in Normal Form -- 10.5 Practice Makes Perfect -- 10.6 Concluding Remarks -- 11 Logic and Reasoning Using Variables -- 11.1 Rules and Quantifiers -- 11.2 Removing Quantifiers -- 11.3 Binding, Unification, and Reasoning -- 11.4 Practical Inference Procedures -- 11.5 Practice Makes Perfect -- 11.6 Concluding Remarks -- 12 Alternative Ways of Representing Knowledge -- 12.1 Frames and Semantic Networks -- 12.2 Reasoning with Frame-Based Knowledge -- 12.3 N-ary Relations in Frames and SNs -- 12.4 Practice Makes Perfect -- 12.5 Concluding Remarks -- 13 Hurdles on the Road to Automated Reasoning -- 13.1 Tacit Assumptions -- 13.2 Non-Monotonicity -- 13.3 Mycin's Uncertainty Factors -- | |
| 505 | 8 | |a 13.4 Practice Makes Perfect -- 13.5 Concluding Remarks -- 14 Probabilistic Reasoning -- 14.1 Theory of Probability (Revision) -- 14.2 Probability and Reasoning -- 14.3 Belief Networks -- 14.4 Dealing with More Realistic Domains -- 14.5 Demspter-Shafer Approach: Masses Instead of Probabilities -- 14.6 From Masses to Belief and Plausibility -- 14.7 DST Rule of Evidence Combination -- 14.8 Practice Makes Perfect -- 14.9 Concluding Remarks -- 15 Fuzzy Sets -- 15.1 Fuzziness of Real-World Concepts -- 15.2 Fuzzy Set Membership -- 15.3 Fuzziness versus Other Paradigms -- 15.4 Fuzzy Set Operations -- 15.5 Counting Linguistic Variables -- 15.6 Fuzzy Reasoning -- 15.7 Practice Makes Perfect -- 15.8 Concluding Remarks -- 16 Highs and Lows of Expert Systems -- 16.1 Early Pioneer: Mycin -- 16.2 Later Developments -- 16.3 Some Experience -- 16.4 Practice Makes Perfect -- 16.5 Concluding Remarks -- 17 Beyond Core AI -- 17.1 Computer Vision -- 17.2 Natural Language Processing -- | |
| 505 | 8 | |a 17.3 Machine Learning -- 17.4 Agent Technology -- 17.5 Concluding Remarks -- 18 Philosophical Musings -- 18.1 Turing Test -- 18.2 Chinese Room and Other Reservations -- 18.3 Engineer's Perspective -- 18.4 Concluding Remarks | |
| 520 | |a "This comprehensive textbook focuses on the core techniques employed by today's artificial intelligence, including problem-solving by search techniques and swarm intelligence, and further knowledge representation, logic, automated reasoning, and uncertainty processing. Some information about planning techniques and expert systems is also provided. Fundamentals of Artificial Intelligence: Problem Solving and Automated Reasoning is written in a concise format, with a view to optimizing learning. Each chapter contains a brief historical overview and a Practice Makes Perfect section to encourage independent thought. The book includes many visuals that illustrate the essential ideas. Also, many easy-to-follow examples show how to use these ideas in practical implementations"-- | ||
| 650 | 4 | |a Artificial intelligence / Textbooks | |
| 650 | 7 | |a Artificial intelligence |2 fast | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-034260601 | ||
Datensatz im Suchindex
| _version_ | 1804185258169466880 |
|---|---|
| adam_txt | |
| any_adam_object | |
| any_adam_object_boolean | |
| author | Kubat, Miroslav 1958- |
| author_GND | (DE-588)1140076752 |
| author_facet | Kubat, Miroslav 1958- |
| author_role | aut |
| author_sort | Kubat, Miroslav 1958- |
| author_variant | m k mk |
| building | Verbundindex |
| bvnumber | BV048997376 |
| classification_rvk | ST 300 |
| contents | 1 Core AI: Problem Solving and Automated Reasoning -- 1.1 Early Milestones -- 1.2 Problem Solving -- 1.3 Automated Reasoning -- 1.4 Structure and Method -- 2 Blind Search -- 2.1 Motivation and Terminology -- 2.2 Depth-First and Breadth-First Search -- 2.3 Practical Considerations -- 2.4 Aspects of Search Performance -- 2.5 Iterative Deepening (and Broadening) -- 2.6 Practice Makes Perfect -- 2.7 Concluding Remarks -- 3 Heuristic Search and Annealing -- 3.1 Hill Climbing and Best-First Search -- 3.2 Practical Aspects of Evaluation Functions -- 3.3 A-Star and IDA-Star -- 3.4 Simulated Annealing -- 3.5 Role of Background Knowledge -- 3.6 Continuous Domains -- 3.7 Practice Makes Perfect -- 3.8 Concluding Remarks -- 4 Adversary Search -- 4.1 Typical Problems -- 4.2 Baseline Mini-Max -- 4.3 Heuristic Mini-Max -- 4.4 Alpha-Beta Pruning -- 4.5 Additional Game-Programming Techniques -- 4.6 Practice Makes Perfect -- 4.7 Concluding Remarks -- 5 Planning -- 5.1 Toy Blocks -- 5.2 Available Actions -- 5.3 Planning with STRIPS -- 5.4 Numeric Example -- 5.5 Advanced Applications of AI Planning -- 5.6 Practice Makes Perfect -- 5.7 Concluding Remarks -- 6 Genetic Algorithm -- 6.1 General Schema -- 6.2 Imperfect Copies and Survival -- 6.3 Alternative GA Operators -- 6.4 Potential Problems -- 6.5 Advanced Variations -- 6.6 GA and the Knapsack Problem -- 6.7 GA and the Prisoner's Dilemma -- 6.8 Practice Makes Perfect -- 6.9 Concluding Remarks -- 7 Artificial Life -- 7.1 Emergent Properties -- 7.2 L-Systems -- 7.3 Cellular Automata -- 7.4 Conways' Game of Life -- 7.5 Practice Makes Perfect -- 7.6 Concluding Remarks -- 8 Emergent Properties and Swarm Intelligence -- 8.1 Ant-Colony Optimization -- 8.2 ACO Addressing the Traveling Salesman -- 8.3 Particle-Swarm Optimization -- 8.4 Artificial-Bees Colony, ABC -- 8.5 Practice Makes Perfect -- 8.6 Concluding Remarks -- 9 Elements of Automated Reasoning -- 9.1 Facts and Queries -- 9.2 Rules and Knowledge-Based Systems -- 9.3 Simple Reasoning with Rules -- 9.4 Practice Makes Perfect -- 9.5 Concluding Remarks -- 10 Logic and Reasoning, Simplified -- 10.1 Entailment, Inference, Theorem Proving -- 10.2 Reasoning with Modus Ponens -- 10.3 Reasoning Using the Resolution Principle -- 10.4 Expressing Knowledge in Normal Form -- 10.5 Practice Makes Perfect -- 10.6 Concluding Remarks -- 11 Logic and Reasoning Using Variables -- 11.1 Rules and Quantifiers -- 11.2 Removing Quantifiers -- 11.3 Binding, Unification, and Reasoning -- 11.4 Practical Inference Procedures -- 11.5 Practice Makes Perfect -- 11.6 Concluding Remarks -- 12 Alternative Ways of Representing Knowledge -- 12.1 Frames and Semantic Networks -- 12.2 Reasoning with Frame-Based Knowledge -- 12.3 N-ary Relations in Frames and SNs -- 12.4 Practice Makes Perfect -- 12.5 Concluding Remarks -- 13 Hurdles on the Road to Automated Reasoning -- 13.1 Tacit Assumptions -- 13.2 Non-Monotonicity -- 13.3 Mycin's Uncertainty Factors -- 13.4 Practice Makes Perfect -- 13.5 Concluding Remarks -- 14 Probabilistic Reasoning -- 14.1 Theory of Probability (Revision) -- 14.2 Probability and Reasoning -- 14.3 Belief Networks -- 14.4 Dealing with More Realistic Domains -- 14.5 Demspter-Shafer Approach: Masses Instead of Probabilities -- 14.6 From Masses to Belief and Plausibility -- 14.7 DST Rule of Evidence Combination -- 14.8 Practice Makes Perfect -- 14.9 Concluding Remarks -- 15 Fuzzy Sets -- 15.1 Fuzziness of Real-World Concepts -- 15.2 Fuzzy Set Membership -- 15.3 Fuzziness versus Other Paradigms -- 15.4 Fuzzy Set Operations -- 15.5 Counting Linguistic Variables -- 15.6 Fuzzy Reasoning -- 15.7 Practice Makes Perfect -- 15.8 Concluding Remarks -- 16 Highs and Lows of Expert Systems -- 16.1 Early Pioneer: Mycin -- 16.2 Later Developments -- 16.3 Some Experience -- 16.4 Practice Makes Perfect -- 16.5 Concluding Remarks -- 17 Beyond Core AI -- 17.1 Computer Vision -- 17.2 Natural Language Processing -- 17.3 Machine Learning -- 17.4 Agent Technology -- 17.5 Concluding Remarks -- 18 Philosophical Musings -- 18.1 Turing Test -- 18.2 Chinese Room and Other Reservations -- 18.3 Engineer's Perspective -- 18.4 Concluding Remarks |
| ctrlnum | (OCoLC)1385287529 (DE-599)BVBBV048997376 |
| discipline | Informatik |
| discipline_str_mv | Informatik |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>06067nam a2200385 c 4500</leader><controlfield tag="001">BV048997376</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">230613s2023 a||| |||| 00||| eng d</controlfield><datafield tag="015" ind1=" " ind2=" "><subfield code="a">GBC319071</subfield><subfield code="2">dnb</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9781260467789</subfield><subfield code="9">978-1-260-46778-9</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">1260467783</subfield><subfield code="9">1-260-46778-3</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)1385287529</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV048997376</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rda</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-1050</subfield><subfield code="a">DE-1102</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">ST 300</subfield><subfield code="0">(DE-625)143650:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Kubat, Miroslav</subfield><subfield code="d">1958-</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)1140076752</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Fundamentals of artificial intelligence</subfield><subfield code="b">problem solving and automated reasoning</subfield><subfield code="c">Miroslav Kubat</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">New York</subfield><subfield code="b">McGraw Hill</subfield><subfield code="c">[2023]</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">xxv, 294 Seiten</subfield><subfield code="b">Illustrationen, Diagramme</subfield><subfield code="c">25 cm</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="b">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="505" ind1="8" ind2=" "><subfield code="a">1 Core AI: Problem Solving and Automated Reasoning -- 1.1 Early Milestones -- 1.2 Problem Solving -- 1.3 Automated Reasoning -- 1.4 Structure and Method -- 2 Blind Search -- 2.1 Motivation and Terminology -- 2.2 Depth-First and Breadth-First Search -- 2.3 Practical Considerations -- 2.4 Aspects of Search Performance -- 2.5 Iterative Deepening (and Broadening) -- 2.6 Practice Makes Perfect -- 2.7 Concluding Remarks -- 3 Heuristic Search and Annealing -- 3.1 Hill Climbing and Best-First Search -- 3.2 Practical Aspects of Evaluation Functions -- 3.3 A-Star and IDA-Star -- 3.4 Simulated Annealing -- 3.5 Role of Background Knowledge -- 3.6 Continuous Domains -- 3.7 Practice Makes Perfect -- 3.8 Concluding Remarks -- 4 Adversary Search -- 4.1 Typical Problems -- 4.2 Baseline Mini-Max -- 4.3 Heuristic Mini-Max -- 4.4 Alpha-Beta Pruning -- 4.5 Additional Game-Programming Techniques -- 4.6 Practice Makes Perfect -- 4.7 Concluding Remarks -- 5 Planning -- 5.1 Toy Blocks -- </subfield></datafield><datafield tag="505" ind1="8" ind2=" "><subfield code="a">5.2 Available Actions -- 5.3 Planning with STRIPS -- 5.4 Numeric Example -- 5.5 Advanced Applications of AI Planning -- 5.6 Practice Makes Perfect -- 5.7 Concluding Remarks -- 6 Genetic Algorithm -- 6.1 General Schema -- 6.2 Imperfect Copies and Survival -- 6.3 Alternative GA Operators -- 6.4 Potential Problems -- 6.5 Advanced Variations -- 6.6 GA and the Knapsack Problem -- 6.7 GA and the Prisoner's Dilemma -- 6.8 Practice Makes Perfect -- 6.9 Concluding Remarks -- 7 Artificial Life -- 7.1 Emergent Properties -- 7.2 L-Systems -- 7.3 Cellular Automata -- 7.4 Conways' Game of Life -- 7.5 Practice Makes Perfect -- 7.6 Concluding Remarks -- 8 Emergent Properties and Swarm Intelligence -- 8.1 Ant-Colony Optimization -- 8.2 ACO Addressing the Traveling Salesman -- 8.3 Particle-Swarm Optimization -- 8.4 Artificial-Bees Colony, ABC -- 8.5 Practice Makes Perfect -- 8.6 Concluding Remarks -- 9 Elements of Automated Reasoning -- 9.1 Facts and Queries -- 9.2 Rules and Knowledge-Based Systems -- </subfield></datafield><datafield tag="505" ind1="8" ind2=" "><subfield code="a">9.3 Simple Reasoning with Rules -- 9.4 Practice Makes Perfect -- 9.5 Concluding Remarks -- 10 Logic and Reasoning, Simplified -- 10.1 Entailment, Inference, Theorem Proving -- 10.2 Reasoning with Modus Ponens -- 10.3 Reasoning Using the Resolution Principle -- 10.4 Expressing Knowledge in Normal Form -- 10.5 Practice Makes Perfect -- 10.6 Concluding Remarks -- 11 Logic and Reasoning Using Variables -- 11.1 Rules and Quantifiers -- 11.2 Removing Quantifiers -- 11.3 Binding, Unification, and Reasoning -- 11.4 Practical Inference Procedures -- 11.5 Practice Makes Perfect -- 11.6 Concluding Remarks -- 12 Alternative Ways of Representing Knowledge -- 12.1 Frames and Semantic Networks -- 12.2 Reasoning with Frame-Based Knowledge -- 12.3 N-ary Relations in Frames and SNs -- 12.4 Practice Makes Perfect -- 12.5 Concluding Remarks -- 13 Hurdles on the Road to Automated Reasoning -- 13.1 Tacit Assumptions -- 13.2 Non-Monotonicity -- 13.3 Mycin's Uncertainty Factors -- </subfield></datafield><datafield tag="505" ind1="8" ind2=" "><subfield code="a">13.4 Practice Makes Perfect -- 13.5 Concluding Remarks -- 14 Probabilistic Reasoning -- 14.1 Theory of Probability (Revision) -- 14.2 Probability and Reasoning -- 14.3 Belief Networks -- 14.4 Dealing with More Realistic Domains -- 14.5 Demspter-Shafer Approach: Masses Instead of Probabilities -- 14.6 From Masses to Belief and Plausibility -- 14.7 DST Rule of Evidence Combination -- 14.8 Practice Makes Perfect -- 14.9 Concluding Remarks -- 15 Fuzzy Sets -- 15.1 Fuzziness of Real-World Concepts -- 15.2 Fuzzy Set Membership -- 15.3 Fuzziness versus Other Paradigms -- 15.4 Fuzzy Set Operations -- 15.5 Counting Linguistic Variables -- 15.6 Fuzzy Reasoning -- 15.7 Practice Makes Perfect -- 15.8 Concluding Remarks -- 16 Highs and Lows of Expert Systems -- 16.1 Early Pioneer: Mycin -- 16.2 Later Developments -- 16.3 Some Experience -- 16.4 Practice Makes Perfect -- 16.5 Concluding Remarks -- 17 Beyond Core AI -- 17.1 Computer Vision -- 17.2 Natural Language Processing -- </subfield></datafield><datafield tag="505" ind1="8" ind2=" "><subfield code="a">17.3 Machine Learning -- 17.4 Agent Technology -- 17.5 Concluding Remarks -- 18 Philosophical Musings -- 18.1 Turing Test -- 18.2 Chinese Room and Other Reservations -- 18.3 Engineer's Perspective -- 18.4 Concluding Remarks</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">"This comprehensive textbook focuses on the core techniques employed by today's artificial intelligence, including problem-solving by search techniques and swarm intelligence, and further knowledge representation, logic, automated reasoning, and uncertainty processing. Some information about planning techniques and expert systems is also provided. Fundamentals of Artificial Intelligence: Problem Solving and Automated Reasoning is written in a concise format, with a view to optimizing learning. Each chapter contains a brief historical overview and a Practice Makes Perfect section to encourage independent thought. The book includes many visuals that illustrate the essential ideas. Also, many easy-to-follow examples show how to use these ideas in practical implementations"--</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Artificial intelligence / Textbooks</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Artificial intelligence</subfield><subfield code="2">fast</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-034260601</subfield></datafield></record></collection> |
| id | DE-604.BV048997376 |
| illustrated | Illustrated |
| index_date | 2024-07-03T22:08:50Z |
| indexdate | 2024-07-10T09:52:22Z |
| institution | BVB |
| isbn | 9781260467789 1260467783 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-034260601 |
| oclc_num | 1385287529 |
| open_access_boolean | |
| owner | DE-1050 DE-1102 |
| owner_facet | DE-1050 DE-1102 |
| physical | xxv, 294 Seiten Illustrationen, Diagramme 25 cm |
| publishDate | 2023 |
| publishDateSearch | 2023 |
| publishDateSort | 2023 |
| publisher | McGraw Hill |
| record_format | marc |
| spelling | Kubat, Miroslav 1958- Verfasser (DE-588)1140076752 aut Fundamentals of artificial intelligence problem solving and automated reasoning Miroslav Kubat New York McGraw Hill [2023] xxv, 294 Seiten Illustrationen, Diagramme 25 cm txt rdacontent n rdamedia nc rdacarrier 1 Core AI: Problem Solving and Automated Reasoning -- 1.1 Early Milestones -- 1.2 Problem Solving -- 1.3 Automated Reasoning -- 1.4 Structure and Method -- 2 Blind Search -- 2.1 Motivation and Terminology -- 2.2 Depth-First and Breadth-First Search -- 2.3 Practical Considerations -- 2.4 Aspects of Search Performance -- 2.5 Iterative Deepening (and Broadening) -- 2.6 Practice Makes Perfect -- 2.7 Concluding Remarks -- 3 Heuristic Search and Annealing -- 3.1 Hill Climbing and Best-First Search -- 3.2 Practical Aspects of Evaluation Functions -- 3.3 A-Star and IDA-Star -- 3.4 Simulated Annealing -- 3.5 Role of Background Knowledge -- 3.6 Continuous Domains -- 3.7 Practice Makes Perfect -- 3.8 Concluding Remarks -- 4 Adversary Search -- 4.1 Typical Problems -- 4.2 Baseline Mini-Max -- 4.3 Heuristic Mini-Max -- 4.4 Alpha-Beta Pruning -- 4.5 Additional Game-Programming Techniques -- 4.6 Practice Makes Perfect -- 4.7 Concluding Remarks -- 5 Planning -- 5.1 Toy Blocks -- 5.2 Available Actions -- 5.3 Planning with STRIPS -- 5.4 Numeric Example -- 5.5 Advanced Applications of AI Planning -- 5.6 Practice Makes Perfect -- 5.7 Concluding Remarks -- 6 Genetic Algorithm -- 6.1 General Schema -- 6.2 Imperfect Copies and Survival -- 6.3 Alternative GA Operators -- 6.4 Potential Problems -- 6.5 Advanced Variations -- 6.6 GA and the Knapsack Problem -- 6.7 GA and the Prisoner's Dilemma -- 6.8 Practice Makes Perfect -- 6.9 Concluding Remarks -- 7 Artificial Life -- 7.1 Emergent Properties -- 7.2 L-Systems -- 7.3 Cellular Automata -- 7.4 Conways' Game of Life -- 7.5 Practice Makes Perfect -- 7.6 Concluding Remarks -- 8 Emergent Properties and Swarm Intelligence -- 8.1 Ant-Colony Optimization -- 8.2 ACO Addressing the Traveling Salesman -- 8.3 Particle-Swarm Optimization -- 8.4 Artificial-Bees Colony, ABC -- 8.5 Practice Makes Perfect -- 8.6 Concluding Remarks -- 9 Elements of Automated Reasoning -- 9.1 Facts and Queries -- 9.2 Rules and Knowledge-Based Systems -- 9.3 Simple Reasoning with Rules -- 9.4 Practice Makes Perfect -- 9.5 Concluding Remarks -- 10 Logic and Reasoning, Simplified -- 10.1 Entailment, Inference, Theorem Proving -- 10.2 Reasoning with Modus Ponens -- 10.3 Reasoning Using the Resolution Principle -- 10.4 Expressing Knowledge in Normal Form -- 10.5 Practice Makes Perfect -- 10.6 Concluding Remarks -- 11 Logic and Reasoning Using Variables -- 11.1 Rules and Quantifiers -- 11.2 Removing Quantifiers -- 11.3 Binding, Unification, and Reasoning -- 11.4 Practical Inference Procedures -- 11.5 Practice Makes Perfect -- 11.6 Concluding Remarks -- 12 Alternative Ways of Representing Knowledge -- 12.1 Frames and Semantic Networks -- 12.2 Reasoning with Frame-Based Knowledge -- 12.3 N-ary Relations in Frames and SNs -- 12.4 Practice Makes Perfect -- 12.5 Concluding Remarks -- 13 Hurdles on the Road to Automated Reasoning -- 13.1 Tacit Assumptions -- 13.2 Non-Monotonicity -- 13.3 Mycin's Uncertainty Factors -- 13.4 Practice Makes Perfect -- 13.5 Concluding Remarks -- 14 Probabilistic Reasoning -- 14.1 Theory of Probability (Revision) -- 14.2 Probability and Reasoning -- 14.3 Belief Networks -- 14.4 Dealing with More Realistic Domains -- 14.5 Demspter-Shafer Approach: Masses Instead of Probabilities -- 14.6 From Masses to Belief and Plausibility -- 14.7 DST Rule of Evidence Combination -- 14.8 Practice Makes Perfect -- 14.9 Concluding Remarks -- 15 Fuzzy Sets -- 15.1 Fuzziness of Real-World Concepts -- 15.2 Fuzzy Set Membership -- 15.3 Fuzziness versus Other Paradigms -- 15.4 Fuzzy Set Operations -- 15.5 Counting Linguistic Variables -- 15.6 Fuzzy Reasoning -- 15.7 Practice Makes Perfect -- 15.8 Concluding Remarks -- 16 Highs and Lows of Expert Systems -- 16.1 Early Pioneer: Mycin -- 16.2 Later Developments -- 16.3 Some Experience -- 16.4 Practice Makes Perfect -- 16.5 Concluding Remarks -- 17 Beyond Core AI -- 17.1 Computer Vision -- 17.2 Natural Language Processing -- 17.3 Machine Learning -- 17.4 Agent Technology -- 17.5 Concluding Remarks -- 18 Philosophical Musings -- 18.1 Turing Test -- 18.2 Chinese Room and Other Reservations -- 18.3 Engineer's Perspective -- 18.4 Concluding Remarks "This comprehensive textbook focuses on the core techniques employed by today's artificial intelligence, including problem-solving by search techniques and swarm intelligence, and further knowledge representation, logic, automated reasoning, and uncertainty processing. Some information about planning techniques and expert systems is also provided. Fundamentals of Artificial Intelligence: Problem Solving and Automated Reasoning is written in a concise format, with a view to optimizing learning. Each chapter contains a brief historical overview and a Practice Makes Perfect section to encourage independent thought. The book includes many visuals that illustrate the essential ideas. Also, many easy-to-follow examples show how to use these ideas in practical implementations"-- Artificial intelligence / Textbooks Artificial intelligence fast |
| spellingShingle | Kubat, Miroslav 1958- Fundamentals of artificial intelligence problem solving and automated reasoning 1 Core AI: Problem Solving and Automated Reasoning -- 1.1 Early Milestones -- 1.2 Problem Solving -- 1.3 Automated Reasoning -- 1.4 Structure and Method -- 2 Blind Search -- 2.1 Motivation and Terminology -- 2.2 Depth-First and Breadth-First Search -- 2.3 Practical Considerations -- 2.4 Aspects of Search Performance -- 2.5 Iterative Deepening (and Broadening) -- 2.6 Practice Makes Perfect -- 2.7 Concluding Remarks -- 3 Heuristic Search and Annealing -- 3.1 Hill Climbing and Best-First Search -- 3.2 Practical Aspects of Evaluation Functions -- 3.3 A-Star and IDA-Star -- 3.4 Simulated Annealing -- 3.5 Role of Background Knowledge -- 3.6 Continuous Domains -- 3.7 Practice Makes Perfect -- 3.8 Concluding Remarks -- 4 Adversary Search -- 4.1 Typical Problems -- 4.2 Baseline Mini-Max -- 4.3 Heuristic Mini-Max -- 4.4 Alpha-Beta Pruning -- 4.5 Additional Game-Programming Techniques -- 4.6 Practice Makes Perfect -- 4.7 Concluding Remarks -- 5 Planning -- 5.1 Toy Blocks -- 5.2 Available Actions -- 5.3 Planning with STRIPS -- 5.4 Numeric Example -- 5.5 Advanced Applications of AI Planning -- 5.6 Practice Makes Perfect -- 5.7 Concluding Remarks -- 6 Genetic Algorithm -- 6.1 General Schema -- 6.2 Imperfect Copies and Survival -- 6.3 Alternative GA Operators -- 6.4 Potential Problems -- 6.5 Advanced Variations -- 6.6 GA and the Knapsack Problem -- 6.7 GA and the Prisoner's Dilemma -- 6.8 Practice Makes Perfect -- 6.9 Concluding Remarks -- 7 Artificial Life -- 7.1 Emergent Properties -- 7.2 L-Systems -- 7.3 Cellular Automata -- 7.4 Conways' Game of Life -- 7.5 Practice Makes Perfect -- 7.6 Concluding Remarks -- 8 Emergent Properties and Swarm Intelligence -- 8.1 Ant-Colony Optimization -- 8.2 ACO Addressing the Traveling Salesman -- 8.3 Particle-Swarm Optimization -- 8.4 Artificial-Bees Colony, ABC -- 8.5 Practice Makes Perfect -- 8.6 Concluding Remarks -- 9 Elements of Automated Reasoning -- 9.1 Facts and Queries -- 9.2 Rules and Knowledge-Based Systems -- 9.3 Simple Reasoning with Rules -- 9.4 Practice Makes Perfect -- 9.5 Concluding Remarks -- 10 Logic and Reasoning, Simplified -- 10.1 Entailment, Inference, Theorem Proving -- 10.2 Reasoning with Modus Ponens -- 10.3 Reasoning Using the Resolution Principle -- 10.4 Expressing Knowledge in Normal Form -- 10.5 Practice Makes Perfect -- 10.6 Concluding Remarks -- 11 Logic and Reasoning Using Variables -- 11.1 Rules and Quantifiers -- 11.2 Removing Quantifiers -- 11.3 Binding, Unification, and Reasoning -- 11.4 Practical Inference Procedures -- 11.5 Practice Makes Perfect -- 11.6 Concluding Remarks -- 12 Alternative Ways of Representing Knowledge -- 12.1 Frames and Semantic Networks -- 12.2 Reasoning with Frame-Based Knowledge -- 12.3 N-ary Relations in Frames and SNs -- 12.4 Practice Makes Perfect -- 12.5 Concluding Remarks -- 13 Hurdles on the Road to Automated Reasoning -- 13.1 Tacit Assumptions -- 13.2 Non-Monotonicity -- 13.3 Mycin's Uncertainty Factors -- 13.4 Practice Makes Perfect -- 13.5 Concluding Remarks -- 14 Probabilistic Reasoning -- 14.1 Theory of Probability (Revision) -- 14.2 Probability and Reasoning -- 14.3 Belief Networks -- 14.4 Dealing with More Realistic Domains -- 14.5 Demspter-Shafer Approach: Masses Instead of Probabilities -- 14.6 From Masses to Belief and Plausibility -- 14.7 DST Rule of Evidence Combination -- 14.8 Practice Makes Perfect -- 14.9 Concluding Remarks -- 15 Fuzzy Sets -- 15.1 Fuzziness of Real-World Concepts -- 15.2 Fuzzy Set Membership -- 15.3 Fuzziness versus Other Paradigms -- 15.4 Fuzzy Set Operations -- 15.5 Counting Linguistic Variables -- 15.6 Fuzzy Reasoning -- 15.7 Practice Makes Perfect -- 15.8 Concluding Remarks -- 16 Highs and Lows of Expert Systems -- 16.1 Early Pioneer: Mycin -- 16.2 Later Developments -- 16.3 Some Experience -- 16.4 Practice Makes Perfect -- 16.5 Concluding Remarks -- 17 Beyond Core AI -- 17.1 Computer Vision -- 17.2 Natural Language Processing -- 17.3 Machine Learning -- 17.4 Agent Technology -- 17.5 Concluding Remarks -- 18 Philosophical Musings -- 18.1 Turing Test -- 18.2 Chinese Room and Other Reservations -- 18.3 Engineer's Perspective -- 18.4 Concluding Remarks Artificial intelligence / Textbooks Artificial intelligence fast |
| title | Fundamentals of artificial intelligence problem solving and automated reasoning |
| title_auth | Fundamentals of artificial intelligence problem solving and automated reasoning |
| title_exact_search | Fundamentals of artificial intelligence problem solving and automated reasoning |
| title_exact_search_txtP | Fundamentals of artificial intelligence problem solving and automated reasoning |
| title_full | Fundamentals of artificial intelligence problem solving and automated reasoning Miroslav Kubat |
| title_fullStr | Fundamentals of artificial intelligence problem solving and automated reasoning Miroslav Kubat |
| title_full_unstemmed | Fundamentals of artificial intelligence problem solving and automated reasoning Miroslav Kubat |
| title_short | Fundamentals of artificial intelligence |
| title_sort | fundamentals of artificial intelligence problem solving and automated reasoning |
| title_sub | problem solving and automated reasoning |
| topic | Artificial intelligence / Textbooks Artificial intelligence fast |
| topic_facet | Artificial intelligence / Textbooks Artificial intelligence |
| work_keys_str_mv | AT kubatmiroslav fundamentalsofartificialintelligenceproblemsolvingandautomatedreasoning |