## Stem dpll$ (all stems)

### 28 papers:

- CAV-2014-LiangRTBD #formal method #regular expression #string
- A DPLL(T) Theory Solver for a Theory of Strings and Regular Expressions (TL, AR, CT, CB, MD), pp. 646–662.
- VMCAI-2013-BrainDHGK #abstract interpretation
- An Abstract Interpretation of DPLL(T) (MB, VD, LH, AG, DK), pp. 455–475.
- SAT-2012-AchlioptasM #algorithm #bound #exponential #random #satisfiability
- Exponential Lower Bounds for DPLL Algorithms on Satisfiable Random 3-CNF Formulas (DA, RMM), pp. 327–340.
- SAT-2011-BeyersdorffGL #complexity
- Parameterized Complexity of DPLL Search Procedures (OB, NG, ML), pp. 5–18.
- SAT-2011-IgnatievS #encryption
- DPLL+ROBDD Derivation Applied to Inversion of Some Cryptographic Functions (AI, AS), pp. 76–89.
- DAC-2009-JainC #graph #performance #satisfiability #using
- Efficient SAT solving for non-clausal formulas using DPLL, graphs, and watched cuts (HJ, EMC), pp. 563–568.
- CADE-2009-BonacinaLM #on the #proving #satisfiability #theorem proving
- On Deciding Satisfiability by DPLL(G+T) and Unsound Theorem Proving (MPB, CL, LMdM), pp. 35–50.
- CAV-2009-McMillanKS #logic
- Generalizing DPLL to Richer Logics (KLM, AK, MS), pp. 462–476.
- SAT-2009-BalintHG #approach #novel #problem #satisfiability
- A Novel Approach to Combine a SLS- and a DPLL-Solver for the Satisfiability Problem (AB, MH, OG), pp. 284–297.
- SAT-2009-HsuM #named #novel #probability
- VARSAT: Integrating Novel Probabilistic Inference Techniques with DPLL Search (EIH, SAM), pp. 377–390.
- SAT-2009-KrocSS #satisfiability
- Relaxed DPLL Search for MaxSAT (LK, AS, BS), pp. 447–452.
- SAT-2009-SinzI #heuristic #problem
- Problem-Sensitive Restart Heuristics for the DPLL Procedure (CS, MI), pp. 356–362.
- IJCAR-2008-MouraB #effectiveness #logic #set #using
- Deciding Effectively Propositional Logic Using DPLL and Substitution Sets (LMdM, NB), pp. 410–425.
- IJCAR-2008-MouraB08a
- Engineering DPLL(T) + Saturation (LMdM, NB), pp. 475–490.
- DAC-2007-DengBWYZ #named #performance #satisfiability #using
- EHSAT: An Efficient RTL Satisfiability Solver Using an Extended DPLL Procedure (SD, JB, WW, XY, YZ), pp. 588–593.
- CAV-2006-DutertreM #performance
- A Fast Linear-Arithmetic Solver for DPLL(T) (BD, LMdM), pp. 81–94.
- SAT-2006-CottonM #constraints #difference #flexibility #performance
- Fast and Flexible Difference Constraint Propagation for DPLL(T) (SC, OM), pp. 170–183.
- SAT-J-2004-HuangD05 #performance #using
- Using DPLL for Efficient OBDD Construction (JH, AD), pp. 157–172.
- CAV-2005-NieuwenhuisO #difference #logic
- DPLL(T) with Exhaustive Theory Propagation and Its Application to Difference Logic (RN, AO), pp. 321–334.
- DATE-v1-2004-WedlerSK #reasoning #satisfiability
- Arithmetic Reasoning in DPLL-Based SAT Solving (MW, DS, WK), pp. 30–35.
- ICALP-2004-AlekhnovichHI #algorithm #bound #exponential #satisfiability
- Exponential Lower Bounds for the Running Time of DPLL Algorithms on Satisfiable Formulas (MA, EAH, DI), pp. 84–96.
- CAV-2004-GanzingerHNOT #performance
- DPLL( T): Fast Decision Procedures (HG, GH, RN, AO, CT), pp. 175–188.
- SAT-2004-Connamacher #constraints #problem #random
- A Random Constraint Satisfaction Problem That Seems Hard for DPLL (HSC), pp. 3–11.
- SAT-2004-HuangD #performance #using
- Using DPLL for Efficient OBDD Construction (JH, AD), pp. 127–136.
- SAT-2004-ThiffaultBW
- Solving Non-clausal Formulas with DPLL search (CT, FB, TW), pp. 147–156.
- SAT-2002-DrakeFW #satisfiability
- Adding resolution to the DPLL procedure for satisfiability (LD, AF, TW), p. 46.
- SAT-2001-LagoudakisL #branch #learning #satisfiability
- Learning to Select Branching Rules in the DPLL Procedure for Satisfiability (MGL, MLL), pp. 344–359.
- KR-2000-Massacci #first-order #reduction
- Reduction rules and universal variables for first order tableaux and DPLL (FM), pp. 186–197.