"Small Dynamic Complexity Classes" was awarded the E.W. Beth Dissertation Prize 2016 for outstanding dissertations in the fields of logic, language, and information. The thesis studies the foundations of query re-evaluation after modifying a database. It explores the structure of small dynamic descriptive complexity classes and provides new methods for proving lower bounds in this dynamic context. One of the contributions to the former aspect helped to confirm the conjecture by Patnaik and Immerman (1997) that reachability can be maintained by first-order update formulas.

This book constitutes the proceedings of the 9th International Computer Science Symposium in Russia, CSR 2014, held in Moscow, Russia, in June 2014. The 27 full papers presented in this volume were carefully reviewed and selected from 76 submissions. In addition the book contains 4 invited lectures. The scope of the proposed topics is quite broad and covers a wide range of areas in theoretical computer science and its applications.

This book constitutes the refereed proceedings of the 8th International Conference on Database Theory, ICDT 2001, held in London, UK, in January 2001. The 26 revised full papers presented together with two invited papers were carefully reviewed and selected from 75 submissions. All current issues on database theory and the foundations of database systems are addressed. Among the topics covered are database queries, SQL, information retrieval, database logic, database mining, constraint databases, transactions, algorithmic aspects, semi-structured data, data engineering, XML, term rewriting, clustering, etc.

This book constitutes the proceedings of the 20th International Conference on Foundations of Software Science and Computation Structures, FOSSACS 2017, which took place in Uppsala, Sweden in April 2017, held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2017. The 32 papers presented in this volume were carefully reviewed and selected from 101 submissions. They were organized in topical sections named: coherence spaces and higher-order computation; algebra and coalgebra; games and automata; automata, logic and formal languages; proof theory; probability; concurrency; lambda calculus and constructive proof; and semantics and category theory.

How high-level behaviors arise from low-level rules, and how understanding this relationship can suggest novel solutions to complex real-world problems such as disease prevention, stock-market prediction, and data mining on the Internet. The term "artificial life" describes research into synthetic systems that possess some of the essential properties of life. This interdisciplinary field includes biologists, computer scientists, physicists, chemists, geneticists, and others. Artificial life may be viewed as an attempt to understand high-level behavior from low-level rules -- for example, how the simple interactions between ants and their environment lead to complex trail-following behavior. An understanding of such relationships in particular systems can suggest novel solutions to complex real-world problems such as disease prevention, stock-market prediction, and data mining on the Internet. Since their inception in 1987, the Artificial Life meetings have grown from small workshops to truly international conferences, reflecting the field's increasing appeal to researchers in all areas of science.

Traditionally, the three most important manufacturing functions are process planning, scheduling, and due-date assignment, which are handled sequentially and separately.This book integrates these manufacturing processes and functions to increase global performance along with manufacturing and production cost savings. Integrated Process Planning, Scheduling, and Due-Date Assignment combines the most important manufacturing functions to use manufacturing resources better, reduce production costs, and eliminate bottlenecks with increased production efficiency. The book covers how the integration will help eliminate scheduling conflicts and how to adapt to irregular shop floor disturbances. It also explains how other elements, such as tardiness and earliness, are penalized and how prioritizing helps improve weight performance function. This book will draw the interest of professionals, students, and academicians in process planning, scheduling, and due-date assignment. It could also be supplemental material for manufacturing courses in industrial engineering and manufacturing engineering departments.

This book constitutes the refereed proceedings of the 22nd Annual Symposium on Theoretical Aspects of Computer Science, STACS 2005, held in Stuttgart, Germany in February 2005. The 54 revised full papers presented together with 3 invited papers were carefully reviewed and selected from 217 submissions. A broad variety of topics from theoretical computer science are addressed, in particular complexity theory, algorithmics, computational discrete mathematics, automata theory, combinatorial optimization and approximation, networking and graph theory, computational geometry, grammar systems and formal languages, etc.