Generic SBDD using computational group theory

DOI10.1007/B13743MaRDI QIDQ5897206zbMATH OpenOpenAlexFDO

Authors Warwick Harvey, Tom Kelsey, Steve Linton, Ian P. Gent

Publication date 2 March 2010

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/b13743

Mathematics Subject Classification ID

Other programming paradigms (object-oriented, sequential, concurrent, automatic, etc.) (68N19) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Recommendations

• Symmetry breaking revisited
• Dominance breaking constraints
• Static and dynamic structural symmetry breaking
• Artificial Intelligence and Symbolic Computation
• Symmetries of symmetry breaking constraints

Cited in

(7)

• \texttt{SymChaff}: Exploiting symmetry in a structure-aware satisfiability solver
• Towards breaking more composition symmetries in partial symmetry breaking
• Symmetry breaking revisited
• Lightweight dynamic symmetry breaking
• A Novel Approach For Detecting Symmetries in CSP Models
• Symmetry breaking constraints for value symmetries in constraint satisfaction
• Symmetry definitions for constraint satisfaction problems

Describes a project that uses

Uses Software

• GAP

This page was built for publication: Generic SBDD using computational group theory

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