Exact Max-SAT solvers for over-constrained problems

We present a new generic problem solving approach for over-constrained problems based on Max-SAT. We first define a Boolean clausal form formalism, called soft CNF formulas, that deals with blocks of clauses instead of individual clauses, and that allows one to declare each block either as hard (i.e...

Descripción completa

Detalles Bibliográficos
Autores: Argelich Romà, Josep, Manyà Serres, Felip
Tipo de recurso: artículo
Estado:Versión aceptada para publicación
Fecha de publicación:2006
País:España
Institución:Universitat de Lleida (UdL)
Repositorio:Repositori Obert UdL
OAI Identifier:oai:repositori.udl.cat:10459.1/57408
Acceso en línea:https://doi.org/10.1007/s10732-006-7234-9
http://hdl.handle.net/10459.1/57408
Access Level:acceso abierto
Palabra clave:Soft constraints
Max-SAT
Solvers
id ES_bd4cfdb261ba978d2bf141b5b2eaeedf
oai_identifier_str oai:repositori.udl.cat:10459.1/57408
network_acronym_str ES
network_name_str España
repository_id_str
spelling Exact Max-SAT solvers for over-constrained problemsArgelich Romà, JosepManyà Serres, FelipSoft constraintsMax-SATSolversWe present a new generic problem solving approach for over-constrained problems based on Max-SAT. We first define a Boolean clausal form formalism, called soft CNF formulas, that deals with blocks of clauses instead of individual clauses, and that allows one to declare each block either as hard (i.e., must be satisfied by any solution) or soft (i.e., can be violated by some solution). We then present two Max-SAT solvers that find a truth assignment that satisfies all the hard blocks of clauses and the maximum number of soft blocks of clauses. Our solvers are branch and bound algorithms equipped with original lazy data structures, powerful inference techniques, good quality lower bounds, and original variable selection heuristics. Finally, we report an experimental investigation on a representative sample of instances (random 2-SAT, Max-CSP, graph coloring, pigeon hole and quasigroup completion) which provides experimental evidence that our approach is very competitive compared with the state-of-the-art approaches developed in the CSP and SAT communities.Research partially supported by projects TIN2004-07933-C03-03 and TIC2003-00950 funded by the Ministerio de Educacion y Ciencia. The second author is supported by a grant Ramon y Cajal.Springer Verlag2006info:eu-repo/semantics/articleinfo:eu-repo/semantics/acceptedVersionhttps://doi.org/10.1007/s10732-006-7234-9http://hdl.handle.net/10459.1/57408reponame:Repositori Obert UdL instname:Universitat de Lleida (UdL)InglésMIECI/PN2004-2007/TIN2004-07933-C03-03MICYT/PN2000-2003/TIC2003-00950Versió postprint del document publicat a https://doi.org/10.1007/s10732-006-7234-9Journal of Heuristics, 2006, vol. 12, núm. 4, p. 375-392(c) Springer Science + Business Media, LLC, 2006info:eu-repo/semantics/openAccessoai:repositori.udl.cat:10459.1/574082026-06-24T12:42:17Z
dc.title.none.fl_str_mv Exact Max-SAT solvers for over-constrained problems
title Exact Max-SAT solvers for over-constrained problems
spellingShingle Exact Max-SAT solvers for over-constrained problems
Argelich Romà, Josep
Soft constraints
Max-SAT
Solvers
title_short Exact Max-SAT solvers for over-constrained problems
title_full Exact Max-SAT solvers for over-constrained problems
title_fullStr Exact Max-SAT solvers for over-constrained problems
title_full_unstemmed Exact Max-SAT solvers for over-constrained problems
title_sort Exact Max-SAT solvers for over-constrained problems
dc.creator.none.fl_str_mv Argelich Romà, Josep
Manyà Serres, Felip
author Argelich Romà, Josep
author_facet Argelich Romà, Josep
Manyà Serres, Felip
author_role author
author2 Manyà Serres, Felip
author2_role author
dc.subject.none.fl_str_mv Soft constraints
Max-SAT
Solvers
topic Soft constraints
Max-SAT
Solvers
description We present a new generic problem solving approach for over-constrained problems based on Max-SAT. We first define a Boolean clausal form formalism, called soft CNF formulas, that deals with blocks of clauses instead of individual clauses, and that allows one to declare each block either as hard (i.e., must be satisfied by any solution) or soft (i.e., can be violated by some solution). We then present two Max-SAT solvers that find a truth assignment that satisfies all the hard blocks of clauses and the maximum number of soft blocks of clauses. Our solvers are branch and bound algorithms equipped with original lazy data structures, powerful inference techniques, good quality lower bounds, and original variable selection heuristics. Finally, we report an experimental investigation on a representative sample of instances (random 2-SAT, Max-CSP, graph coloring, pigeon hole and quasigroup completion) which provides experimental evidence that our approach is very competitive compared with the state-of-the-art approaches developed in the CSP and SAT communities.
publishDate 2006
dc.date.none.fl_str_mv 2006
dc.type.none.fl_str_mv info:eu-repo/semantics/article
info:eu-repo/semantics/acceptedVersion
format article
status_str acceptedVersion
dc.identifier.none.fl_str_mv https://doi.org/10.1007/s10732-006-7234-9
http://hdl.handle.net/10459.1/57408
url https://doi.org/10.1007/s10732-006-7234-9
http://hdl.handle.net/10459.1/57408
dc.language.none.fl_str_mv Inglés
language_invalid_str_mv Inglés
dc.relation.none.fl_str_mv MIECI/PN2004-2007/TIN2004-07933-C03-03
MICYT/PN2000-2003/TIC2003-00950
Versió postprint del document publicat a https://doi.org/10.1007/s10732-006-7234-9
Journal of Heuristics, 2006, vol. 12, núm. 4, p. 375-392
dc.rights.none.fl_str_mv (c) Springer Science + Business Media, LLC, 2006
info:eu-repo/semantics/openAccess
rights_invalid_str_mv (c) Springer Science + Business Media, LLC, 2006
eu_rights_str_mv openAccess
dc.publisher.none.fl_str_mv Springer Verlag
publisher.none.fl_str_mv Springer Verlag
dc.source.none.fl_str_mv reponame:Repositori Obert UdL
instname:Universitat de Lleida (UdL)
instname_str Universitat de Lleida (UdL)
reponame_str Repositori Obert UdL
collection Repositori Obert UdL
repository.name.fl_str_mv
repository.mail.fl_str_mv
_version_ 1869418189531643904
score 15,811543

Similares en LA Referencia