Cited in
(only showing first 100 items - show all)- Logic programming with infinite sets
- scientific article; zbMATH DE number 1956571 (Why is no real title available?)
- Extended Resolution Proofs for Conjoining BDDs
- 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
- On the power of clause-learning SAT solvers as resolution engines
- DPLL: the core of modern satisfiability solvers
- GridSAT: Design and implementation of a computational grid application
- Solving SAT problem by heuristic polarity decision-making algorithm
- Logic for Programming, Artificial Intelligence, and Reasoning
- Towards NP-P via proof complexity and search
- Look-back techniques and heuristics in DLV: Implementation, evaluation, and comparison to QBF solvers
- A taxonomy of exact methods for partial Max-SAT
- Satisfiability testing of Boolean combinations of pseudo-Boolean constraints using local-search techniques
- Producing and verifying extremely large propositional refutations
- Formal Techniques, Modelling and Analysis of Timed and Fault-Tolerant Systems
- scientific article; zbMATH DE number 5542984 (Why is no real title available?)
- Applications of SAT Solvers to Cryptanalysis of Hash Functions
- Correct Hardware Design and Verification Methods
- Pool Resolution and Its Relation to Regular Resolution and DPLL with Clause Learning
- Formal Methods for Hardware Verification
- scientific article; zbMATH DE number 5263038 (Why is no real title available?)
- Verification of embedded systems based on interval analysis
- Formal Methods in Computer-Aided Design
- Computer Aided Verification
- Deep cooperation of CDCL and local search for SAT
- Dynamic symmetry-breaking for Boolean satisfiability
- Theory and Applications of Satisfiability Testing
- Logic for Programming, Artificial Intelligence, and Reasoning
- 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
- scientific article; zbMATH DE number 1975619 (Why is no real title available?)
- Satisfiability Checking of Non-clausal Formulas Using General Matings
- 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
- Curriculum-based course timetabling with SAT and MaxSAT
- On Solving the Partial MAX-SAT Problem
- scientific article; zbMATH DE number 2090309 (Why is no real title available?)
- SYSTEMATIC VERSUS LOCAL SEARCH AND GA TECHNIQUES FOR INCREMENTAL SAT
- 2-valued and 3-valued abstraction-refinement in model checking
- Visualizing SAT instances and runs of the DPLL algorithm
- An interleaved depth-first search method for the linear optimization problem with disjunctive constraints
- Boundary Points and Resolution
- Heuristic-based backtracking relaxation for propositional satisfiability
- The complexity of pure literal elimination
- Propositional SAT solving
- 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.
- Deciding Separation Logic Formulae by SAT and Incremental Negative Cycle Elimination
- Random backtracking in backtrack search algorithms for satisfiability
- A Decision-Making Procedure for Resolution-Based SAT-Solvers
- Answer set programming based on propositional satisfiability
- Theory and Applications of Satisfiability Testing
- A Scalable Algorithm for Minimal Unsatisfiable Core Extraction
- Formalization and implementation of modern SAT solvers
- scientific article; zbMATH DE number 2104641 (Why is no real title available?)
- Clause-Learning Algorithms with Many Restarts and Bounded-Width Resolution
- Formal Methods for Hardware Verification
- Formal Methods for Hardware Verification
- \textsc{HaifaSat}: a SAT solver based on an abstraction/refinement model
- Deciding Quantifier-Free Presburger Formulas Using Parameterized Solution Bounds
- Parallel SAT solving in bounded model checking
- Some computational aspects of DISTANCE SAT
- A generative power-law search tree model
- Test Pattern Generation using Boolean Proof Engines
- scientific article; zbMATH DE number 2243352 (Why is no real title available?)
- Modification strategies for SAT-based plan adaptation
- Theory and Applications of Satisfiability Testing
- Improvements to Hybrid Incremental SAT Algorithms
- Reconfigurable computing. The theory and practice of FPGA-based computation.
- A Boolean Encoding Including SAT and n-ary CSPs
- Fast and Flexible Difference Constraint Propagation for DPLL(T)
- CirCUs
- DPvis
- GNT
- HaifaSat
- MiniSat
- SBSAT
- tts
- UnitWalk
- Zchaff2004
- PLATYPUS
- GridLab
- SatEx
- DiVer
- BarcelogicTools
- GridSAT
- SATLIB
- NP-SPEC
- ASSAT
- TAPS
- UBCSAT
- MAX-2-SAT
This page was built for software: BerkMin
