Constraint symmetries
Constraint Symmetries have been suggested as an appropriate subgroup of solution symmetries easier to be more easily found that the complete group of symmetries. The concept is analyzed, and it becomes clear that a knowledge of the problem as deep as for finding the whole group is required to find t...
| Autor: | |
|---|---|
| Tipo de recurso: | informe técnico |
| Fecha de publicación: | 2017 |
| País: | España |
| Institución: | Universitat Politècnica de Catalunya (UPC) |
| Repositorio: | UPCommons. Portal del coneixement obert de la UPC |
| Idioma: | inglés |
| OAI Identifier: | oai:upcommons.upc.edu:2117/112886 |
| Acceso en línea: | https://hdl.handle.net/2117/112886 |
| Access Level: | acceso abierto |
| Palabra clave: | Artificial intelligence Mathematical programming artificial intelligence mathematical programming Symmetries Constraint Satisfaction Numerical Constraint Satisfaction Symmetry Detection Problem solving Intel·ligència artificial Programació (Matemàtica) Àrees temàtiques de la UPC::Informàtica::Robòtica |
| Sumario: | Constraint Symmetries have been suggested as an appropriate subgroup of solution symmetries easier to be more easily found that the complete group of symmetries. The concept is analyzed, and it becomes clear that a knowledge of the problem as deep as for finding the whole group is required to find that subset. Indeed, we show that the Microstructure Complement in most cases only find an small fraction of the subgroup of Constraint Symmetries. Moreover, not all the symmetries it finds are truly Constraint Symmetries. We show also that in the context of point symmetries (as opposed to literal symmetries), the subgroup of Constraint Symmetries coincide with the whole solution symmetry group. |
|---|