On implementing symmetry detection

DOI10.1007/s10601-008-9057-9zbMath1181.68177OpenAlexW1968235060MaRDI QIDQ1037637

Maria Garcia de la Banda, Mark G. Wallace, Christopher Mears

Publication date: 16 November 2009

Published in: Constraints (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10601-008-9057-9

zbMATH Keywords

graph automorphismautomatic symmetry detection

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items

Symmetry in Mathematical Programming ⋮ \textsc{Conjure}: automatic generation of constraint models from problem specifications ⋮ Automatic generation of dominance breaking nogoods for a class of constraint optimization problems ⋮ A Novel Approach For Detecting Symmetries in CSP Models ⋮ Compiling CP subproblems to MDDs and d-DNNFs ⋮ Symmetries, almost symmetries, and lazy clause generation ⋮ Dominance breaking constraints ⋮ A method for detecting symmetries in constraint models and its generalisation

Uses Software

• CSPLib

Cites Work

• Symmetry Definitions for Constraint Satisfaction Problems
• Automatic Detection of Variable and Value Symmetries
• Breaking All Value Symmetries in Surjection Problems
• Recent Advances in Constraints
• Unnamed Item
• Unnamed Item

This page was built for publication: On implementing symmetry detection