Minimal ordering constraints for some families of variable symmetries

DOI10.1007/S10472-010-9174-1zbMATH Open1205.68375OpenAlexW1978953840MaRDI QIDQ976995FDOQ976995

Chris Jefferson, Andrew Grayland, Colva M. Roney-Dougal, Ian Miguel

Publication date: 16 June 2010

Published in: Annals of Mathematics and Artificial Intelligence (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10472-010-9174-1

Recommendations

• Principles and Practice of Constraint Programming – CP 2003
• Breaking Symmetry of Interchangeable Variables and Values
• The complexity of symmetry-breaking formulas
• Combining Symmetry Breaking and Global Constraints
• Breaking All Value Symmetries in Surjection Problems

zbMATH Keywords

symmetryconstraint programmingconstraint modelling

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Finite automorphism groups of algebraic, geometric, or combinatorial structures (20B25)

Cites Work

• Title not available (Why is that?)
• Symmetry Definitions for Constraint Satisfaction Problems

Cited In (2)

• Disjoint direct product decompositions of permutation groups
• An adaptive prefix-assignment technique for symmetry reduction

This page was built for publication: Minimal ordering constraints for some families of variable symmetries

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q976995)