swMATH6917MaRDI QIDQ18983FDOQ18983
Author name not available (Why is that?)
Official website: http://eigold.tripod.com/BerkMin.html
Cited In (only showing first 100 items - show all)
- Cutting plane versus compact formulations for uncertain (integer) linear programs
- GridSAT: Design and implementation of a computational grid application
- On the power of clause-learning SAT solvers as resolution engines
- Solving SAT problem by heuristic polarity decision-making algorithm
- Applications of SAT Solvers to Cryptanalysis of Hash Functions
- Pool Resolution and Its Relation to Regular Resolution and DPLL with Clause Learning
- Towards NP-P via proof complexity and search
- Title not available (Why is that?)
- Computer Aided Verification
- Extended Resolution Proofs for Symbolic SAT Solving with Quantification
- Theory and Applications of Satisfiability Testing
- Theory and Applications of Satisfiability Testing
- Limitations of restricted branching in clause learning
- On Solving the Partial MAX-SAT Problem
- Title not available (Why is that?)
- Curriculum-based course timetabling with SAT and MaxSAT
- Theory and Applications of Satisfiability Testing
- Theory and Applications of Satisfiability Testing
- Effective use of Boolean satisfiability procedures in the formal verification of superscalar and VLIW microprocessors.
- Answer set programming based on propositional satisfiability
- Formalization and implementation of modern SAT solvers
- Reconfigurable computing. The theory and practice of FPGA-based computation.
- Fast and Flexible Difference Constraint Propagation for DPLL(T)
- Conflict-driven answer set solving: from theory to practice
- DPvis
- GNT
- HaifaSat
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- tts
- SatEx
- SATLIB
- Cmodels
- QingTing1
- Siege
- SATO
- PBS
- SAT competition
- SATIRE
- zChaff
- GrADS
- Chaff
- Limmat
- NiVER
- PaMiraXT
- PicoSAT
- GrADSAT
- Quaffle
- FORCE
- SYMBA
- Eureka
- Jerusat
- SATORI
- MiniMaxSat
- HANNIBAL
- HITEC
- PASSAT
- SOCRATES
- UML2Alloy
- iClingo
- NAGSAT
- AMUSE
- MUP
- ZetaSAT
- ModelSim
- SATLIB Benchmark Suite
- Leibniz
- RSat
- DiffSat
- EVC
- Velev SAT Benchmarks
- Conflict analysis in mixed integer programming
- Theory and Applications of Satisfiability Testing
- Theory and Applications of Satisfiability Testing
- Decision Procedures for SAT, SAT Modulo Theories and Beyond. The BarcelogicTools
- nomore++
- Shatter
- Denali
- MapleSAT
- semprop
- SAT Solver Verification
- Towards a design flow for reversible logic
- Sparrow2Riss
- Hardware and Software, Verification and Testing
- Formal verification of a modern SAT solver by shallow embedding into Isabelle/HOL
- Title not available (Why is that?)
- \texttt{SymChaff}: Exploiting symmetry in a structure-aware satisfiability solver
- Tools and Algorithms for the Construction and Analysis of Systems
- The model evolution calculus as a first-order DPLL method
- Optimization Methods for the Partner Units Problem
- On the resolution of bipolar max-min equations.
- Formal Methods in Computer-Aided Design
- Application of productions for automatic control of logical design of discrete devices
- Exploiting Unit Propagation to Compute Lower Bounds in Branch and Bound Max-SAT Solvers
- Formal verification of logical descriptions with functional uncertainty based on logarithmic encoding of conditions
- Logic programming with infinite sets
- Extended Resolution Proofs for Conjoining BDDs
- Efficient SAT-based bounded model checking for software verification
This page was built for software: BerkMin
