Michael Codish — accepted AI-conference papers

2025

Complete Symmetry Breaking for Finite Models

Marek Dančo, Mikoláš Janota, Michael Codish, João Jorge Araújo

AAAI 2025technical

This paper introduces a SAT-based technique that calculates a compact and complete symmetry-break for finite model finding, with the focus on structures with a single binary operation (magmas). Classes of algebraic structures are typically described as first-order logic formulas and the concrete alg…

Cited by 0 Source ↗PDF ↗Scholar ↗

2024

SAT-Based Techniques for Lexicographically Smallest Finite Models

Mikoláš Janota, Choiwah Chow, João Araújo, Michael Codish, Petr Vojtěchovský

AAAI 2024technical

This paper proposes SAT-based techniques to calculate a specific normal form of a given finite mathematical structure (model). The normal form is obtained by permuting the domain elements so that the representation of the structure is lexicographically smallest possible. Such a normal form is of int…

Cited by 3 Source ↗PDF ↗Scholar ↗