This is the first book presenting a broad overview of parallelism in constraint-based reasoning formalisms. In recent years, an increasing number of contributions have been made on scaling constraint reasoning thanks to parallel architectures. The goal in this book is to overview these achievements in a concise way, assuming the reader is familiar with the classical, sequential background. It presents work demonstrating the use of multiple resources from single machine multi-core and GPU-based computations to very large scale distributed execution platforms up to 80,000 processing units. The contributions in the book cover the most important and recent contributions in parallel propositional satisfiability (SAT), maximum satisfiability (MaxSAT), quantified Boolean formulas (QBF), satisfiability modulo theory (SMT), theorem proving (TP), answer set programming (ASP), mixed integer linear programming (MILP), constraint programming (CP), stochastic local search (SLS), optimal path finding with A*, model checking for linear-time temporal logic (MC/LTL), binary decision diagrams (BDD), and model-based diagnosis (MBD). The book is suitable for researchers, graduate students, advanced undergraduates, and practitioners who wish to learn about the state of the art in parallel constraint reasoning.

Propositional logic has been recognized throughout the centuries as one of the cornerstones of reasoning in philosophy and mathematics. Over time, its formalization into Boolean algebra was accompanied by the recognition that a wide range of combinatorial problems can be expressed as propositional satisfiability (SAT) problems. Because of this dual role, SAT developed into a mature, multi-faceted scientific discipline, and from the earliest days of computing a search was underway to discover how to solve SAT problems in an automated fashion. This book, the Handbook of Satisfiability, is the second, updated and revised edition of the book first published in 2009 under the same name. The handbook aims to capture the full breadth and depth of SAT and to bring together significant progress and advances in automated solving. Topics covered span practical and theoretical research on SAT and its applications and include search algorithms, heuristics, analysis of algorithms, hard instances, randomized formulae, problem encodings, industrial applications, solvers, simplifiers, tools, case studies and empirical results. SAT is interpreted in a broad sense, so as well as propositional satisfiability, there are chapters covering the domain of quantified Boolean formulae (QBF), constraints programming techniques (CSP) for word-level problems and their propositional encoding, and satisfiability modulo theories (SMT). An extensive bibliography completes each chapter. This second edition of the handbook will be of interest to researchers, graduate students, final-year undergraduates, and practitioners using or contributing to SAT, and will provide both an inspiration and a rich resource for their work. Edmund Clarke, 2007 ACM Turing Award Recipient: "SAT solving is a key technology for 21st century computer science." Donald Knuth, 1974 ACM Turing Award Recipient: "SAT is evidently a killer app, because it is key to the solution of so many other problems." Stephen Cook, 1982 ACM Turing Award Recipient: "The SAT problem is at the core of arguably the most fundamental question in computer science: What makes a problem hard?"

This book contains the revised selected papers of the International Conference on Dynamic Monitoring and Optimization, DCO 2021, held in Aveiro, Portugal, February 3-5, 2021. The papers present achievements in the most challenging areas of dynamic control, optimization and related topics, including recent results in nonlinear dynamic control systems, calculus of variations, sub-Riemannian geometry, conventional differential equations, control of PDE evolution, stochastic differential equations, the spread of acoustic waves in elastic media, dynamics in space-time, Nondegenerate abnormality, controllability, and the infimum gap phenomena in optimization and optimal control with state constraints.

This book presents the XXII Congress of APDIO – IO 2022 which is the 22nd edition of the regular meeting of the Portuguese Association of Operational Research (APDIO). The APDIO regular meetings aim to gather Portuguese and international researchers, scholars and practitioners, as well as M.Sc. and Ph.D. students, working in the field of Operations Research to present and discuss their latest research works. The main theme of the XXII Congress of APDIO is OR in Turbulent Times: Adaptation and Resilience. Readers find interesting results and applications of Operational Research cutting-edge methods and techniques in the wide variety of the addressed problems. Of particular interest are the applications of, among others, linear, nonlinear and mixed-integer programing, multiobjective optimization, metaheuristics and hybrid heuristics, multicriteria decision analysis, data envelopment analysis, simulation, clustering techniques and decision support systems, in different areas such as, supply chain management, scheduling problems, production management, logistics, energy, telecommunications, finance and health.

This book constitutes the proceedings of the 19th International Conference on the Integration of Constraint Programming, Artificial Intelligence, and Operations Research, CPAIOR 2022, which was held in Los Angeles, CA, USA, in June 2022.The 28 regular papers presented were carefully reviewed and selected from a total of 60 submissions. The conference program included a Master Class on the topic "Bridging the Gap between Machine Learning and Optimization”.

This book constitutes the proceedings of the 20th International Conference on the Integration of Constraint Programming, Artificial Intelligence, and Operations Research, CPAIOR 2022, held in Nice, France, during May 29–June 1, 2023. The 26 full papers and the 6 short papers presented in this book were carefully reviewed and selected from a total of 71 submissions. The content of the papers present new techniques or new applications, and provide an opportunity for researchers in one area to learn about techniques in the others. Besides they give researchers the opportunity to show how the integration of techniques from different fields can lead to interesting results on large and complex problems.