Stem solver$ (all stems)

299 papers:

DATE-2015-ChenWY #parallel #performance

A fast parallel sparse solver for SPICE-based circuit simulators (XC, YW, HY), pp. 205–210.

DATE-2015-SchaffnerGSB #architecture #image #linear

DRAM or no-DRAM?: exploring linear solver architectures for image domain warping in 28 nm CMOS (MS, FKG, AS, LB), pp. 707–712.

TACAS-2015-BjornerPF #named #optimisation #smt

νZ — An Optimizing SMT Solver (NB, ADP, LF), pp. 194–199.

STOC-2015-ZhuO #convergence #performance

Nearly-Linear Time Positive LP Solver with Faster Convergence Rate (ZAZ, LO), pp. 229–236.

SAC-2015-AmadiniGM #named

SUNNY-CP: a sequential CP portfolio solver (RA, MG, JM), pp. 1861–1867.

ICSE-v1-2015-MilicevicNKJ #constraints #higher-order #relational #theorem proving

Alloy*: A General-Purpose Higher-Order Relational Constraint Solver (AM, JPN, EK, DJ), pp. 609–619.

HPDC-2015-ElliottHM #fault #linear

A Numerical Soft Fault Model for Iterative Linear Solvers (JE, MH, FM), pp. 271–274.

PPoPP-2015-HaidarDLTD #hardware #linear #towards

Towards batched linear solvers on accelerated hardware platforms (AH, TD, PL, ST, JJD), pp. 261–262.

CADE-2015-ReynoldsB #data type #smt

A Decision Procedure for (Co)datatypes in SMT Solvers (AR, JCB), pp. 197–213.

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-AbdullaACHRRS #constraints #named #smt #string

Norn: An SMT Solver for String Constraints (PAA, MFA, YFC, LH, AR, PR, JS), pp. 462–469.

CAV-2015-ZhengGSTDZ #constraints #effectiveness #equation #regular expression #string

Effective Search-Space Pruning for Solvers of String Equations, Regular Expressions and Length Constraints (YZ, VG, SS, OT, JD, XZ), pp. 235–254.

ICLP-2015-BrocheninM #reasoning #set

Abstract Answer Set Solvers for Cautious Reasoning (RB, MM).

SAT-2015-BalyoSS #named #parallel #satisfiability

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

SAT-2015-CaiLS #named #satisfiability

CCAnr: A Configuration Checking Based Local Search Solver for Non-random Satisfiability (SC, CL, KS), pp. 1–8.

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-HyvarinenMS #clustering #smt

Search-Space Partitioning for Parallelizing SMT Solvers (AEJH, MM, NS), pp. 369–386.

SAT-2015-LonsingE #api #incremental #satisfiability

Incrementally Computing Minimal Unsatisfiable Cores of QBFs via a Clause Group Solver API (FL, UE), pp. 191–198.

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.

VMCAI-2015-ReynoldsK #induction #smt

Induction for SMT Solvers (AR, VK), pp. 80–98.

ASE-2014-KauslerS #constraints #evaluation #execution #string #symbolic computation #theorem proving

Evaluation of string constraint solvers in the context of symbolic execution (SK, ES), pp. 259–270.

DAC-2014-SchaffnerGSKB #approximate #complexity #linear #realtime #video

An Approximate Computing Technique for Reducing the Complexity of a Direct-Solver for Sparse Linear Systems in Real-Time Video Processing (MS, FKG, AS, HK, LB), p. 6.

PLDI-2014-TorlakB #lightweight #virtual machine

A lightweight symbolic virtual machine for solver-aided host languages (ET, RB), p. 54.

STOC-2014-PengS #linear #parallel #performance

An efficient parallel solver for SDD linear systems (RP, DAS), pp. 333–342.

CIAA-2014-EsparzaLS #equation #fixpoint #named

FPsolve: A Generic Solver for Fixpoint Equations over Semirings (JE, ML, MS), pp. 1–15.

ICML-c1-2014-HsiehSD #divide and conquer #kernel

A Divide-and-Conquer Solver for Kernel Support Vector Machines (CJH, SS, ISD), pp. 566–574.

ICML-c2-2014-NieHH #linear

Linear Time Solver for Primal SVM (FN, YH, HH), pp. 505–513.

ICML-c2-2014-SchwingHPU #algorithm #convergence #parallel #using

Globally Convergent Parallel MAP LP Relaxation Solver using the Frank-Wolfe Algorithm (AGS, TH, MP, RU), pp. 487–495.

PADL-2014-LierlerT #composition

Abstract Modular Inference Systems and Solvers (YL, MT), pp. 49–64.

POPL-2014-LiAKGC #optimisation #smt

Symbolic optimization with SMT solvers (YL, AA, ZK, AG, MC), pp. 607–618.

SAC-2014-AmadiniGM #constraints #theorem proving

An enhanced features extractor for a portfolio of constraint solvers (RA, MG, JM), pp. 1357–1359.

