Exploiting Symmetry in Model Expansion for Predicate and Propositional Logic KU Leuven
Many combinatorial problems exhibit symmetry, a transformational property that does not fundamentally alter the nature of a problem. For instance, renaming a set of identical trucks in a routing problem, mirroring or rotating a chessboard onto itself, or the automorphisms of an input graph give rise to symmetry. These symmetry properties often hinder an algorithm solving a combinatorial problem, as it wastefully investigates different ...