Universitat de Lleida
    • English
    • català
    • español
  • English 
    • English
    • català
    • español
  • Login
Repositori Obert UdL
View Item 
  •   Home
  • Recerca
  • Informàtica i Enginyeria Industrial
  • Articles publicats (Informàtica i Enginyeria Industrial)
  • View Item
  •   Home
  • Recerca
  • Informàtica i Enginyeria Industrial
  • Articles publicats (Informàtica i Enginyeria Industrial)
  • View Item
JavaScript is disabled for your browser. Some features of this site may not work without it.

A Max-SAT Solver with Lazy Data Structures

Thumbnail
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.
Impact


Web of Science logo    citations in Web of Science

Scopus logo    citations in Scopus

Google Scholar logo  Google Scholar
Share
Export to Mendeley
Metadata
Show full item record
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
European research projects
Collections
  • Grup de Recerca en Energia i Intel·ligència Artificial (GREiA) (INSPIRES) [387]
  • Publicacions de projectes de recerca del Plan Nacional [2273]
  • Articles publicats (Informàtica i Enginyeria Industrial) [784]

Related items

Showing items related by title, author, creator and subject.

  • Exploiting Unit Propagation to Compute Lower Bounds in Branch and Bound Max-SAT Solvers 

    Li, Chu-Min; Manyà Serres, Felip; Planes Cid, Jordi (Springer Verlag, 2005)
    One of the main differences between complete SAT solvers and exact Max-SAT solvers is that the former make an intensive use of unit propagation at each node of the proof tree while the latter, in order to ensure optimality, ...
  • An efficient solver for weighted Max-SAT 

    Alsinet, Teresa; Manyà Serres, Felip; Planes Cid, Jordi (Springer, 2008)
    We present a new branch and bound algorithm for weighted Max-SAT, called Lazy which incorporates original data structures and inference rules, as well as a lower bound of better quality. We provide experimental evidence ...
  • Improved Exact Solvers for Weighted Max-SAT 

    Alsinet, Teresa; Manyà Serres, Felip; Planes Cid, Jordi (Springer Verlag, 2005)
    We present two new branch and bound weighted Max-SAT solvers (Lazy and Lazy ) which incorporate original data structures and inference rules, and a lower bound of better quality

Contact Us | Send Feedback | Legal Notice
© 2021 BiD. Universitat de Lleida
Metadata subjected to 
 

 

Browse

All of the repositoryCommunities & CollectionsBy Issue DateAuthorsTitlesSubjectsThis CollectionBy Issue DateAuthorsTitlesSubjects

Statistics

View Usage Statistics

D'interès

Política institucional d'accés obertDiposita les teves publicacionsDiposita dades de recercaSuport a la recerca

Contact Us | Send Feedback | Legal Notice
© 2021 BiD. Universitat de Lleida
Metadata subjected to