A Max-SAT Solver with Lazy Data Structures

Alsinet, Teresa; Manyà Serres, Felip; Planes Cid, Jordi

doi:https://doi.org/10.1007/978-3-540-30498-2_34

View/Open

006637.pdf (152.7Kb)
Sol·licita una còpia

Issue date

2004

Author

Alsinet, Teresa

Manyà Serres, Felip

Planes Cid, Jordi

Suggested citation

Alsinet, Teresa; Manyà Serres, Felip; Planes Cid, Jordi; . (2004) . A Max-SAT Solver with Lazy Data Structures. Lecture Notes in Computer Science, 2004, vol. 3315, p. 334-342. https://doi.org/10.1007/978-3-540-30498-2_34.

Abstract

We present a new branch and bound algorithm for Max-SAT which incorporates original lazy data structures, a new variable selection heuristics and a lower bound of better quality. We provide experimental evidence that our solver outperforms some of the best performing Max- SAT solvers on a wide range of instances.

URI

http://hdl.handle.net/10459.1/57428

DOI

https://doi.org/10.1007/978-3-540-30498-2_34

Is part of

Lecture Notes in Computer Science, 2004, vol. 3315, p. 334-342

Collections

Publicacions de projectes de recerca del Plan Nacional [2684]
Articles publicats (Informàtica i Enginyeria Industrial) [935]
Grup de Recerca en Energia i Intel·ligència Artificial (GREiA) (INSPIRES) [445]