FSE-2014-VakiliD #infinity #modelling #smt #using #verification

Verifying CTL-live properties of infinite state models using an SMT solver (AV, NAD), pp. 213–223.

CAV-2014-HadareanBJBT #lazy evaluation

A Tale of Two Solvers: Eager and Lazy Approaches to Bit-Vectors (LH, KB, DJ, CB, CT), pp. 680–695.

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.

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

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

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-HeymanSMLA #using

Dominant Controllability Check Using QBF-Solver and Netlist Optimizer (TH, DS, YM, LL, HAH), pp. 227–242.

SAT-2014-MartinsML #composition #named #satisfiability

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

SAT-2014-NewshamGFAS #community #performance #satisfiability

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

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

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

SMT-2014-PalikarevaC #execution #multi #symbolic computation

Multi-solver Support in Symbolic Execution (HP, CC), p. 15.

TAP-2014-AminLR #smt

Computing with an SMT Solver (NA, KRML, TR), pp. 20–35.

TAP-2014-KurthSW #constraints #generative #interface #process #testing #theorem proving #uml #using

Generating Test Data from a UML Activity Using the AMPL Interface for Constraint Solvers (FK, SS, SW), pp. 169–186.

DAC-2013-ZhouLJ #3d #complexity #finite #linear #multi #scalability

A direct finite element solver of linear complexity for large-scale 3-D circuit extraction in multiple dielectrics (BZ, HL, DJ), p. 6.

TACAS-2013-CimattiGSS #smt

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

MoDELS-2013-SemerathHV #constraints #domain-specific language #graph #query #validation

Validation of Derived Features and Well-Formedness Constraints in DSLs — By Mapping Graph Queries to an SMT-Solver (OS, ÁH, DV), pp. 538–554.

MoDELS-2013-SemerathHV #constraints #domain-specific language #graph #query #validation

Validation of Derived Features and Well-Formedness Constraints in DSLs — By Mapping Graph Queries to an SMT-Solver (OS, ÁH, DV), pp. 538–554.

Onward-2013-TorlakB

Growing solver-aided languages with rosette (ET, RB), pp. 135–152.

GPCE-2013-Bodik #biology #modelling #programming language

Modeling biology with solver-aided programming languages (RB), pp. 1–2.

ESEC-FSE-2013-ZhengZG #analysis #named #string #web

Z3-str: a z3-based string solver for web application analysis (YZ, XZ, VG), pp. 114–124.

CADE-2013-GaoKC #named #smt

dReal: An SMT Solver for Nonlinear Theories over the Reals (SG, SK, EMC), pp. 208–214.

CAV-2013-ChagantyLNR #learning #relational #smt #using

Combining Relational Learning with SMT Solvers Using CEGAR (ATC, AL, AVN, SKR), pp. 447–462.

CAV-2013-PalikarevaC #execution #multi #symbolic computation

Multi-solver Support in Symbolic Execution (HP, CC), pp. 53–68.

ICLP-J-2013-AlbertBGRS #generative #testing

A CLP heap solver for test case generation (EA, MJGdlB, MGZ, JMR, PJS), pp. 721–735.

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

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

SAT-2013-DaviesB #power of #satisfiability

Exploiting the Power of mip Solvers in maxsat (JD, FB), pp. 166–181.

SAT-2013-FujitaKH #constraints #named #satisfiability

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

SAT-2013-MantheyPW #satisfiability

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

VMCAI-2013-PelleauMTB #abstract domain #constraints #theorem proving

A Constraint Solver Based on Abstract Domains (MP, AM, CT, FB), pp. 434–454.

ASE-2012-NijjarB #bound #smt #using #verification

Unbounded data model verification using SMT solvers (JN, TB), pp. 210–219.

DATE-2012-XuYCJW #3d #performance

Efficient variation-aware EM-semiconductor coupled solver for the TSV structures in 3D IC (YX, WY, QC, LJ, NW), pp. 1409–1412.

ICSM-2012-RupakhetiH #constraints #fault #modelling #similarity #theorem proving #using

Finding errors from reverse-engineered equality models using a constraint solver (CRR, DH), pp. 77–86.

SAS-2012-DSilvaHK #satisfiability

Satisfiability Solvers Are Static Analysers (VD, LH, DK), pp. 317–333.

FLOPS-2012-MartinFS #eclipse #integer #set

Extending the TOY System with the ECLiPSe Solver over Sets of Integers (SEM, JCF, FSP), pp. 120–135.

FLOPS-2012-Triska #constraints #finite #prolog #theorem proving

The Finite Domain Constraint Solver of SWI-Prolog (MT), pp. 307–316.

FM-2012-CarlierDG #constraints #finite #theorem proving

A Certified Constraint Solver over Finite Domains (MC, CD, AG), pp. 116–131.

ICEIS-v1-2012-DomagalaWLS #energy #hybrid

A Hybrid Solver for Maximizing the Profit of an Energy Company (LD, TW, WL, MS), pp. 278–283.

