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 …

An integer linear program (ILP) is symmetric if its variables can be permuted without
changing the structure of the problem. Areas where symmetric ILPs arise range from applied …

We report the current state of the graph isomorphism problem from the practical point of
view. After describing the general principles of the refinement-individualization paradigm …

Constraint programming is a powerful paradigm for solving combinatorial search problems
that draws on a wide range of techniques from artificial intelligence, computer science …

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 …

Reconfigurable Computing marks a revolutionary and hot topic that bridges the gap
between the separate worlds of hardware and software design—the key feature of …

Mixed integer programming has become a very powerful tool for modeling and solving real-
world planning and scheduling problems, with the breadth of applications appearing to be …

The problem of canonically labeling a graph is studied. Within the general framework of
backtracking algorithms based on individualization and refinement, data structures …

We study the relationship between the Quantum Approximate Optimization Algorithm
(QAOA) and the underlying symmetries of the objective function to be optimized. Our …

1 Introduction. nauty (no automorphisms, yes?) is a set of procedures for determining the
automorphism group of a vertex-coloured graph. It provides this information in the form of a …