4 papers
SAT-Based Techniques for Lexicographically Smallest Finite Models
Mikoláš Janota, Choiwah Chow, João Araújo +2
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 e…
Cube-based Isomorph-free Finite Model Finding
Choiwah Chow, Mikoláš Janota, João Araújo
Complete enumeration of finite models of first-order logic (FOL) formulas is pivotal to universal algebra, which studies and catalogs algebraic structures. Efficient finite model e…
CREAM: a Package to Compute [Auto, Endo, Iso, Mono, Epi]-morphisms, Congruences, Divisors and More for Algebras of Type
João Araújo, Rui Barradas Pereira, Wolfram Bentz +4
The CREAM GAP package computes automorphisms, congruences, endomorphisms and subalgebras of algebras with an arbitrary number of binary and unary operations; it also decides if bet…
Boosting Isomorphic Model Filtering with Invariants
João Araújo, Choiwah Chow, Mikoláš Janota
The enumeration of finite models is very important to the working discrete mathematician (algebra, graph theory, etc) and hence the search for effective methods to do this task is…