BerkMin
From MaRDI portal
Cited in
(only showing first 100 items - show all)- A generative power-law search tree model
- Using heuristics to find minimal unsatisfiable subformulas in satisfiability problems
- \texttt{SymChaff}: Exploiting symmetry in a structure-aware satisfiability solver
- CirCUs
- DPvis
- GNT
- HaifaSat
- MiniSat
- SBSAT
- tts
- UnitWalk
- Zchaff2004
- PLATYPUS
- Effective use of Boolean satisfiability procedures in the formal verification of superscalar and VLIW microprocessors.
- SatEx
- GridLab
- DiVer
- GridSAT
- BarcelogicTools
- SATLIB
- NP-SPEC
- TAPS
- ASSAT
- UBCSAT
- MAX-2-SAT
- Walksat
- Cmodels
- Siege
- SATO
- QingTing1
- PBS
- SAT competition
- An empirical study of branching heuristics through the lens of global learning rate
- SATIRE
- zChaff
- An interleaved depth-first search method for the linear optimization problem with disjunctive constraints
- Conflict-driven answer set solving: from theory to practice
- A SAT approach to query optimization in mediator systems
- On deciding subsumption problems
- GrADS
- Chaff
- Limmat
- NiVER
- PaMiraXT
- PicoSAT
- Quaffle
- GrADSAT
- SYMBA
- FORCE
- Deep cooperation of CDCL and local search for SAT
- Jerusat
- Eureka
- SATORI
- MiniMaxSat
- UML2Alloy
- HANNIBAL
- HITEC
- SOCRATES
- PASSAT
- Limitations of restricted branching in clause learning
- iClingo
- NAGSAT
- ZetaSAT
- Bounded model checking of infinite state systems
- MUP
- AMUSE
- Satisfiability testing of Boolean combinations of pseudo-Boolean constraints using local-search techniques
- SATLIB Benchmark Suite
- ModelSim
- The model evolution calculus as a first-order DPLL method
- Cutting plane versus compact formulations for uncertain (integer) linear programs
- On look-ahead heuristics in disjunctive logic programming
- A taxonomy of exact methods for partial Max-SAT
- Search techniques for SAT-based Boolean optimization
- Visualizing SAT instances and runs of the DPLL algorithm
- Solving SAT problem by heuristic polarity decision-making algorithm
- Conflict analysis in mixed integer programming
- Leibniz
- RSat
- GridSAT: Design and implementation of a computational grid application
- Verification of embedded systems based on interval analysis
- DiffSat
- Velev SAT Benchmarks
- EVC
- Random backtracking in backtrack search algorithms for satisfiability
- Learning rate based branching heuristic for SAT solvers
- On the resolution of bipolar max-min equations.
- Symbolic computational techniques for solving games
- Bounded model checking with parametric data structures
- Interpolant learning and reuse in SAT-based model checking
- Speeding up SAT solver by exploring CNF symmetries: Revisited
- Optimization Methods for the Partner Units Problem
- Reducing chaos in SAT-like search: finding solutions close to a given one
- scientific article; zbMATH DE number 5914356 (Why is no real title available?)
- Learning and using domain-specific heuristics in ASP solvers
- Encoding OCL data types for SAT-based verification of UML/OCL models
- 2-valued and 3-valued abstraction-refinement in model checking
- Parallel SAT solving in bounded model checking
- Propositional SAT solving
- \textsc{HaifaSat}: a SAT solver based on an abstraction/refinement model
This page was built for software: BerkMin
