Stem sat$ (all stems)

415 papers:

TACAS-2015-BransenBCD #attribute grammar #order #scheduling #using

Linearly Ordered Attribute Grammar Scheduling Using SAT-Solving (JB, LTvB, KC, AD), pp. 289–303.

TACAS-2015-ChakrabortyFMSV #generative #on the #parallel #satisfiability #scalability

On Parallel Scalable Uniform SAT Witness Generation (SC, DJF, KSM, SAS, MYV), pp. 304–319.

AdaEurope-2015-ZamoranoG #analysis #scheduling

Schedulability Analysis of PWM Tasks for the UPMSat-2 ADCS (JZ, JG), pp. 85–99.

OOPSLA-2015-DemskyL #model checking #named

SATCheck: SAT-directed stateless model checking for SC and TSO (BD, PL), pp. 20–36.

SAC-2015-TodaT #performance #satisfiability

BDD construction for all solutions SAT and efficient caching mechanism (TT, KT), pp. 1880–1886.

ICSE-v1-2015-Ben-DavidSAB #model checking #product line #requirements #satisfiability #using

Symbolic Model Checking of Product-Line Requirements Using SAT-Based Methods (SBD, BS, JMA, SB), pp. 189–199.

SPLC-2015-LiangGCR #analysis #feature model #modelling #satisfiability #scalability

