Pages that link to "Item:Q4930573"
From MaRDI portal
The following pages link to Theory and Applications of Satisfiability Testing – SAT 2010 (Q4930573):
Displaying 36 items.
- The Big Deal: Applying Constraint Satisfaction Technologies Where It Makes the Difference (Q4930574) (← links)
- Improving Stochastic Local Search for SAT with a New Probability Distribution (Q4930575) (← links)
- Lower Bounds for Width-Restricted Clause Learning on Small Width Formulas (Q4930576) (← links)
- Proof Complexity of Propositional Default Logic (Q4930577) (← links)
- Automated Testing and Debugging of SAT and QBF Solvers (Q4930578) (← links)
- Rewriting (Dependency-)Quantified 2-CNF with Arbitrary Free Literals into Existential 2-HORN (Q4930579) (← links)
- Synthesizing Shortest Linear Straight-Line Programs over GF(2) Using SAT (Q4930580) (← links)
- sQueezeBF: An Effective Preprocessor for QBFs Based on Equivalence Reasoning (Q4930581) (← links)
- Non Uniform Selection of Solutions for Upper Bounding the 3-SAT Threshold (Q4930582) (← links)
- Symmetry and Satisfiability: An Update (Q4930583) (← links)
- A Non-prenex, Non-clausal QBF Solver with Game-State Learning (Q4930584) (← links)
- SAT Solving with Reference Points (Q4930585) (← links)
- Integrating Dependency Schemes in Search-Based QBF Solvers (Q4930586) (← links)
- An Exact Algorithm for the Boolean Connectivity Problem for k-CNF (Q4930587) (← links)
- Improving Unsatisfiability-Based Algorithms for Boolean Optimization (Q4930588) (← links)
- Encoding Techniques, Craig Interpolants and Bounded Model Checking for Incomplete Designs (Q4930589) (← links)
- Statistical Methodology for Comparison of SAT Solvers (Q4930590) (← links)
- On the Relative Merits of Simple Local Search Methods for the MAX-SAT Problem (Q4930591) (← links)
- The Seventh QBF Solvers Evaluation (QBFEVAL’10) (Q4930592) (← links)
- Complexity Results for Linear XSAT-Problems (Q4930593) (← links)
- Bounds on Threshold of Regular Random k-SAT (Q4930594) (← links)
- Dynamic Scoring Functions with Variable Expressions: New SLS Methods for Solving SAT (Q4930595) (← links)
- Improved Local Search for Circuit Satisfiability (Q4930596) (← links)
- A System for Solving Constraint Satisfaction Problems with SMT (Q4930597) (← links)
- Two Techniques for Minimizing Resolution Proofs (Q4930598) (← links)
- On Moderately Exponential Time for SAT (Q4930599) (← links)
- Minimising Deterministic Büchi Automata Precisely Using SAT Solving (Q4930600) (← links)
- Exploiting Circuit Representations in QBF Solving (Q4930601) (← links)
- Reconstructing Solutions after Blocked Clause Elimination (Q4930602) (← links)
- An Empirical Study of Optimal Noise and Runtime Distributions in Local Search (Q4930603) (← links)
- Green-Tao Numbers and SAT (Q4930604) (← links)
- Exact MinSAT Solving (Q4930605) (← links)
- Uniquely Satisfiable k-SAT Instances with Almost Minimal Occurrences of Each Variable (Q4930606) (← links)
- Assignment Stack Shrinking (Q4931560) (← links)
- Simple but Hard Mixed Horn Formulas (Q4931561) (← links)
- Zero-One Designs Produce Small Hard SAT Instances (Q4931562) (← links)
