The University of Southampton
University of Southampton Institutional Repository

Symmetry breaking for maximum satisfiability

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
University of Southampton
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
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 Southampton. University of Southampton 12pp.

Record type: Monograph (Project Report)

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-corr08a.pdf - Other
Download (95kB)

More information

Published date: 3 April 2008
Additional Information: ArXiv Report arXiv:0804.0599
Organisations: Electronics & Computer Science

Identifiers

Local EPrints ID: 265390
URI: https://eprints.soton.ac.uk/id/eprint/265390
PURE UUID: 2c23ef31-58ac-4db0-b2ce-b0c9c0037aa1

Catalogue record

Date deposited: 03 Apr 2008 18:41
Last modified: 28 Nov 2019 17:31

Export record

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

Atom RSS 1.0 RSS 2.0

Contact ePrints Soton: eprints@soton.ac.uk

ePrints Soton supports OAI 2.0 with a base URL of https://eprints.soton.ac.uk/cgi/oai2

This repository has been built using EPrints software, developed at the University of Southampton, but available to everyone to use.

We use cookies to ensure that we give you the best experience on our website. If you continue without changing your settings, we will assume that you are happy to receive cookies on the University of Southampton website.

×