Symmetries, almost symmetries, and lazy clause generation
From MaRDI portal
Publication:2342601
DOI10.1007/s10601-014-9163-9zbMath1316.90045OpenAlexW2087983512MaRDI QIDQ2342601
Peter J. Stuckey, Christopher Mears, Geoffrey Chu, Maria Garcia de la Banda
Publication date: 29 April 2015
Published in: Constraints (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/11343/282666
Related Items (3)
An adaptive prefix-assignment technique for symmetry reduction ⋮ CP methods for scheduling and routing with~time-dependent task costs ⋮ Symmetries, almost symmetries, and lazy clause generation
Uses Software
Cites Work
- Short proofs for tricky formulas
- Symmetry definitions for constraint satisfaction problems
- On implementing symmetry detection
- Symmetries, almost symmetries, and lazy clause generation
- Breaking Symmetry of Interchangeable Variables and Values
- Propagation = Lazy Clause Generation
- Conditional Symmetry Breaking
- A Novel Approach For Detecting Symmetries in CSP Models
- Principles and Practice of Constraint Programming – CP 2003
- Recent Advances in Constraints
- Exploiting symmetries within constraint satisfaction search
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Symmetries, almost symmetries, and lazy clause generation