ICML-2012-PletscherW

LPQP for MAP: Putting LP Solvers to Better Use (PP, SW), p. 93.

MoDELS-2012-ButtnerEC #atl #off the shelf #on the #smt #using #verification

On Verifying ATL Transformations Using “off-the-shelf” SMT Solvers (FB, ME, JC), pp. 432–448.

MoDELS-2012-ButtnerEC #atl #off the shelf #on the #smt #using #verification

On Verifying ATL Transformations Using “off-the-shelf” SMT Solvers (FB, ME, JC), pp. 432–448.

LOPSTR-2012-MarpleG #named #set

Galliwasp: A Goal-Directed Answer Set Solver (KM, GG), pp. 122–136.

FSE-2012-StoleeE #semantics #smt #towards

Toward semantic search via SMT solver (KTS, SGE), p. 25.

ICSE-2012-BalasubramaniamJKMN #approach #automation #constraints #generative #performance #theorem proving

An automated approach to generating efficient constraint solvers (DB, CJ, LK, IM, PN), pp. 661–671.

CAV-2012-BodikT #constraints #source code #theorem proving

Synthesizing Programs with Constraint Solvers (RB, ET), p. 3.

CAV-2012-LalQL #modulo theories #reachability

A Solver for Reachability Modulo Theories (AL, SQ, SKL), pp. 427–443.

ICLP-2012-Balduccini #set #source code

An Answer Set Solver for non-Herbrand Programs: Progress Report (MB), pp. 49–60.

ICLP-2012-FilardoE #finite #flexibility

A Flexible Solver for Finite Arithmetic Circuits (NWF, JE), pp. 425–438.

ICLP-2012-HoosKSS #named #scheduling

aspeed: ASP-based Solver Scheduling (HH, RK, TS, MTS), pp. 176–187.

ICLP-2012-SilverthornLS

Surviving Solver Sensitivity: An ASP Practitioner’s Guide (BS, YL, MS), pp. 164–175.

ICST-2012-LiuNT #bound #case study #smt #using #verification

Bounded Program Verification Using an SMT Solver: A Case Study (TL, MN, MT), pp. 101–110.

IJCAR-2012-BaaderMM #logic #named #unification

UEL: Unification Solver for the Description Logic ℰℒ — System Description (FB, JM, BM), pp. 45–51.

SAT-2012-BaylessH #algorithm

Single-Solver Algorithms for 2QBF — (Poster Presentation) (SB, AJH), pp. 487–488.

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-HyvarinenM #design #parallel #satisfiability #scalability

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

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-LiffitonM #constraints #for free

A Cardinality Solver: More Expressive Constraints for Free — (Poster Presentation) (MHL, JCM), pp. 485–486.

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.

SAT-2012-XuHHL #algorithm #component

Evaluating Component Solver Contributions to Portfolio-Based Algorithm Selectors (LX, FH, HH, KLB), pp. 228–241.

SMT-2012-ConchonMRI #axiom #float #smt

Built-in Treatment of an Axiomatic Floating-Point Theory for SMT Solvers (SC, GM, CR, MI), pp. 12–21.

VMCAI-2012-Leino #automation #induction #smt

Automating Induction with an SMT Solver (KRML), pp. 315–331.

VMCAI-2012-OeSOC #named #satisfiability

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

WICSA-2011-BalasubramaniamSJKMN #approach #architecture #constraints #generative #named #performance #theorem proving

Dominion: An Architecture-Driven Approach to Generating Efficient Constraint Solvers (DB, LdS, CJ, LK, IM, PN), pp. 228–231.

ASE-2011-GanovKP #alloy #analysis #incremental #performance

A case for alloy annotations for efficient incremental analysis via domain specific solvers (SRG, SK, DEP), pp. 464–467.

DAC-2011-BardhanH #performance

A fast solver for nonlocal electrostatic theory in biomolecular science and engineering (JPB, AH), pp. 801–805.

DATE-2011-BoghratiS #analysis #grid #performance #power management #random

A scaled random walk solver for fast power grid analysis (BB, SSS), pp. 38–43.

DATE-2011-PavlenkoWSKDSG #algebra #named #problem #reasoning #smt #verification

STABLE: A new QF-BV SMT solver for hard verification problems combining Boolean reasoning with computer algebra (EP, MW, DS, WK, AD, FS, GMG), pp. 155–160.

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.

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.

ESEC-FSE-2011-PalmaST #interactive #requirements #smt #using

Using an SMT solver for interactive requirements prioritization (FP, AS, PT), pp. 48–58.

CADE-2011-BlanchetteBP #smt

Extending Sledgehammer with SMT Solvers (JCB, SB, LCP), pp. 116–130.

CAV-2011-GaneshKAGHE #analysis #detection #named #string #testing

HAMPI: A String Solver for Testing, Analysis and Vulnerability Detection (VG, AK, SA, PJG, PH, MDE), pp. 1–19.

