swMATH743MaRDI QIDQ13494FDOQ13494
Author name not available (Why is that?)
Official website: http://www.cril.univ-artois.fr/PB06/papers/pueblo15.pdf
Cited In (50)
- On the Implementation of Weight Constraint Rules in Conflict-Driven ASP Solvers
- Vertical dynamic behavior of three-piece bogie suspensions with two types of friction wedge
- Solving satisfiability problems with preferences
- Solving hybrid Boolean constraints in continuous space via multilinear Fourier expansions
- Combinatorial optimization solutions for the maximum quartet consistency problem
- On dedicated CDCL strategies for PB solvers
- Reasoning with uncertain and inconsistent OWL ontologies
- Terse integer linear programs for Boolean optimization
- Freight car models and their computer-aided dynamic analysis
- Simulation optimization for revenue management of airlines with cancellations and overbooking
- On weakening strategies for PB solvers
- Title not available (Why is that?)
- Tools for modeling and solving search problems
- Vector optimization: Singularities, regularizations
- A logical approach to efficient Max-SAT solving
- 2006 and 2007 Max-SAT evaluations: contributed instances
- Generic preferences over subsets of structured objects
- Equality saturation: a new approach to optimization
- Title not available (Why is that?)
- Mendelian error detection in complex pedigrees using weighted constraint satisfaction tech\-niques
- OptSAT
- PBS
- OPBDP
- RPOLY
- CLIPS
- PicoSAT
- Sat4j
- ToulBar2
- Improving Unsatisfiability-Based Algorithms for Boolean Optimization
- OPIUM
- Pedcheck
- MiniMaxSat
- MSUnCore
- Open-WBO
- ROSoClingo
- Haplotype inference with pseudo-Boolean optimization
- CNFgen
- lp2normal
- Iterative and core-guided maxsat solving: a survey and assessment
- GMCheck
- Title not available (Why is that?)
- FourierSAT
- New Encodings of Pseudo-Boolean Constraints into CNF
- On using cutting planes in pseudo-Boolean optimization
- On SAT Modulo Theories and Optimization Problems
- Learn to relax: integrating \(0-1\) integer linear programming with pseudo-Boolean conflict-driven search
- Recent Advances in Constraints
- Algorithms for Weighted Boolean Optimization
- Minimaxsat: an efficient weighted Max-SAT solver
- SAT Solving for Termination Analysis with Polynomial Interpretations
This page was built for software: Pueblo
