BerkMin
From MaRDI portal
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)
- Logic programming with infinite sets
- Extended Resolution Proofs for Conjoining BDDs
- Efficient SAT-based bounded model checking for software verification
- Efficient branch-and-bound algorithms for weighted MAX-2-SAT
- Logic for Programming, Artificial Intelligence, and Reasoning
- DPLL: the core of modern satisfiability solvers
- Look-back techniques and heuristics in DLV: Implementation, evaluation, and comparison to QBF solvers
- Formal Techniques, Modelling and Analysis of Timed and Fault-Tolerant Systems
- Correct Hardware Design and Verification Methods
- Satisfiability testing of Boolean combinations of pseudo-Boolean constraints using local-search techniques
- Formal Methods for Hardware Verification
- Title not available (Why is that?)
- Producing and verifying extremely large propositional refutations
- Verification of embedded systems based on interval analysis
- Logic for Programming, Artificial Intelligence, and Reasoning
- Deep cooperation of CDCL and local search for SAT
- Dynamic symmetry-breaking for Boolean satisfiability
- Theory and Applications of Satisfiability Testing
- Clause-Learning Algorithms with Many Restarts and Bounded-Width Resolution
- Experimenting with Look-Back Heuristics for Hard ASP Programs
- Theory and Applications of Satisfiability Testing
- Decomposing SAT problems into connected components
- 2-valued and 3-valued abstraction-refinement in model checking
- Boundary Points and Resolution
- An interleaved depth-first search method for the linear optimization problem with disjunctive constraints
- Deciding Separation Logic Formulae by SAT and Incremental Negative Cycle Elimination
- Propositional SAT solving
- Heuristic-based backtracking relaxation for propositional satisfiability
- The complexity of pure literal elimination
- Random backtracking in backtrack search algorithms for satisfiability
- A Decision-Making Procedure for Resolution-Based SAT-Solvers
- A Scalable Algorithm for Minimal Unsatisfiable Core Extraction
- Clause-Learning Algorithms with Many Restarts and Bounded-Width Resolution
- Formal Methods for Hardware Verification
- Title not available (Why is that?)
- Deciding Quantifier-Free Presburger Formulas Using Parameterized Solution Bounds
- Parallel SAT solving in bounded model checking
- Title not available (Why is that?)
- Some computational aspects of DISTANCE SAT
- A generative power-law search tree model
- Improvements to Hybrid Incremental SAT Algorithms
- Formal Methods in Computer-Aided Design
- Tools and Algorithms for the Construction and Analysis of Systems
- Towards Robust CNF Encodings of Cardinality Constraints
- A SAT approach to query optimization in mediator systems
- Evaluating CDCL variable scoring schemes
- Using heuristics to find minimal unsatisfiable subformulas in satisfiability problems
- On deciding subsumption problems
- A Gröbner Basis Approach to CNF-Formulae Preprocessing
- Theory and Applications of Satisfiability Testing
- An overview of parallel SAT solving
- An empirical study of branching heuristics through the lens of global learning rate
- 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
- Efficient Generation of Unsatisfiability Proofs and Cores in SAT
- Logic Programming and Nonmonotonic Reasoning
- Local-search techniques for propositional logic extended with cardinality constraints
- SAT-solving in practice, with a tutorial example from supervisory control
- Encoding OCL data types for SAT-based verification of UML/OCL models
- Title not available (Why is that?)
- New updating criteria for conflict-based branching heuristics in DPLL algorithms for satisfiability
- Formalization of Abstract State Transition Systems for SAT
- Theory and Applications of Satisfiability Testing
- Anatomy and empirical evaluation of modern SAT solvers
- Learning rate based branching heuristic for SAT solvers
- Theory and Applications of Satisfiability Testing
- Decision procedures. An algorithmic point of view
- Reducing chaos in SAT-like search: finding solutions close to a given one
- Tools and Algorithms for the Construction and Analysis of Systems
- Symbolic computational techniques for solving games
- Breaking instance-independent symmetries in exact graph coloring
- Interpolant learning and reuse in SAT-based model checking
- Bounded model checking of infinite state systems
- 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
This page was built for software: BerkMin