ICST-2011-KhalekK #constraints #database #relational #testing #theorem proving #using

Systematic Testing of Database Engines Using a Relational Constraint Solver (SAK, SK), pp. 50–59.

SAT-2011-Gelder #multi #ranking

Careful Ranking of Multiple Solvers with Timeouts and Ties (AVG), pp. 317–328.

SAT-2011-Gelder11a #satisfiability

Generalized Conflict-Clause Strengthening for Satisfiability Solvers (AVG), pp. 329–342.

SAT-2011-KatebiSS #empirical #satisfiability

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

TAP-2011-BentakoukPZ #behaviour #consistency #smt #testing #web #web service

Checking the Behavioral Conformance of Web Services with Symbolic Testing and an SMT Solver (LB, PP, FZ), pp. 33–50.

DAC-2010-PigorschS #preprocessor #satisfiability #using

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

TACAS-2010-BruttomessoPST

The OpenSMT Solver (RB, EP, NS, AT), pp. 150–153.

SAS-2010-HofmannKS #coq #verification

Verifying a Local Generic Solver in Coq (MH, AK, HS), pp. 340–355.

ICFP-2010-BiermanGHL #semantics #smt #type system

Semantic subtyping with an SMT solver (GMB, ADG, CH, DEL), pp. 105–116.

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).

SEKE-2010-FuL #constraints #detection #string #theorem proving #web

A String Constraint Solver for Detecting Web Application Vulnerability (XF, CCL), pp. 535–542.

SAC-2010-JiaLLZ #satisfiability

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

PPoPP-2010-ZhangCO #gpu #performance

Fast tridiagonal solvers on the GPU (YZ, JC, JDO), pp. 127–136.

CAV-2010-ChatterjeeHJR #game studies #named #probability

Gist: A Solver for Probabilistic Games (KC, TAH, BJ, AR), pp. 665–669.

ICLP-2010-Balduccini10 #heuristic #learning #set

Learning Domain-Specific Heuristics for Answer Set Solvers (MB), pp. 14–23.

ICLP-J-2010-BrummayerJ #debugging #development #testing

Testing and debugging techniques for answer set solver development (RB, MJ), pp. 741–758.

IJCAR-2010-AravantinosCP10a #named #satisfiability

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

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

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

SAT-2010-KlieberSGC #learning

A Non-prenex, Non-clausal QBF Solver with Game-State Learning (WK, SS, SG, EMC), pp. 128–142.

SAT-2010-LonsingB #dependence #search-based

Integrating Dependency Schemes in Search-Based QBF Solvers (FL, AB), pp. 158–171.

SAT-2010-Nikolic #comparison #satisfiability #statistics

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

SAT-2010-PeschieraPTBKL #evaluation

The Seventh QBF Solvers Evaluation (QBFEVAL’10) (CP, LP, AT, UB, OK, IL), pp. 237–250.

ASE-2009-SiddiquiMK #constraints #optimisation #performance #theorem proving

Optimizing a Structural Constraint Solver for Efficient Software Checking (JHS, DM, SK), pp. 615–619.

DAC-2009-ChaiJK #3d #complexity #equation #linear #scalability

A direct integral-equation solver of linear complexity for large-scale 3D capacitance and impedance extraction (WC, DJ, CKK), pp. 752–757.

DAC-2009-ShiCHMTHW #analysis #gpu #grid #network #performance #power management

GPU friendly fast Poisson solver for structured power grid network analysis (JS, YC, WH, LM, SXDT, PHH, XW), pp. 178–183.

DATE-2009-KoelblJJP #equivalence

Solver technology for system-level to RTL equivalence checking (AK, RJ, HJ, CP), pp. 196–201.

DATE-2009-PigorschS

Exploiting structure in an AIG based QBF solver (FP, CS), pp. 1596–1601.

TACAS-2009-BrummayerB #array #named #performance #smt

Boolector: An Efficient SMT Solver for Bit-Vectors and Arrays (RB, AB), pp. 174–177.

SAS-2009-Qadeer #algorithm #smt #using #verification

Algorithmic Verification of Systems Software Using SMT Solvers (SQ), p. 2.

KEOD-2009-Essert-VillardBS #approach #multi #semantics #towards

Multi-semantic Approach Towards a Generic Formal Solver of Tool Placement for Percutaneous Surgery (CEV, CB, PS), pp. 443–446.

SAC-2009-LeinoM #first-order #reasoning #smt

Reasoning about comprehensions with first-order SMT solvers (KRML, RM), pp. 615–622.

CADE-2009-BoutonODF #named #performance

veriT: An Open, Trustable and Efficient SMT-Solver (TB, DCBdO, DD, PF), pp. 151–156.

CAV-2009-JhaLS #named #performance #smt

Beaver: Engineering an Efficient SMT Solver for Bit-Vector Arithmetic (SJ, RL, SAS), pp. 668–674.

CAV-2009-LahiriQR #concurrent #detection #fault #precise #smt #using

