Pages that link to "Item:Q2817996"
From MaRDI portal
The following pages link to Theory and Applications of Satisfiability Testing – SAT 2016 (Q2817996):
Displaying 36 items.
- Parameterized Compilation Lower Bounds for Restricted CNF-Formulas (Q2817997) (← links)
- Satisfiability via Smooth Pictures (Q2817998) (← links)
- Solution-Graphs of Boolean Formulas and Isomorphism (Q2817999) (← links)
- Strong Backdoors for Default Logic (Q2818000) (← links)
- The Normalized Autocorrelation Length of Random Max $$r$$ -Sat Converges in Probability to $$(1-1/2^r)/r$$ (Q2818001) (← links)
- Tight Upper Bound on Splitting by Linear Combinations for Pigeonhole Principle (Q2818003) (← links)
- Extreme Cases in SAT Problems (Q2818004) (← links)
- Improved Static Symmetry Breaking for SAT (Q2818005) (← links)
- Learning Rate Based Branching Heuristic for SAT Solvers (Q2818006) (← links)
- On the Hardness of SAT with Community Structure (Q2818008) (← links)
- Trade-offs Between Time and Memory in a Tighter Model of CDCL SAT Solvers (Q2818010) (← links)
- A SAT Approach to Branchwidth (Q2818011) (← links)
- Computing Maximum Unavoidable Subgraphs Using SAT Solvers (Q2818013) (← links)
- Heuristic NPN Classification for Large Functions Using AIGs and LEXSAT (Q2818016) (← links)
- Solving and Verifying the Boolean Pythagorean Triples Problem via Cube-and-Conquer (Q2818017) (← links)
- Deciding Bit-Vector Formulas with mcSAT (Q2818018) (← links)
- Solving Quantified Bit-Vector Formulas Using Binary Decision Diagrams (Q2818019) (← links)
- Speeding up the Constraint-Based Method in Difference Logic (Q2818021) (← links)
- Synthesis of Domain Specific CNF Encoders for Bit-Vector Solvers (Q2818024) (← links)
- Finding Finite Models in Multi-sorted First-Order Logic (Q2818025) (← links)
- MCS Extraction with Sublinear Oracle Queries (Q2818026) (← links)
- Predicate Elimination for Preprocessing in First-Order Theorem Proving (Q2818027) (← links)
- Incremental Determinization (Q2818028) (← links)
- Non-prenex QBF Solving Using Abstraction (Q2818029) (← links)
- On Q-Resolution and CDCL QBF Solving (Q2818030) (← links)
- On Stronger Calculi for QBFs (Q2818031) (← links)
- Q-Resolution with Generalized Axioms (Q2818032) (← links)
- 2QBF: Challenges and Solutions (Q2818033) (← links)
- Dependency Schemes for DQBF (Q2818034) (← links)
- Lifting QBF Resolution Calculi to DQBF (Q2818035) (← links)
- Long Distance Q-Resolution with Dependency Schemes (Q2818036) (← links)
- BEACON: An Efficient SAT-Based Tool for Debugging $${\mathcal {EL}}{^+}$$ Ontologies (Q2818038) (← links)
- HordeQBF: A Modular and Massively Parallel QBF Solver (Q2818039) (← links)
- LMHS: A SAT-IP Hybrid MaxSAT Solver (Q2818041) (← links)
- OpenSMT2: An SMT Solver for Multi-core and Cloud Computing (Q2818042) (← links)
- SpyBug: Automated Bug Detection in the Configuration Space of SAT Solvers (Q2818043) (← links)
