Publisher Summary The past few years have seen enormous progress in the performance of
Boolean satisfiability (SAT) solvers. Despite the worst-case exponential run time of all known …

Networks have grown increasingly complicated. Violations of intended policies can
compromise network availability and network reliability. Network operators need to ensure …

Handbook of Knowledge Representation describes the essential foundations of Knowledge
Representation, which lies at the core of Artificial Intelligence (AI). The book provides an up …

Deep learning has transformed the way we think of software and what it can do. But deep
neural networks are fragile and their behaviors are often surprising. In many settings, we …

Automated, data-driven construction and evaluation of scientific models and theories is a
long-standing challenge in artificial intelligence. We present a framework for algorithmically …

Algebraic Cryptanalysis bridges the gap between a course in cryptography, and being able
to read the cryptanalytic literature. This book is divided into three parts: Part One covers the …

Optimizations in a traditional compiler are applied sequentially, with each optimization
destructively modifying the program to produce a transformed program that is then passed to …

Boolean Satisfiability (SAT) has seen many successful applications in various fields such as
Electronic Design Automation and Artificial Intelligence. However, in some cases, it may be …

Software Product Lines (SPL) are difficult to validate due to combinatorics induced by
variability across their features. This leads to combinatorial explosion of the number of …

Abstract Model counting, or counting the number of solutions of a propositional formula,
generalizes SAT and is the canonical# P-complete problem. Surprisingly, model counting is …