We give an algorithm for counting the number of max-weight solutions to a 2SAT formula, and improve the bound on its running time to $O(1.2377^n)$. The main source of the improvement is a refinement of the method of analysis, where we extend the concept of compound (piecewise linear) measures to multivariate measures, also allowing the optimal parameters for the measure to be found automatically. This method extension should be of independent interest
We present a fast an extensible algorithm for computing upper and lower bounds on the number of solu...
Abstract. Maximum Satisfiability (MaxSAT) is a well-known op-timization version of Propositional Sat...
AbstractWe present a novel method for exactly solving (in fact, counting solutions to) general const...
We give an algorithm for counting the number of max-weight solutions to a 2SAT formula, and improve ...
Abstract. An algorithm is presented for counting the number of maximum weight satisfying assignments...
AbstractWe here present algorithms for counting models and max-weight models for 2SAT and 3SAT formu...
The Maximum Satisfiability (MAXSAT) problem is an optimization version of the Satisfiability problem...
AbstractWe propose a simple probability model for MAX-2SAT instances for discussing the average-case...
We study three new techniques which will speed up the branch-and-bound algorithm for the MAX-2-SAT ...
We present and implement a Weighted Partial MaxSAT solver based on successive calls to a SAT solver....
Max-2SAT-CC is the Max-2SAT problem with the additional cardinality constraint that the value one m...
We introduce the problem Max#SAT, an extension of model counting (#SAT). Given a formula over sets o...
Abstract. This paper presents several ways to compute lower and upper bounds for MaxSAT based on cal...
Abstract. We present two new branch and bound weighted Max-SAT solvers (Lazy and Lazy ⋆ ) which inco...
We present and implement a Weighted Partial MaxSAT solver based on successive calls to a SAT solver....
We present a fast an extensible algorithm for computing upper and lower bounds on the number of solu...
Abstract. Maximum Satisfiability (MaxSAT) is a well-known op-timization version of Propositional Sat...
AbstractWe present a novel method for exactly solving (in fact, counting solutions to) general const...
We give an algorithm for counting the number of max-weight solutions to a 2SAT formula, and improve ...
Abstract. An algorithm is presented for counting the number of maximum weight satisfying assignments...
AbstractWe here present algorithms for counting models and max-weight models for 2SAT and 3SAT formu...
The Maximum Satisfiability (MAXSAT) problem is an optimization version of the Satisfiability problem...
AbstractWe propose a simple probability model for MAX-2SAT instances for discussing the average-case...
We study three new techniques which will speed up the branch-and-bound algorithm for the MAX-2-SAT ...
We present and implement a Weighted Partial MaxSAT solver based on successive calls to a SAT solver....
Max-2SAT-CC is the Max-2SAT problem with the additional cardinality constraint that the value one m...
We introduce the problem Max#SAT, an extension of model counting (#SAT). Given a formula over sets o...
Abstract. This paper presents several ways to compute lower and upper bounds for MaxSAT based on cal...
Abstract. We present two new branch and bound weighted Max-SAT solvers (Lazy and Lazy ⋆ ) which inco...
We present and implement a Weighted Partial MaxSAT solver based on successive calls to a SAT solver....
We present a fast an extensible algorithm for computing upper and lower bounds on the number of solu...
Abstract. Maximum Satisfiability (MaxSAT) is a well-known op-timization version of Propositional Sat...
AbstractWe present a novel method for exactly solving (in fact, counting solutions to) general const...
DOI
Add to ORKG