• Walksat

  • Referenced in 207 articles [sw04328]
  • WalkSat are local search algorithms to solve Boolean satisfiability problems. Both algorithms work on formulae...
  • JBool

  • Referenced in 103 articles [sw06185]
  • clausal) or by disjonctive ones. Boolean Functions: Theory, Algorithms and Applications, Y. Crama...
  • Chaff

  • Referenced in 567 articles [sw06916]
  • Chaff:engineering an efficient SAT solver. Boolean Satisfiability is probably the most studied of combinatorial ... variants of the Davis-Putnam (DP) search algorithm. In this paper we describe the development ... search - especially a particularly efficient implementation of Boolean constraint propagation (BCP) and a novel...
  • CGAL

  • Referenced in 355 articles [sw00118]
  • Algorithms Library (CGAL), offers data structures and algorithms like triangulations (2D constrained triangulations and Delaunay ... Voronoi diagrams, and segment Voronoi diagrams), polygons (Boolean operations, offsets, straight skeleton), polyhedra (Boolean operations ... ridges and umbilics), alpha shapes, convex hull algorithms (in 2D, 3D and dD), search structures...
  • clasp

  • Referenced in 90 articles [sw07095]
  • from the area of Boolean constraint solving. The primary clasp algorithm relies on conflict-driven...
  • UnitWalk

  • Referenced in 34 articles [sw00993]
  • randomized algorithm for SAT, i.e., the satisfiability problem for Boolean formulas in conjunctive normal form...
  • OPBDP

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

  • Referenced in 44 articles [sw00723]
  • introduce a specialised data structure for Boolean polynomials based on zero-suppressed binary decision diagrams ... speed. Furthermore, we concentrate on high-level algorithmic aspects, taking into account the new data ... structures as well as structural properties of Boolean polynomials. For example, a new useless-pair...
  • zeroin

  • Referenced in 20 articles [sw26438]
  • Algorithms with Guaranteed Convergence for Finding a Zero of a Function: Algol 60 Boolean procedure...
  • MaxSolver

  • Referenced in 20 articles [sw01990]
  • clauses in a Boolean formula. A branch and bound algorithm based on the Davis–Putnam...
  • Spacer

  • Referenced in 9 articles [sw19496]
  • properties over a decidable theory, the algorithm is guaranteed to find a counterexample ... quantifier elimination (QE). For Boolean programs, the algorithm is a polynomial decision procedure, matching...
  • Kodkod

  • Referenced in 23 articles [sw07090]
  • boolean logic. These desiderata are addressed with three new techniques: a symmetry detection algorithm that ... relations, and a compact representation of boolean formulas inspired by boolean expression diagrams and reduced...
  • DepQBF

  • Referenced in 31 articles [sw09734]
  • boolean formulae (QBF) in prenex conjunctive normal form. It is based on the DPLL algorithm...
  • QCA

  • Referenced in 3 articles [sw25855]
  • social science research. It uses a Boolean algorithm that results in a minimal causal combination...
  • BULL

  • Referenced in 2 articles [sw09912]
  • BULL: a library for learning algorithms of Boolean functions. We present the tool BULL (Boolean ... first publicly available implementation of learning algorithms for Boolean functions. The tool is implemented ... results show significant advantages of Boolean function learning algorithms over all variants...
  • Quaffle

  • Referenced in 63 articles [sw07278]
  • Malik, ”Conflict Driven Learning in a Quantified Boolean Satisfiability Solver”, Proceedings of International Conference ... file. The code is experimental and for algorithm evaluation only. It should compile under most...
  • EXACUS

  • Referenced in 24 articles [sw02738]
  • EXACUS: Efficient and exact algorithms for curves and surfaces. We present the first release ... curve segments of low algebraic degree, and Boolean operations on polygons bounded by such segments...
  • Localizer

  • Referenced in 19 articles [sw21238]
  • makes it possible to express local search algorithms in a notation close to their informal ... descriptions in scientific papers. Experimental results on Boolean satisfiability graph coloring, graph partitioning...
  • BIBasis

  • Referenced in 3 articles [sw06549]
  • algebra systems, which allows one to compute Boolean involutive bases and Gröbner bases. The implementations ... BIBasis with other packages and algorithms for constructing Boolean Gröbner bases available in the computer...
  • QCAGUI

  • Referenced in 1 article [sw25856]
  • social science research. It uses a boolean algorithm that results in a minimal causal combination...