Can we build moral machines? Artificial intelligence is an essential part of our lives - for better or worse. It can be used to influence what we buy, who gets shortlisted for a job and even how we vote. Without AI, medical technology wouldn't have come so far, we'd still be getting lost in our GPS-free cars, and smartphones wouldn't be so, well, smart. But as we continue to build more intelligent and autonomous machines, what impact will this have on humanity and the planet? Professor Toby Walsh, a world-leading researcher in the field of artificial intelligence, explores the ethical considerations and unexpected consequences AI poses. Can AI be racist? Can robots have rights? What happens if a self-driving car kills someone? What limitations should we put on the use of facial recognition? Machines Behaving Badly is a thought-provoking look at the increasing human reliance on robotics and the decisions that need to be made now to ensure the future of AI is a force for good, not evil.

This book covers recent progress in solving propositional satisfiability and related problems. Propositional satisfiability is a powerful and general formalism used to solve a wide range of important problems including hardware and software verification. Research into methods to automate such reasoning has therefore a long history in artificial intelligence. This book follows on from the highly successful volume entitled SAT 2000 published five years ago.

Computational social choice is an expanding field that merges classical topics like economics and voting theory with more modern topics like artificial intelligence, multiagent systems, and computational complexity. This book provides a concise introduction to the main research lines in this field, covering aspects such as preference modelling, uncertainty reasoning, social choice, stable matching, and computational aspects of preference aggregation and manipulation. The book is centered around the notion of preference reasoning, both in the single-agent and the multi-agent setting. It presents the main approaches to modeling and reasoning with preferences, with particular attention to two popular and powerful formalisms, soft constraints and CP-nets. The authors consider preference elicitation and various forms of uncertainty in soft constraints. They review the most relevant results in voting, with special attention to computational social choice. Finally, the book considers preferences in matching problems. The book is intended for students and researchers who may be interested in an introduction to preference reasoning and multi-agent preference aggregation, and who want to know the basic notions and results in computational social choice. Table of Contents: Introduction / Preference Modeling and Reasoning / Uncertainty in Preference Reasoning / Aggregating Preferences / Stable Marriage Problems

The 8th International Conference on Theory and Applications of Satis?ability Testing(SAT2005)providedaninternationalforumforthemostrecentresearch on the satis?ablity problem (SAT). SAT is the classic problem of determining whether or not a propositional formula has a satisfying truth assignment. It was the ?rst problem shown by Cook to be NP-complete. Despite its seemingly specialized nature, satis?ability testing has proved to extremely useful in a wide range of di?erent disciplines, both from a practical as well as from a theoretical point of view. For example, work on SAT continues to provide insight into various fundamental problems in computation, and SAT solving technology has advanced to the point where it has become the most e?ective way of solving a number of practical problems. The SAT series of conferences are multidisciplinary conferences intended to bring together researchers from various disciplines who are interested in SAT. Topics of interest include, but are not limited to: proof systems and proof c- plexity; search algorithms and heuristics; analysis of algorithms; theories beyond the propositional; hard instances and random formulae; problem encodings; - dustrial applications; solvers and other tools. This volume contains the papers accepted for presentation at SAT 2005. The conference attracted a record number of 73 submissions. Of these, 26 papers were accepted for presentation in the technical programme. In addition, 16 - pers were accepted as shorter papers and were presented as posters during the technicalprogramme.Theacceptedpapersandposterpaperscoverthefullrange of topics listed in the call for papers.

This book constitutes the refereed proceedings of the 7th International Conference on Principles and Practice of Constraint Programming, CP 2001, held in Paphos, Cyprus, in November/December 2001.The 37 revised full papers, 9 innovative applications presentations, and 14 short papers presented were carefully reviewed and selected from a total of 135 submissions. All current issues in constraint processing are addressed, ranging from theoretical and foundational issues to advanced and innovative applications in a variety of fields.

This volume contains the proceedings of SARA 2000, the fourth Symposium on Abstraction, Reformulations, and Approximation (SARA). The conference was held at Horseshoe Bay Resort and Conference Club, Lake LBJ, Texas, July 26- 29, 2000, just prior to the AAAI 2000 conference in Austin. Previous SARA conferences took place at Jackson Hole in Wyoming (1994), Ville d'Esterel in Quebec (1995), and Asilomar in California (1998). The symposium grewout of a series of workshops on abstraction, approximation, and reformulation that had taken place alongside AAAI since 1989. This year's symposium was actually scheduled to take place at Lago Vista Clubs & Resort on Lake Travis but, due to the resort's failure to pay taxes, the conference had to be moved late in the day. This mischance engendered eleventh-hour reformulations, abstractions, and resource re-allocations of its own. Such are the perils of organizing a conference. This is the ?rst SARA for which the proceedings have been published in the LNAI series of Springer-Verlag. We hope that this is a re?ection of the increased maturity of the ?eld and that the increased visibility brought by the publication of this volume will help the discipline grow even further. Abstractions, reformulations, and approximations (AR&A) have found - plications in a variety of disciplines and problems including automatic progr- ming, constraint satisfaction, design, diagnosis, machine learning, planning, qu- itative reasoning, scheduling, resource allocation, and theorem proving. The - pers in this volume capture a cross-section of these application domains."

