Group theory is the mathematical study of symmetry. This paper presents a CP method of efficiently solving group-theoretic problems, where each of the solutions is an element of a group. This method allows us to answer questions in group theory which are computationally unfeasible with traditional CP techniques.</p
Constraint Satisfaction Problems (CSPs) are often highly symmetric. Symmetries can give rise to redu...
We introduce groupoids – generalisations of groups in which not all pairs of elements may be multipl...
Constraint Satisfaction Problems (CSPs) are often highly symmetric. Symmetries can give rise to redu...
Group theory is the mathematical study of symmetry. This paper presents a CP method of efficiently s...
We describe a novel algorithm that statically breaks symmetry in CSPs by using computational group t...
We describe a novel algorithm that statically breaks symmetry in CSPs by using computational group t...
International audienceOne important issue of automated theorem proving is the complexity of the infe...
Abstract Symmetry-breaking formulas, introduced by Crawford, Ginsberg, Luks and Roy, are supplementa...
Symmetry reduction techniques aim to combat the state-space explosion problem for model checking by ...
18 pagesSymmetries occur naturally in CSP or SAT problems and are not very difficult to discover, bu...
Symmetry breaking has been shown to be an important method to speed up the search in constraint sa...
The presence of symmetry in constraint satisfaction problems can cause a great deal of wasted search...
The presence of symmetry in constraint satisfaction problems can cause a great deal of wasted search...
Every process in physics is governed by selection rules that are the consequence of symmetry require...
Constraint Satisfaction Problems (CSPs) are often highly symmetric. Symmetries can give rise to redu...
Constraint Satisfaction Problems (CSPs) are often highly symmetric. Symmetries can give rise to redu...
We introduce groupoids – generalisations of groups in which not all pairs of elements may be multipl...
Constraint Satisfaction Problems (CSPs) are often highly symmetric. Symmetries can give rise to redu...
Group theory is the mathematical study of symmetry. This paper presents a CP method of efficiently s...
We describe a novel algorithm that statically breaks symmetry in CSPs by using computational group t...
We describe a novel algorithm that statically breaks symmetry in CSPs by using computational group t...
International audienceOne important issue of automated theorem proving is the complexity of the infe...
Abstract Symmetry-breaking formulas, introduced by Crawford, Ginsberg, Luks and Roy, are supplementa...
Symmetry reduction techniques aim to combat the state-space explosion problem for model checking by ...
18 pagesSymmetries occur naturally in CSP or SAT problems and are not very difficult to discover, bu...
Symmetry breaking has been shown to be an important method to speed up the search in constraint sa...
The presence of symmetry in constraint satisfaction problems can cause a great deal of wasted search...
The presence of symmetry in constraint satisfaction problems can cause a great deal of wasted search...
Every process in physics is governed by selection rules that are the consequence of symmetry require...
Constraint Satisfaction Problems (CSPs) are often highly symmetric. Symmetries can give rise to redu...
Constraint Satisfaction Problems (CSPs) are often highly symmetric. Symmetries can give rise to redu...
We introduce groupoids – generalisations of groups in which not all pairs of elements may be multipl...
Constraint Satisfaction Problems (CSPs) are often highly symmetric. Symmetries can give rise to redu...
DOI
Add to ORKG