• Sat4j

  • Referenced in 86 articles [sw07283]
  • java library for solving boolean satisfaction and optimization problems. It can solve SAT, MAXSAT, Pseudo...
  • ToulBar2

  • Referenced in 22 articles [sw07289]
  • Toulbar2 is an exact discrete optimization c++ open-source software for Graphical Models such ... Problems, Weighted Max-SAT, Quadratic Pseudo-Boolean Optimization, and Bayesian Networks...
  • OPBDP

  • Referenced in 14 articles [sw05036]
  • Putnam Based Enumeration Algorithm for LinearPseudo-Boolean Optimization , 0-1 variables, objective and constraints polynomial ... Based Enumeration Algorithm for Linear Pseudo-Boolean Optimization...
  • RPOLY

  • Referenced in 10 articles [sw05301]
  • Haplotype inference with pseudo-Boolean optimization. The fast development of sequencing techniques in the recent ... based methods, including pseudo-Boolean optimization (PBO) methods, has produced very efficient solvers. This paper...
  • MaxSolver

  • Referenced in 20 articles [sw01990]
  • satisfiability (max-SAT) is the optimization counterpart of Boolean satisfiability (SAT), in which a variable...
  • Walksat

  • Referenced in 211 articles [sw04328]
  • WalkSat are local search algorithms to solve Boolean satisfiability problems. Both algorithms work on formulae ... assignment. When picking a guessed to be optimal variable, WalkSAT has to do less calculation...
  • PBS

  • Referenced in 38 articles [sw04622]
  • Boolean literals.) Can be used to solve decision (Yes/No) and optimization (Max/Min) problems. Includes incremental...
  • Pueblo

  • Referenced in 34 articles [sw00743]
  • Boolean (PB) constraints into generic SAT solvers in order to solve PB satisfiability and optimization...
  • GraMoFoNe

  • Referenced in 3 articles [sw34237]
  • problem as a linear pseudo-boolean optimization problem (LPB), i.e. as a linear program whose...
  • ADATE

  • Referenced in 3 articles [sw02854]
  • state-of-the-art handcrafted meta-heuristic optimization code. In particular, the programs generated ... move selection part of BOOP-Boolean Optimization Problems. The baseline is a highly successful Tabu...
  • Sugar

  • Referenced in 27 articles [sw09758]
  • Satisfaction Problem (CSP) is encoded to a Boolean CNF formula, and it is solved ... solver. Sugar also can solve Constraint Optimization Problems (COP) and Max-CSP. Sugar...
  • TinyGarble

  • Referenced in 3 articles [sw41619]
  • logic synthesis techniques for generating and optimizing compressed Boolean circuits used in secure computation, such ... such that our sequential circuits can be optimized and securely evaluated by interfacing with available...
  • PackUp

  • Referenced in 4 articles [sw10046]
  • This paper presents PackUp (PACKage UPgradability with Boolean formulations) a framework for solving ... solvers: weighted partia MaxSAT solvers and optimization pseudo-Boolean (OPB) solvers. The paper discusses...
  • HySAT

  • Referenced in 26 articles [sw01980]
  • tight integration of a DPLL-based pseudo-Boolean SAT solver and a linear programming routine ... tool exploits the various optimizations that arise naturally in the bounded model checking context...
  • BoolFilter

  • Referenced in 2 articles [sw22774]
  • package BoolFilter: Optimal Estimation of Partially Observed Boolean Dynamical Systems. Tools for optimal and approximate...
  • SPAN

  • Referenced in 1 article [sw34044]
  • carries out search partition analysis for optimal Boolean prediction rules and implements other approaches...
  • MiniMaxSat

  • Referenced in 36 articles [sw09732]
  • well as pseudo-boolean objective functions and constraints. Its main features are: learning and backjumping ... empirical evaluation on a wide set of optimization benchmarks indicates that its performance is usually...
  • meSAT

  • Referenced in 5 articles [sw29642]
  • related Constraint Optimization Problems (COP)) involving integer and Boolean variables is reduction to propositional satisfiability...
  • WPM3

  • Referenced in 6 articles [sw41870]
  • MaxSAT optimization problem into a sequence of SAT decision problems where Pseudo-Boolean (PB) constraints...
  • EVC

  • Referenced in 8 articles [sw13374]
  • tool that exploits positive equality and other optimizations when translating a formula in EUFM ... which can then be evaluated by any Boolean satisfiability (SAT) procedure. EVC has been used...