Search Methods in Artificial Intelligence

Deepak Khemani

ISBN 10: 1009284320 / ISBN 13: 9781009284325

Published by Cambridge University Press, 2024

About this Item

Druck auf Anfrage Neuware - Printed after ordering - This book is designed to provide in-depth knowledge on how search plays a fundamental role in problem solving. Meant for undergraduate and graduate students pursuing courses in computer science and artificial intelligence, it covers a wide spectrum of search methods. Readers will be able to begin with simple approaches and gradually progress to more complex algorithms applied to a variety of problems. It demonstrates that search is all pervasive in artificial intelligence and equips the reader with the relevant skills. The text starts with an introduction to intelligent agents and search spaces. Basic search algorithms like depth first search and breadth first search are the starting points. Then, it proceeds to discuss heuristic search algorithms, stochastic local search, algorithm A\*, and problem decomposition. It also examines how search is used in playing board games, deduction in logic and automated planning. The book concludes with a coverage on constraint satisfaction.

Seller Inventory # 9781009284325

Bibliographic Details

• Title: Search Methods in Artificial Intelligence
• Publisher: Cambridge University Press
• Publication Date: 2024
• Language: English
• ISBN 10: 1009284320
• ISBN 13: 9781009284325
• Binding: Buch
• Condition: Neu
• Dimensions: 260W x 183H x 31D millimeters 260 millimeters width by 183 millimeters height by 31 millimeters depth
• Weight: 1104 grams

About this title

Synopsis

This book is designed to provide in-depth knowledge on how search plays a fundamental role in problem solving. Meant for undergraduate and graduate students pursuing courses in computer science and artificial intelligence, it covers a wide spectrum of search methods. Readers will be able to begin with simple approaches and gradually progress to more complex algorithms applied to a variety of problems. It demonstrates that search is all pervasive in artificial intelligence and equips the reader with the relevant skills. The text starts with an introduction to intelligent agents and search spaces. Basic search algorithms like depth first search and breadth first search are the starting points. Then, it proceeds to discuss heuristic search algorithms, stochastic local search, algorithm A*, and problem decomposition. It also examines how search is used in playing board games, deduction in logic and automated planning. The book concludes with a coverage on constraint satisfaction.

About the Author

Deepak Khemani is a professor at IIT Madras. He has been working in AI for four decades, with a focus on knowledge representation and problem-solving. He is the author of the textbook, A First Course in Artificial Intelligence (2008), and has three popular online courses on Swayam.