Dynamic Flexible Constraint Satisfaction and its Application to AI Planning
Dynamic Flexible Constraint Satisfaction and its Application to AI Planning

Author: Ian Miguel

Publisher: Springer Science & Business Media

Published: 2003-11-14

Total Pages: 346

ISBN-13: 9781852337643

DOWNLOAD EBOOK

First, I would like to thank my principal supervisor Dr Qiang Shen for all his help, advice and friendship throughout. Many thanks also to my second supervisor Dr Peter Jarvis for his enthusiasm, help and friendship. I would also like to thank the other members of the Approximate and Qualitative Reasoning group at Edinburgh who have also helped and inspired me. This project has been funded by an EPSRC studentship, award num ber 97305803. I would like, therefore, to extend my gratitude to EPSRC for supporting this work. Many thanks to the staff at Edinburgh University for all their help and support and for promptly fixing any technical problems that I have had . My whole family have been both encouraging and supportive throughout the completion of this book, for which I am forever indebted. York, April 2003 Ian Miguel Contents List of Figures XV 1 Introduction. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1 1. 1 Solving Classical CSPs . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 2 1. 2 Applicat ions of Classical CSP . . . . . . . . . . . . . . . . . . . . . . . . . . . . 3 1. 3 Limitations of Classical CSP . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 6 1. 3. 1 Flexible CSP 6 1. 3. 2 Dynamic CSP . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 7 1. 4 Dynamic Flexible CSP . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 7 1. 5 Flexible Planning: a DFCSP Application . . . . . . . . . . . . . . . . . . 8 1. 6 Structure . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 9 1. 7 Contributions and their Significance 11 2 The Constraint Satisfaction Problem 13 2. 1 Constraints and Constraint Graphs . . . . . . . . . . . . . . . . . . . . . . . 13 2. 2 Tree Search Solution Techniques for Classical CSP . . . . . . . . . . 16 2. 2. 1 Backtrack . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 17 2. 2. 2 Backjumping . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 18 2. 2. 3 Conflict-Directed Backjumping . . . . . . . . . . . . . . . . . . . . . 19 2. 2. 4 Backmarking . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .

Artificial Intelligence
Artificial Intelligence

Author: Nils J. Nilsson

Publisher: Morgan Kaufmann

Published: 1998-04

Total Pages: 537

ISBN-13: 1558604677

DOWNLOAD EBOOK

Nilsson employs increasingly capable intelligent agents in an evolutionary approach--a novel perspective from which to view and teach topics in artificial intelligence.

Logic-Based Artificial Intelligence
Logic-Based Artificial Intelligence

Author: Jack Minker

Publisher: Springer Science & Business Media

Published: 2012-12-06

Total Pages: 600

ISBN-13: 146151567X

DOWNLOAD EBOOK

The use of mathematical logic as a formalism for artificial intelligence was recognized by John McCarthy in 1959 in his paper on Programs with Common Sense. In a series of papers in the 1960's he expanded upon these ideas and continues to do so to this date. It is now 41 years since the idea of using a formal mechanism for AI arose. It is therefore appropriate to consider some of the research, applications and implementations that have resulted from this idea. In early 1995 John McCarthy suggested to me that we have a workshop on Logic-Based Artificial Intelligence (LBAI). In June 1999, the Workshop on Logic-Based Artificial Intelligence was held as a consequence of McCarthy's suggestion. The workshop came about with the support of Ephraim Glinert of the National Science Foundation (IIS-9S2013S), the American Association for Artificial Intelligence who provided support for graduate students to attend, and Joseph JaJa, Director of the University of Maryland Institute for Advanced Computer Studies who provided both manpower and financial support, and the Department of Computer Science. We are grateful for their support. This book consists of refereed papers based on presentations made at the Workshop. Not all of the Workshop participants were able to contribute papers for the book. The common theme of papers at the workshop and in this book is the use of logic as a formalism to solve problems in AI.

Handbook of Constraint Programming
Handbook of Constraint Programming

