Symmetry breaking for maximum satisfiability
Symmetry breaking for maximum satisfiability
Symmetries are intrinsic to many combinatorial problems including Boolean Satisfiability (SAT) and Constraint Programming (CP). In SAT, the identification of symmetry breaking predicates (SBPs) is a well-known, often effective, technique for solving hard problems. The identification of SBPs in SAT has been the subject of significant improvements in recent years, resulting in more compact SBPs and more effective algorithms. The identification of SBPs has also been applied to pseudo-Boolean (PB) constraints, showing that symmetry breaking can also be an effective technique for PB constraints. This paper extends further the application of SBPs, and shows that SBPs can be identified and used in Maximum Satisfiability (MaxSAT), as well as in its most well-known variants, including partial MaxSAT, weighted MaxSAT and weighted partial MaxSAT. As with SAT and PB, symmetry breaking predicates for MaxSAT and variants are shown to be effective for a representative number of problem domains, allowing solving problem instances that current state of the art MaxSAT solvers could not otherwise solve.
Marques-Silva, Joao
f992f61f-cedd-4897-9f73-1a3ac7ebb35c
Lynce, Ines
2325eb92-000d-4de6-8e5f-1a35f91e7c45
Manquinho, Vasco
b79e4843-84f2-4119-8cd9-ebffe33243ea
November 2008
Marques-Silva, Joao
f992f61f-cedd-4897-9f73-1a3ac7ebb35c
Lynce, Ines
2325eb92-000d-4de6-8e5f-1a35f91e7c45
Manquinho, Vasco
b79e4843-84f2-4119-8cd9-ebffe33243ea
Marques-Silva, Joao, Lynce, Ines and Manquinho, Vasco
(2008)
Symmetry breaking for maximum satisfiability.
International Conference on Logic for Programming Artificial Intelligence and Reasoning, , Doha, Qatar.
22 - 27 Nov 2008.
15 pp
.
Record type:
Conference or Workshop Item
(Paper)
Abstract
Symmetries are intrinsic to many combinatorial problems including Boolean Satisfiability (SAT) and Constraint Programming (CP). In SAT, the identification of symmetry breaking predicates (SBPs) is a well-known, often effective, technique for solving hard problems. The identification of SBPs in SAT has been the subject of significant improvements in recent years, resulting in more compact SBPs and more effective algorithms. The identification of SBPs has also been applied to pseudo-Boolean (PB) constraints, showing that symmetry breaking can also be an effective technique for PB constraints. This paper extends further the application of SBPs, and shows that SBPs can be identified and used in Maximum Satisfiability (MaxSAT), as well as in its most well-known variants, including partial MaxSAT, weighted MaxSAT and weighted partial MaxSAT. As with SAT and PB, symmetry breaking predicates for MaxSAT and variants are shown to be effective for a representative number of problem domains, allowing solving problem instances that current state of the art MaxSAT solvers could not otherwise solve.
Text
jpms-lpar08.pdf
- Other
More information
Published date: November 2008
Venue - Dates:
International Conference on Logic for Programming Artificial Intelligence and Reasoning, , Doha, Qatar, 2008-11-22 - 2008-11-27
Organisations:
Electronics & Computer Science
Identifiers
Local EPrints ID: 266608
URI: http://eprints.soton.ac.uk/id/eprint/266608
PURE UUID: 2aaf142e-c04a-47e2-8ba4-a19b4b69c265
Catalogue record
Date deposited: 29 Aug 2008 21:07
Last modified: 14 Mar 2024 08:32
Export record
Contributors
Author:
Joao Marques-Silva
Author:
Ines Lynce
Author:
Vasco Manquinho
Download statistics
Downloads from ePrints over the past year. Other digital versions may also be available to download e.g. from the publisher's website.
View more statistics