Static and Precise Detection of Concurrency Errors in Systems Code Using SMT Solvers (SKL, SQ, ZR), pp. 509–524.

CAV-2009-SrivastavaGF #named #smt #verification

VS3: SMT Solvers for Program Verification (SS, SG, JSF), pp. 702–708.

ICLP-2009-GebserKKS #constraints #implementation #on the

On the Implementation of Weight Constraint Rules in Conflict-Driven ASP Solvers (MG, RK, BK, TS), pp. 250–264.

ISSTA-2009-KiezunGGHE #constraints #named #string

HAMPI: a solver for string constraints (AK, VG, PJG, PH, MDE), pp. 105–116.

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-Chen #hybrid #reasoning #satisfiability

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

SAT-2009-GoultiaevaIB

Beyond CNF: A Circuit-Based QBF Solver (AG, VI, FB), pp. 412–426.

SAT-2009-KojevnikovKY #performance #using

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

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-PipatsrisawatD #policy #satisfiability

Width-Based Restart Policies for Clause-Learning Satisfiability Solvers (KP, AD), pp. 341–355.

SAT-2009-SoosNC #encryption #problem #satisfiability

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

ASE-2008-KhalekELK #constraints #generative #relational #testing #theorem proving #using

Query-Aware Test Generation Using a Relational Constraint Solver (SAK, BE, YOL, SK), pp. 238–247.

DAC-2008-DavisTYZ #configuration management #hardware #satisfiability

A practical reconfigurable hardware accelerator for Boolean satisfiability solvers (JDD, ZT, FY, LZ), pp. 780–785.

DAC-2008-MoselhyD #equation #performance #probability

Stochastic integral equation solver for efficient variation-aware interconnect extraction (TM, LD), pp. 415–420.

TACAS-2008-Moskal #proving #smt

Rocket-Fast Proof Checking for SMT Solvers (MM), pp. 486–500.

TACAS-2008-MouraB #named #performance #smt

Z3: An Efficient SMT Solver (LMdM, NB), pp. 337–340.

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.

ICML-2008-WeinbergerS #distance #implementation #learning #metric #performance

Fast solvers and efficient implementations for distance metric learning (KQW, LKS), pp. 1160–1167.

SEKE-2008-ChenLMW #algorithm #case study #optimisation #polynomial #problem #verification

Verification of Optimization Algorithms: a Case Study of a Quadratic Assignment Problem Solver (TYC, HL, RGM, DW), pp. 16–21.

GPCE-2008-ZhangAN #constraints #optimisation #theorem proving

From generic to specific: off-line optimization for a general constraint solver (YZ, TA, FN), pp. 45–54.

PPDP-2008-FeydySS #constraints #difference #finite

Global difference constraint propagation for finite domain solvers (TF, AS, PJS), pp. 226–235.

PADL-2008-Subbarayan #constraints #performance #reasoning #theorem proving

Efficient Reasoning for Nogoods in Constraint Solvers with BDDs (SS), pp. 53–67.

POPL-2008-LahiriQ #precise #smt #using #verification

Back to the future: revisiting precise program verification using SMT solvers (SKL, SQ), pp. 171–182.

SAC-2008-FabreS

Combining symbolic and numerical solvers to simplify indecomposable systems solving (AF, PS), pp. 1838–1842.

CAV-2008-BofillNORR #smt

The Barcelogic SMT Solver (MB, RN, AO, ERC, AR), pp. 294–298.

CAV-2008-BruttomessoCFGS #smt

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

ICLP-2008-GebserKKOST #incremental

Engineering an Incremental ASP Solver (MG, RK, BK, MO, TS, ST), pp. 190–205.

ICLP-2008-Lierler #set

Abstract Answer Set Solvers (YL), pp. 377–391.

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-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-Goldberg

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

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.

DATE-2007-FangH #hybrid #performance #satisfiability

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

DATE-2007-MoselhyHD #3d #performance

pFFT in FastMaxwell: a fast impedance extraction solver for 3D conductor structures over substrate (TM, XH, LD), pp. 1194–1199.

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-WuLLH #named #robust #satisfiability

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

ICML-2007-BabariaNKSBM #crawling #scalability

Focused crawling with scalable ordinal regression solvers (RB, JSN, SK, KRS, CB, MNM), pp. 57–64.

KDD-2007-TeoSVL #composition #scalability

A scalable modular convex solver for regularized risk minimization (CHT, AJS, SVNV, QVL), pp. 727–736.

LOPSTR-2007-AbdennadherS #approach #constraints #generative #rule-based #theorem proving

Generation of Rule-Based Constraint Solvers: Combined Approach (SA, IS), pp. 106–120.

LOPSTR-2007-ZhangN #constraints #scalability #theorem proving #unification #using

A Scalable Inclusion Constraint Solver Using Unification (YZ, FN), pp. 121–137.

SAC-2007-BordeauxZ #constraints #linear #quantifier