Author: Francesca Rossi

Publisher: Elsevier

Published: 2006-08-18

Total Pages: 977

ISBN-13: 0080463800

DOWNLOAD EBOOK

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

AI*IA 99:Advances in Artificial Intelligence
AI*IA 99:Advances in Artificial Intelligence

Author: Evelina Lamma

Publisher: Springer

Published: 2003-06-26

Total Pages: 400

ISBN-13: 3540462384

DOWNLOAD EBOOK

This book contains the extended versions of 33 papers selected among those originally presented at the Sixth Congress of the Italian Association for Artificial Intelligence (AI*IA). The congress of the AI*IA is the most relevant Italian event in the field of Artificial Intelligence, and has been receiving much attention from many researchers and practitioners of different countries. The sixth congress was held in Bologna, 14-17 September 1999, and was organized in twelve scientific sessions and one demo session. The papers here collected report on significant work carried out in different areas of artificial intelligence, in Italy and other countries. Areas such as automated reasoning, knowledge representation, planning, and machine learning continue to be thoroughly investigated. The collection also shows a growing interest in the field of multi-agent systems, perception and robotics, and temporal reasoning. Many people contributed in different ways to the success of the congress and to this volume. First of all, the members of the program committee who efficiently handled the reviewing of the 64 papers submitted to the congress, and later on the reviewing of the 41 papers submitted for publication in this volume. They provided three reviews for each manuscript, by relying on the support of valuable additional reviewers. The members of the organizing committee, namely Rosangela Barruffi, Paolo Bellavista, Anna Ciampolini, Marco Cremonini, Enrico Denti, Marco Gavanelli, Mauro Gaspari, Michela Milano, Rebecca Montanari, Andrea Omicini, Fabrizio Riguzzi, Cesare Stefanelli, and Paolo Torroni, worked hardy supporting at solving problems during and after the congress.

Intelligent Agent Systems
Intelligent Agent Systems

Author: Lawrence Cavedon

Publisher: Springer Science & Business Media

Published: 1997-03-05

Total Pages: 208

ISBN-13: 9783540626862

DOWNLOAD EBOOK

The agents approach is not just another abstract computing paradigm, but has matured during recent years into a booming research area and software engineering technology which holds great promise for the design and application of complex distributed systems. This book presents 12 revised full chapters grouped around 3 main topics in intelligent agent systems; agent architectures, formal theories of rationality and cooperation and collaboration. Among the topics addressed are software agents, BDI architectures, social commitment, believable agents and artificial life. The book is based on the Workshop on Theoretical and Practical Foundations of Intelligent Agents held at the Fourth Pacific Rim International Conference on Artificial Intelligence in Cairns, Australia, in August 1996.

Algorithms and Theory of Computation Handbook - 2 Volume Set
Algorithms and Theory of Computation Handbook - 2 Volume Set

Author: Mikhail J. Atallah

Publisher: CRC Press

Published: 2022-05-29

Total Pages: 1904

ISBN-13: 1439832331

DOWNLOAD EBOOK

Algorithms and Theory of Computation Handbook, Second Edition in a two volume set, provides an up-to-date compendium of fundamental computer science topics and techniques. It also illustrates how the topics and techniques come together to deliver efficient solutions to important practical problems. New to the Second Edition: Along with updating and revising many of the existing chapters, this second edition contains more than 20 new chapters. This edition now covers external memory, parameterized, self-stabilizing, and pricing algorithms as well as the theories of algorithmic coding, privacy and anonymity, databases, computational games, and communication networks. It also discusses computational topology, computational number theory, natural language processing, and grid computing and explores applications in intensity-modulated radiation therapy, voting, DNA research, systems biology, and financial derivatives. This best-selling handbook continues to help computer professionals and engineers find significant information on various algorithmic topics. The expert contributors clearly define the terminology, present basic results and techniques, and offer a number of current references to the in-depth literature. They also provide a glimpse of the major research issues concerning the relevant topics