Heribert Vollmer

Nadia Creignou

Phokion G. Kolaitis

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.

An Overview of Current Research Themes

Complexity of Constraints

Leonid Libkin

Erich Grädel

Scott Weinstein

Moshe Y. Vardi

Joel Spencer

Maarten Marx

Yde Venema

Finite model theory,as understoodhere, is an areaof mathematicallogic that has developed in close connection with applications to computer science, in particular the theory of computational complexity and database theory. One of the fundamental insights of mathematical logic is that our understanding of mathematical phenomena is enriched by elevating the languages we use to describe mathematical structures to objects of explicit study. If mathematics is the science of patterns, then the media through which we discern patterns, as well as the structures in which we discern them, command our attention. It isthis aspect oflogicwhichis mostprominentin model theory,“thebranchof mathematical logic which deals with the relation between a formal language and its interpretations”. No wonder, then, that mathematical logic, and ?nite model theory in particular, should ?nd manifold applications in computer science: from specifying programs to querying databases, computer science is rife with phenomena whose understanding requires close attention to the interaction between language and structure. This volume gives a broadoverviewof some central themes of ?nite model theory: expressive power, descriptive complexity, and zero–one laws, together with selected applications to database theory and arti?cial intelligence, es- cially constraint databases and constraint satisfaction problems. The ?nal chapter provides a concise modern introduction to modal logic,which emp- sizes the continuity in spirit and technique with ?nite model theory.

Finite Model Theory and Its Applications

Foto N. Afrati

This book constitutes the refereed proceedings of the 6th International Conference on Database Theory, ICDT '97, held in Delphi, Greece, in January 1997. The 29 revised full papers presented in the volume were carefully selected from a total of 118 submissions. Also included are invited papers by Serge Abiteboul and Jeff Ullman as well as a tutorial on data mining by Heikki Mannila. The papers are organized in sections on conjunctive queries in heterogeneous databases, logic and databases, active databases, new applications, concurrency control, unstructured data, object-oriented databases, access methods, and spatial and bulk data.

6th International Conference, Delphi, Greece, January 8-10, 1997. Proceedings

Database Theory - ICDT '97

Phokion G. Kolaitis

Books

Your next favorite book is out there