A solver for quantified Boolean and linear constraints (LB, LZ), pp. 321–325.

SAC-2007-DjelloulDF #constraints #finite #first-order #infinity #prolog #theorem proving #towards #unification #using

Toward a first-order extension of Prolog’s unification using CHR: a CHR first-order constraint solver over finite or infinite trees (KD, TBHD, TWF), pp. 58–64.

ESEC-FSE-2007-DolbyVT #debugging #satisfiability

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

CADE-2007-MouraB #performance #smt

Efficient E-Matching for SMT Solvers (LMdM, NB), pp. 183–198.

CAV-2007-BruttomessoCFGHNPS #industrial #lazy evaluation #problem #smt #verification

A Lazy and Layered SMT(BV) Solver for Hard Industrial Verification Problems (RB, AC, AF, AG, ZH, AN, AP, RS), pp. 547–560.

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-ArgelichM #learning #satisfiability

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

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-HerasLO #named #satisfiability

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

SAT-2007-PipatsrisawatD #component #lightweight #satisfiability

A Lightweight Component Caching Scheme for Satisfiability Solvers (KP, AD), pp. 294–299.

DAC-2006-WangGG #deduction #difference #learning #logic

Predicate learning and selective theory deduction for a difference logic solver (CW, AG, MKG), pp. 235–240.

TACAS-2006-FontaineMMNT #automation #interactive #proving #smt #towards

Expressiveness + Automation + Soundness: Towards Combining SMT Solvers and Interactive Proof Assistants (PF, JYM, SM, LPN, AFT), pp. 167–181.

TACAS-2006-GanaiTG #encoding #integration #lazy evaluation #logic #named

SDSAT: Tight Integration of Small Domain Encoding and Lazy Approaches in a Separation Logic Solver (MKG, MT, AG), pp. 135–150.

SFM-2006-CimattiS #performance #satisfiability

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

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

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

SAC-2006-Kosmatov #constraints #sequence #theorem proving

A constraint solver for sequences and its applications (NK), pp. 404–408.

SAC-2006-Oltean #multi #named #problem

A-Brain: the multiple problems solver (MO), pp. 955–959.

CAV-2006-DutertreM #performance

A Fast Linear-Arithmetic Solver for DPLL(T) (BD, LMdM), pp. 81–94.

SAT-2006-MironovZ #satisfiability

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

DAC-2005-GopeCJ #3d #multi #named #performance

DiMES: multilevel fast direct solver based on multipole expansions for parasitic extraction of massively coupled 3D microelectronic structures (DG, IC, VJ), pp. 159–162.

DAC-2005-PengL #named #performance #power management #using

Freeze: engineering a fast repeater insertion solver for power minimization using the ellipsoid method (YP, XL), pp. 813–818.

DATE-2005-IyerPC #constraints #learning #performance #theorem proving

Efficient Conflict-Based Learning in an RTL Circuit Constraint Solver (MKI, GP, KTC), pp. 666–671.

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-SheiniS #named #pseudo #satisfiability

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

SOFTVIS-2005-GhoniemCFJ #constraints #graph #programming #using #visualisation

Peeking in solver strategies using explanations visualization of dynamic graphs for constraint programming (MG, HC, JDF, NJ), pp. 27–36.

SEKE-2005-LiWMW #constraints #generative #testing #theorem proving

A Constraint Solver for Code-based Test Data Generation (JJL, WEW, XM, DMW), pp. 300–305.

PADL-2005-NieuwenborghHV #logic programming #order

An Ordered Logic Program Solver (DVN, SH, DV), pp. 128–142.

GTTSE-2005-BenavidesSMC #analysis #automation #csp #feature model #java #modelling #using

Using Java CSP Solvers in the Automated Analyses of Feature Models (DB, SS, PTMA, ARC), pp. 399–408.

SAT-J-2004-BerreNST05 #comparative #evaluation

The Second QBF Solvers Comparative Evaluation (DLB, MN, LS, AT), pp. 376–392.

SAT-J-2004-BerreS05 #contest #satisfiability

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

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-JinS05 #hybrid #named #satisfiability

CirCUs: A Hybrid Satisfiability Solver (HJ, FS), pp. 211–223.

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

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

ICLP-2005-StuckeyBMMSSWW #independence #modelling #performance

The G12 Project: Mapping Solver Independent Models to Efficient Solutions (PJS, MJGdlB, MJM, KM, JKS, ZS, MW, TW), pp. 9–13.

SAT-2005-AlsinetMP #satisfiability

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

SAT-2005-DershowitzHN #heuristic #satisfiability

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

SAT-2005-KourilF #performance #satisfiability

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

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-Zarpas #benchmark #bound #metric #model checking #satisfiability

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

DAC-2004-ParthasarathyICW #constraints #performance #theorem proving

An efficient finite-domain constraint solver for circuits (GP, MKI, KTC, LCW), pp. 212–217.

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

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

TACAS-2004-NielsonNSBHPS

