Pages that link to "Item:Q3612451"
From MaRDI portal
The following pages link to Theory and Applications of Satisfiability Testing – SAT 2007 (Q3612451):
Displaying 26 items.
- Mapping CSP into Many-Valued SAT (Q3612452) (← links)
- Circuit Based Encoding of CNF Formula (Q3612453) (← links)
- Solving Multi-objective Pseudo-Boolean Problems (Q3612455) (← links)
- Improved Lower Bounds for Tree-Like Resolution over Linear Inequalities (Q3612456) (← links)
- Horn Upper Bounds and Renaming (Q3612457) (← links)
- Matched Formulas and Backdoor Sets (Q3612458) (← links)
- Short XORs for Model Counting: From Theory to Practice (Q3612459) (← links)
- Variable Dependency in Local Search: Prevention Is Better Than Cure (Q3612460) (← links)
- Combining Adaptive Noise and Look-Ahead in Local Search for SAT (Q3612461) (← links)
- From Idempotent Generalized Boolean Assignments to Multi-bit Search (Q3612462) (← links)
- Satisfiability with Exponential Families (Q3612463) (← links)
- Formalizing Dangerous SAT Encodings (Q3612464) (← links)
- Algorithms for Variable-Weighted 2-SAT and Dual Problems (Q3612465) (← links)
- On the Boolean Connectivity Problem for Horn Relations (Q3612466) (← links)
- A First Step Towards a Unified Proof Checker for QBF (Q3612467) (← links)
- Dynamically Partitioning for Solving QBF (Q3612468) (← links)
- Backdoor Sets of Quantified Boolean Formulas (Q3612469) (← links)
- Bounded Universal Expansion for Preprocessing QBF (Q3612470) (← links)
- Effective Incorporation of Double Look-Ahead Procedures (Q3612471) (← links)
- Applying Logic Synthesis for Speeding Up SAT (Q3612472) (← links)
- Minimum 2CNF Resolution Refutations in Polynomial Time (Q3612473) (← links)
- Polynomial Time SAT Decision for Complementation-Invariant Clause-Sets, and Sign-non-Singular Matrices (Q3612474) (← links)
- A Simple and Flexible Way of Computing Small Unsatisfiable Cores in SAT Modulo Theories (Q3612475) (← links)
- SAT Solving for Termination Analysis with Polynomial Interpretations (Q3612476) (← links)
- Fault Localization and Correction with QBF (Q3612477) (← links)
- Inversion Attacks on Secure Hash Functions Using sat Solvers (Q3612479) (← links)
