Books in the Artificial Intelligence: Foundations, Theory, and Algorithms series

This book introduces readers to critical ethical concerns in the development and use of artificial intelligence. Offering clear and accessible information on central concepts and debates in AI ethics, it explores how related problems are now forcing us to address fundamental, age-old questions about human life, value, and meaning. In addition, the book shows how foundational and theoretical issues relate to concrete controversies, with an emphasis on understanding how ethical questions play out in practice.All topics are explored in depth, with clear explanations of relevant debates in ethics and philosophy, drawing on both historical and current sources. Questions in AI ethics are explored in the context of related issues in technology, regulation, society, religion, and culture, to help readers gain a nuanced understanding of the scope of AI ethics within broader debates and concerns.Written with both students and educators in mind, the book is easy to use, with keyterms clearly explained, and numerous exercises designed to stretch and challenge. It offers readers essential insights into the evolving field of AI ethics. Moreover, it presents a range of methods and strategies that can be used to analyse and understand ethical questions, which are illustrated throughout with case studies.

The book discusses the main issues of coordination in complex sociotechnical systems, covering distributed, self-organising, and pervasive systems.

The authors present chapters on the use of decision diagrams for combinatorial optimization and constraint programming, with attention to general-purpose solution methods as well as problem-specific techniques.The book will be useful for researchers and practitioners in discrete optimization and constraint programming.

This book provides a significant step towards bridging the areas of Boolean satisfiability and constraint satisfaction by answering the question why SAT-solvers are efficient on certain classes of CSP instances which are hard to solve for standard constraint solvers.