This book constitutes the refereed proceedings of the 20th International Conference on Theory and Applications of Satisfiability Testing, SAT 2017, held in Melbourne, Australia, in August/September 2017. The 22 revised full papers, 5 short papers, and 3 tool papers were carefully reviewed and selected from 64 submissions. The papers are organized in the following topical sections: algorithms, complexity, and lower bounds; clause learning and symmetry handling; maximum satisfiability and minimal correction sets; parallel SAT solving; quantified Boolean formulas; satisfiability modulo theories; and SAT encodings.

This book is devoted to recent progress made in solving propositional satisfiability and related problems. Propositional satisfiability is a powerful and general formalism used to solve a wide range of important problems including hardware and software verification. The core of many reasoning problems in automated deduction are propositional. Research into methods to automate such reasoning has therefore a long history in artificial intelligence. In 1957, Allen Newell and Herb Simon introduced the Logic Theory Machine to prove propositional theorems from Whitehead and Russel's Principia mathematica. ...] This book follows on from the highly successful volume entitled SAT 2000 published five years ago. The papers in SAT 2005 fall (not entirely neatly) into the following categories: complete methods, local and stochastic search methods, random problems, applications, and extensions beyond the propositional.

A scientist who has spent a career developing Artificial Intelligence takes a realistic look at the technological challenges and assesses the likely effect of AI on the future. How will Artificial Intelligence (AI) impact our lives? Toby Walsh, one of the leading AI researchers in the world, takes a critical look at the many ways in which "thinking machines" will change our world. Based on a deep understanding of the technology, Walsh describes where Artificial Intelligence is today, and where it will take us. *Will automation take away most of our jobs? *Is a "technological singularity" near? *What is the chance that robots will take over? *How do we best prepare for this future? The author concludes that, if we plan well, AI could be our greatest legacy, the last invention human beings will ever need to make.

Constraint programming is a powerful paradigm for solving combinatorial search problems that draws on a wide range of techniques from artificial intelligence, computer science, databases, programming languages, and operations research. Constraint programming is currently applied with success to many domains, such as scheduling, planning, vehicle routing, configuration, networks, and bioinformatics.
The aim of this handbook is to capture the full breadth and depth of the constraint programming field and to be encyclopedic in its scope and coverage. While there are several excellent books on constraint programming, such books necessarily focus on the main notions and techniques and cannot cover also extensions, applications, and languages. The handbook gives a reasonably complete coverage of all these lines of work, based on constraint programming, so that a reader can have a rather precise idea of the whole field and its potential. Of course each line of work is dealt with in a survey-like style, where some details may be neglected in favor of coverage. However, the extensive bibliography of each chapter will help the interested readers to find suitable sources for the missing details. Each chapter of the handbook is intended to be a self-contained survey of a topic, and is written by one or more authors who are leading researchers in the area.
The intended audience of the handbook is researchers, graduate students, higher-year undergraduates and practitioners who wish to learn about the state-of-the-art in constraint programming. No prior knowledge about the field is necessary to be able to read the chapters and gather useful knowledge. Researchers from other fields should find in this handbook an effective way to learn about constraint programming and to possibly use some of the constraint programming concepts and techniques in their work, thus providing a means for a fruitful cross-fertilization among different research areas.
The handbook is organized in two parts. The first part covers the basic foundations of constraint programming, including the history, the notion of constraint propagation, basic search methods, global constraints, tractability and computational complexity, and important issues in modeling a problem as a constraint problem. The second part covers constraint languages and solver, several useful extensions to the basic framework (such as interval constraints, structured domains, and distributed CSPs), and successful application areas for constraint programming.
- Covers the whole field of constraint programming
- Survey-style chapters
- Five chapters on applications

This book constitutes the thoroughly refereed conference proceedings of the 4th International Conference on Algorithmic Decision Theory , ADT 2015, held in September 2015 in Lexington, USA. The 32 full papers presented were carefully selected from 76 submissions. The papers are organized in topical sections such as preferences; manipulation, learning and other issues; utility and decision theory; argumentation; bribery and control; social choice; allocation and other problems; doctoral consortium.

If governed adequately, AI (artificial intelligence) has the potential to benefit humankind enormously. However, if mismanaged, it also has the potential to harm humanity catastrophically. The title of this book reflects the belief that access to the benefits of AI, awareness about the nature of the technology, governance of the technology and its development process with a focus on responsible development, should be transparent, open, understood by and accessible to all people regardless of their geographic, generational, economic, cultural and/or other social background. The book is the result of a discussion series organized by the Association of Pacific Rim Universities (APRU) which was financially supported by Google.

Many people think the future is something we need to adjust to, rather than what we decide through the choices we make today. This book looks at the choices we are starting to make that will define this future. The majority of experts in Artificial Intelligence (AI) and robotics predict we are likely to have built machines as intelligent as us by the year 2062. What will the future look like when the quest to build intelligent machines has succeeded?

In 2062, Professor of Artificial Intelligence, Toby Walsh, a world-leader in the field and one of the 100 ‘rock stars’ of Australia’s digital revolution, considers the impact AI will have on work, war, equality, politics and, ultimately, the fate of humanity. Will automation take away most of our jobs? When will we start to see this happen? Will the robots take over? Will they become conscious? Will we perhaps become machines? Will inequality continue to increase? How can we prevent this? How will political debate adjust to the post-truth, digital world? How do we make the right choices today to ensure our future is bright?

Based on a deep understanding of the technology and its implications, 2062 describes the choices we need to make today to ensure a good future. Walsh answers some of the most important and pressing questions facing us today. He concludes that, if we plan well, the future past 2062 could be very bright indeed but we need to start making some difficult choices today.