BerkMin

swMATH6917MaRDI QIDQ18983FDOQ18983

Author name not available (Why is that?)

Described by source

• BerkMin: A fast and robust SAT-solver

Cited In (only showing first 100 items - show all)

• Logic programming with infinite sets
• Extended Resolution Proofs for Conjoining BDDs
• Towards a Design Flow for Reversible Logic
• Efficient SAT-based bounded model checking for software verification
• Cutting plane versus compact formulations for uncertain (integer) linear programs
• Efficient branch-and-bound algorithms for weighted MAX-2-SAT
• Logic for Programming, Artificial Intelligence, and Reasoning
• 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
• Formal Techniques, Modelling and Analysis of Timed and Fault-Tolerant Systems
• Applications of SAT Solvers to Cryptanalysis of Hash Functions
• Correct Hardware Design and Verification Methods
• Satisfiability testing of Boolean combinations of pseudo-Boolean constraints using local-search techniques
• Formal Methods for Hardware Verification
• 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?)
• Title not available (Why is that?)
• Producing and verifying extremely large propositional refutations
• Verification of embedded systems based on interval analysis
• Computer Aided Verification
• Learning Rate Based Branching Heuristic for SAT Solvers
• Extended Resolution Proofs for Symbolic SAT Solving with Quantification
• Theory and Applications of Satisfiability Testing
• Theory and Applications of Satisfiability Testing
• Clause-Learning Algorithms with Many Restarts and Bounded-Width Resolution
• Limitations of restricted branching in clause learning
• On Solving the Partial MAX-SAT Problem
• Reducing Chaos in SAT-Like Search: Finding Solutions Close to a Given One
• Title not available (Why is that?)
• Curriculum-based course timetabling with SAT and MaxSAT
• Theory and Applications of Satisfiability Testing
• Boundary Points and Resolution
• Theory and Applications of Satisfiability Testing
• Deciding Separation Logic Formulae by SAT and Incremental Negative Cycle Elimination
• Effective use of Boolean satisfiability procedures in the formal verification of superscalar and VLIW microprocessors.
• A Decision-Making Procedure for Resolution-Based SAT-Solvers
• Answer set programming based on propositional satisfiability
• A Scalable Algorithm for Minimal Unsatisfiable Core Extraction
• Clause-Learning Algorithms with Many Restarts and Bounded-Width Resolution
• Formal Methods for Hardware Verification
• Formalization and implementation of modern SAT solvers
• Deciding Quantifier-Free Presburger Formulas Using Parameterized Solution Bounds
• Fast and Flexible Difference Constraint Propagation for DPLL(T)
• Formal Methods in Computer-Aided Design
• Towards Robust CNF Encodings of Cardinality Constraints
• Conflict-driven answer set solving: from theory to practice
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Conflict analysis in mixed integer programming
• Theory and Applications of Satisfiability Testing
• Theory and Applications of Satisfiability Testing
• Propositional SAT Solving
• Decision Procedures for SAT, SAT Modulo Theories and Beyond. The BarcelogicTools
• Using heuristics to find minimal unsatisfiable subformulas in satisfiability problems
• A Gröbner Basis Approach to CNF-Formulae Preprocessing
• Theory and Applications of Satisfiability Testing
• Hardware and Software, Verification and Testing
• An overview of parallel SAT solving
• Formal verification of a modern SAT solver by shallow embedding into Isabelle/HOL
• Approximate Boolean Reasoning: Foundations and Applications in Data Mining
• Theory and Applications of Satisfiability Testing
• Determinization of Resolution by an Algorithm Operating on Complete Assignments
• Parallel SAT Solving in Bounded Model Checking
• 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
• SAT-solving in practice, with a tutorial example from supervisory control
• 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
• Theory and Applications of Satisfiability Testing
• Title not available (Why is that?)
• Decision procedures. An algorithmic point of view
• Evaluating CDCL Variable Scoring Schemes
• Formal verification of logical descriptions with functional uncertainty based on logarithmic encoding of conditions
• Symbolic computational techniques for solving games
• Interpolant learning and reuse in SAT-based model checking
• Bounded model checking of infinite state systems
• Title not available (Why is that?)
• Title not available (Why is that?)
• Theory and Applications of Satisfiability Testing
• Principles and Practice of Constraint Programming – CP 2004
• Principles and Practice of Constraint Programming – CP 2004
• Theory and Applications of Satisfiability Testing
• Advancing Lazy-Grounding ASP Solving Techniques – Restarts, Phase Saving, Heuristics, and More
• Correct Hardware Design and Verification Methods
• Theory and Applications of Satisfiability Testing
• Title not available (Why is that?)
• Look-back techniques and heuristics in DLV: Implementation, evaluation, and comparison to QBF solvers
• Encoding OCL Data Types for SAT-Based Verification of UML/OCL Models
• A taxonomy of exact methods for partial Max-SAT
• Title not available (Why is that?)

This page was built for software: BerkMin