The Succinct Solver Suite (FN, HRN, HS, MB, RRH, HP, HS), pp. 251–265.

CAV-2004-JinAS #bound #model checking #named #satisfiability #towards

CirCUs: A Satisfiability Solver Geared towards Bounded Model Checking (HJ, MA, FS), pp. 519–522.

SAT-2004-JinS #hybrid #named #satisfiability

CirCUs: A Hybrid Satisfiability Solver (HJ, FS), pp. 47–55.

DAC-2003-ChaiK #constraints #performance #pseudo #theorem proving

A fast pseudo-boolean constraint solver (DC, AK), pp. 830–835.

DAC-2003-ChenCCKMSYZ #algebra #clustering #layout #multi

An algebraic multigrid solver for analytical placement with layout based clustering (HC, CKC, NCC, ABK, JFM, PS, BY, ZZ), pp. 794–799.

DAC-2003-LuWCMH #case study #correlation #industrial

A signal correlation guided ATPG solver and its applications for solving difficult industrial cases (FL, LCW, KTC, JM, ZH), pp. 436–441.

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.

TACAS-2003-Mateescu #equation #on the fly

A Generic On-the-Fly Solver for Alternation-Free Boolean Equation Systems (RM), pp. 81–96.

TACAS-2003-VaziriJ #constraints #theorem proving

Checking Properties of Heap-Manipulating Procedures with a Constraint Solver (MV, DJ), pp. 505–520.

LOPSTR-2003-AbdennadherF #constraints #integration #optimisation #rule-based #theorem proving

Integration and Optimization of Rule-Based Constraint Solvers (SA, TWF), pp. 198–213.

PPDP-2003-DuckSBH #constraints

Extending arbitrary solvers with constraint handling rules (GJD, PJS, MJGdlB, CH), pp. 79–90.

SAC-2003-BettigSJB #internet #simulation

Dynamic Solver Selection for an Internet Simulation Backbone (BPB, CS, ARJ, KB), pp. 153–160.

SAC-2003-MonfroyC #component #constraints #theorem proving

Basic Components for Constraint Solver Cooperations (EM, CC), pp. 367–374.

CADE-2003-PanV #optimisation

Optimizing a BDD-Based Modal Solver (GP, MYV), pp. 75–89.

CAV-2003-ChechikG #logic #named #query

TLQSolver: A Temporal Logic Query Checker (MC, AG), pp. 210–214.

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-Bruni #fault #satisfiability #scalability #set

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

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-FrancoKSWWDV #named #satisfiability

SBSAT: a State-Based, BDD-Based Satisfiability Solver (JVF, MK, JSS, JW, SW, MD, WMV), pp. 398–410.

SAT-2003-GentGNRT #data type

Watched Data Structures for QBF Solvers (IPG, EG, MN, AGDR, AT), pp. 25–36.

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-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-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.

DATE-2002-GoldbergN #named #performance #robust

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

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

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

TACAS-2002-BouquetLP #constraints #named #theorem proving

CLPS-B — A Constraint Solver for B (FB, BL, FP), pp. 188–204.

LOPSTR-2002-AbdennadherR #constraints #logic programming #synthesis #theorem proving #using

Constraint Solver Synthesis Using Tabled Resolution for Constraint Logic Programming (SA, CR), pp. 32–47.

CADE-2002-ZhangM #performance #satisfiability

The Quest for Efficient Boolean Satisfiability Solvers (LZ, SM), pp. 295–313.

CAV-2002-ZhangM #performance #satisfiability

The Quest for Efficient Boolean Satisfiability Solvers (LZ, SM), pp. 17–36.

SAT-2002-AloulRMS1 #backtracking #named

PBS: A backtrack-search psuedo-Boolean solver and optimizer (FAA, AR, IM, KS), p. 37.

SAT-2002-AloulSS #backtracking

A tool for measuring progress of backtrack-search solvers (FAA, BS, KS), p. 28.

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

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

SAT-2002-Gelder #reasoning #satisfiability #towards

Toward leaner binary-clause reasoning in a satisfiability solver (AVG), p. 16.

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-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-LynceM #backtracking #data type #performance #satisfiability

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

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

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

SAT-2002-RuessM #satisfiability

Lemmas on demand for Satisfiability solvers (HR, LdM), p. 17.

SAT-2002-Zhang #generative #satisfiability

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

DAC-2001-MoskewiczMZZM #named #performance #satisfiability

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

PPDP-2001-AbdennadherR #confluence #constraints #rule-based #theorem proving #using

Using Confluence to Generate Rule-Based Constraint Solvers (SA, CR), pp. 127–135.

ESEC-FSE-2001-EdvardssonK #analysis #constraints #generative #testing #theorem proving

Analysis of the constraint solver in UNA based test data generation (JE, MK), pp. 237–245.

CAV-2001-BjesseLM #debugging #satisfiability #using

Finding Bugs in an α Microprocessor Using Satisfiability Solvers (PB, TL, AM), pp. 454–464.

