Cited in
(only showing first 100 items - show all)- Determinization of Resolution by an Algorithm Operating on Complete Assignments
- Deciding Separation Logic Formulae by SAT and Incremental Negative Cycle Elimination
- Theory and Applications of Satisfiability Testing
- Formal Techniques, Modelling and Analysis of Timed and Fault-Tolerant Systems
- Propositional SAT solving
- Logic for Programming, Artificial Intelligence, and Reasoning
- Deciding Quantifier-Free Presburger Formulas Using Parameterized Solution Bounds
- Fast and Flexible Difference Constraint Propagation for DPLL(T)
- scientific article; zbMATH DE number 5605058 (Why is no real title available?)
- Breaking instance-independent symmetries in exact graph coloring
- Formal Methods in Computer-Aided Design
- 2-valued and 3-valued abstraction-refinement in model checking
- Applications of SAT Solvers to Cryptanalysis of Hash Functions
- scientific article; zbMATH DE number 2243352 (Why is no real title available?)
- Learning rate based branching heuristic for SAT solvers
- DPLL: the core of modern satisfiability solvers
- Satisfiability testing of Boolean combinations of pseudo-Boolean constraints using local-search techniques
- Efficient SAT-based bounded model checking for software verification
- Correct Hardware Design and Verification Methods
- Reducing chaos in SAT-like search: finding solutions close to a given one
- Verification of embedded systems based on interval analysis
- On deciding subsumption problems
- Formalization of Abstract State Transition Systems for SAT
- A Gröbner Basis Approach to CNF-Formulae Preprocessing
- Tools and Algorithms for the Construction and Analysis of Systems
- Interpolant learning and reuse in SAT-based model checking
- Some computational aspects of DISTANCE SAT
- Formal Methods for Hardware Verification
- Towards NP-P via proof complexity and search
- Pool Resolution and Its Relation to Regular Resolution and DPLL with Clause Learning
- Logic programming with infinite sets
- Cutting plane versus compact formulations for uncertain (integer) linear programs
- Clause-Learning Algorithms with Many Restarts and Bounded-Width Resolution
- Formal Methods for Hardware Verification
- Extended Resolution Proofs for Conjoining BDDs
- Formal Methods in Computer-Aided Design
- Dynamic symmetry-breaking for Boolean satisfiability
- SAT-solving in practice, with a tutorial example from supervisory control
- Application of productions for automatic control of logical design of discrete devices
- scientific article; zbMATH DE number 2104641 (Why is no real title available?)
- Bounded model checking of infinite state systems
- Evaluating CDCL variable scoring schemes
- On the power of clause-learning SAT solvers as resolution engines
- Heuristic-based backtracking relaxation for propositional satisfiability
- The complexity of pure literal elimination
- Formal verification of logical descriptions with functional uncertainty based on logarithmic encoding of conditions
- Logic Programming and Nonmonotonic Reasoning
- Symbolic computational techniques for solving games
- Random backtracking in backtrack search algorithms for satisfiability
- Theory and Applications of Satisfiability Testing
- Theory and Applications of Satisfiability Testing
- Clause-Learning Algorithms with Many Restarts and Bounded-Width Resolution
- Decomposing SAT problems into connected components
- Parallel SAT solving in bounded model checking
- Anatomy and empirical evaluation of modern SAT solvers
- Approximate Boolean Reasoning: Foundations and Applications in Data Mining
- A Scalable Algorithm for Minimal Unsatisfiable Core Extraction
- scientific article; zbMATH DE number 5263038 (Why is no real title available?)
- Producing and verifying extremely large propositional refutations
- Tools and Algorithms for the Construction and Analysis of Systems
- Decision procedures. An algorithmic point of view
- Experimenting with Look-Back Heuristics for Hard ASP Programs
- Limitations of restricted branching in clause learning
- Towards Robust CNF Encodings of Cardinality Constraints
- Boundary Points and Resolution
- A generative power-law search tree model
- New updating criteria for conflict-based branching heuristics in DPLL algorithms for satisfiability
- A Decision-Making Procedure for Resolution-Based SAT-Solvers
- Look-back techniques and heuristics in DLV: Implementation, evaluation, and comparison to QBF solvers
- Theory and Applications of Satisfiability Testing
- An overview of parallel SAT solving
- Using heuristics to find minimal unsatisfiable subformulas in satisfiability problems
- Efficient branch-and-bound algorithms for weighted MAX-2-SAT
- Encoding OCL data types for SAT-based verification of UML/OCL models
- A SAT approach to query optimization in mediator systems
- Theory and Applications of Satisfiability Testing
- Theory and Applications of Satisfiability Testing
- Theory and Applications of Satisfiability Testing
- Formalization and implementation of modern SAT solvers
- 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 verification of a modern SAT solver by shallow embedding into Isabelle/HOL
- Decision Procedures for SAT, SAT Modulo Theories and Beyond. The BarcelogicTools
- GridSAT: Design and implementation of a computational grid application
- Computer Aided Verification
- Hardware and Software, Verification and Testing
- Answer set programming based on propositional satisfiability
- CirCUs
- DPvis
- GNT
- HaifaSat
- MiniSat
- SBSAT
- tts
- UnitWalk
- Zchaff2004
- PLATYPUS
- GridLab
- SatEx
This page was built for software: BerkMin
