Nowadays constraint satisfaction problems (CSPs) are ubiquitous in many different areas of computer science, from artificial intelligence and database systems to circuit design, network optimization, and theory of programming languages. Consequently, it is important to analyze and pinpoint the computational complexity of certain algorithmic tasks related to constraint satisfaction. The complexity-theoretic results of these tasks may have a direct impact on, for instance, the design and processing of database query languages, or strategies in data-mining, or the design and implementation of planners. This state-of-the-art survey contains the papers that were invited by the organizers after conclusion of an International Dagstuhl-Seminar on Complexity of Constraints, held in Dagstuhl Castle, Germany, in October 2006. A number of speakers were solicited to write surveys presenting the state of the art in their area of expertise. These contributions were peer-reviewed by experts in the field and revised before they were collated to the 9 papers of this volume. In addition, the volume contains a reprint of a survey by Kolaitis and Vardi on the logical approach to constraint satisfaction that first appeared in 'Finite Model Theory and its Applications', published by Springer in 2007.

"Control of Complex Systems: Structural Constraints and Uncertainty" focuses on control design under information structure constraints, with a particular emphasis on large-scale systems. The complexity of such systems poses serious computational challenges and severely restricts the types of feedback laws that can be used in practice. This book systematically addresses the main issues, and provides a number of applications that illustrate potential design methods, most which use Linear Matrix Inequalities (LMIs), which have become a popular design tool over the past two decades. Authors Aleksandar I. Zecevic and Dragoslav D. Siljak use their years of experience in the control field to also: Address the issues of large-scale systems as they relate to robust control and linear matrix inequalities Discuss a new approach to applying standard LMI techniques to large-scale systems, combining graphic-theoretic decomposition techniques with appropriate low-rank numerical approximations and dramatically reducing the computational effort Providing numerous examples and a wide variety of applications, ranging from electric power systems and nonlinear circuits to mechanical problems and dynamic Boolean networks "Control of Complex Systems: Structural Constraints and Uncertainty" will appeal to practicing engineers, researchers and students working in control design and other related areas.

New and classical results in computational complexity, including interactive proofs, PCP, derandomization, and quantum computation. Ideal for graduate students.

What is the difference between a wink and a blink? The answer is important not only to philosophers of mind, for significant moral and legal consequences rest on the distinction between voluntary and involuntary behavior. However, "action theory"—the branch of philosophy that has traditionally articulated the boundaries between action and non-action, and between voluntary and involuntary behavior—has been unable to account for the difference. Alicia Juarrero argues that a mistaken, 350-year-old model of cause and explanation—one that takes all causes to be of the push-pull, efficient cause sort, and all explanation to be prooflike—underlies contemporary theories of action. Juarrero then proposes a new framework for conceptualizing causes based on complex adaptive systems. Thinking of causes as dynamical constraints makes bottom-up and top-down causal relations, including those involving intentional causes, suddenly tractable. A different logic for explaining actions—as historical narrative, not inference—follows if one adopts this novel approach to long-standing questions of action and responsibility.

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

Constraint reasoning has matured over the last three decades with contributions from a diverse community of researchers in artificial intelligence, databases and programming languages, operations research, management science, and applied mathematics. In Constraint Processing, Rina Dechter synthesizes these contributions, as well as her own significant work, to provide the first comprehensive examination of the theory that underlies constraint processing algorithms.

This book constitutes the thoroughly refereed and extended post-proceedings of the Joint ERCIM/CoLogNet International Workshop on Constraint Solving and Constraint Logic Programming, CSCLP 2005. The 12 revised full papers presented were carefully reviewed and selected for inclusion in the book. The papers are organized in topical sections on global constraints, search and heuristics, language and implementation issues, and modeling.

This monograph sets out to derive the effects of standard constraints on displacement like the Minimal Link Condition (MLC) and the Condition on Extraction Domain (CED) from more basic principles in a minimalist approach. Assuming that movement via phase edges is possible only in the presence of edge features on phase heads, simple restrictions can be introduced on when such edge features can be inserted derivationally. The resulting system is shown to correctly predict MLC/CED effects (including certain exceptions, like intervention without c-command and melting). In addition, it derives operator-island effects, a restriction on extraction from verb-second clauses, and island repair by ellipsis. The approach presupposes that syntactic operations apply in a fixed order: Timing emerges as crucial. Thus, the book provides new arguments for a strictly derivational organization of syntax. Accordingly, it should be of interest not only to all syntacticians working on islands, but more generally to all scholars interested in the overall organization of grammar.

This book provides an introduction to the role of diversity in complex adaptive systems. A complex system--such as an economy or a tropical ecosystem--consists of interacting adaptive entities that produce dynamic patterns and structures. Diversity plays a different role in a complex system than it does in an equilibrium system, where it often merely produces variation around the mean for performance measures. In complex adaptive systems, diversity makes fundamental contributions to system performance. Scott Page gives a concise primer on how diversity happens, how it is maintained, and how it affects complex systems. He explains how diversity underpins system level robustness, allowing for multiple responses to external shocks and internal adaptations; how it provides the seeds for large events by creating outliers that fuel tipping points; and how it drives novelty and innovation. Page looks at the different kinds of diversity--variations within and across types, and distinct community compositions and interaction structures--and covers the evolution of diversity within complex systems and the factors that determine the amount of maintained diversity within a system. Provides a concise and accessible introduction Shows how diversity underpins robustness and fuels tipping points Covers all types of diversity The essential primer on diversity in complex adaptive systems

Constraints on Language Variation and Change in Complex Multilingual Contact Settings explores an innovative proposal: that linguistic similarities identified in different forms of contact-influenced varieties of language use (including translation, native and non-native varieties of English, and language use of bilinguals more generally) can be accounted for in a coherent framework grounded in the notion of ‘constrained communication’. These varieties have hitherto been studied in independent scholarly traditions, especially translation studies and world Englishes, leaving the potential underlying unity underexplored, both conceptually and empirically. The chapters collected in this volume aim to develop such a unified perspective by drawing on corpus data across a range of languages and language varieties, with a focus on written language, a neglected data source in research on multilingual contact settings. The findings point to shared general characteristics across individual contact settings, which result from (probabilistically conditioned) manifestations of the same deeper regularities – constraints – present in diverse language-contact settings.