Add to ORKGThe Davis-Putnam enumeration method (DP) recently evolved to one of the fastest known methods for solving the clausal satisfiability problem of propositional calculus. We present a generalization of the DP-procedure for linear pseudo-Boolean (or 0-1) inequalities and make use of the achievements for DP. We extend the method to optimize a linear pseudo-Boolean objective function w.r.t. a set of linear pseudoBoolean inequalities. The algorithm compares well with traditional linear programming based methods on a variety of standard 0-1 integer programming benchmarks
AbstractThe best-known algorithm for the satisfiability problem in the case of propositional formula...
This is the first of three planned papers describing zap, a satisfiability engine that substantially...
In the first part of this paper we survey a number of algorithms for solving the propositional satis...
The Davis-Putnam enumeration method (DP) has recently become one of the fastest known methods for so...
Linear Pseudo-Boolean (LPB) constraints denote inequalities between arithmetic sums of weighted Bool...
Linear Pseudo-Boolean (LPB) constraints denote inequalities between arithmetic sums of weighted Bool...
Pseudo-Boolean problems are a generalization of Boolean problems and combine Boolean algebra with ar...
Pseudo-Boolean problems are a generalization of Boolean problems and combine Boolean algebra with ar...
Pseudo-Boolean problems generalize SAT problems by allowing linear constraints and a linear objectiv...
Pseudo-Boolean problems generalize SAT problems by allowing linear constraints and a linear objectiv...
Pseudo-Boolean problems lie on the border between satisfiability problems, constraint programming, a...
AbstractThis survey examines the state of the art of a variety of problems related to pseudo-Boolean...
Pseudo-Boolean problems are a generalization of Boolean problems and combine Boolean algebra with ...
Abstract. Recently, several unsatisfiability-based algorithms have been proposed for Maximum Satisfi...
Boolean constraints play an important role in various constraint logic programming languages. In thi...
AbstractThe best-known algorithm for the satisfiability problem in the case of propositional formula...
This is the first of three planned papers describing zap, a satisfiability engine that substantially...
In the first part of this paper we survey a number of algorithms for solving the propositional satis...
The Davis-Putnam enumeration method (DP) has recently become one of the fastest known methods for so...
Linear Pseudo-Boolean (LPB) constraints denote inequalities between arithmetic sums of weighted Bool...
Linear Pseudo-Boolean (LPB) constraints denote inequalities between arithmetic sums of weighted Bool...
Pseudo-Boolean problems are a generalization of Boolean problems and combine Boolean algebra with ar...
Pseudo-Boolean problems are a generalization of Boolean problems and combine Boolean algebra with ar...
Pseudo-Boolean problems generalize SAT problems by allowing linear constraints and a linear objectiv...
Pseudo-Boolean problems generalize SAT problems by allowing linear constraints and a linear objectiv...
Pseudo-Boolean problems lie on the border between satisfiability problems, constraint programming, a...
AbstractThis survey examines the state of the art of a variety of problems related to pseudo-Boolean...
Pseudo-Boolean problems are a generalization of Boolean problems and combine Boolean algebra with ...
Abstract. Recently, several unsatisfiability-based algorithms have been proposed for Maximum Satisfi...
Boolean constraints play an important role in various constraint logic programming languages. In thi...
AbstractThe best-known algorithm for the satisfiability problem in the case of propositional formula...
This is the first of three planned papers describing zap, a satisfiability engine that substantially...
In the first part of this paper we survey a number of algorithms for solving the propositional satis...