yusuke1997/dblp-id-title huggingface dataset:
BEACON: An Efficient SAT-Based Tool for Debugging EL ^+ Ontologies
Satisfiability Solving Meets Evolutionary Optimisation in Designing Approximate Circuits
Uncovering and Classifying Bugs in MaxSAT Solvers through Fuzzing and Delta Debugging
A Scalable Method for Solving Satisfiability of Integer Linear Arithmetic Logic
A Study of Pure Random Walk on Random Satisfiability Problems with "Physical" Methods
Two Techniques for Minimizing Resolution Proofs
On CDCL-Based Proof Systems with the Ordered Decision Strategy
On Variables with Few Occurrences in Conjunctive Normal Forms
Logical Cryptanalysis with WDSat
(I Can Get) Satisfaction: Preference-Based Scheduling for Concert-Goers at Multi-venue Music Festivals
CrystalBall: Gazing in the Black Box of SAT Solving
Fast Sampling of Perfectly Uniform Satisfying Assignments
Weighted Model Counting Without Parameter Variables
Core-Guided Linear Programming-Based Maximum Satisfiability
Henkin Quantifiers and Boolean Formulae
Incrementally Computing Minimal Unsatisfiable Cores of QBFs via a Clause Group Solver API
Simplifying Pseudo-Boolean Constraints in Residual Number Systems
SAT Preprocessors and Symmetry
On Efficient Computation of Variable MUSes
Encoding CNFs to Empower Component Analysis
CadiBack: Extracting Backbones with CaDiCaL
Competitive Sorter-based Encoding of PB-Constraints into SAT
A Benders Decomposition Approach to Deciding Modular Linear Integer Arithmetic
eSLIM: Circuit Minimization with SAT Based Local Improvement
Satisfiability Checking of Non-clausal Formulas Using General Matings
Solving Quantified Bit-Vector Formulas Using Binary Decision Diagrams
Encoding Global Unobservability for Efficient Translation to SAT
Perfect Hashing and CNF Encodings of Cardinality Constraints
Turing's Computable Real Numbers and Why They Are Still Important Today
A Constraint Satisfaction Approach for Programmable Logic Detailed Placement
An Ising Model Inspired Extension of the Product-Based MP Framework for SAT
Verifying the On-Line Help System of SIEMENS Magnetic Resonance Tomographs using SAT (Extended Abstract)
Predicting SAT Solver Performance on Heterogeneous Hardware
QRP+Gen: A Framework for Checking Q-Resolution Proofs with Generalized Axioms
Resolution-Based Certificate Extraction for QBF - (Tool Presentation)
Guiding SAT Diagnosis with Tree Decompositions
Evaluating CDCL Variable Scoring Schemes
A Non-prenex, Non-clausal QBF Solver with Game-State Learning
Hash-Based Preprocessing and Inprocessing Techniques in SAT Solvers
Two flavors of DRAT
Relaxed DPLL Search for MaxSAT
Incremental Compilation-to-SAT Procedures
On Propositional QBF Expansions and Q-Resolution
Designing Scalable Parallel SAT Solvers
On the Hardness of SAT with Community Structure
LearnSAT: A SAT Solver for Education
c-sat: A Parallel SAT Solver for Clusters
Resolution and Expressiveness of Subclasses of Quantified Boolean Formulas and Circuits
Local Search for Very Large SAT Problems
A New Bound for an NP-Hard Subclass of 3-SAT Using Backdoors
Finding Guaranteed MUSes Fast
From Parallel SAT to Distributed SAT
SAT Encodings for the Car Sequencing Problem
Modern Cooperative Parallel SAT Solving
Strong Backdoors for Default Logic
New CNF Features and Formula Classification
Approximating Highly Satisfiable Random 2-SAT
A Distribution Method for Solving SAT in Grids
Constraint Metrics for Local Search
Optimizations for Compiling Declarative Models into Boolean Formulas
Zero-One Designs Produce Small Hard SAT Instances
Applications of SAT Solvers to Cryptanalysis of Hash Functions
Solving MaxSAT and #SAT on Structured CNF Formulas
Symmetry and Satisfiability: An Update
Nonlinear Pseudo-Boolean Optimization: Relaxation or Propagation?
Scarab: A Rapid Prototyping Tool for SAT-Based Constraint Programming Systems
An Application of SAT Solvers in Integer Programming Games
MedleySolver: Online SMT Algorithm Selection
Satisfiability Certificates Verifiable in Subexponential Time
The Order Encoding: From Tractable CSP to Tractable SAT
Reducing Chaos in SAT-Like Search: Finding Solutions Close to a Given One
Experiments with Reduction Finding
Tight Bounds for Tseitin Formulas
A Theoretical Analysis of Search in GSAT
On-the-Fly Clause Improvement
A Preprocessor for Max-SAT Solvers
Faster LRAT Checking Than Solving with CaDiCaL
A SAT Solver's Opinion on the Erdős-Faber-Lovász Conjecture
A Lower Bound on DNNF Encodings of Pseudo-Boolean Constraints
Dynamic Scoring Functions with Variable Expressions: New SLS Methods for Solving SAT
Resolve and Expand
Community-Based Partitioning for MaxSAT Solving
Early Conflict Detection Based BCP for SAT Solving
Conditional Lower Bounds for Failed Literals and Related Techniques
Solving Non-uniform Planted and Filtered Random SAT Formulas Greedily
Abstraction-Based Algorithm for 2QBF
Community Branching for Parallel Portfolio SAT Solvers
Approximately Propagation Complete and Conflict Propagating Constraint Encodings
Solving Non-clausal Formulas with DPLL search
Towards Improving the Resource Usage of SAT-solvers
QBF Encoding of Generalized Tic-Tac-Toe
Simple but Hard Mixed Horn Formulas
Online Estimation of SAT Solving Runtime
Hierarchical Stochastic SAT and Quality Assessment of Logic Locking
The Complexity of Theorem Proving in Autoepistemic Logic
Satisfying versus Falsifying in Local Search for Satisfiability - (Poster Presentation)
Faster Exact Solving of SAT Formulae with a Low Number of Occurrences per Variable
Speedup Techniques Utilized in Modern SAT Solvers
Non-Model-Based Algorithm Portfolios for SAT
Satisfiability and The Art of Computer Programming
A Fast Algorithm for SAT in Terms of Formula Length
Exact MinSAT Solving
FPGA Logic Synthesis Using Quantified Boolean Satisfiability
Threshold Behaviour of WalkSAT and Focused Metropolis Search on Random 3-Satisfiability
Linear Time Algorithms for Some Not-All-Equal Satisfiability Problems
Azucar: A SAT-Based CSP Solver Using Compact Order Encoding - (Tool Presentation)
SAT-Based Local Improvement for Finding Tree Decompositions of Small Width
Strong Backdoors to Nested Satisfiability
On Compiling CNFs into Structured Deterministic DNNFs
Speeding up MUS Extraction with Preprocessing and Chunking
Dynamic Polynomial Watchdog Encoding for Solving Weighted MaxSAT
Factoring Out Assumptions to Speed Up MUS Extraction
A Branching Heuristics for Quantified Renamable Horn Formulas
Satisfiability and Computing van der Waerden Numbers
Chinese Remainder Encoding for Hamiltonian Cycles
The Seventh QBF Solvers Evaluation (QBFEVAL'10)
Search-Space Partitioning for Parallelizing SMT Solvers
Augmenting Clause Learning with Implied Literals - (Poster Presentation)
Branch and Bound for Boolean Optimization and the Generation of Optimality Certificates
Hypergraph Reductions and Satisfiability Problems
Between SAT and UNSAT: The Fundamental Difference in CDCL SAT
An Improved Separation of Regular Resolution from Pool Resolution and Clause Learning
SAT: Past and Future
Sequential Encodings from Max-CSP into Partial Max-SAT
An Efficient Method for Solving UNSAT 3-SAT and Similar Instances via Static Decomposition - (Poster Presentation)
Efficient CNF Simplification Based on Binary Implication Graphs
Equivalence Checking of Circuits with Parameterized Specifications
SAT-Based Generation of Planar Graphs
A New Set of Algebraic Benchmark Problems for SAT Solvers
Equivalence Between Systems Stronger Than Resolution
Satisfiability Threshold of the Skewed Random k-SAT
On Solving MaxSAT Through SAT
An Analysis of Core-Guided Maximum Satisfiability Solvers Using Linear Programming
Characterizing Propagation Methods for Boolean Satisfiability
Algorithms for Weighted Boolean Optimization
A Problem Meta-Data Library for Research in SAT
A Comparison of SAT Encodings for Acyclicity of Directed Graphs
In Between Resolution and Cutting Planes: A Study of Proof Systems for Pseudo-Boolean SAT Solving
LMHS: A SAT-IP Hybrid MaxSAT Solver
Translating Pseudo-Boolean Constraints into CNF
Efficient MUS Enumeration of Horn Formulae with Applications to Axiom Pinpointing
Hard Satisfiable Formulas for Splittings by Linear Combinations
Local Restarts
From Propositional Satisfiability to Satisfiability Modulo Theories
Theory and Applications of Satisfiability Testing - SAT 2013 - 16th International Conference, Helsinki, Finland, July 8-12, 2013. Proceedings
Exact Algorithms and Complexity
Connecting SAT Algorithms and Complexity Lower Bounds
Evaluating Component Solver Contributions to Portfolio-Based Algorithm Selectors
Anytime Approximate Formal Feature Attribution
Improved Single Pass Algorithms for Resolution Proof Reduction - (Poster Presentation)
DRAT-based Bit-Vector Proofs in CVC4
Bounded Model Checking with QBF
Searching for Autarkies to Trim Unsatisfiable Clause Sets
Fast DQBF Refutation
A Faster Algorithm for Propositional Model Counting Parameterized by Incidence Treewidth
Fifty-Five Solvers in Vancouver: The SAT 2004 Competition
Game-SAT: A Preliminary Report
Automated Generation of Simplification Rules for SAT and MAXSAT
Community Structure Inspired Algorithms for SAT and #SAT
Weighted Model Counting with Twin-Width
SAT-Metropolis: Combining Markov Chain Monte Carlo with SAT/SMT Sampling
Efficient Term-ITE Conversion for Satisfiability Modulo Theories
Generalizing Core-Guided Max-SAT
Centrality-Based Improvements to CDCL Heuristics
The Combinatorics of Conflicts between Clauses
New Encodings of Pseudo-Boolean Constraints into CNF
Generating Diverse Solutions in SAT
SAT, UNSAT and Coloring
Lazy Reimplication in Chronological Backtracking
Random Walk with Continuously Smoothed Variable Weights
Careful Ranking of Multiple Solvers with Timeouts and Ties
On the Performance of Deep Generative Models of Realistic SAT Instances
Efficient Clause Learning for Quantified Boolean Formulas via QBF Pseudo Unit Propagation
Minimizing Learned Clauses
A Random Constraint Satisfaction Problem That Seems Hard for DPLL
On Computing k-CNF Formula Properties
2QBF: Challenges and Solutions
Variable Dependency in Local Search: Prevention Is Better Than Cure
Incremental Encoding of Pseudo-Boolean Goal Functions Based on Comparator Networks
OptiLog: A Framework for SAT-based Systems
Revisiting Clause Exchange in Parallel SAT Solving
RustSAT: A Library for SAT Solving in Rust
On Computing Minimum Unsatisfiable Cores
Mining Backbone Literals in Incremental SAT - A New Kind of Incremental Data
Depth-Optimal Quantum Layout Synthesis as SAT
Implementing Survey Propagation on Graphics Processing Units
Bit-Precise Reasoning with Parametric Bit-Vectors
28th International Conference on Theory and Applications of Satisfiability Testing, SAT 2025, Glasgow, Scotland, August 12-15, 2025
Extending SAT Solvers to Cryptographic Problems
A Note on Satisfying Truth-Value Assignments of Boolean Formulas
QBF Reasoning on Real-World Instances
Towards a SAT Encoding for Quantum Circuits: A Journey From Classical Circuits to Clifford Circuits and Beyond
The GRAT Tool Chain - Efficient (UN)SAT Certificate Checking with Formal Correctness Guarantees
On the Resolution Complexity of Graph Non-isomorphism
UBCSAT: An Implementation and Experimentation Environment for SLS Algorithms for SAT and MAX-SAT
Combining Cubic Dynamical Solvers with Make/Break Heuristics to Solve SAT
OptiLog V2: Model, Solve, Tune and Run
Preprocessing for DQBF
Random Instances of W[2]-Complete Problems: Thresholds, Complexity, and Algorithms
Trail Saving on Backtrack
Clause Form Conversions for Boolean Circuits
Optimal Layout Synthesis for Deep Quantum Circuits on NISQ Processors with 100+ Qubits
On the Parallel Parameterized Complexity of MaxSAT Variants
SATGraf: Visualizing the Evolution of SAT Formula Structure in Solvers
A Scalable Algorithm for Minimal Unsatisfiable Core Extraction
Satsuma: Structure-Based Symmetry Breaking in SAT
Finding Efficient Circuits for Ensemble Computation
Single-Solver Algorithms for 2QBF - (Poster Presentation)
Determinization of Resolution by an Algorithm Operating on Complete Assignments
Theory and Applications of Satisfiability Testing, 7th International Conference, SAT 2004, Vancouver, BC, Canada, May 10-13, 2004, Revised Selected Papers
Scalable SAT Solving in the Cloud
Problem Partitioning via Proof Prefixes
CCAnr: A Configuration Checking Based Local Search Solver for Non-random Satisfiability
SAT-Based Formula Simplification
Satisfiability with Exponential Families
Inversion Attacks on Secure Hash Functions Using satSolvers
Empirical Study of the Anatomy of Modern Sat Solvers
26th International Conference on Theory and Applications of Satisfiability Testing, SAT 2023, Alghero, Italy, July 4-8, 2023
On the Probabilistic Approach to the Random Satisfiability Problem
Local Search for Unsatisfiability
On the Community Structure of Bounded Model Checking SAT Problems
SAT(ID): Satisfiability of Propositional Logic Extended with Inductive Definitions
Phase Transitions in Knowledge Compilation: An Experimental Study
CirCUs: A Hybrid Satisfiability Solver
Approximation Algorithm for Random MAX- k SAT
Leveraging GPUs for Effective Clause Sharing in Parallel SAT Solving
NiVER: Non Increasing Variable Elimination Resolution for Preprocessing SAT instances
Towards Practical First-Order Model Counting
Sorting Parity Encodings by Reusing Variables
The Community Structure of SAT Formulas
Local Search for Fast Matrix Multiplication
On the Boolean Connectivity Problem for Horn Relations
Theory Refinement for Program Verification
Classes of Hard Formulas for QBF Resolution
Fast and Flexible Probabilistic Model Counting
Local and Global Complete Solution Learning Methods for QBF
Computing Resolution-Path Dependencies in Linear Time ,
Reencoding Unique Literal Clauses
Efficient Circuit to CNF Conversion
Learning Shorter Redundant Clauses in SDCL Using MaxSAT
On Reducing Maximum Independent Set to Minimum Satisfiability
On Super Strong ETH
Analysis of Portfolio-Style Parallel SAT Solving on Current Multi-Core Architectures
Anytime and Exact Search for Planning Problems: How to Explore a DP-based State Transition Graph with A*, CP and LS? (Invited Talk)
Reasoning About Strong Inconsistency in ASP
Prioritised Unit Propagation by Partitioning the Watch Lists
Resolution Tunnels for Improved SAT Solver Performance
Computing Maximal Autarkies with Few and Simple Oracle Queries
Efficient Local Search for Pseudo Boolean Optimization
SAT-Based Rigorous Explanations for Decision Lists
QRATPre+: Effective QBF Preprocessing via Strong Redundancy Properties
A SAT Based Scheduler for Tournament Schedules
Trade-offs Between Time and Memory in a Tighter Model of CDCL SAT Solvers
Should Decisions in QCDCL Follow Prefix Order?
Solving Over-Constrained Problems with SAT Technology
Functional Treewidth: Bounding Complexity in the Presence of Functional Dependencies
On Some Aspects of Mixed Horn Formulas
Improved Conflict-Clause Minimization Leads to Improved Propositional Proof Traces
Categorisation of Clauses in Conjunctive Normal Forms: Minimally Unsatisfiable Sub-clause-sets and the Lean Kernel
QMusExt: A Minimal (Un)satisfiable Core Extractor for Quantified Boolean Formulas
Typical-case complexity and the SAT competitions
Satisfiability of Acyclic and almost Acyclic CNF Formulas (II)
SatX10: A Scalable Plug&Play Parallel SAT Framework - (Tool Presentation)
Preliminary Report on Input Cover Number as a Metric for Propositional Resolution Proofs
Proof Complexity of Propositional Model Counting
Challenges in the QBF Arena: the SAT'03 Evaluation of QBF Solvers
Proof Complexity and the Kneser-Lovász Theorem
Exploiting Resolution-Based Representations for MaxSAT Solving
Applying Logic Synthesis for Speeding Up SAT
POS-10. Pragmatics of SAT, Edinburgh, UK, July 10, 2010
A Local Search SAT Solver Using an Effective Switching Strategy and an Efficient Unit Propagation
Using DPLL for Efficient OBDD Construction
Learning Rate Based Branching Heuristic for SAT Solvers
Dealing with Symmetries in Quantified Boolean Formulas
SAT in Bioinformatics: Making the Case with Haplotype Inference
Solving QBF with Counterexample Guided Refinement
On the Relative Merits of Simple Local Search Methods for the MAX-SAT Problem
PyDGGA: Distributed GGA for Automatic Configuration
Sensor Deployment for Failure Diagnosis in Networked Aerial Robots: A Satisfiability-Based Approach
Certified DQBF Solving by Definition Extraction
Effective Use of SMT Solvers for Program Equivalence Checking Through Invariant-Sketching and Query-Decomposition
Creating Industrial-Like SAT Instances by Clustering and Reconstruction - (Poster Presentation)
Local Consistencies in SAT
A Lower Bound on CNF Encodings of the At-Most-One Constraint
Matrix Multiplication: Verifying Strong Uniquely Solvable Puzzles
SCSat: A Soft Constraint Guided SAT Solver
Complexity and Algorithms for Well-Structured k-SAT Instances
SAT Modulo the Theory of Linear Arithmetic: Exact, Inexact and Commercial Solvers
Satisfiability Threshold for Power Law Random 2-SAT in Configuration Model
SMT-Aided Combinatorial Materials Discovery
iDQ: Instantiation-Based DQBF Solving
Constructing SAT Filters with a Quantum Annealer
Using Problem Structure for Efficient Clause Learning
Combining Component Caching and Clause Learning for Effective Model Counting
On CNF Conversion for Disjoint SAT Enumeration
Proceedings of Pragmatics of SAT 2015, Austin, Texas, USA, September 23, 2015 / Pragmatics of SAT 2018, Oxford, UK, July 7, 2018
On Linear CNF Formulas
Deep Cooperation of CDCL and Local Search for SAT
Bounded Universal Expansion for Preprocessing QBF
Variable Ordering for Efficient SAT Search by Analyzing Constraint-Variable Dependencies
Solving Quantified Boolean Formulas with Circuit Observability Don't Cares
DRAT-trim: Efficient Checking and Trimming Using Expressive Clausal Proofs
An Empirical Study of Branching Heuristics Through the Lens of Global Learning Rate
Positional Games and QBF: The Corrective Encoding
Effective Preprocessing with Hyper-Resolution and Equality Reduction
Efficient SAT-Based Minimal Model Generation Methods for Modal Logic S5
Redundancy Rules for MaxSAT
CNOT-Optimal Clifford Synthesis as SAT
Mapping Problems with Finite-Domain Variables to Problems with Boolean Variables
Improving Glucose for Incremental SAT Solving with Assumptions: Application to MUS Extraction
Improved Algorithms for Sparse MAX-SAT and MAX-k-CSP
The Normalized Autocorrelation Length of Random Max r -Sat Converges in Probability to (1-1/2^r)/r
Exploiting Historical Relationships of Clauses and Variables in Local Search for Satisfiability - (Poster Presentation)
Efficient All-UIP Learned Clause Minimization
Knowledge Compilation Languages as Proof Systems
Fixed-Parameter Tractable Reductions to SAT
Speeding up Quantified Bit-Vector SMT Solvers by Bit-Width Reductions and Extensions
Non Uniform Selection of Solutions for Upper Bounding the 3-SAT Threshold
ProCount: Weighted Projected Model Counting with Graded Project-Join Trees
Assignment Stack Shrinking
Polynomial Time SAT Decision, Hypergraph Transversals and the Hermitian Rank
Generalized Property Directed Reachability
Reducing Bit-Vector Polynomials to SAT Using Gröbner Bases
ASPQ: An ASP-Based 2QBF Solver
Model Counting Using the Inclusion-Exclusion Principle
Dependency Quantified Horn Formulas: Models and Complexity
The Effect of Scrambling CNFs
Detecting Cardinality Constraints in CNF
Green-Tao Numbers and SAT
Dynamic Symmetry Breaking by Simulating Zykov Contraction
A Symbolic Search Based Approach for Quantified Boolean Formulas
Beyond CNF: A Circuit-Based QBF Solver
Minimal False Quantified Boolean Formulas
On Applying Cutting Planes in DLL-Based Algorithms for Pseudo-Boolean Optimization
Assessing Heuristic Machine Learning Explanations with Model Counting
Effective Auxiliary Variables via Structured Reencoding
Dominant Controllability Check Using QBF-Solver and Netlist Optimizer
A Complete Calculus for Max-SAT
Dolius: A Distributed Parallel SAT Solving Framework
A Rank Lower Bound for Cutting Planes Proofs of Ramsey's Theorem
Automatic Extraction of Functional Dependencies
Backdoor Treewidth for SAT
Visualizing the Internal Structure of SAT Instances (Preliminary Report)
Improving Reduction Techniques in Pseudo-Boolean Conflict Analysis
Abstract Cores in Implicit Hitting Set MaxSat Solving
Algorithms for Satisfiability Using Independent Sets of Variables
Theory and Applications of Satisfiability Testing - SAT 2020 - 23rd International Conference, Alghero, Italy, July 3-10, 2020, Proceedings
Quantum Circuit Mapping Based on Incremental and Parallel SAT Solving
Extended Resolution Proofs for Symbolic SAT Solving with Quantification
Quantified CDCL with Universal Resolution
On Boolean Models for Quantified Boolean Horn Formulas
Speeding Up Assumption-Based SAT
Theory and Applications of Satisfiability Testing - SAT 2016 - 19th International Conference, Bordeaux, France, July 5-8, 2016, Proceedings
The Interaction Between Inference and Branching Heuristics
The QBF Solver AIGSolve
UpMax: User Partitioning for MaxSAT
Symbolic Conflict Analysis in Pseudo-Boolean Optimization
New Width Parameters for Model Counting
Width-Based Restart Policies for Clause-Learning Satisfiability Solvers
Cost-Effective Hyper-Resolution for Preprocessing CNF Formulas
A Comparative Study of 2QBF Algorithms
Derandomization of PPSZ for Unique- k -SAT
Enumerating All Solutions of a Boolean CSP by Non-decreasing Weight
Interpolant Strength Revisited
Algorithms Transcending the SAT-Symmetry Interface
Verifying Binarized Neural Networks by Angluin-Style Learning
A Max-SAT Inference-Based Pre-processing for Max-Clique
A Resolution-Style Proof System for DQBF
A Comprehensive Study of k-Portfolios of Recent SAT Solvers
On Davis-Putnam Reductions for Minimally Unsatisfiable Clause-Sets
Theory and Applications of Satisfiability Testing - SAT 2018 - 21st International Conference, SAT 2018, Held as Part of the Federated Logic Conference, FloC 2018, Oxford, UK, July 9-12, 2018, Proceedings
On Improving MUS Extraction Algorithms
Reducing Acceptance Marks in Emerson-Lei Automata by QBF Solving
SAT Based Predicate Abstraction for Hardware Verification
Enumerating All Boolean Matches
Using Term Rewriting to Solve Bit-Vector Arithmetic Problems - (Poster Presentation)
Dynamic Programming-based QBF Solving
An Empirical Study of Optimal Noise and Runtime Distributions in Local Search
Pedant: A Certifying DQBF Solver
Between Restarts and Backjumps
Concurrent Cube-and-Conquer - (Poster Presentation)
Towards a Better Understanding of the Functionality of a Conflict-Driven SAT Solver
Post Mortem Analysis of SAT Solver Proofs
Exploiting Circuit Representations in QBF Solving
Smt-Switch: A Solver-Agnostic C++ API for SMT Solving
On Fixed-Parameter Tractable Parameterizations of SAT
Using Rewarding Mechanisms for Improving Branching Heuristics
Clause-Learning Algorithms with Many Restarts and Bounded-Width Resolution
QBF Merge Resolution Is Powerful but Unnatural
LS-DTKMS: A Local Search Algorithm for Diversified Top-k MaxSAT Problem
Guiding High-Performance SAT Solvers with Unsat-Core Predictions
Resolution and Pebbling Games
Applying UCT to Boolean Satisfiability
How Many Conflicts Does It Need to Be Unsatisfiable?
An Adaptive Prefix-Assignment Technique for Symmetry Reduction
Rewriting (Dependency-)Quantified 2-CNF with Arbitrary Free Literals into Existential 2-HORN
On the Complexity of k-DQBF
SAT-Based Encodings for Optimal Decision Trees with Explicit Paths
Solving Multi-objective Pseudo-Boolean Problems
QBF Modeling: Exploiting Player Symmetry for Simplicity and Efficiency
Theory and Applications of Satisfiability Testing - SAT 2011 - 14th International Conference, SAT 2011, Ann Arbor, MI, USA, June 19-22, 2011. Proceedings
Improved Static Symmetry Breaking for SAT
Enhancing MaxSAT Local Search via a Unified Soft Clause Weighting Scheme
A SAT-Based System for Consistent Query Answering
Zchaff2004: An Efficient SAT Solver
Parameterized Complexity of DPLL Search Procedures
Theory and Applications of Satisfiability Testing, 8th International Conference, SAT 2005, St. Andrews, UK, June 19-23, 2005, Proceedings
Preprocessing in Incremental SAT
Integrating Dependency Schemes in Search-Based QBF Solvers
VARSAT: Integrating Novel Probabilistic Inference Techniques with DPLL Search
Proof Complexity of QBF Symmetry Recomputation