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?"

A collection of papers on various theoretical and practical aspects of SAT solving. It is suitable for students and researchers.

This book provides a significant step towards bridging the areas of Boolean satisfiability and constraint satisfaction by answering the question why SAT-solvers are efficient on certain classes of CSP instances which are hard to solve for standard constraint solvers. The author also gives theoretical reasons for choosing a particular SAT encoding for several important classes of CSP instances. Boolean satisfiability and constraint satisfaction emerged independently as new fields of computer science, and different solving techniques have become standard for problem solving in the two areas. Even though any propositional formula (SAT) can be viewed as an instance of the general constraint satisfaction problem (CSP), the implications of this connection have only been studied in the last few years. The book will be useful for researchers and graduate students in artificial intelligence and theoretical computer science.

This book constitutes the refereed conference proceedings of the 22nd International Conference on Principles and Practice of Constraint Programming, CP 2016, held in Toulouse, France, in September 2016. The 63 revised regular papers presented together with 4 short papers and the abstracts of 4 invited talks were carefully reviewed and selected from 157 submissions. The scope of CP 2016 includes all aspects of computing with constraints, including theory, algorithms, environments, languages, models, systems, and applications such as decision making, resource allocation, scheduling, configuration, and planning. The papers are grouped into the following tracks: technical track; application track; computational sustainability track; CP and biology track; music track; preference, social choice, and optimization track; testing and verification track; and journal-first and sister conferences track.

This book focuses on the core areas of computing and their applications in the real world. Presenting papers from the Computing Conference 2020 covers a diverse range of research areas, describing various detailed techniques that have been developed and implemented. The Computing Conference 2020, which provided a venue for academic and industry practitioners to share new ideas and development experiences, attracted a total of 514 submissions from pioneering academic researchers, scientists, industrial engineers and students from around the globe. Following a double-blind, peer-review process, 160 papers (including 15 poster papers) were selected to be included in these proceedings. Featuring state-of-the-art intelligent methods and techniques for solving real-world problems, the book is a valuable resource and will inspire further research and technological improvements in this important area.

LC copy bound in 2 v.: v. 1, p. 1-509; v. 2, p. [509]-1153.

This book constitutes the refereed proceedings of the 15th International Baltic Conference on Digital Business and Intelligent Systems, Baltic DB&IS 2022, held in Riga, Latvia, in July 2022. The 16 revised full papers and 1 short paper presented were carefully reviewed and selected from 42 submissions. The papers are centered around topics like architectures and quality of information systems, artificial intelligence in information systems, data and knowledge engineering, enterprise and information systems engineering, security of information systems.

This Festschrift, dedicated to Reiner Hähnle on the occasion of his 60th birthday, contains papers written by many of his closest collaborators. After positions at Karlsruhe Institute of Technology and Chalmers University of Technology, since 2011 Reiner has been the chaired professor of Software Engineering at Technische Universität Darmstadt, where his team focuses on the formal verification of object-oriented software, the formal modeling and specification of highly adaptive software systems, and formal modeling and analysis in domains such as biological systems and railroad operations. His work is characterized by achievements in theory and in practical implementations, significant collaborations include the KeY project and the development of the ABS language. He has served as chair and editor of important related academic conferences, and coauthored almost 200 academic publications. The contributions in this volume reflect Reiner’s main research focus: formal methods, in particular applied to software verification.

This open access book constitutes the proceedings of the 29th European Symposium on Programming, ESOP 2020, which was planned to take place in Dublin, Ireland, in April 2020, as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2020. The actual ETAPS 2020 meeting was postponed due to the Corona pandemic. The papers deal with fundamental issues in the specification, design, analysis, and implementation of programming languages and systems.

This book constitutes the refereed proceedings of the 8th International Conference on ICT in Education, Research, and Industrial Applications, held in Kherson, Ukraine, in June 2012. The 14 revised full papers were carefully reviewed and selected from 70 submissions. This book begins with an invited contribution presenting the substance of one of ICTERI 2012 invited talks. The chapter deals with the issues of abstraction and verification of properties in real-time Java programs. The rest of the volume is structured in four topical parts: ICT Frameworks, Infrastructures, Integration, and Deployment; Formal Logic and Knowledge-Based Frameworks; ICT-Based Systems Modeling, Specification, and Verification: ICT in Teaching and Learning.