CAV-2001-FilliatreORS #named

ICS: Integrated Canonizer and Solver (JCF, SO, HR, NS), pp. 246–249.

ICLP-2001-BandaJMNSH #constraints #theorem proving

Building Constraint Solvers with HAL (MJGdlB, DJ, KM, NN, PJS, CH), pp. 90–104.

SAT-2001-Gelder #satisfiability

Combining Preorder and Postorder Resolution in a Satisfiability Solver (AVG), pp. 115–128.

DAC-2000-Zhao #3d

Singularity-treated quadrature-evaluated method of moments solver for 3-D capacitance extraction (JZ), pp. 536–539.

TACAS-2000-AbdullaBE #analysis #reachability

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

TACAS-2000-BharadwajS #automation #constraints #invariant #named #theorem proving

Salsa: Combining Constraint Solvers with BDDs for Automatic Invariant Checking (RB, SS), pp. 378–394.

SAC-2000-AguiarDPR #algorithm #named #process #search-based

EEGSolver — Brain Activity and Genetic Algorithms (PA, AD, SP, ACR), pp. 80–84.

ISSTA-2000-JacksonV #constraints #debugging #theorem proving

Finding bugs with a constraint solver (DJ, MV), pp. 14–25.

DAC-1999-AbramoviciSS #configuration management #hardware #satisfiability #using

A Massively-Parallel Easily-Scalable Satisfiability Solver Using Reconfigurable Hardware (MA, JTdS, DGS), pp. 684–690.

SAC-1999-CallahanT #finite #implementation #parallel

Parallel Implementation of a Frontal Finite Element Solver on Multiple Platforms (JDC, JMT), pp. 491–495.

DATE-1998-SzekelyR #performance #static analysis

Fast Field Solvers for Thermal and Electrostatic Analysis (VS, MR), pp. 518–523.

WRLA-1998-BorovanskyC #constraints #process #theorem proving #using

Cooperation of constraint solvers: using the new process control facilities of ELAN (PB, CC), pp. 1–20.

CADE-1998-Peltier #constraints #equation

System Description: An Equational Constraints Solver (NP), pp. 119–123.

JICSLP-1998-Monfroy #collaboration

A Solver Collaboration in BALI (EM), pp. 349–350.

DAC-1997-KapurZ #parametricity #performance

A Fast Method of Moments Solver for Efficient Parameter Extraction of MCMs (SK, JZ), pp. 141–146.

PLILP-1997-CarlssonOC #constraints #finite #theorem proving

An Open-Ended Finite Domain Constraint Solver (MC, GO, BC), pp. 191–206.

ESOP-1996-ThuneA #towards

Towards an Expressive Language for PDE Solvers (MT, KÅ), pp. 373–386.

SAS-1996-FechtS #equation #performance

An Even Faster Solver for General Systems of Equations (CF, HS), pp. 189–204.

PLILP-1996-StuckeyT #constraints #logic programming #modelling #probability #theorem proving #using

Models for Using Stochastic Constraint Solvers in Constraint Logic Programming (PJS, VT), pp. 423–437.

SAC-1996-MonfroyRS #constraints #implementation

Implementing non-linear constraints with cooperative solvers (EM, MR, RS), pp. 63–72.

HPDC-1996-Chan #clustering #parallel

Task Partitionings for Parallel Triangular Solver on an MIMD Computer (JQ, TKYC), pp. 365–373.

ICLP-1994-Rauzy #design

Notes on the Design of an Open Boolean Solver (AR), pp. 354–368.

ICLP-1993-CorsiniR #analysis #fault #safety

Safety Analysis by Means of Fault Trees: An Application for Open Boolean Solvers (MMC, AR), p. 834.

JICSLP-1992-KirchnerR #algebra #algorithm #constraints #finite #theorem proving #unification

A Constraint Solver in Finite Algebras and Its Combination with Unification Algorithms (HK, CR), pp. 225–239.

OOPSLA-1991-Wilk #constraints #named #object-oriented #theorem proving

Equate: An Object-Oriented Constraint Solver (MRW), pp. 286–298.

ICLP-1991-WatanabeK #layout #parallel #problem

Co-operative Hierarchical Layout Problem Solver on Parallel Inference Machine (TW, KK), p. 892.

SEKE-1990-SaveantC #metalanguage #problem #representation

A Metalanguage for Representation and Control in Assumption-based Problem Solvers (PS, PC), pp. 159–164.

PLILP-1990-Jaakola #algorithm #constraints #theorem proving

Modifying the Simplex Algorithm to a Constraint Solver (JJ), pp. 89–105.

CADE-1990-BrownA90a #algebra #equation

Cylindric Algebra Equation Solver (FMB, CA), pp. 645–646.

VLDB-1977-AntonacciDST #implementation #problem #query #relational

Structure and Implementation of a Relational Query Language for the Problem Solver (FA, PD, VNS, AT), pp. 351–358.