BerkMin

swMATH6917MaRDI QIDQ18983

No author found.

Described by source

• BerkMin: A fast and robust SAT-solver

Related Items (only showing first 100 items - show all)

Unnamed Item ⋮ Tools and Algorithms for the Construction and Analysis of Systems ⋮ Logic for Programming, Artificial Intelligence, and Reasoning ⋮ Logic for Programming, Artificial Intelligence, and Reasoning ⋮ Logic Programming and Nonmonotonic Reasoning ⋮ Deciding Separation Logic Formulae by SAT and Incremental Negative Cycle Elimination ⋮ Pool Resolution and Its Relation to Regular Resolution and DPLL with Clause Learning ⋮ Another Complete Local Search Method for SAT ⋮ Theory and Applications of Satisfiability Testing ⋮ Theory and Applications of Satisfiability Testing ⋮ Theory and Applications of Satisfiability Testing ⋮ Theory and Applications of Satisfiability Testing ⋮ Theory and Applications of Satisfiability Testing ⋮ Theory and Applications of Satisfiability Testing ⋮ Theory and Applications of Satisfiability Testing ⋮ Theory and Applications of Satisfiability Testing ⋮ Theory and Applications of Satisfiability Testing ⋮ Theory and Applications of Satisfiability Testing ⋮ Experimenting with Look-Back Heuristics for Hard ASP Programs ⋮ Correct Hardware Design and Verification Methods ⋮ Correct Hardware Design and Verification Methods ⋮ On Solving the Partial MAX-SAT Problem ⋮ Extended Resolution Proofs for Symbolic SAT Solving with Quantification ⋮ Satisfiability Checking of Non-clausal Formulas Using General Matings ⋮ Fast and Flexible Difference Constraint Propagation for DPLL(T) ⋮ Applications of SAT Solvers to Cryptanalysis of Hash Functions ⋮ A Scalable Algorithm for Minimal Unsatisfiable Core Extraction ⋮ Determinization of Resolution by an Algorithm Operating on Complete Assignments ⋮ A Gröbner Basis Approach to CNF-Formulae Preprocessing ⋮ Approximate Boolean Reasoning: Foundations and Applications in Data Mining ⋮ Formal Techniques, Modelling and Analysis of Timed and Fault-Tolerant Systems ⋮ Clause-Learning Algorithms with Many Restarts and Bounded-Width Resolution ⋮ Tools and Algorithms for the Construction and Analysis of Systems ⋮ Clause-Learning Algorithms with Many Restarts and Bounded-Width Resolution ⋮ Principles and Practice of Constraint Programming – CP 2003 ⋮ Hardware and Software, Verification and Testing ⋮ Formal Methods for Hardware Verification ⋮ Formal Methods for Hardware Verification ⋮ Formal Methods for Hardware Verification ⋮ Principles and Practice of Constraint Programming – CP 2004 ⋮ Principles and Practice of Constraint Programming – CP 2004 ⋮ Formal Methods in Computer-Aided Design ⋮ Formal Methods in Computer-Aided Design ⋮ Formal Methods in Computer-Aided Design ⋮ Unnamed Item ⋮ Efficient Generation of Unsatisfiability Proofs and Cores in SAT ⋮ Unnamed Item ⋮ Bounded model checking of infinite state systems ⋮ Formalization and implementation of modern SAT solvers ⋮ Evaluating CDCL Variable Scoring Schemes ⋮ Propositional SAT Solving ⋮ SAT-solving in practice, with a tutorial example from supervisory control ⋮ Unnamed Item ⋮ Satisfiability testing of Boolean combinations of pseudo-Boolean constraints using local-search techniques ⋮ Random backtracking in backtrack search algorithms for satisfiability ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Deciding Quantifier-Free Presburger Formulas Using Parameterized Solution Bounds ⋮ The model evolution calculus as a first-order DPLL method ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Cutting plane versus compact formulations for uncertain (integer) linear programs ⋮ Answer set programming based on propositional satisfiability ⋮ Heuristic-based backtracking relaxation for propositional satisfiability ⋮ The complexity of pure literal elimination ⋮ Unnamed Item ⋮ Theory and Applications of Satisfiability Testing ⋮ Theory and Applications of Satisfiability Testing ⋮ Theory and Applications of Satisfiability Testing ⋮ Theory and Applications of Satisfiability Testing ⋮ Theory and Applications of Satisfiability Testing ⋮ Theory and Applications of Satisfiability Testing ⋮ Theory and Applications of Satisfiability Testing ⋮ Application of productions for automatic control of logical design of discrete devices ⋮ Some computational aspects of DISTANCE SAT ⋮ Formal verification of a modern SAT solver by shallow embedding into Isabelle/HOL ⋮ Formal verification of logical descriptions with functional uncertainty based on logarithmic encoding of conditions ⋮ Unnamed Item ⋮ An empirical study of branching heuristics through the lens of global learning rate ⋮ Formalization of Abstract State Transition Systems for SAT ⋮ A Decision-Making Procedure for Resolution-Based SAT-Solvers ⋮ Improvements to Hybrid Incremental SAT Algorithms ⋮ Towards NP-P via proof complexity and search ⋮ Unnamed Item ⋮ On look-ahead heuristics in disjunctive logic programming ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ A taxonomy of exact methods for partial Max-SAT ⋮ Towards Robust CNF Encodings of Cardinality Constraints ⋮ Exploiting Unit Propagation to Compute Lower Bounds in Branch and Bound Max-SAT Solvers ⋮ Look-back techniques and heuristics in DLV: Implementation, evaluation, and comparison to QBF solvers ⋮ The effect of structural branching on the efficiency of clause learning SAT solving: An experimental study ⋮ Unnamed Item ⋮ Effective use of Boolean satisfiability procedures in the formal verification of superscalar and VLIW microprocessors. ⋮ Unnamed Item ⋮ A Boolean Encoding Including SAT and n-ary CSPs ⋮ Decision Procedures for SAT, SAT Modulo Theories and Beyond. The BarcelogicTools ⋮ Curriculum-based course timetabling with SAT and MaxSAT ⋮ Unnamed Item

This page was built for software: BerkMin