The enumeration of finite models of first order logic formulas is an indispensable tool in computational algebra. The task is hindered by the existence of isomorphic models, which are of no use to mathematicians and therefore are typically filtered out a posteriori. This paper proposes a divide-and-conquer approach to speed up and parallelize this process. We design a series of invariant properties that enable us to partition existing models into mutually non-isomorphic blocks, which are then tackled separately. The presented approach is integrated into the popular tool Mace4, where it shows tremendous speed-ups for a variety of algebraic structures
Recent years have seen considerable interest in procedures for computing finite models of first-orde...
The isomorphisms holding in all models of the simply typed lambda calculus with surjective and termi...
We solve the isomorphism problem for certain classes of unary automatic structures: unary automatic ...
This senior project focuses on a collection of algebras that arise in knot theory called quandles. I...
We describe a new method for finding finite models of unsorted first-order logic clause sets. The me...
AbstractWe present a new deterministic algorithm to test constructively for isomorphism between two ...
Abstract We consider the complexity of the isomorphism relation on countable first-order structures ...
Automatic structures are finitely presented structures where the universe and all relations can be r...
We present a new algorithm to decide isomorphism between finite graded algebras. For a broad class o...
AbstractWe solve the isomorphism problem for certain classes of unary automatic structures: unary au...
We implement a MACE-style method for finding finite models in unsorted classical first-order logic. ...
In this paper we combine many of the standard and more recent algebraic techniques for testing isomo...
In this paper, we show how isomorphism checking can be used as an effective technique for symmetry r...
This work considers the MACE-style approach to finite model finding for (multi-sorted) first-order l...
Abstract. Recent years have seen considerable interest in procedures for com-puting finite models of...
Recent years have seen considerable interest in procedures for computing finite models of first-orde...
The isomorphisms holding in all models of the simply typed lambda calculus with surjective and termi...
We solve the isomorphism problem for certain classes of unary automatic structures: unary automatic ...
This senior project focuses on a collection of algebras that arise in knot theory called quandles. I...
We describe a new method for finding finite models of unsorted first-order logic clause sets. The me...
AbstractWe present a new deterministic algorithm to test constructively for isomorphism between two ...
Abstract We consider the complexity of the isomorphism relation on countable first-order structures ...
Automatic structures are finitely presented structures where the universe and all relations can be r...
We present a new algorithm to decide isomorphism between finite graded algebras. For a broad class o...
AbstractWe solve the isomorphism problem for certain classes of unary automatic structures: unary au...
We implement a MACE-style method for finding finite models in unsorted classical first-order logic. ...
In this paper we combine many of the standard and more recent algebraic techniques for testing isomo...
In this paper, we show how isomorphism checking can be used as an effective technique for symmetry r...
This work considers the MACE-style approach to finite model finding for (multi-sorted) first-order l...
Abstract. Recent years have seen considerable interest in procedures for com-puting finite models of...
Recent years have seen considerable interest in procedures for computing finite models of first-orde...
The isomorphisms holding in all models of the simply typed lambda calculus with surjective and termi...
We solve the isomorphism problem for certain classes of unary automatic structures: unary automatic ...