Exploiting symmetries within constraint satisfaction search

DOI10.1016/S0004-3702(01)00104-7zbMath0971.68144MaRDI QIDQ5941314

Carme Torras, Pedro Meseguer

Publication date: 20 August 2001

Published in: Artificial Intelligence (Search for Journal in Brave)

zbMATH Keywords

symmetryheuristicsconstraint satisfactionnogoods

Mathematics Subject Classification ID

Searching and sorting (68P10) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items

Symmetry breaking constraints for value symmetries in constraint satisfaction ⋮ Symmetry definitions for constraint satisfaction problems ⋮ \textsc{Conjure}: automatic generation of constraint models from problem specifications ⋮ Automatically improving constraint models in Savile Row ⋮ The Relation Between Complete and Incomplete Search ⋮ Variable symmetry breaking in numerical constraint problems ⋮ Symmetry breaking revisited ⋮ Dynamic structural symmetry breaking for constraint satisfaction problems ⋮ Constraints for symmetry breaking in graph representation ⋮ Memetic collaborative approaches for finding balanced incomplete block designs ⋮ Symmetries, almost symmetries, and lazy clause generation

Cites Work

• Algorithmic Techniques for the Generation and Analysis of Strongly Regular Graphs and other Combinatorial Configurations
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Exploiting symmetries within constraint satisfaction search