SAT-based analysis of large real-world feature models is easy (JH(L, VG, KC, VR), pp. 91–100.

CADE-2015-ZulkoskiGC #algebra #named #satisfiability

MathCheck: A Math Assistant via a Combination of Computer Algebra Systems and SAT Solvers (EZ, VG, KC), pp. 607–622.

CAV-2015-SebastianiT #modulo theories #named #optimisation

OptiMathSAT: A Tool for Optimization Modulo Theories (RS, PT), pp. 447–454.

ICST-2015-YamadaKACOB #combinator #incremental #optimisation #satisfiability #testing

Optimization of Combinatorial Testing by Incremental SAT Solving (AY, TK, CA, EHC, YO, AB), pp. 1–10.

SAT-2015-AzizCMS

#∃SAT: Projected Model Counting (RAA, GC, CJM, PJS), pp. 121–137.

SAT-2015-BalyoSS #named #parallel #satisfiability

HordeSat: A Massively Parallel Portfolio SAT Solver (TB, PS, CS), pp. 156–172.

SAT-2015-BurchardSB #parallel #satisfiability

Laissez-Faire Caching for Parallel #SAT Solving (JB, TS, BB), pp. 46–61.

SAT-2015-ChenS #algorithm #satisfiability

Improved Algorithms for Sparse MAX-SAT and MAX-k-CSP (RC, RS), pp. 33–45.

SAT-2015-DouglassKR #quantum #satisfiability

Constructing SAT Filters with a Quantum Annealer (AD, ADK, JR), pp. 104–120.

SAT-2015-FalknerLH #analysis #automation #named #performance #satisfiability

SpySMAC: Automated Configuration and Performance Analysis of SAT Solvers (SF, MTL, FH), pp. 215–222.

SAT-2015-GanianS #algorithm #community #satisfiability

Community Structure Inspired Algorithms for SAT and #SAT (RG, SS), pp. 223–237.

SAT-2015-IgnatievPM #satisfiability

SAT-Based Formula Simplification (AI, AP, JMS), pp. 287–298.

SAT-2015-IvriiRS #incremental #mining #satisfiability

Mining Backbone Literals in Incremental SAT — A New Kind of Incremental Data (AI, VR, OS), pp. 88–103.

SAT-2015-MangalZNN #framework #lazy evaluation #named #satisfiability #scalability

Volt: A Lazy Grounding Framework for Solving Very Large MaxSAT Instances (RM, XZ, AVN, MN), pp. 299–306.

SAT-2015-MenciaPM #bound #satisfiability

SAT-Based Horn Least Upper Bounds (CM, AP, JMS), pp. 423–433.

SAT-2015-NevesMJLM #satisfiability

Exploiting Resolution-Based Representations for MaxSAT Solving (MN, RM, MJ, IL, VMM), pp. 272–286.

SAT-2015-NewshamLGLFC #evolution #named #satisfiability #visualisation

SATGraf: Visualizing the Evolution of SAT Formula Structure in Solvers (ZN, WL, VG, JHL, SF, KC), pp. 62–70.

SAT-2015-Oh #difference #satisfiability

Between SAT and UNSAT: The Fundamental Difference in CDCL SAT (CO), pp. 307–323.

SAT-2015-TuHJ #learning #named #reasoning #satisfiability

QELL: QBF Reasoning with Extended Clause Learning and Levelized SAT Solving (KHT, TCH, JHRJ), pp. 343–359.

DAC-2014-ChakrabortyMV #generative #satisfiability #scalability

Balancing Scalability and Uniformity in SAT Witness Generator (SC, KSM, MYV), p. 6.

DATE-2014-CabodiPQV #approximate #reachability #satisfiability

Tightening BDD-based approximate reachability with SAT-based clause generalization∗ (GC, PP, SQ, DV), pp. 1–6.

TACAS-2014-ArmandoCC #model checking #named #satisfiability

SATMC: A SAT-Based Model Checker for Security-Critical Systems (AA, RC, LC), pp. 31–45.

STOC-2014-Coja-Oghlan #satisfiability

The asymptotic k-SAT threshold (ACO), pp. 804–813.

STOC-2014-DingSS #random #satisfiability

Satisfiability threshold for random regular NAE-SAT (JD, AS, NS), pp. 814–822.

ICALP-v1-2014-Hertli #satisfiability

Breaking the PPSZ Barrier for Unique 3-SAT (TH), pp. 600–611.

ICALP-v1-2014-Tzameret #algorithm #problem #random #satisfiability

Sparser Random 3-SAT Refutation Algorithms and the Interpolation Problem — (Extended Abstract) (IT), pp. 1015–1026.

LATA-2014-GwynneK #constraints #on the #satisfiability

On SAT Representations of XOR Constraints (MG, OK), pp. 409–420.

ICSE-2014-DegiovanniAAU #automation #satisfiability

Automated goal operationalisation based on interpolation and SAT solving (RD, DA, NA, SU), pp. 129–139.

SLE-2014-KaufmannKPSW #debugging #diagrams #satisfiability #sequence chart #state machine

A SAT-Based Debugging Tool for State Machines and Sequence Diagrams (PK, MK, AP, MS, MW), pp. 21–40.

IJCAR-2014-AnsoteguiBGL #satisfiability

The Fractal Dimension of SAT Formulas (CA, MLB, JGC, JL), pp. 107–121.

IJCAR-2014-LahavZ #calculus #satisfiability

SAT-Based Decision Procedure for Analytic Pure Sequent Calculi (OL, YZ), pp. 76–90.

SAT-2014-AudemardS #lazy evaluation #parallel #policy #satisfiability

Lazy Clause Exchange Policy for Parallel SAT Solvers (GA, LS), pp. 197–205.

SAT-2014-BacchusN #algorithm #analysis #satisfiability

Cores in Core Based MaxSat Algorithms: An Analysis (FB, NN), pp. 7–15.

SAT-2014-BalintBFS #heuristic #implementation #satisfiability

Improving Implementation of SLS Solvers for SAT and New Heuristics for k-SAT with Long Clauses (AB, AB, AF, US), pp. 302–316.

SAT-2014-Bulatov0 #approximate #random #satisfiability

Approximating Highly Satisfiable Random 2-SAT (AAB, CW), pp. 384–398.

SAT-2014-Gableske #framework #satisfiability

An Ising Model Inspired Extension of the Product-Based MP Framework for SAT (OG), pp. 367–383.

SAT-2014-HaanS #parametricity #reduction #satisfiability

Fixed-Parameter Tractable Reductions to SAT (RdH, SS), pp. 85–102.

SAT-2014-KonevL #satisfiability

A SAT Attack on the Erdős Discrepancy Conjecture (BK, AL), pp. 219–226.

SAT-2014-MartinsML #composition #named #satisfiability

Open-WBO: A Modular MaxSAT Solver, (RM, VMM, IL), pp. 438–445.

SAT-2014-NadelRS #incremental #satisfiability

Ultimately Incremental SAT (AN, VR, OS), pp. 206–218.

SAT-2014-NewshamGFAS #community #performance #satisfiability

Impact of Community Structure on SAT Solver Performance (ZN, VG, SF, GA, LS), pp. 252–268.

SAT-2014-Nordstrom #bibliography #complexity #proving #satisfiability

A (Biased) Proof Complexity Survey for SAT Practitioners (JN), pp. 1–6.

SAT-2014-SaetherTV #satisfiability

Solving MaxSAT and #SAT on Structured CNF Formulas (SHS, JAT, MV), pp. 16–31.

SAT-2014-SakaiST #reduction #satisfiability #strict

Solving Sparse Instances of Max SAT via Width Reduction and Greedy Restriction (TS, KS, ST), pp. 32–47.

SAT-2014-SonobeKI #branch #community #parallel #satisfiability

Community Branching for Parallel Portfolio SAT Solvers (TS, SK, MI), pp. 188–196.

VMCAI-2014-BloemKS #safety #satisfiability #specification #synthesis

SAT-Based Synthesis Methods for Safety Specs (RB, RK, MS), pp. 1–20.

DAC-2013-WuWLH #algorithm #generative #model checking #satisfiability

A counterexample-guided interpolant generation algorithm for SAT-based model checking (CYW, CAW, CYL, CY(H), p. 6.

DATE-2013-Belov0MM #abstraction #satisfiability

Core minimization in SAT-based abstraction (AB, HC, AM, JMS), pp. 1411–1416.

DATE-2013-MillerB #parametricity #satisfiability #verification

Formal verification of analog circuit parameters across variation utilizing SAT (MM, FB), pp. 1442–1447.

DATE-2013-SauerRSPB #performance #satisfiability

Efficient SAT-based dynamic compaction and relaxation for longest sensitizable paths (MS, SR, TS, IP, BB), pp. 448–453.

TACAS-2013-CimattiGSS #smt

The MathSAT5 SMT Solver (AC, AG, BJS, RS), pp. 93–107.

TACAS-2013-WieringaH #incremental #manycore #satisfiability

Asynchronous Multi-core Incremental SAT Solving (SW, KH), pp. 139–153.

STOC-2013-Coja-OghlanP #satisfiability

Going after the k-SAT threshold (ACO, KP), pp. 705–714.

AdaEurope-2013-BrandonC #ada

A SPARK/Ada CubeSat Control Program (CB, PC), pp. 51–64.

CADE-2013-KaminskiT #incremental #named #reasoning #reduction #satisfiability

InKreSAT: Modal Reasoning via Incremental Reduction to SAT (MK, TT), pp. 436–442.

CADE-2013-WilliamsK #problem #proving #reduction #satisfiability

Propositional Temporal Proving with Reductions to a SAT Problem (RW, BK), pp. 421–435.

CAV-2013-ChakrabortyMV #generative #satisfiability #scalability

A Scalable and Nearly Uniform Generator of SAT Witnesses (SC, KSM, MYV), pp. 608–623.

ICLP-J-2013-ArbelaezTC #parallel #predict #runtime #satisfiability #using

Using sequential runtime distributions for the parallel speedup prediction of SAT local search (AA, CT, PC), pp. 625–639.

ICST-2013-AbadABCFGMMRV #bound #contract #generative #incremental #satisfiability #testing

Improving Test Generation under Rich Contracts by Tight Bounds and Incremental SAT Solving (PA, NA, VSB, DC, MFF, JPG, TSEM, MMM, NR, IV), pp. 21–30.

SAT-2013-AudemardLS #incremental #satisfiability

Improving Glucose for Incremental SAT Solving with Assumptions: Application to MUS Extraction (GA, JML, LS), pp. 309–317.

SAT-2013-Ben-Ari #education #named #satisfiability

LearnSAT: A SAT Solver for Education (MBA), pp. 403–407.

SAT-2013-CimattiGSS #approach #composition #modulo theories #satisfiability

A Modular Approach to MaxSAT Modulo Theories (AC, AG, BJS, RS), pp. 150–165.

SAT-2013-FujitaKH #constraints #named #satisfiability

SCSat: A Soft Constraint Guided SAT Solver (HF, MK, RH), pp. 415–421.

SAT-2013-Gableske #heuristic #message passing #on the #satisfiability

On the Interpolation between Product-Based Message Passing Heuristics for SAT (OG), pp. 293–308.

SAT-2013-HeuleS #approach #clique #satisfiability

A SAT Approach to Clique-Width (MH, SS), pp. 318–334.

SAT-2013-IserST #modelling #satisfiability

Minimizing Models for Tseitin-Encoded SAT Instances (MI, CS, MT), pp. 224–232.

SAT-2013-MantheyPW #satisfiability

Soundness of Inprocessing in Clause Sharing SAT Solvers (NM, TP, CW), pp. 22–39.

SAT-2013-MartinsML #clustering #satisfiability

Community-Based Partitioning for MaxSAT Solving (RM, VMM, IL), pp. 182–191.

SAT-2013-SohTB #agile #constraints #named #programming #prototype #satisfiability

Scarab: A Rapid Prototyping Tool for SAT-Based Constraint Programming Systems (TS, NT, MB), pp. 429–436.

DAC-2012-KengV #abstraction #debugging #design #refinement #satisfiability

Path directed abstraction and refinement in SAT-based design debugging (BK, AGV), pp. 947–954.

DAC-2012-WelpKK #optimisation

Generalized SAT-sweeping for post-mapping optimization (TW, SK, AK), pp. 814–819.

DATE-2012-LeMKV #debugging #satisfiability #using

Non-solution implications using reverse domination in a modern SAT-based debugging environment (BL, HM, BK, AGV), pp. 629–634.

DATE-2012-SekaninaV #optimisation #polymorphism #satisfiability

A SAT-based fitness function for evolutionary optimization of polymorphic circuits (LS, ZV), pp. 715–720.

TACAS-2012-ZaeemGKM #data type #satisfiability #using

History-Aware Data Structure Repair Using SAT (RNZ, DG, SK, KSM), pp. 2–17.

ICALP-v1-2012-GaspersS #satisfiability

Backdoors to Acyclic SAT (SG, SS), pp. 363–374.

ECMFA-2012-KuhlmannG #modelling #ocl #representation #satisfiability #uml #validation

Strengthening SAT-Based Validation of UML/OCL Models by Representing Collections as Relations (MK, MG), pp. 32–48.

ICLP-J-2012-MetodiC #compilation #constraints #finite #satisfiability

Compiling finite domain constraints to SAT with BEE (AM, MC), pp. 465–483.

IJCAR-2012-BaaderBM #encoding #ontology #satisfiability #strict #unification

SAT Encoding of Unification in ℰℒℋ_R⁺ w.r.t. Cycle-Restricted Ontologies (FB, SB, BM), pp. 30–44.

IJCAR-2012-Nieuwenhuis #challenge #satisfiability #smt

SAT and SMT Are Still Resolution: Questions and Challenges (RN), pp. 10–13.

SAT-2012-AnsoteguiGL #community #satisfiability

The Community Structure of SAT Formulas (CA, JGC, JL), pp. 410–423.

SAT-2012-ArbelaezC #parallel #satisfiability #towards

Towards Massively Parallel Local Search for SAT — (Poster Presentation) (AA, PC), pp. 481–482.

SAT-2012-AudemardHJLP #parallel #satisfiability

Revisiting Clause Exchange in Parallel SAT Solving (GA, BH, SJ, JML, CP), pp. 200–213.

SAT-2012-BloomGHSSS #framework #game studies #named #parallel #satisfiability #scalability

SatX10: A Scalable Plug&Play Parallel SAT Framework — (Tool Presentation) (BB, DG, BH, AS, HS, VAS), pp. 463–468.

SAT-2012-BurgKK #clustering #re-engineering #satisfiability

Creating Industrial-Like SAT Instances by Clustering and Reconstruction — (Poster Presentation) (SB, SK, MK), pp. 471–472.

SAT-2012-DemirovicG #composition #performance #satisfiability

An Efficient Method for Solving UNSAT 3-SAT and Similar Instances via Static Decomposition — (Poster Presentation) (ED, HG), pp. 489–490.

SAT-2012-GaneshOSDRS #named #problem #satisfiability

Lynx: A Programmatic SAT Solver for the RNA-Folding Problem (VG, CWO, MS, SD, MCR, ASL), pp. 143–156.

SAT-2012-Hugel #named #random #satisfiability

SATLab: X-Raying Random k-SAT — (Tool Presentation) (TH), pp. 424–429.

SAT-2012-HyvarinenM #design #parallel #satisfiability #scalability

Designing Scalable Parallel SAT Solvers (AEJH, NM), pp. 214–227.

SAT-2012-IserTS #optimisation #order #relational

Optimizing MiniSAT Variable Orderings for the Relational Model Finder Kodkod — (Poster Presentation) (MI, MT, CS), pp. 483–484.

SAT-2012-JabbourLS #satisfiability

Intensification Search in Modern SAT Solvers — (Poster Presentation) (SJ, JL, LS), pp. 491–492.

SAT-2012-KatsirelosS #learning #satisfiability

Learning Polynomials over GF(2) in a SAT Solver — (Poster Presentation) (GK, LS), pp. 496–497.

SAT-2012-KottlerZSK #analysis #named #satisfiability

CoPAn: Exploring Recurring Patterns in Conflict Analysis of CDCL SAT Solvers — (Tool Presentation) (SK, CZ, PS, MK), pp. 449–455.

SAT-2012-MorgadoHM #satisfiability

Improvements to Core-Guided Binary Search for MaxSAT (AM, FH, JMS), pp. 284–297.

SAT-2012-NadelR #performance #satisfiability

Efficient SAT Solving under Assumptions (AN, VR), pp. 242–255.

SAT-2012-NadelRS #incremental #preprocessor #satisfiability

Preprocessing in Incremental SAT (AN, VR, OS), pp. 256–269.

SAT-2012-SabharwalSS #learning #satisfiability

Learning Back-Clauses in SAT — (Poster Presentation) (AS, HS, MS), pp. 498–499.

SAT-2012-TanjoTB #csp #encoding #named #order #satisfiability #using

Azucar: A SAT-Based CSP Solver Using Compact Order Encoding — (Tool Presentation) (TT, NT, MB), pp. 456–462.

SMT-2012-Biere #aspect-oriented #satisfiability

Practical Aspects of SAT Solving (AB), p. 1.

TAP-2012-CreignouES #framework #random #satisfiability #specification

A Framework for the Specification of Random SAT and QSAT Formulas (NC, UE, MS), pp. 163–168.

VMCAI-2012-OeSOC #named #satisfiability

versat: A Verified Modern SAT Solver (DO, AS, CO, KC), pp. 363–378.

ASE-2011-ArcainiGR #automation #generative #optimisation #satisfiability #smt #testing

Optimizing the automatic test generation by SAT and SMT solving for Boolean expressions (PA, AG, ER), pp. 388–391.

DAC-2011-LinH #satisfiability #using

Using SAT-based Craig interpolation to enlarge clock gating functions (THL, CY(H), pp. 621–626.

DATE-2011-KochteW #evaluation #fault #satisfiability

SAT-based fault coverage evaluation in the presence of unknown values (MAK, HJW), pp. 1303–1308.

DATE-2011-SafarESS #configuration management #pipes and filters #satisfiability

A reconfigurable, pipelined, conflict directed jumping search SAT solver (MS, MWEK, MS, AS), pp. 1243–1248.

TACAS-2011-GopinathMK #program repair #satisfiability #using

Specification-Based Program Repair Using SAT (DG, MZM, SK), pp. 173–188.

STOC-2011-MoserS #algorithm #satisfiability

A full derandomization of schöning’s k-SAT algorithm (RAM, DS), pp. 245–252.

ICALP-v1-2011-Coja-OghlanP #process #random #satisfiability

The Decimation Process in Random k-SAT (ACO, AYPP), pp. 305–316.

SEFM-2011-EggersRNF #analysis #hybrid #satisfiability

Improving SAT Modulo ODE for Hybrid Systems Analysis by Combining Different Enclosure Methods (AE, NR, NSN, MF), pp. 172–187.

SEFM-2011-ParrinoGGF #analysis #bound #data flow #satisfiability #verification

A Dataflow Analysis to Improve SAT-Based Bounded Program Verification (BCP, JPG, DG, MFF), pp. 138–154.

AGTIVE-2011-ErmlerKKT #graph transformation

From Graph Transformation Units via MiniSat to GrGen.NET (ME, HJK, SK, CvT), pp. 153–168.

KDD-2011-GilpinD #algorithm #approach #clustering #flexibility #performance #satisfiability

Incorporating SAT solvers into hierarchical clustering algorithms: an efficient and flexible approach (SG, IND), pp. 1136–1144.

TOOLS-EUROPE-2011-KuhlmannHG #modelling #ocl #satisfiability #validation

Extensive Validation of OCL Models by Integrating SAT Solving into USE (MK, LH, MG), pp. 290–306.

CADE-2011-Brown #higher-order #problem #proving #satisfiability #sequence #theorem proving

Reducing Higher-Order Theorem Proving to a Sequence of SAT Problems (CEB), pp. 147–161.

CAV-2011-BrauerKK #incremental #quantifier #satisfiability

Existential Quantification as Incremental SAT (JB, AK, JK), pp. 191–207.

ICLP-J-2011-CodishGBFG #analysis #constraints #integer #satisfiability #termination #using

SAT-based termination analysis using monotonicity constraints over the integers (MC, IG, AMBA, CF, JG), pp. 503–520.

SAT-2011-AbioDNS

Reducing Chaos in SAT-Like Search: Finding Solutions Close to a Given One (IA, MD, RN, PJS), pp. 273–286.

SAT-2011-ArgelichLMP #evaluation #satisfiability

Analyzing the Instances of the MaxSAT Evaluation (JA, CML, FM, JP), pp. 360–361.

SAT-2011-GableskeH #named #random #satisfiability #using

EagleUP: Solving Random 3-SAT Using SLS with Unit Propagation (OG, MH), pp. 367–368.

SAT-2011-KatebiSS #empirical #satisfiability

Empirical Study of the Anatomy of Modern Sat Solvers (HK, KAS, JPMS), pp. 343–356.

SAT-2011-MalitskySSS #algorithm #satisfiability

Non-Model-Based Algorithm Portfolios for SAT (YM, AS, HS, MS), pp. 369–370.

SAT-2011-MundhenkZ #equivalence #how #normalisation

How to Apply SAT-Solving for the Equivalence Test of Monotone Normal Forms (MM, RZ), pp. 105–119.

SAT-2011-Nadel #generative #satisfiability

Generating Diverse Solutions in SAT (AN), pp. 287–301.

SAT-2011-PetkeJ #csp #encoding #order #satisfiability

The Order Encoding: From Tractable CSP to Tractable SAT (JP, PJ), pp. 371–372.

SAT-2011-SilverthornM #learning #satisfiability

Learning Polarity from Structure in SAT (BS, RM), pp. 377–378.

SAT-2011-TanjoTB #csp #encoding #finite #performance

A Compact and Efficient SAT-Encoding of Finite Domain CSP (TT, NT, MB), pp. 375–376.

SAT-2011-TompkinsBH #heuristic #satisfiability

Captain Jack: New Variable Selection Heuristics in Local Search for SAT (DADT, AB, HHH), pp. 302–316.

SAT-2011-Williams #algorithm #bound #complexity #satisfiability

Connecting SAT Algorithms and Complexity Lower Bounds (RW), pp. 1–2.

TAP-2011-SoekenWD #data type #encoding #modelling #ocl #satisfiability #uml #verification

Encoding OCL Data Types for SAT-Based Verification of UML/OCL Models (MS, RW, RD), pp. 152–170.

VMCAI-2011-Bradley #model checking #satisfiability

SAT-Based Model Checking without Unrolling (ARB), pp. 70–87.

DAC-2010-PigorschS #preprocessor #satisfiability #using

An AIG-Based QBF-solver using SAT for preprocessing (FP, CS), pp. 170–175.

DAC-2010-ThalmaierNWSBK #induction #invariant #satisfiability

Analyzing k-step induction to compute invariants for SAT-based property checking (MT, MDN, MW, DS, JB, WK), pp. 176–181.

DATE-2010-ChenQM #generative #performance #satisfiability #testing

Efficient decision ordering techniques for SAT-based test generation (MC, XQ, PM), pp. 490–495.

DATE-2010-YangCZH #multi #satisfiability

SAT based multi-net rip-up-and-reroute for manufacturing hotspot removal (FY, YC, QZ, JH), pp. 1369–1372.

TACAS-2010-BardinHP #satisfiability

An Alternative to SAT-Based Approaches for Bit-Vectors (SB, PH, FP), pp. 84–98.

TACAS-2010-MalinowskiN #automaton #bound #model checking #partial order #satisfiability #semantics

SAT Based Bounded Model Checking with Partial Order Semantics for Timed Automata (JM, PN), pp. 405–419.

PLDI-2010-TorlakVD #axiom #memory management #modelling #named #specification

MemSAT: checking axiomatic specifications of memory models (ET, MV, JD), pp. 341–350.

FLOPS-2010-HoweK #prolog #satisfiability

A Pearl on SAT Solving in Prolog (JMH, AK), pp. 165–174.

FLOPS-2010-TamuraTB #constraints #problem #satisfiability

Solving Constraint Satisfaction Problems with SAT Technology (NT, TT, MB), pp. 19–23.

LATA-2010-Cruz-SantosM #on the #quantum #reduction #satisfiability

On the Hamiltonian Operators for Adiabatic Quantum Reduction of SAT (WCS, GML), pp. 239–248.

ICGT-2010-KreowskiKW #graph transformation #satisfiability

Graph Transformation Units Guided by a SAT Solver (HJK, SK, RW), pp. 27–42.

KR-2010-XiaoLMQ #consistency #metric #multi #nondeterminism #satisfiability #semantics

Computing Inconsistency Measurements under Multi-Valued Semantics by Partial Max-SAT Solvers (GX, ZL, YM, GQ).

PPDP-2010-BofillBV #approach #declarative #robust #satisfiability

A declarative approach to robust weighted Max-SAT (MB, DB, MV), pp. 67–76.

SAC-2010-JiaLLZ #satisfiability

Local lemma: a new strategy of pruning in SAT solvers (XJ, RL, SL, JZ), pp. 2071–2072.

IJCAR-2010-AravantinosCP10a #named #satisfiability

RegSTAB: A SAT Solver for Propositional Schemata (VA, RC, NP), pp. 309–315.

SAT-2010-BalintF #probability #satisfiability

Improving Stochastic Local Search for SAT with a New Probability Distribution (AB, AF), pp. 10–15.

SAT-2010-BoufkhadH #bound #satisfiability

Non Uniform Selection of Solutions for Upper Bounding the 3-SAT Threshold (YB, TH), pp. 99–112.

SAT-2010-BrummayerLB #automation #debugging #satisfiability #testing

Automated Testing and Debugging of SAT and QBF Solvers (RB, FL, AB), pp. 44–57.

SAT-2010-DantsinW #exponential #on the #satisfiability

On Moderately Exponential Time for SAT (ED, AW), pp. 313–325.

SAT-2010-Ehlers #automaton #satisfiability #using

Minimising Deterministic Büchi Automata Precisely Using SAT Solving (RE), pp. 326–332.

SAT-2010-FuhsS #linear #satisfiability #source code #using

Synthesizing Shortest Linear Straight-Line Programs over GF(2) Using SAT (CF, PSK), pp. 71–84.

SAT-2010-GelderS #design #satisfiability

Zero-One Designs Produce Small Hard SAT Instances (AVG, IS), pp. 388–397.

SAT-2010-Kottler #satisfiability

SAT Solving with Reference Points (SK), pp. 143–157.

SAT-2010-Kullmann #satisfiability

Green-Tao Numbers and SAT (OK), pp. 352–362.

SAT-2010-LiMQZ #satisfiability

Exact MinSAT Solving (CML, FM, ZQ, ZZ), pp. 363–368.

SAT-2010-MatthewsP #satisfiability

Uniquely Satisfiable k-SAT Instances with Almost Minimal Occurrences of Each Variable (WM, RP), pp. 369–374.

SAT-2010-Nikolic #comparison #satisfiability #statistics

Statistical Methodology for Comparison of SAT Solvers (MN), pp. 209–222.

SAT-2010-PankratovB #on the #problem #satisfiability

On the Relative Merits of Simple Local Search Methods for the MAX-SAT Problem (DP, AB), pp. 223–236.

SAT-2010-RathiARS #bound #random #satisfiability

Bounds on Threshold of Regular Random k-SAT (VR, EA, LKR, MS), pp. 264–277.

SAT-2010-TompkinsH #satisfiability

Dynamic Scoring Functions with Variable Expressions: New SLS Methods for Solving SAT (DADT, HHH), pp. 278–292.

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.

DAC-2009-WangCL #network #satisfiability #scalability #simulation

Simulation and SAT-based Boolean matching for large Boolean networks (KHW, CMC, JCL), pp. 396–401.

DATE-2009-ChambersMV #generative #performance #satisfiability

Faster SAT solving with better CNF generation (BC, PM, DV), pp. 1590–1595.

DATE-2009-KinsmanN #finite #modulo theories #precise #using

Finite Precision bit-width allocation using SAT-Modulo Theory (ABK, NN), pp. 1106–1111.

DATE-2009-SulflowFBKD #debugging #satisfiability

Increasing the accuracy of SAT-based debugging (AS, GF, CB, UK, RD), pp. 1326–1331.

ICALP-v1-2009-Coja-Oghlan #algorithm #random #satisfiability

A Better Algorithm for Random k-SAT (ACO), pp. 292–303.

PPDP-2009-CodishGS #declarative #encoding #satisfiability

A declarative encoding of telecommunications feature subscription in SAT (MC, SG, PJS), pp. 255–266.

SPLC-2009-MendoncaWC #analysis #feature model #modelling #satisfiability

SAT-based analysis of feature models is easy (MM, AW, KC), pp. 231–240.

CADE-2009-BorrallerasLNRR #linear #polynomial #satisfiability

Solving Non-linear Polynomial Arithmetic via SAT Modulo Linear Arithmetic (CB, SL, RNM, ERC, AR), pp. 294–305.

CADE-2009-SebastianiV #analysis #axiom #encoding #lightweight #logic

Axiom Pinpointing in Lightweight Description Logics via Horn-SAT Encoding and Conflict Analysis (RS, MV), pp. 84–99.

SAT-2009-AnsoteguiBL #satisfiability #testing

Solving (Weighted) Partial MaxSAT through Satisfiability Testing (CA, MLB, JL), pp. 427–440.

SAT-2009-ArgelichCLM #encoding #satisfiability

Sequential Encodings from Max-CSP into Partial Max-SAT (JA, AC, IL, FM), pp. 161–166.

SAT-2009-BonetJ #metric #satisfiability #using

Efficiently Calculating Evolutionary Tree Measures Using SAT (MLB, KSJ), pp. 4–17.

SAT-2009-Chen #hybrid #reasoning #satisfiability

Building a Hybrid SAT Solver via Conflict-Driven, Look-Ahead and XOR Reasoning Techniques (JC), pp. 298–311.

SAT-2009-JohannsenRW #satisfiability #strict

Solving SAT for CNF Formulas with a One-Sided Restriction on Variable Occurrences (DJ, IR, MW), pp. 80–85.

SAT-2009-KojevnikovKY #performance #using

Finding Efficient Circuits Using SAT-Solvers (AK, ASK, GY), pp. 32–44.

SAT-2009-KrocSS #satisfiability

Relaxed DPLL Search for MaxSAT (LK, AS, BS), pp. 447–452.

SAT-2009-LiffitonS #satisfiability

Generalizing Core-Guided Max-SAT (MHL, KAS), pp. 481–494.

SAT-2009-LiMMP #satisfiability

Exploiting Cycle Structures in Max-SAT (CML, FM, NOM, JP), pp. 467–480.

SAT-2009-Nieuwenhuis #algorithm #modulo theories #satisfiability

SAT Modulo Theories: Enhancing SAT with Special-Purpose Algorithms (RN), p. 1.

SAT-2009-NikolicMJ #policy #satisfiability

Instance-Based Selection of Policies for SAT Solvers (MN, FM, PJ), pp. 326–340.

SAT-2009-OhmuraU #clustering #named #parallel #satisfiability

c-sat: A Parallel SAT Solver for Clusters (KO, KU), pp. 524–537.

SAT-2009-SamerV #encoding #satisfiability

Encoding Treewidth into SAT (MS, HV), pp. 45–50.

SAT-2009-SoosNC #encryption #problem #satisfiability

Extending SAT Solvers to Cryptographic Problems (MS, KN, CC), pp. 244–257.

SAT-2009-Szeider #complexity #satisfiability

The Parameterized Complexity of k-Flip Local Search for SAT and MAX SAT (SS), pp. 276–283.

ASE-2008-KimKK #memory management #model checking #satisfiability #testing

Unit Testing of Flash Memory Device Driver through a SAT-Based Model Checker (MK, YK, HK), pp. 198–207.

DATE-2008-FangH #algorithm #approximate #performance #satisfiability

A Fast Approximation Algorithm for MIN-ONE SAT (LF, MSH), pp. 1087–1090.

TACAS-2008-Ben-AmramC #approach #ranking #satisfiability #termination

A SAT-Based Approach to Size Change Termination with Global Ranking Functions (AMBA, MC), pp. 218–232.

ICALP-A-2008-EldarR #quantum #satisfiability

Quantum SAT for a Qutrit-Cinquit Pair Is QMA1-Complete (LE, OR), pp. 881–892.

ICALP-A-2008-RazgonO #parametricity #satisfiability

Almost 2-SAT Is Fixed-Parameter Tractable (Extended Abstract) (IR, BO), pp. 551–562.

ICALP-B-2008-AxelssonHL #context-free grammar #incremental #satisfiability #using

Analyzing Context-Free Grammars Using an Incremental SAT Solver (RA, KH, ML), pp. 410–422.

KDD-2008-GodboleR #analysis #automation #classification #industrial

Text classification, business intelligence, and interactivity: automating C-Sat analysis for services industry (SG, SR), pp. 911–919.

SEKE-2008-ParkK08a #problem #satisfiability

Japanese Puzzle as a SAT Problem (SP, GK), pp. 543–548.

CAV-2008-BruttomessoCFGS #smt

The MathSAT 4SMT Solver (RB, AC, AF, AG, RS), pp. 299–303.

CAV-2008-KingS #congruence #equation #satisfiability #using

Inferring Congruence Equations Using SAT (AK, HS), pp. 281–293.

SAT-2008-ArgelichCLM #modelling #satisfiability

Modelling Max-CSP as Partial Max-SAT (JA, AC, IL, FM), pp. 1–14.

SAT-2008-ArgelichLM #preprocessor #satisfiability

A Preprocessor for Max-SAT Solvers (JA, CML, FM), pp. 15–20.

SAT-2008-Biere #adaptation #satisfiability

Adaptive Restart Strategies for Conflict Driven SAT Solvers (AB), pp. 28–33.

SAT-2008-DavisTYZ #design #hardware #performance #satisfiability

Designing an Efficient Hardware Implication Accelerator for SAT Solving (JDD, ZT, FY, LZ), pp. 48–62.

SAT-2008-EibachPV #satisfiability #using

Attacking Bivium Using SAT Solvers (TE, EP, GV), pp. 63–76.

SAT-2008-FaureNOR #formal method #linear #satisfiability

SAT Modulo the Theory of Linear Arithmetic: Exact, Inexact and Commercial Solvers (GF, RN, AO, ERC), pp. 77–90.

SAT-2008-GeorgiouP #algorithm #complexity #satisfiability

Complexity and Algorithms for Well-Structured k-SAT Instances (KG, PAP), pp. 105–118.

SAT-2008-Goldberg

A Decision-Making Procedure for Resolution-Based SAT-Solvers (EG), pp. 119–132.

SAT-2008-HaimW #estimation #online #runtime #satisfiability

Online Estimation of SAT Solving Runtime (SH, TW), pp. 133–138.

SAT-2008-HerasL #clique #preprocessor #satisfiability

A Max-SAT Inference-Based Pre-processing for Max-Clique (FH, JL), pp. 139–152.

SAT-2008-Iwama #satisfiability

SAT, UNSAT and Coloring (KI), p. 153.

SAT-2008-KottlerKS08a #bound #np-hard #satisfiability #subclass #using

A New Bound for an NP-Hard Subclass of 3-SAT Using Backdoors (SK, MK, CS), pp. 161–167.

SAT-2008-LetombeM #algorithm #hybrid #incremental #satisfiability

Improvements to Hybrid Incremental SAT Algorithms (FL, JMS), pp. 168–181.

SAT-2008-MarienWDB #induction #logic #satisfiability

SAT(ID): Satisfiability of Propositional Logic Extended with Inductive Definitions (MM, JW, MD, MB), pp. 211–224.

DATE-2007-FangH #hybrid #performance #satisfiability

A new hybrid solution to boost SAT solver performance (LF, MSH), pp. 1307–1313.

DATE-2007-SafarSES #configuration management #interactive #satisfiability

Interactive presentation: A shift register based clause evaluator for reconfigurable SAT solver (MS, MS, MWEK, AS), pp. 153–158.

DATE-2007-TadesseSLBG #analysis #modelling #satisfiability #using

Accurate timing analysis using SAT and pattern-dependent delay models (DT, DS, EL, RIB, JG), pp. 1018–1023.

DATE-2007-WuLLH #named #robust #satisfiability

QuteSAT: a robust circuit-based SAT solver for complex circuit structure (CAW, THL, CCL, CYH), pp. 1313–1318.

ITiCSE-2007-AustinJF #student

Stimulating minority student retention with BalloonSAT projects (SAA, LPJ, JMF), p. 320.

TACAS-2007-AmlaM #abstraction #model checking #refinement #satisfiability

Combining Abstraction Refinement and SAT-Based Model Checking (NA, KLM), pp. 405–419.

STOC-2007-Austrin #satisfiability

Balanced max 2-sat might not be the hardest (PA), pp. 189–197.

ESEC-FSE-2007-DolbyVT #debugging #satisfiability

Finding bugs efficiently with a SAT solver (JD, MV, FT), pp. 195–204.

CADE-2007-DeshaneHJLLM #encoding #first-order #proving #satisfiability

Encoding First Order Proofs in SAT (TD, WH, PJ, HL, CL, REM), pp. 476–491.

CADE-2007-KoprowskiM #dependence #predict #satisfiability #using

Predictive Labeling with Dependency Pairs Using SAT (AK, AM), pp. 410–425.

CAV-2007-BrummayerB #c #named #satisfiability

C32SAT: Checking C Expressions (RB, AB), pp. 294–297.

CAV-2007-SinhaC #composition #lazy evaluation #learning #satisfiability #using #verification

SAT-Based Compositional Verification Using Lazy Learning (NS, EMC), pp. 39–54.

MBT-2007-OuimetL #automation #consistency #satisfiability #specification #state machine #using #verification

Automated Verification of Completeness and Consistency of Abstract State Machine Specifications using a SAT Solver (MO, KL), pp. 85–97.

SAT-2007-AnsoteguiBLM #csp #satisfiability

Mapping CSP into Many-Valued SAT (CA, MLB, JL, FM), pp. 10–15.

SAT-2007-ArgelichM #learning #satisfiability

Partial Max-SAT Solvers with Clause Learning (JA, FM), pp. 28–40.

SAT-2007-CimattiGS #flexibility #modulo theories #satisfiability

A Simple and Flexible Way of Computing Small Unsatisfiable Cores in SAT Modulo Theories (AC, AG, RS), pp. 334–339.

SAT-2007-Davis #named #past present future #satisfiability

SAT: Past and Future (MD), pp. 1–2.

SAT-2007-DershowitzHN #comprehension #satisfiability #towards

Towards a Better Understanding of the Functionality of a Conflict-Driven SAT Solver (ND, ZH, AN), pp. 287–293.

SAT-2007-EenMS #logic #satisfiability #synthesis

Applying Logic Synthesis for Speeding Up SAT (NE, AM, NS), pp. 272–286.

SAT-2007-FuhsGMSTZ #analysis #polynomial #satisfiability #termination

SAT Solving for Termination Analysis with Polynomial Interpretations (CF, JG, AM, PSK, RT, HZ), pp. 340–354.

SAT-2007-HerasLO #named #satisfiability

MiniMaxSat: A New Weighted Max-SAT Solver (FH, JL, AO), pp. 41–55.

SAT-2007-HertelHU #encoding #formal method #satisfiability

Formalizing Dangerous SAT Encodings (AH, PH, AU), pp. 159–172.

SAT-2007-Kullmann #invariant #matrix #polynomial #satisfiability

Polynomial Time SAT Decision for Complementation-Invariant Clause-Sets, and Sign-non-Singular Matrices (OK), pp. 314–327.

SAT-2007-LiWZ #adaptation #satisfiability

Combining Adaptive Noise and Look-Ahead in Local Search for SAT (CML, WW, HZ), pp. 121–133.

SAT-2007-LynceM #matrix #modelling #satisfiability #symmetry

Breaking Symmetries in SAT Matrix Models (IL, JPMS), pp. 22–27.

SAT-2007-PorschenS #algorithm #problem #satisfiability

Algorithms for Variable-Weighted 2-SAT and Dual Problems (SP, ES), pp. 173–186.

DAC-2006-AksoyCFM #constraints #integer #linear #optimisation #programming #satisfiability #synthesis #using

Optimization of area under a delay constraint in digital filter synthesis using SAT-based integer linear programming (LA, EACdC, PFF, JM), pp. 669–674.

DAC-2006-SafarpourVBY #performance #satisfiability

Efficient SAT-based Boolean matching for FPGA technology mapping (SS, AGV, GB, RY), pp. 466–471.

DAC-2006-VimjamH #identification #induction #performance #satisfiability

Fast illegal state identification for improving SAT-based induction (VCV, MSH), pp. 241–246.

DAC-2006-ZhuKKS #satisfiability

SAT sweeping with local observability don’t-cares (QZ, NK, AK, ALSV), pp. 229–234.

DATE-2006-FeySVD #on the #satisfiability

On the relation between simulation-based and SAT-based diagnosis (GF, SS, AGV, RD), pp. 1139–1144.

TACAS-2006-Chaki #certification #satisfiability

SAT-Based Software Certification (SC), pp. 151–166.

SFM-2006-CimattiS #performance #satisfiability

Building Efficient Decision Procedures on Top of SAT Solvers (AC, RS), pp. 144–175.

SFM-2006-GuptaGW #hardware #satisfiability #verification

SAT-Based Verification Methods and Applications in Hardware Verification (AG, MKG, CW), pp. 108–143.

PADL-2006-HawkinsS #constraints #finite #hybrid #satisfiability #theorem proving

A Hybrid BDD and SAT Finite Domain Constraint Solver (PH, PJS), pp. 103–117.

CAV-2006-RoordaC #abstraction #evaluation #refinement #satisfiability

SAT-Based Assistance in Abstraction Refinement for Symbolic Trajectory Evaluation (JWR, KC), pp. 175–189.

IJCAR-2006-ReeberH #satisfiability #subclass

A SAT-Based Decision Procedure for the Subclass of Unrollable List Formulas in ACL2 (SULFA) (ER, WAHJ), pp. 453–467.

ISSTA-2006-DennisCJ #composition #satisfiability #verification

Modular verification of code with SAT (GD, FSHC, DJ), pp. 109–120.

SAT-2006-Bacchus #named #satisfiability

CSPs: Adding Structure to SAT (FB), p. 10.

SAT-2006-BonetLM #calculus #satisfiability

A Complete Calculus for Max-SAT (MLB, JL, FM), pp. 240–251.

SAT-2006-DantsinW #constant #performance #satisfiability

MAX-SAT for Formulas with Constant Clause Density Can Be Solved Faster Than in O(s2) Time (ED, AW), pp. 266–276.

SAT-2006-FuM #on the #problem #satisfiability

On Solving the Partial MAX-SAT Problem (ZF, SM), pp. 252–265.

SAT-2006-HyvarinenJN #satisfiability

A Distribution Method for Solving SAT in Grids (AEJH, TAJ, IN), pp. 430–435.

SAT-2006-JussilaSB #proving #quantifier #satisfiability

Extended Resolution Proofs for Symbolic SAT Solving with Quantification (TJ, CS, AB), pp. 54–60.

SAT-2006-LynceM #satisfiability #type inference

SAT in Bioinformatics: Making the Case with Haplotype Inference (IL, JMS), pp. 136–141.

SAT-2006-MironovZ #satisfiability

Applications of SAT Solvers to Cryptanalysis of Hash Functions (IM, LZ), pp. 102–115.

SAT-2006-NieuwenhuisO #modulo theories #on the #optimisation #problem #satisfiability

On SAT Modulo Theories and Optimization Problems (RN, AO), pp. 156–169.

SAT-2006-NishimuraRS #satisfiability #using

Solving #SAT Using Vertex Covers (NN, PR, SS), pp. 396–409.

SAT-2006-SebastianiV #case study #encoding #logic #satisfiability

Encoding the Satisfiability of Modal and Description Logics into SAT: The Case Study of K(m)/ALC (RS, MV), pp. 130–135.

SAT-2006-WatanabeY #analysis #problem #satisfiability

Average-Case Analysis for the MAX-2SAT Problem (OW, MY), pp. 277–282.

DAC-2005-BabicBH #performance #satisfiability

Efficient SAT solving: beyond supercubes (DB, JDB, AJH), pp. 744–749.

DAC-2005-GanaiGA #model checking #safety #satisfiability

Beyond safety: customized SAT-based model checking (MKG, AG, PA), pp. 738–743.

DAC-2005-ZhangPHS #abstraction #satisfiability #using

Dynamic abstraction using SAT-based BMC (LZ, MRP, MSH, TS), pp. 754–757.

DATE-2005-LuIPWCC #performance #satisfiability

An Efficient Sequential SAT Solver With Improved Search Strategies (FL, MKI, GP, LCW, KTC, KCC), pp. 1102–1107.

DATE-2005-MishchenkoB #network #optimisation #satisfiability

SAT-Based Complete Don’t-Care Computation for Network Optimization (AM, RKB), pp. 412–417.

DATE-2005-SheiniS #named #pseudo #satisfiability

Pueblo: A Modern Pseudo-Boolean SAT Solver (HMS, KAS), pp. 684–685.

TACAS-2005-ClarkeKSY #abstraction #named #satisfiability

SATABS: SAT-Based Predicate Abstraction for ANSI-C (EMC, DK, NS, KY), pp. 570–574.

TACAS-2005-GanaiGA #framework #model checking #named #satisfiability #scalability #verification

DiVer: SAT-Based Model Checking Platform for Verifying Large Scale Systems (MKG, AG, PA), pp. 575–580.

SAT-J-2004-ArmandoCGM05 #constraints #difference #satisfiability

A SAT-Based Decision Procedure for the Boolean Combination of Difference Constraints (AA, CC, EG, MM), pp. 16–29.

SAT-J-2004-BenedettiB05 #incremental

Incremental Compilation-to-SAT Procedures (MB, SB), pp. 46–58.

SAT-J-2004-BerreS05 #contest #satisfiability

Fifty-Five Solvers in Vancouver: The SAT 2004 Competition (DLB, LS), pp. 321–344.

SAT-J-2004-DantsinW05 #algorithm #satisfiability

Derandomization of Schuler’s Algorithm for SAT (ED, AW), pp. 80–88.

SAT-J-2004-GalesiK05 #polynomial #rank #satisfiability

Polynomial Time SAT Decision, Hypergraph Transversals and the Hermitian Rank (NG, OK), pp. 89–104.

SAT-J-2004-HeuleDZM05 #implementation #named #performance #reasoning #satisfiability

March_eq: Implementing Additional Reasoning into an Efficient Look-Ahead SAT Solver (MH, MD, JvZ, HvM), pp. 345–359.

SAT-J-2004-MahajanFM05 #named #performance #satisfiability

Zchaff2004: An Efficient SAT Solver (YSM, ZF, SM), pp. 360–375.

SAT-J-2004-PorschenS05 #bound #problem

Worst Case Bounds for Some NP-Complete Modified Horn-SAT Problems (SP, ES), pp. 251–262.

SAT-J-2004-Sinopalnikov05 #random #satisfiability

Satisfiability Threshold of the Skewed Random k-SAT (DAS), pp. 263–275.

SAT-J-2004-SubbarayanP05 #named #preprocessor #satisfiability

NiVER: Non-increasing Variable Elimination Resolution for Preprocessing SAT Instances (SS, DKP), pp. 276–291.

SAT-J-2004-TompkinsH05 #algorithm #implementation #named #satisfiability

UBCSAT: An Implementation and Experimentation Environment for SLS Algorithms for SAT and MAX-SAT (DADT, HHH), pp. 306–320.

CADE-2005-BozzanoBCJRSS

The MathSAT 3 System (MB, RB, AC, TAJ, PvR, SS, RS), pp. 315–321.

CAV-2005-TangMGI #model checking #reduction #satisfiability #symmetry

Symmetry Reduction in SAT-Based Model Checking (DT, SM, AG, CNI), pp. 125–138.

CAV-2005-XieA #debugging #detection #named #satisfiability

Saturn: A SAT-Based Tool for Bug Detection (YX, AA), pp. 139–143.

ICLP-2005-GiunchigliaM #on the #satisfiability #set

On the Relation Between Answer Set and SAT Procedures (or, Between cmodels and smodels) (EG, MM), pp. 37–51.

SAT-2005-AlsinetMP #satisfiability

Improved Exact Solvers for Weighted Max-SAT (TA, FM, JP), pp. 371–377.

SAT-2005-ArgelichM #problem #satisfiability

Solving Over-Constrained Problems with SAT Technology (JA, FM), pp. 1–15.

SAT-2005-DantsinW #bound #satisfiability

An Improved Upper Bound for SAT (ED, AW), pp. 400–407.

SAT-2005-DershowitzHN #heuristic #satisfiability

A Clause-Based Heuristic for SAT Solvers (ND, ZH, AN), pp. 46–60.

SAT-2005-DurairajK #constraints #dependence #performance #satisfiability

Variable Ordering for Efficient SAT Search by Analyzing Constraint-Variable Dependencies (VD, PK), pp. 415–422.

SAT-2005-EenB #effectiveness #preprocessor #satisfiability

Effective Preprocessing in SAT Through Variable and Clause Elimination (NE, AB), pp. 61–75.

SAT-2005-HeuleM #bound #linear #programming #random #satisfiability #using

Observed Lower Bounds for Random 3-SAT Phase Transition Density Using Linear Programming (MH, HvM), pp. 122–134.

SAT-2005-KourilF #performance #satisfiability

Resolution Tunnels for Improved SAT Solver Performance (MK, JVF), pp. 143–157.

SAT-2005-Kulikov #automation #generative #satisfiability

Automated Generation of Simplification Rules for SAT and MAXSAT (ASK), pp. 430–436.

SAT-2005-LewisSB #satisfiability

Speedup Techniques Utilized in Modern SAT Solvers (MDTL, TS, BB), pp. 437–443.

SAT-2005-MeierS #algebra #benchmark #metric #problem #satisfiability #set

A New Set of Algebraic Benchmark Problems for SAT Solvers (AM, VS), pp. 459–466.

SAT-2005-Rolf #satisfiability

Derandomization of PPSZ for Unique- k-SAT (DR), pp. 216–225.

SAT-2005-SeitzAO #behaviour #random #satisfiability

Threshold Behaviour of WalkSAT and Focused Metropolis Search on Random 3-Satisfiability (SS, MA, PO), pp. 475–481.

SAT-2005-SinzD #named #satisfiability #visualisation

DPvis — A Tool to Visualize the Structure of SAT Instances (CS, EMD), pp. 257–268.

SAT-2005-Wahlstrom #performance #satisfiability

Faster Exact Solving of SAT Formulae with a Low Number of Occurrences per Variable (MW), pp. 309–323.

SAT-2005-Zarpas #benchmark #bound #metric #model checking #satisfiability

Benchmarking SAT Solvers for Bounded Model Checking (EZ), pp. 340–354.

VMCAI-2005-ShenQL #incremental #satisfiability

Minimizing Counterexample with Unit Core Extraction and Incremental SAT (SS, YQ, SL), pp. 298–312.

DAC-2004-ChauhanCK #algorithm #satisfiability #simulation

A SAT-based algorithm for reparameterization in symbolic simulation (PC, EMC, DK), pp. 524–529.

DAC-2004-WangJHS #bound #model checking #satisfiability

Refining the SAT decision ordering for bounded model checking (CW, HJ, GDH, FS), pp. 535–538.

DATE-v1-2004-LiHS #novel #performance #satisfiability

A Novel SAT All-Solutions Solver for Efficient Preimage Computation (BL, MSH, SS), pp. 272–279.

DATE-v1-2004-WedlerSK #reasoning #satisfiability

Arithmetic Reasoning in DPLL-Based SAT Solving (MW, DS, WK), pp. 30–35.

SAC-2004-BoughaciD #metaheuristic #optimisation #problem #satisfiability #using

Solving weighted Max-Sat optimization problems using a Taboo Scatter Search metaheuristic (DB, HD), pp. 35–36.

CSL-2004-Atserias #complexity #random #satisfiability

Notions of Average-Case Complexity for Random 3-SAT (AA), pp. 1–5.

SAT-2004-ArmandoCGM #constraints #difference #satisfiability

A SAT-based Decision Procedure for the Boolean Combination of Difference Constraints (AA, CC, EG, MM), pp. 166–173.

SAT-2004-BenedettiB #incremental

Incremental Compilation-to-SAT Procedures (MB, SB), pp. 205–213.

SAT-2004-DantsinW #algorithm #satisfiability

Derandomization of Schuler’s Algorithm for SAT (ED, AW), pp. 69–75.

SAT-2004-GalesiK #polynomial #rank #satisfiability

Polynomial Time SAT Decision, Hypergraph Transversals and the Hermitian Rank (NG, OK), pp. 76–85.

SAT-2004-HooryS #satisfiability

Computing Unsatisfiable k-SAT Instances with Few Occurrences per Variable (SH, SS), pp. 86–95.

SAT-2004-LewisSB #detection #satisfiability

Early Conflict Detection Based BCP for SAT Solving (MDTL, TS, BB), pp. 29–36.

SAT-2004-ManquinhoM #bound #optimisation #pseudo #satisfiability #using

Using Lower-Bound Estimates in SAT-Based Pseudo-Boolean Optimization (VMM, JPMS), pp. 120–126.

SAT-2004-TompkinsH #algorithm #implementation #named #satisfiability

UBCSAT: An Implementation and Experimentation Environment for SLS Algorithms for SAT & MAX-SAT (DADT, HHH), pp. 37–46.

SAT-2004-Velev #encoding #performance #satisfiability

Encoding Global Unobservability for Efficient Translation to SAT (MNV), pp. 197–204.

SAT-2004-ZhangLS #satisfiability

A SAT Based Scheduler for Tournament Schedules (HZ, DL, HS), pp. 191–196.

DAC-2003-GuptaGWYA #bound #learning #model checking #satisfiability

Learning from BDDs in SAT-based bounded model checking (AG, MKG, CW, ZY, PA), pp. 824–829.

DAC-2003-KangP #bound #model checking #satisfiability

SAT-based unbounded symbolic model checking (HJK, ICP), pp. 840–843.

DAC-2003-SeshiaLB #hybrid #logic #satisfiability

A hybrid SAT-based decision procedure for separation logic with uninterpreted functions (SAS, SKL, REB), pp. 425–430.

DATE-2003-CabodiNQ #approximate #bound #model checking #satisfiability #traversal

Improving SAT-Based Bounded Model Checking by Means of BDD-Based Approximate Traversals (GC, SN, SQ), pp. 10898–10905.

DATE-2003-HaubeltTFM #satisfiability #synthesis

SAT-Based Techniques in System Synthesis (CH, JT, RF, BM), pp. 11168–11169.

DATE-2003-LuWCH #correlation #learning #satisfiability

A Circuit SAT Solver With Signal Correlation Guided Learning (FL, LCW, KTC, RCYH), pp. 10892–10897.

DATE-2003-ZhangM #implementation #independence #satisfiability #using #validation

Validating SAT Solvers Using an Independent Resolution-Based Checker: Practical Implementations and Other Applications (LZ, SM), pp. 10880–10885.

STOC-2003-AchlioptasP #random #satisfiability

The threshold for random k-SAT is 2k (ln 2 — O(k)) (DA, YP), pp. 223–231.

FME-2003-ArmandoCG #analysis #graph #model checking #protocol #satisfiability #security #using

SAT-Based Model-Checking of Security Protocols Using Planning Graph Analysis (AA, LC, PG), pp. 875–893.

CADE-2003-Clarke #abstraction #model checking #refinement #satisfiability

SAT-Based Counterexample Guided Abstraction Refinement in Model Checking (EMC), p. 1.

CAV-2003-GuptaGWYA #abstraction #satisfiability

Abstraction and BDDs Complement SAT-Based BMC in DiVer (AG, MKG, CW, ZY, PA), pp. 206–209.

CAV-2003-McMillan #model checking #satisfiability

Interpolation and SAT-Based Model Checking (KLM), pp. 1–13.

SAT-2003-ArmandoC #analysis #protocol #satisfiability #security

Abstraction-Driven SAT-based Analysis of Security Protocols (AA, LC), pp. 257–271.

SAT-2003-BaumerS #algorithm #independence #probability #satisfiability

Improving a Probabilistic 3-SAT Algorithm by Dynamic Search and Independent Clause Pairs (SB, RS), pp. 150–161.

SAT-2003-BerreS #contest #satisfiability

The Essentials of the SAT 2003 Competition (DLB, LS), pp. 452–467.

SAT-2003-BerreST #challenge #evaluation #satisfiability

Challenges in the QBF Arena: the SAT’03 Evaluation of QBF Solvers (DLB, LS, AT), pp. 468–485.

SAT-2003-BessiereHW #consistency #satisfiability

Local Consistencies in SAT (CB, EH, TW), pp. 299–314.

SAT-2003-BjesseKDSZ #satisfiability

Guiding SAT Diagnosis with Tree Decompositions (PB, JHK, RFD, TS, YZ), pp. 315–329.

SAT-2003-BraunsteinZ #bibliography #random #satisfiability

Survey and Belief Propagation on Random K-SAT (AB, RZ), pp. 519–528.

SAT-2003-BroeringL #algorithm #satisfiability

Width-Based Algorithms for SAT and CIRCUIT-SAT: (Extended Abstract) (EB, SVL), pp. 162–171.

SAT-2003-Bruni #fault #satisfiability #scalability #set

Solving Error Correction for Large Data Sets by Means of a SAT Solver (RB), pp. 229–241.

SAT-2003-Chen #algorithm #satisfiability

An Algorithm for SAT Above the Threshold (HC), pp. 14–24.

SAT-2003-ClarkeTVW #abstraction #hardware #satisfiability #verification

SAT Based Predicate Abstraction for Hardware Verification (EMC, MT, HV, DW), pp. 78–92.

SAT-2003-DequenD #named #performance #random #satisfiability

kcnfs: An Efficient Solver for Random k-SAT Formulae (GD, OD), pp. 486–501.

SAT-2003-EenS

An Extensible SAT-solver (NE, NS), pp. 502–518.

SAT-2003-GoldbergN #how #question

How Good Can a Resolution Based SAT-solver Be? (EG, YN), pp. 37–52.

SAT-2003-LiSB #effectiveness #performance #satisfiability #using

A Local Search SAT Solver Using an Effective Switching Strategy and an Efficient Unit Propagation (XYL, MFMS, FB), pp. 53–68.

SAT-2003-MaarenN

Hidden Threshold Phenomena for Fixed-Density SAT-formulae (HvM, LvN), pp. 135–149.

SAT-2003-Prestwich #problem

Local Search on SAT-encoded Colouring Problems (SDP), pp. 105–119.

SAT-2003-Szeider #on the #parametricity #satisfiability

On Fixed-Parameter Tractable Parameterizations of SAT (SS), pp. 188–202.

SAT-2003-ZhangM #algorithm #case study #implementation #performance #satisfiability

Cache Performance of SAT Solvers: a Case Study for Efficient Implementation of Algorithms (LZ, SM), pp. 287–298.

DAC-2002-AloulRMS #satisfiability #symmetry

Solving difficult SAT instances in the presence of symmetry (FAA, AR, ILM, KAS), pp. 731–736.

DAC-2002-CabodiCQ #bound #model checking #question #satisfiability

Can BDDs compete with SAT solvers on bounded model checking? (GC, PC, SQ), pp. 117–122.

DAC-2002-GanaiAGZM #algorithm #satisfiability

Combining strengths of circuit-based and CNF-based algorithms for a high-performance SAT solver (MKG, PA, AG, LZ, SM), pp. 747–750.

DAC-2002-PilarskiH #satisfiability

SAT with partial clauses and back-leaps (SP, GH), pp. 743–746.

DATE-2002-AloulMS #satisfiability #search-based #using

Search-Based SAT Using Zero-Suppressed BDDs (FAA, MNM, KAS), p. 1082.

DATE-2002-GoldbergN #named #performance #robust

BerkMin: A Fast and Robust Sat-Solver (EIG, YN), pp. 142–149.

DATE-2002-PilarskiH #satisfiability

Speeding up SAT for EDA (SP, GH), p. 1081.

DATE-2002-SkliarovaF #configuration management #hardware #satisfiability #using

A SAT Solver Using Software and Reconfigurable Hardware (IS, AdBF), p. 1094.

LOPSTR-2002-Martin-MateosAHR #framework #verification

Verification in ACL2 of a Generic Framework to Synthesize SAT-Provers (FJMM, JAA, MJH, JLRR), pp. 182–198.

CADE-2002-AudemardBCKS #approach #linear #satisfiability

A SAT Based Approach for Solving Formulas over Boolean and Linear Mathematical Propositions (GA, PB, AC, AK, RS), pp. 195–210.

CAV-2002-BarrettDS #first-order #incremental #satisfiability

Checking Satisfiability of First-Order Formulas by Incremental Translation to SAT (CWB, DLD, AS), pp. 236–249.

CAV-2002-ClarkeGKS #abstraction #machine learning #satisfiability #using

SAT Based Abstraction-Refinement Using ILP and Machine Learning Techniques (EMC, AG, JHK, OS), pp. 265–279.

CAV-2002-McMillan #bound #model checking #satisfiability

Applying SAT Methods in Unbounded Symbolic Model Checking (KLM), pp. 250–264.

CAV-2002-StrichmanSB #satisfiability

Deciding Separation Formulas with SAT (OS, SAS, REB), pp. 209–222.

SAT-2002-AloulRMS #satisfiability #symmetry

Solving difficult SAT instances in the presence of symmetry (FAA, AR, IM, KS), p. 23.

SAT-2002-BrglezLS #algorithm #benchmark #metric #satisfiability #testing

The role of a skeptic agent in testing and benchmarking of SAT algorithms (FB, XYL, MFS), p. 13.

SAT-2002-Clarke #abstraction #logic #model checking #refinement #satisfiability

SAT based abstraction refinement in temporal logic model checking (Keynote Talk) (EC), p. 26.

SAT-2002-DuboisD #random #satisfiability

Renormalization as a function of clause lengths for solving random k-SAT formulae (OD, GD), p. 15.

SAT-2002-FormanS #named #parallel #random #satisfiability

NAGSAT: A randomized, complete, parallel solver for 3-SAT (SF, AMS), p. 45.

SAT-2002-FriezeW #named #satisfiability

k-SAT: A tight threshold for moderately growing k (AF, NW), p. 6.

SAT-2002-GentP #encoding #problem #satisfiability

SAT encodings of the stable marriage problem with ties and incomplete lists (IG, PP), p. 19.

SAT-2002-HirschK #named #satisfiability

UnitWalk: A new SAT solver that uses local search guided by unit clause elimination (EH, AK), p. 38.

SAT-2002-Hoos #algorithm #modelling #satisfiability

SLS algorithms for SAT: irregular instances, search stagnation, and mixture models (HH), p. 41.

SAT-2002-Kullmann #adaptation #branch #database #encryption #normalisation #random #satisfiability #standard #towards #using

Towards an adaptive density based branching rule for SAT solvers, using a database for mixed random conjunctive normal forms built upon the Advanced Encryption Standard (AES) (OK), p. 8.

SAT-2002-Kusper #linear #problem #satisfiability

Solving the resolution-free SAT problem by hyper-unit propagation in linear time (GK), p. 32.

SAT-2002-LiB #empirical #satisfiability

An empirical measure for characterizing 3-SAT (CML, HB), p. 35.

SAT-2002-LynceM #backtracking #data type #performance #satisfiability

Efficient data structures for backtrack search SAT solvers (IL, JMS), p. 20.

SAT-2002-MonassonC #algorithm #analysis #exponential #random #satisfiability #scalability

Restart method and exponential acceleration of random 3-SAT instances resolutions: A large deviation analysis of the Davis-Putnam-Loveland-Logemann algorithm (RM, SC), p. 11.

SAT-2002-MotterM #on the #performance #proving #satisfiability

On proof systems behind efficient SAT solvers (DM, IM), p. 31.

SAT-2002-PorschenRS #decidability #satisfiability

X3SAT is decidable in time O(2n/5) (SP, BR, ES), p. 10.

SAT-2002-PrestwichB #approach #optimisation #query #satisfiability

A SAT approach to query optimization in mediator systems (SP, SB), p. 33.

SAT-2002-Roli #parallel #satisfiability

Impact of structure on parallel local search for SAT (AR), p. 24.

SAT-2002-Schoening #bound #satisfiability

New worst case bounds on k-SAT (Keynote Talk) (US), p. 1.

SAT-2002-Zhang #generative #satisfiability

Generating college conference basketball schedules by a SAT solver (HZ), p. 39.

VMCAI-2002-CimattiPRS #encoding #ltl #model checking #satisfiability

Improving the Encoding of LTL Model Checking into SAT (AC, MP, MR, RS), pp. 196–207.

DAC-2001-GuptaGYA #detection #image #satisfiability

Dynamic Detection and Removal of Inactive Clauses in SAT with Application in Image Computation (AG, AG, ZY, PA), pp. 536–541.

DAC-2001-MajumdarW #combinator #satisfiability #using

Watermarking of SAT using Combinatorial Isolation Lemmas (RM, JLW), pp. 480–485.

DAC-2001-MoskewiczMZZM #named #performance #satisfiability

Chaff: Engineering an Efficient SAT Solver (MWM, CFM, YZ, LZ, SM), pp. 530–535.

DATE-2001-GoldbergPB #equivalence #satisfiability #using

Using SAT for combinational equivalence checking (EIG, MRP, RKB), pp. 114–121.

ESOP-2001-CadoliS #compilation #problem #satisfiability #specification

Compiling Problem Specifications into SAT (MC, AS), pp. 387–401.

ICALP-2001-FriedmanG #random #satisfiability

Recognizing More Unsatisfiable Random 3-SAT Instances Efficiently (JF, AG), pp. 310–321.

SAC-2001-Zhang #automation #satisfiability #symmetry

Automatic symmetry breaking method combined with SAT (JZ0), pp. 17–21.

SAT-2001-BejarCFMG #logic #satisfiability

Extending the Reach of SAT with Many-Valued Logics (RB, AC, CF, FM, CPG), pp. 392–407.

SAT-2001-CoccoM #analysis #backtracking #physics #random #satisfiability #statistics

Statistical physics analysis of the backtrack resolution of random 3-SAT instances (SC, RM), pp. 36–47.

SAT-2001-GiunchigliaNTV #library #performance #satisfiability #towards

Towards an Efficient Library for SAT: a Manifesto (EG, MN, AT, MYV), pp. 290–310.

SAT-2001-NuallainRB #behaviour #predict #satisfiability

Ensemble-based prediction of SAT search behaviour (BÓN, MdR, JvB), pp. 278–289.

SAT-2001-SimonC #framework #named #satisfiability

SatEx: A Web-based Framework for SAT Experimentation (LS, PC), pp. 129–149.

SAT-2001-SinzBK #implementation #named #parallel

PaSAT — Parallel SAT-Checking with Lemma Exchange: Implementation and Applications (CS, WB, WK), pp. 205–216.

SAT-2001-Subramani #satisfiability

A polyhedral projection procedure for Q2SAT (KS), pp. 369–375.

TACAS-2000-AbdullaBE #analysis #reachability

Symbolic Reachability Analysis Based on SAT-Solvers (PAA, PB, NE), pp. 411–425.

STOC-2000-Achlioptas #bound #random #satisfiability

Setting 2 variables at a time yields a new lower bound for random 3-SAT (extended abstract) (DA), pp. 28–37.

ICALP-2000-DantsinGHS #algorithm #satisfiability

Deterministic Algorithms for k-SAT Based on Covering Codes and Local Search (ED, AG, EAH, US), pp. 236–247.

CADE-2000-GiunchigliaT #development #framework

System Description: *SAT: A Platform for the Development of Modal Decision Procedures (EG, AT), pp. 291–296.

CAV-2000-Shtrichman #bound #model checking #satisfiability

Tuning SAT Checkers for Bounded Model Checking (OS), pp. 480–494.

CAV-2000-WilliamsBCG #diagrams #model checking #performance #satisfiability

Combining Decision Diagrams and SAT Procedures for Efficient Symbolic Model Checking (PFW, AB, EMC, AG), pp. 124–138.

CL-2000-AudemardBS #named #satisfiability

AVAL: An Enumerative Method for SAT (GA, BB, PS), pp. 373–383.

DAC-1999-BiereCCFZ #model checking #satisfiability #using

Symbolic Model Checking Using SAT Procedures instead of BDDs (AB, AC, EMC, MF, YZ), pp. 317–320.

ICALP-1999-NiedermeierR #bound #satisfiability

New Upper Bounds for MaxSat (RN, PR), pp. 575–584.

STOC-1998-Freedman #satisfiability

K-sat on Groups and Undecidability (MHF), pp. 572–576.

CADE-1998-MazureSG #framework #satisfiability

System Description: CRIL Platform for SAT (BM, LS, ÉG), pp. 124–128.

CSL-1998-Sadowski #algorithm #on the #satisfiability

On an Optimal Deterministic Algorithm for SAT (ZS), pp. 179–187.

STOC-1996-BergadanoCV #learning #query

Learning Sat-k-DNF Formulas from Membership Queries (FB, DC, SV), pp. 126–130.

KR-1996-GiunchigliaS #satisfiability

A SAT-based Decision Procedure for ALC (FG, RS), pp. 304–314.

STOC-1994-GoemansW #algorithm #approximate #satisfiability

.879-approximation algorithms for MAX CUT and MAX 2SAT (MXG, DPW), pp. 422–431.