Sciweavers

PPDP
2010
Springer
13 years 9 months ago
A declarative approach to robust weighted Max-SAT
The presence of uncertainty in the real world makes robustness to be a desired property of solutions to constraint satisfaction problems. Roughly speaking, a solution is robust if...
Miquel Bofill, Dídac Busquets, Mateu Villar...
JAIR
2007
132views more  JAIR 2007»
13 years 11 months ago
New Inference Rules for Max-SAT
Exact Max-SAT solvers, compared with SAT solvers, apply little inference at each node of the proof tree. Commonly used SAT inference rules like unit propagation produce a simpli...
Chu Min Li, Felip Manyà, Jordi Planes
AI
2005
Springer
13 years 11 months ago
MaxSolver: An efficient exact algorithm for (weighted) maximum satisfiability
Maximum Boolean satisfiability (max-SAT) is the optimization counterpart of Boolean satisfiability (SAT), in which a variable assignment is sought to satisfy the maximum number of...
Zhao Xing, Weixiong Zhang
JSAT
2008
83views more  JSAT 2008»
13 years 11 months ago
The First and Second Max-SAT Evaluations
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 ...
Josep Argelich, Chu Min Li, Felip Manyà, Jo...
JSAT
2008
80views more  JSAT 2008»
13 years 11 months ago
Solving Weighted Max-SAT Problems in a Reduced Search Space: A Performance Analysis
We analyze, in this work, the performance of a recently introduced weighted Max-SAT solver, Clone, in the Max-SAT evaluation 2007. Clone utilizes a novel bound computation based o...
Knot Pipatsrisawat, Akop Palyan, Mark Chavira, Art...
JAIR
2008
120views more  JAIR 2008»
13 years 11 months ago
MiniMaxSAT: An Efficient Weighted Max-SAT solver
In this paper we introduce MINIMAXSAT, a new Max-SAT solver that is built on top of MINISAT+. It incorporates the best current SAT and Max-SAT techniques. It can handle hard claus...
Federico Heras, Javier Larrosa, Albert Oliveras
AAAI
2007
14 years 1 months ago
Inference Rules for High-Order Consistency in Weighted CSP
Recently defined resolution calculi for Max-SAT and signed Max-SAT have provided a logical characterization of the solving techniques applied by Max-SAT and WCSP solvers. In this...
Carlos Ansótegui, Maria Luisa Bonet, Jordi ...
CP
2003
Springer
14 years 4 months ago
Solving Max-SAT as Weighted CSP
For the last ten years, a significant amount of work in the constraint community has been devoted to the improvement of complete methods for solving soft constraints networks. We ...
Simon de Givry, Javier Larrosa, Pedro Meseguer, Th...
AI
2003
Springer
14 years 4 months ago
Scaling and Probabilistic Smoothing: Dynamic Local Search for Unweighted MAX-SAT
Abstract. In this paper, we study the behaviour of the Scaling and Probabilistic Smoothing (SAPS) dynamic local search algorithm on the unweighted MAXSAT problem. MAX-SAT is a conc...
Dave A. D. Tompkins, Holger H. Hoos
SAT
2007
Springer
121views Hardware» more  SAT 2007»
14 years 5 months ago
MiniMaxSat: A New Weighted Max-SAT Solver
In this paper we introduce MINIMAXSAT, a new Max-SAT solver that incorporates the best SAT and Max-SAT techniques. It can handle hard clauses (clauses of mandatory satisfaction as ...
Federico Heras, Javier Larrosa, Albert Oliveras