On the Hardness of SAT with Community Structure ( abstract )

Trade-offs Between Time and Memory in a Tighter Model of CDCL SAT Solvers ( abstract )

On stronger calculi for QBFs ( abstract )

On Q-Resolution and DPLL QBF Solving ( abstract )

Q-Resolution with Generalized Axioms ( abstract )

Satisfiability Testing, a Disruptive Technology in Program Verification ( abstract )

A SAT Approach to Branchwidth ( abstract )

Improved static symmetry breaking for SAT ( abstract )

Learning Rate Based Branching Heuristic for SAT Solvers ( abstract )

Parameterized Compilation Lower Bounds for Restricted CNF-formulas ( abstract )

Solution-Graphs of Boolean Formulas and Isomorphism ( abstract )

Strong Backdoors for Default Logic ( abstract )

Heuristic NPN classification for large functions using AIGs and LEXSAT ( abstract )

Coping with Inconsistent Databases: Semantics, Algorithms, and Complexity ( abstract )

Speeding Up the Constraint-Based Method in Difference Logic ( abstract )

Synthesis of Domain Specific CNF Encoders for Bit-Vector Solvers ( abstract )

Incremental Determinization ( abstract )

Non-prenex QBF Solving using Abstraction ( abstract )

2QBF: challenges and solutions ( abstract )

Dependency Schemes for DQBF ( abstract )

Lifting QBF Resolution Calculi to DQBF ( abstract )

Long Distance Q-Resolution with Dependency Schemes ( abstract )

Satisfiability via Smooth Pictures ( abstract )

The Normalized Autocorrelation Length of Random Max r-Sat Converges in Probability to (1-1/2^r)/r ( abstract )

Tight Upper Bound on Splitting by Linear Combinations for Pigeonhole Principle ( abstract )

From SAT to ASP and back! ( abstract )

Extreme Cases in SAT Problems ( abstract )

Predicate elimination for preprocessing in first-order theorem proving ( abstract )

Finding Finite Models in Multi-Sorted First Order Logic ( abstract )

MCS Extraction with Sublinear Oracle Calls ( abstract )

Presentation of the company Mindi ( abstract )

Solving and Verifying the boolean Pythagorean Triples problem via Cube-and-Conquer ( abstract )

Computing Maximum Unavoidable Subgraphs using SAT Solvers ( abstract )

BEACON: An Efficient SAT-Based Tool for Debugging EL+ Ontologies ( abstract )

OpenSMT2: An SMT Solver for Multi-Core and Cloud Computing ( abstract )

HordeQBF: A Modular and Massively Parallel QBF Solver ( abstract )

LMHS: A SAT-IP Hybrid MaxSAT Solver ( abstract )

SpyBug: Automated Bug Detection in the Configuration Space of SAT Solvers ( abstract )

Deciding Bit-Vector Formulas with mcSAT ( abstract )

Solving Quantified Bit-Vector Formulas Using Binary Decision Diagrams ( abstract )