Now showing items 1-4 of 4

    • A Max-SAT Solver with Lazy Data Structures 

      Alsinet, Teresa; Manyà Serres, Felip; Planes Cid, Jordi (Springer Verlag, 2004)
      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 ...
    • 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 ...
    • Exact Max-SAT solvers for over-constrained problems 

      Argelich Romà, Josep; Manyà Serres, Felip (Springer Verlag, 2006)
      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 ...
    • The first and second Max-SAT evaluations 

      Argelich Romà, Josep; Li, Chu-Min; Manyà Serres, Felip; Planes Cid, Jordi (IOS Press, 2008)
      We describe the organization and report on the results of the First and Second Max-SAT Evaluations, which were organized as affiliated events of the 2006 and 2007 editions of the International Conference on Theory and ...