BibSLEIGH
BibSLEIGH corpus
BibSLEIGH tags
BibSLEIGH bundles
BibSLEIGH people
CC-BY
Open Knowledge
XHTML 1.0 W3C Rec
CSS 2.1 W3C CanRec
email twitter
Used together with:
boolean (41)
problem (34)
use (32)
base (25)
algorithm (25)

Stem satisfi$ (all stems)

308 papers:

STOCSTOC-2015-DingSS #proving #satisfiability #scalability
Proof of the Satisfiability Conjecture for Large k (JD, AS, NS), pp. 59–68.
STOCSTOC-2015-FeldmanPV #complexity #on the #problem #random #satisfiability
On the Complexity of Random Satisfiability Problems with Planted Solutions (VF, WP, SV), pp. 77–86.
ICMLICML-2015-GasseAE #classification #composition #multi #on the #set
On the Optimality of Multi-Label Classification under Subset Zero-One Loss for Distributions Satisfying the Composition Property (MG, AA, HE), pp. 2531–2539.
CADECADE-2015-David #satisfiability
Deciding ATL* Satisfiability by Tableaux (AD), pp. 214–228.
ICLPICLP-J-2015-AlvianoP #fuzzy #modulo theories #satisfiability #set
Fuzzy answer set computation via satisfiability modulo theories (MA, RP), pp. 588–603.
ICSTSAT-2015-CaiLS #named #satisfiability
CCAnr: A Configuration Checking Based Local Search Solver for Non-random Satisfiability (SC, CL, KS), pp. 1–8.
STOCSTOC-2014-DingSS #random #satisfiability
Satisfiability threshold for random regular NAE-SAT (JD, AS, NS), pp. 814–822.
LATALATA-2014-CarapelleFGQ #satisfiability #word
Satisfiability for MTL and TPTL over Non-monotonic Data Words (CC, SF, OFG, KQ), pp. 248–259.
KRKR-2014-Belardinelli #logic #satisfiability
Satisfiability of Alternating-Time Temporal Epistemic Logic Through Tableaux (FB).
OOPSLAOOPSLA-2014-UhlerD #satisfiability
Smten with satisfiability-based search (RU, ND), pp. 157–176.
FSEFSE-2014-LiYP0H #finite #infinity #ltl #named #satisfiability
Aalta: an LTL satisfiability checker over Infinite/Finite traces (JL, YY, GP, LZ, JH), pp. 731–734.
IJCARIJCAR-2014-CerritoDG #atl #logic #satisfiability #testing
Optimal Tableaux-Based Decision Procedure for Testing Satisfiability in the Alternating-Time Temporal Logic ATL+ (SC, AD, VG), pp. 277–291.
IJCARIJCAR-2014-ChocronFR #satisfiability
A Gentle Non-disjoint Combination of Satisfiability Procedures (PC, PF, CR), pp. 122–136.
IJCARIJCAR-2014-EhlersL #approximate #finite #incremental #logic #satisfiability
A Tool That Incrementally Approximates Finite Satisfiability in Full Interval Temporal Logic (RE, ML), pp. 360–366.
ISSTAISSTA-2014-LinK #automation #concurrent #multi #satisfiability #source code #thread #using
Automatic repair for multi-threaded programs with Deadlock/Livelock using maximum satisfiability (YL, SSK), pp. 237–247.
LICSLICS-CSL-2014-BrotherstonFPG #induction #logic #satisfiability
A decision procedure for satisfiability in separation logic with inductive predicates (JB, CF, JANP, NG), p. 10.
LICSLICS-CSL-2014-FredriksonJ #approach #privacy #satisfiability
Satisfiability modulo counting: a new approach for analyzing privacy properties (MF, SJ), p. 10.
ICSTSAT-2014-Bulatov0 #approximate #random #satisfiability
Approximating Highly Satisfiable Random 2-SAT (AAB, CW), pp. 384–398.
ICSTSAT-2014-IgnatievMM #independence #on the #satisfiability #set
On Reducing Maximum Independent Set to Minimum Satisfiability (AI, AM, JMS), pp. 103–120.
DATEDATE-2013-KumarCT #approach #distributed #realtime #satisfiability
A satisfiability approach to speed assignment for distributed real-time systems (PK, DBC, LT), pp. 749–754.
STOCSTOC-2013-Huang #approximate #satisfiability
Approximation resistance on satisfiable instances for predicates with few accepting inputs (SH), pp. 457–466.
HCIDUXU-PMT-2013-HsiehLHM #design
Satisfying Consumers’ Needs through Systematic Empathic Design Model (MHH, DBL, CYH, CHM), pp. 488–497.
HILTHILT-2013-Bjorner #development #modulo theories #satisfiability
Satisfiability modulo theories for high integrity development (NB), pp. 5–6.
CIKMCIKM-2013-JabbourSS #mining #satisfiability #sequence
Boolean satisfiability for sequence mining (SJ, LS, YS), pp. 649–658.
SACSAC-2013-ChocklerIMRS #satisfiability #using
Using cross-entropy for satisfiability (HC, AI, AM, SFR, NS), pp. 1196–1203.
SACSAC-2013-LaroucheMGH #equation #satisfiability #word
Solving equations on words through boolean satisfiability (ML, ABM, SG, SH), pp. 104–106.
ICSTSAT-2013-FingerLGS #constraints #probability #satisfiability #using
Solutions for Hard and Soft Constraints Using Optimized Probabilistic Satisfiability (MF, RL, CPG, BS), pp. 233–249.
ICSTSAT-2013-IgnatievJM #approach #quantifier #satisfiability
Quantified Maximum Satisfiability: — A Core-Guided Approach (AI, MJ, JMS), pp. 250–266.
VMCAIVMCAI-2013-MouraJ #calculus #satisfiability
A Model-Constructing Satisfiability Calculus (LMdM, DJ), pp. 1–12.
DACDAC-2012-LinMK #logic #satisfiability #using
Boolean satisfiability using noise based logic (PCKL, AM, SPK), pp. 1260–1261.
DACDAC-2012-RyzhenkoB #satisfiability #standard
Standard cell routing via boolean satisfiability (NR, SB), pp. 603–612.
FASEFASE-2012-AlrajehKRU #learning #satisfiability #specification
Learning from Vacuously Satisfiable Scenario-Based Specifications (DA, JK, AR, SU), pp. 377–393.
SASSAS-2012-DSilvaHK #satisfiability
Satisfiability Solvers Are Static Analysers (VD, LH, DK), pp. 317–333.
STOCSTOC-2012-BartoK #constraints #problem #robust #satisfiability
Robust satisfiability of constraint satisfaction problems (LB, MK), pp. 931–940.
CHICHI-2012-OlssonS #artificial reality #case study #experience #mobile
Narratives of satisfying and unsatisfying experiences of current mobile augmented reality applications (TO, MS), pp. 2779–2788.
CIKMCIKM-2012-ShenCL
Loyalty-based selection: retrieving objects that persistently satisfy criteria (ZS, MAC, XL), pp. 2189–2193.
CAVCAV-2012-DilligDMA #smt
Minimum Satisfying Assignments for SMT (ID, TD, KLM, AA), pp. 394–409.
CAVCAV-2012-HanJ #satisfiability
When Boolean Satisfiability Meets Gaussian Elimination in a Simplex Way (CSH, JHRJ), pp. 410–426.
CSLCSL-2012-BertrandFS #bound #satisfiability
Bounded Satisfiability for PCTL (NB, JF, SS), pp. 92–106.
CSLCSL-2012-Lynce #named #satisfiability
Satisfiability: where Theory meets Practice (Invited Talk) (IL), pp. 12–13.
ICLPICLP-J-2012-Duck #constraints #named #satisfiability
SMCHR: Satisfiability modulo constraint handling rules (GJD), pp. 601–618.
IJCARIJCAR-2012-Bjorner #satisfiability
Taking Satisfiability to the Next Level with Z3 — (Abstract) (NB), pp. 1–8.
IJCARIJCAR-2012-GaoAC #satisfiability
δ-Complete Decision Procedures for Satisfiability over the Reals (SG, JA, EMC), pp. 286–300.
ICSTSAT-2012-AchlioptasM #algorithm #bound #exponential #random #satisfiability
Exponential Lower Bounds for DPLL Algorithms on Satisfiable Random 3-CNF Formulas (DA, RMM), pp. 327–340.
ICSTSAT-2012-CreignouV #complexity #problem #satisfiability
Parameterized Complexity of Weighted Satisfiability Problems (NC, HV), pp. 341–354.
ICSTSAT-2012-CrowstonGJRSY #parametricity
Fixed-Parameter Tractability of Satisfying beyond the Number of Variables (RC, GG, MJ, VR, SS, AY), pp. 355–368.
ICSTSAT-2012-GaspersS #satisfiability
Strong Backdoors to Nested Satisfiability (SG, SS), pp. 72–85.
ICSTSAT-2012-Knuth #programming #satisfiability
Satisfiability and The Art of Computer Programming (DEK), p. 15.
ICSTSAT-2012-LiL #satisfiability
Satisfying versus Falsifying in Local Search for Satisfiability — (Poster Presentation) (CML, YL), pp. 477–478.
ICSTSAT-2012-LiWL #satisfiability
Exploiting Historical Relationships of Clauses and Variables in Local Search for Satisfiability — (Poster Presentation) (CML, WW, YL), pp. 479–480.
SMTSMT-2012-BjornerMR #modulo theories #satisfiability #verification
Program Verification as Satisfiability Modulo Theories (NB, KLM, AR), pp. 3–11.
SMTSMT-2012-PhanBM #quantifier #satisfiability
Anatomy of Alternating Quantifier Satisfiability (Work in progress) (ADP, NB, DM), pp. 120–130.
TACASTACAS-2011-GriggioLS #generative #integer #linear #performance #satisfiability
Efficient Interpolant Generation in Satisfiability Modulo Linear Integer Arithmetic (AG, TTHL, RS), pp. 143–157.
TACASTACAS-2011-TeigeF #probability #problem #satisfiability
Generalized Craig Interpolation for Stochastic Boolean Satisfiability Problems (TT, MF), pp. 158–172.
ICPCICPC-2011-RupakhetiH #programming
Satisfying Programmers’ Information Needs in API-Based Programming (CRR, DH), pp. 250–253.
PLDIPLDI-2011-JoseM #fault #locality #satisfiability #using
Cause clue clauses: error localization using maximum satisfiability (MJ, RM), pp. 437–446.
SASSAS-2011-SuterKK #recursion #satisfiability #source code
Satisfiability Modulo Recursive Programs (PS, ASK, VK), pp. 298–315.
CIAACIAA-2011-CastanoC #approach #satisfiability
Variable and Clause Ordering in an FSA Approach to Propositional Satisfiability (JMC, RC), pp. 76–87.
DLTDLT-2011-PlyushchenkoS #on the
On Brzozowski’s Conjecture for the Free Burnside Semigroup Satisfying x2 = x3 (ANP, AMS), pp. 362–373.
FMFM-2011-RozierV #approach #encoding #ltl #multi #satisfiability
A Multi-encoding Approach for LTL Symbolic Satisfiability Checking (KYR, MYV), pp. 417–431.
HCIHCI-UA-2011-KimuraF #communication #comprehension #design
Design of Communication Field for Leading to Satisfied Understanding: Example of High-Level Radioactive Waste Disposal in Japan (HK, MF), pp. 354–359.
SIGIRSIGIR-2011-ClinchantG #constraints #information retrieval #modelling
Do IR models satisfy the TDC retrieval constraint (SC, ÉG), pp. 1155–1156.
REFSQREFSQ-2011-QureshiSP #perspective #research
Satisfying User Needs at the Right Time and in the Right Place: A Research Preview (NAQ, NS, AP), pp. 94–99.
SACSAC-2011-RosaGO #problem #quality #satisfiability
Optimal stopping methods for finding high quality solutions to satisfiability problems with preferences (EDR, EG, BO), pp. 901–906.
CADECADE-2011-KlinovP #hybrid #probability #satisfiability
A Hybrid Method for Probabilistic Satisfiability (PK, BP), pp. 354–368.
LICSLICS-2011-HerrmannZ #complexity #quantum #satisfiability
Computational Complexity of Quantum Satisfiability (CH, MZ), pp. 175–184.
ICSTSAT-2011-DantsinH #satisfiability
Satisfiability Certificates Verifiable in Subexponential Time (ED, EAH), pp. 19–32.
ICSTSAT-2011-Gelder11a #satisfiability
Generalized Conflict-Clause Strengthening for Satisfiability Solvers (AVG), pp. 329–342.
ICSTSAT-2011-OrdyniakPS #satisfiability
Satisfiability of Acyclic and almost Acyclic CNF Formulas (II) (SO, DP, SS), pp. 47–60.
ICSTSAT-2011-PrevitiRSS #satisfiability
Applying UCT to Boolean Satisfiability (AP, RR, MS, BS), pp. 373–374.
ICSTSAT-2011-SpeckenmeyerWP #approach #graph #satisfiability
A Satisfiability-Based Approach for Embedding Generalized Tanglegrams on Level Graphs (ES, AW, SP), pp. 134–144.
VMCAIVMCAI-2011-SuterSK #constraints #modulo theories #satisfiability #set
Sets with Cardinality Constraints in Satisfiability Modulo Theories (PS, RS, VK), pp. 403–418.
DATEDATE-2010-SoekenWKGD #modelling #ocl #satisfiability #uml #using #verification
Verifying UML/OCL models using Boolean satisfiability (MS, RW, MK, MG, RD), pp. 1341–1344.
TACASTACAS-2010-CimattiFGSS #formal method #satisfiability
Satisfiability Modulo the Theory of Costs: Foundations and Applications (AC, AF, AG, RS, CS), pp. 99–113.
STOCSTOC-2010-DellM #polynomial #satisfiability
Satisfiability allows no nontrivial sparsification unless the polynomial-time hierarchy collapses (HD, DvM), pp. 251–260.
STOCSTOC-2010-PaturiP #complexity #on the #satisfiability
On the complexity of circuit satisfiability (RP, PP), pp. 241–250.
ICALPICALP-v1-2010-Welzl #constraints #satisfiability
When Conflicting Constraints Can Be Resolved — The Lovász Local Lemma and Satisfiability (EW), p. 18.
ICALPICALP-v2-2010-AchilleosLM #satisfiability
Parameterized Modal Satisfiability (AA, ML, VM), pp. 369–380.
ICALPICALP-v2-2010-MertziosSSZ #multi #network #set
Placing Regenerators in Optical Networks to Satisfy Multiple Sets of Requests (GBM, IS, MS, SZ), pp. 333–344.
LATALATA-2010-AravantinosCP #complexity #problem #satisfiability
Complexity of the Satisfiability Problem for a Class of Propositional Schemata (VA, RC, NP), pp. 58–69.
KEODKEOD-2010-GillespieSC #case study #composition #modelling
Satisfying user Expectations in Ontology-driven Compositional Systems — A Case Study in Fish Population Modeling (MGG, DAS, SSC), pp. 133–143.
KMISKMIS-2010-SultanowWL #communication
Solve Insufficient Communications — A Measurement-method for Satisfied Communication in Business Organizations (ES, EW, RL), pp. 367–371.
POPLPOPL-2010-HarrisSIG #program analysis #satisfiability #source code
Program analysis via satisfiability modulo path programs (WRH, SS, FI, AG), pp. 71–82.
SACSAC-2010-LeungHB #constraints #mining #nondeterminism
Mining uncertain data for frequent itemsets that satisfy aggregate constraints (CKSL, BH, DAB), pp. 1034–1038.
ICSTICST-2010-WeiGMO
Satisfying Test Preconditions through Guided Object Selection (YW, SG, BM, MO), pp. 303–312.
ICSTSAT-2010-BelovS #satisfiability
Improved Local Search for Circuit Satisfiability (AB, ZS), pp. 293–299.
ICSTSAT-2010-KatebiSM #satisfiability #symmetry
Symmetry and Satisfiability: An Update (HK, KAS, ILM), pp. 113–127.
ICSTSAT-2010-MatthewsP #satisfiability
Uniquely Satisfiable k-SAT Instances with Almost Minimal Occurrences of Each Variable (WM, RP), pp. 369–374.
DATEDATE-2009-ZhengH #array #logic #programmable #satisfiability
Defect-aware logic mapping for nanowire-based programmable logic arrays via satisfiability (YZ, CH), pp. 1279–1283.
PODSPODS-2009-AbiteboulBM #documentation #query #satisfiability
Satisfiability and relevance for queries over active documents (SA, PB, BM), pp. 87–96.
PODSPODS-2009-Figueira #satisfiability #similarity #testing #xpath
Satisfiability of downward XPath with data equality tests (DF), pp. 197–206.
TACASTACAS-2009-NicoliniRR #integer #satisfiability
Satisfiability Procedures for Combination of Theories Sharing Integer Offsets (EN, CR, MR), pp. 428–442.
STOCSTOC-2009-ODonnellW #satisfiability
Conditional hardness for satisfiable 3-CSPs (RO, YW), pp. 493–502.
DLTDLT-2009-Saarela #complexity #equation #on the #satisfiability #theorem
On the Complexity of Hmelevskii’s Theorem and Satisfiability of Three Unknown Equations (AS), pp. 443–453.
RERE-2009-WaldmannJ #feature model #perspective #requirements #reuse
Feature-oriented Requirements Satisfy Needs for Reuse and Systems View (BW, PJ), pp. 329–334.
SACSAC-2009-GroppeNL #java #named #query #rdf #satisfiability #semantics #type safety #web
SWOBE — embedding the semantic web languages RDF, SPARQL and SPARUL into java for guaranteeing type safety, for checking the satisfiability of queries and for the determination of query result types (SG, JN, VL), pp. 1239–1246.
SACSAC-2009-KrocSS #heuristic #message passing #satisfiability
Message-passing and local heuristics as decimation strategies for satisfiability (LK, AS, BS), pp. 1408–1414.
CADECADE-2009-BonacinaLM #on the #proving #satisfiability #theorem proving
On Deciding Satisfiability by DPLL(G+T) and Unsound Theorem Proving (MPB, CL, LMdM), pp. 35–50.
CADECADE-2009-GoreW #on the fly #satisfiability
An Optimal On-the-Fly Tableau-Based Decision Procedure for PDL-Satisfiability (RG, FW), pp. 437–452.
ICLPICLP-2009-Truszczynski #logic programming #satisfiability #semantics #source code
Reducts of Propositional Theories, Satisfiability Relations, and Generalizations of Semantics of Logic Programs (MT), pp. 175–189.
LICSLICS-2009-KazakovP #complexity #logic #problem #satisfiability
A Note on the Complexity of the Satisfiability Problem for Graded Modal Logics (YK, IPH), pp. 407–416.
LICSLICS-2009-KieronskiT #equivalence #finite #first-order #logic #on the #satisfiability
On Finite Satisfiability of Two-Variable First-Order Logic with Equivalence Relations (EK, LT), pp. 123–132.
ICSTSAT-2009-AnsoteguiBL #satisfiability #testing
Solving (Weighted) Partial MaxSAT through Satisfiability Testing (CA, MLB, JL), pp. 427–440.
ICSTSAT-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.
ICSTSAT-2009-BelovS #probability #process #satisfiability
Improving Variable Selection Process in Stochastic Local Search for Propositional Satisfiability (AB, ZS), pp. 258–264.
ICSTSAT-2009-KimSJ #modulo theories #performance #satisfiability
Efficient Term-ITE Conversion for Satisfiability Modulo Theories (HK, FS, HJ), pp. 195–208.
ICSTSAT-2009-PipatsrisawatD #policy #satisfiability
Width-Based Restart Policies for Clause-Learning Satisfiability Solvers (KP, AD), pp. 341–355.
ICSTSAT-2009-Vardi #satisfiability
Symbolic Techniques in Propositional Satisfiability Solving (MYV), pp. 2–3.
TAPTAP-2009-CalvagnaG #combinator #heuristic #interactive #satisfiability #testing
Combining Satisfiability Solving and Heuristics to Constrained Combinatorial Interaction Testing (AC, AG), pp. 27–42.
ASEASE-2008-PradellaMP #bound #realtime #satisfiability #specification
Refining Real-Time System Specifications through Bounded Model- and Satisfiability-Checking (MP, AM, PSP), pp. 119–127.
DACDAC-2008-DavisTYZ #configuration management #hardware #satisfiability
A practical reconfigurable hardware accelerator for Boolean satisfiability solvers (JDD, ZT, FY, LZ), pp. 780–785.
DACDAC-2008-LeeJH #satisfiability #scalability
Bi-decomposing large Boolean functions via interpolation and satisfiability solving (RRL, JHRJ, WLH), pp. 636–641.
DATEDATE-2008-Marques-SilvaP #algorithm #satisfiability #using
Algorithms for Maximum Satisfiability using Unsatisfiable Cores (JMS, JP), pp. 408–413.
DATEDATE-2008-VelevG #comparison #encoding #problem #satisfiability
Comparison of Boolean Satisfiability Encodings on FPGA Detailed Routing Problems (MNV, PG), pp. 1268–1273.
SIGMODSIGMOD-2008-NambiarGBM #multi
Helping satisfy multiple objectives during a service desk conversation (UN, HG, RB, MKM), pp. 1147–1158.
FoSSaCSFoSSaCS-2008-Parys #commutative #equation #finite
Systems of Equations Satisfied in All Commutative Finite Semigroups (PP), pp. 261–272.
TACASTACAS-2008-CimattiGS #generative #modulo theories #performance #satisfiability
Efficient Interpolant Generation in Satisfiability Modulo Theories (AC, AG, RS), pp. 397–412.
TACASTACAS-2008-WulfDMR #algorithm #anti #ltl #model checking #named #satisfiability
Antichains: Alternative Algorithms for LTL Satisfiability and Model-Checking (MDW, LD, NM, JFR), pp. 63–77.
AFLAFL-2008-BreveglieriCNR #equation #problem #satisfiability
NP-completeness of the alphabetical satisfiability problem for trace equations (LB, AC, CDN, ER), pp. 111–121.
ICALPICALP-B-2008-Schewe #satisfiability
ATL* Satisfiability Is 2EXPTIME-Complete (SS), pp. 373–385.
GT-VCGT-VC-2007-Pennemann08 #algorithm #approximate #problem #satisfiability
An Algorithm for Approximating the Satisfiability Problem of High-level Conditions (KHP), pp. 75–94.
CIKMCIKM-2008-ZhouYM #biology
A system for finding biological entities that satisfy certain conditions from texts (WZ, CTY, WM), pp. 1281–1290.
LICSLICS-2008-BrazdilFKK #probability #problem #satisfiability
The Satisfiability Problem for Probabilistic CTL (TB, VF, JK, AK), pp. 391–402.
ICSTSAT-2008-MarienWDB #induction #logic #satisfiability
SAT(ID): Satisfiability of Propositional Logic Extended with Inductive Definitions (MM, JW, MD, MB), pp. 211–224.
ICSTSAT-2008-Marques-SilvaM #algorithm #effectiveness #satisfiability #towards
Towards More Effective Unsatisfiability-Based Maximum Satisfiability Algorithms (JMS, VMM), pp. 225–230.
ICSTSAT-2008-StachniakB #learning #satisfiability
Speeding-Up Non-clausal Local Search for Propositional Satisfiability with Clause Learning (ZS, AB), pp. 257–270.
ECSAECSA-2007-HarrisonA #design pattern #quality
Leveraging Architecture Patterns to Satisfy Quality Attributes (NBH, PA), pp. 263–270.
DACDAC-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.
DATEDATE-2007-MangassarianVSNA #estimation #process #pseudo #satisfiability #using
Maximum circuit activity estimation using pseudo-boolean satisfiability (HM, AGV, SS, FNN, MSA), pp. 1538–1543.
FoSSaCSFoSSaCS-2007-BaulandSSSV #complexity #linear #logic #satisfiability
The Complexity of Generalized Satisfiability for Linear Temporal Logic (MB, TS, HS, IS, HV), pp. 48–62.
TACASTACAS-2007-KrsticGGT #parametricity #satisfiability
Combined Satisfiability Modulo Parametric Theories (SK, AG, JG, CT), pp. 602–617.
HCIHCI-IDU-2007-NingT #functional #how #order #usability
How to Use Emotional Usability to Make the Product Serves a Need Beyond the Traditional Functional Objective to Satisfy the Emotion Needs of the User in Order to Improve the Product Differentiator — Focus on Home Appliance Product (LN, ST), pp. 587–593.
ECMFAECMDA-FA-2007-MaraeeB #diagrams #finite #performance #reasoning #satisfiability #set #uml
Efficient Reasoning About Finite Satisfiability of UML Class Diagrams with Constrained Generalization Sets (AM, MB), pp. 17–31.
CADECADE-2007-GeBT #modulo theories #quantifier #satisfiability #using #verification
Solving Quantified Verification Conditions Using Satisfiability Modulo Theories (YG, CB, CT), pp. 167–182.
CADECADE-2007-GhilardiNRZ #infinity #model checking #satisfiability
Combination Methods for Satisfiability and Model-Checking of Infinite-State Systems (SG, EN, SR, DZ), pp. 362–378.
CADECADE-2007-KuncakR #algebra #performance #satisfiability #towards
Towards Efficient Satisfiability Checking for Boolean Algebra with Presburger Arithmetic (VK, MCR), pp. 215–230.
CAVCAV-2007-CimattiRST #abstraction #logic #satisfiability
Boolean Abstraction for Temporal Logic Satisfiability (AC, MR, VS, ST), pp. 532–546.
CAVCAV-2007-MouraDS #modulo theories #satisfiability #tutorial
A Tutorial on Satisfiability Modulo Theories (LMdM, BD, NS), pp. 20–36.
CSLCSL-2007-FiliotTT #logic #satisfiability
Satisfiability of a Spatial Logic with Tree Variables (EF, JMT, ST), pp. 130–145.
RTARTA-2007-NieuwenhuisORR #challenge #modulo theories #satisfiability
Challenges in Satisfiability Modulo Theories (RN, AO, ERC, AR), pp. 2–18.
RTARTA-2007-ZanklM #constraints
Satisfying KBO Constraints (HZ, AM), pp. 389–403.
ICSTSAT-2007-AloulK #approach #deployment #satisfiability
Sensor Deployment for Failure Diagnosis in Networked Aerial Robots: A Satisfiability-Based Approach (FAA, NK), pp. 369–376.
ICSTSAT-2007-PipatsrisawatD #component #lightweight #satisfiability
A Lightweight Component Caching Scheme for Satisfiability Solvers (KP, AD), pp. 294–299.
ICSTSAT-2007-SchederZ #exponential #product line #satisfiability
Satisfiability with Exponential Families (DS, PZ), pp. 148–158.
DACDAC-2006-ZhangMBC #detection #representation #satisfiability #scalability #simulation #symmetry #using
Symmetry detection for large Boolean functions using circuit representation, simulation, and satisfiability (JSZ, AM, RKB, MCJ), pp. 510–515.
DATEDATE-2006-JinS #analysis #satisfiability
Strong conflict analysis for propositional satisfiability (HJ, FS), pp. 818–823.
DATEDATE-DF-2006-PotlapallyRRJL #encryption #framework #satisfiability
Satisfiability-based framework for enabling side-channel attacks on cryptographic software (NRP, AR, SR, NKJ, RBL), pp. 18–23.
ICALPICALP-v1-2006-BjorklundH #algorithm #satisfiability
Exact Algorithms for Exact Satisfiability and Number of Perfect Matchings (AB, TH), pp. 548–559.
ICALPICALP-v1-2006-GopalanKMP #satisfiability
The Connectivity of Boolean Satisfiability: Computational and Structural Dichotomies (PG, PGK, ENM, CHP), pp. 346–357.
ICGTICGT-2006-HabelP #satisfiability
Satisfiability of High-Level Conditions (AH, KHP), pp. 430–444.
CAiSECAiSE-2006-DourdasZMJZ #query #requirements
Discovering Remote Software Services that Satisfy Requirements: Patterns for Query Reformulation (ND, XZ, NAMM, SJ, KZ), pp. 239–254.
SACSAC-2006-LallouetL #consistency #constraints #satisfiability
From satisfiability to consistency through certificates: application to partially defined constraints (AL, AL), pp. 415–416.
CSLCSL-2006-ScheweF #calculus #finite #satisfiability #μ-calculus
Satisfiability and Finite Model Property for the Alternating-Time μ-Calculus (SS, BF), pp. 591–605.
IJCARIJCAR-2006-Darwiche #compilation #evolution #satisfiability
Searching While Keeping a Trace: The Evolution from Satisfiability to Knowledge Compilation (AD), p. 3.
LICSLICS-2006-FischerMR #approximate #equivalence #satisfiability
Approximate Satisfiability and Equivalence (EF, FM, MdR), pp. 421–430.
ICSTSAT-2006-HsuM #satisfiability
Characterizing Propagation Methods for Boolean Satisfiability (EIH, SAM), pp. 325–338.
ICSTSAT-2006-JainBC #satisfiability #using
Satisfiability Checking of Non-clausal Formulas Using General Matings (HJ, CB, EMC), pp. 75–89.
ICSTSAT-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.
ICSTSAT-2006-SheiniS #modulo theories #satisfiability
From Propositional Satisfiability to Satisfiability Modulo Theories (HMS, KAS), pp. 1–9.
ICSTSAT-2006-SheiniS06a #modulo theories #satisfiability
A Progressive Simplifier for Satisfiability Modulo Theories (HMS, KAS), pp. 184–197.
DACDAC-2005-JinS #performance
Prime clauses for fast enumeration of satisfying assignments to boolean circuits (HJ, FS), pp. 750–753.
DATEDATE-2005-ChandrasekarH #fault #generative #incremental #integration #learning #performance #satisfiability #testing
Integration of Learning Techniques into Incremental Satisfiability for Efficient Path-Delay Fault Test Generation (KC, MSH), pp. 1002–1007.
DATEDATE-2005-FuYM #satisfiability
Considering Circuit Observability Don’t Cares in CNF Satisfiability (ZF, YY, SM), pp. 1108–1113.
PODSPODS-2005-BenediktFG #satisfiability #xpath
XPath satisfiability in the presence of DTDs (MB, WF, FG), pp. 25–36.
ESOPESOP-2005-NiehrenPS #complexity #satisfiability #type system
Complexity of Subtype Satisfiability over Posets (JN, TP, ZS), pp. 357–373.
TACASTACAS-2005-BozzanoBCJRSS #incremental #linear #logic #satisfiability
An Incremental and Layered Procedure for the Satisfiability of Linear Arithmetic Logic (MB, RB, AC, TAJ, PvR, SS, RS), pp. 317–333.
TACASTACAS-2005-JinHS #analysis #performance
Efficient Conflict Analysis for Finding All Satisfying Assignments of a Boolean Circuit (HJ, HH, FS), pp. 287–300.
POPLPOPL-2005-XieA #detection #fault #satisfiability #scalability #using
Scalable error detection using boolean satisfiability (YX, AA), pp. 351–363.
ICSTSAT-J-2004-GummadiNV05 #algorithm #independence #satisfiability #set #using
Algorithms for Satisfiability Using Independent Sets of Variables (RG, NSN, VR), pp. 133–144.
ICSTSAT-J-2004-JiaMS05 #satisfiability
From Spin Glasses to Hard Satisfiable Formulas (HJ, CM, BS), pp. 199–210.
ICSTSAT-J-2004-JinS05 #hybrid #named #satisfiability
CirCUs: A Hybrid Satisfiability Solver (HJ, FS), pp. 211–223.
ICSTSAT-J-2004-PanV05 #satisfiability
Search vs. Symbolic Techniques in Satisfiability Solving (GP, MYV), pp. 235–250.
ICSTSAT-J-2004-Sinopalnikov05 #random #satisfiability
Satisfiability Threshold of the Skewed Random k-SAT (DAS), pp. 263–275.
ICSTSAT-J-2004-TangYRM05 #algorithm #analysis #problem #quantifier #satisfiability
Analysis of Search Based Algorithms for Satisfiability of Propositional and Quantified Boolean Formulas Arising from Circuit State Space Diameter Problems (DT, YY, DR, SM), pp. 292–305.
CAVCAV-2005-BarrettMS #contest #modulo theories #named #satisfiability
SMT-COMP: Satisfiability Modulo Theories Competition (CWB, LMdM, AS), pp. 20–23.
CAVCAV-2005-BozzanoBCJRRS #modulo theories #performance #satisfiability
Efficient Satisfiability Modulo Theories via Delayed Theory Combination (MB, RB, AC, TAJ, SR, PvR, RS), pp. 335–349.
ICLPICLP-2005-PelovT #induction #satisfiability
Reducing Inductive Definitions to Propositional Satisfiability (NP, ET), pp. 221–234.
ICSTSAT-2005-BelovS #logic #satisfiability
Substitutional Definition of Satisfiability in Classical Propositional Logic (AB, ZS), pp. 31–45.
ICSTSAT-2005-LiH #satisfiability
Diversification and Determinism in Local Search for Satisfiability (CML, WH), pp. 158–172.
ICSTSAT-2005-LingSB #logic #quantifier #satisfiability #synthesis #using
FPGA Logic Synthesis Using Quantified Boolean Satisfiability (ACL, DPS, SDB), pp. 444–450.
ICSTSAT-2005-MaarenN #satisfiability
Sums of Squares, Satisfiability and Maximum Satisfiability (HvM, LvN), pp. 294–308.
ICSTSAT-2005-SeitzAO #behaviour #random #satisfiability
Threshold Behaviour of WalkSAT and Focused Metropolis Search on Random 3-Satisfiability (SS, MA, PO), pp. 475–481.
ICSTSAT-2005-SheiniS #integer #linear #logic #satisfiability #scalability
A Scalable Method for Solving Satisfiability of Integer Linear Arithmetic Logic (HMS, KAS), pp. 241–256.
DATEDATE-v1-2004-SafarpourVDL #satisfiability
Managing Don’t Cares in Boolean Satisfiability (SS, AGV, RD, JL), pp. 260–265.
PODSPODS-2004-Calders #complexity #satisfiability
Computational Complexity of Itemset Frequency Satisfiability (TC), pp. 143–154.
VLDBVLDB-2004-LakshmananRWZ #on the #query #satisfiability #testing
On Testing Satisfiability of Tree Pattern Queries (LVSL, GR, WHW, Z(Z), pp. 120–131.
ICALPICALP-2004-AlekhnovichHI #algorithm #bound #exponential #satisfiability
Exponential Lower Bounds for the Running Time of DPLL Algorithms on Satisfiable Formulas (MA, EAH, DI), pp. 84–96.
ICALPICALP-2004-MelkebeekR #bound #satisfiability
A Time Lower Bound for Satisfiability (DvM, RR), pp. 971–982.
CAiSECAiSE-2004-SebastianiGM #low cost #modelling #satisfiability
Simple and Minimum-Cost Satisfiability for Goal Models (RS, PG, JM), pp. 20–35.
KRKR-2004-SerafiniR #satisfiability
Satisfiability for Propositional Contexts (LS, FR), pp. 369–376.
PPDPPPDP-2004-CamaraoFV #constraints #satisfiability
Constraint-set satisfiability for overloading (CC, LF, CV), pp. 67–77.
CAVCAV-2004-JinAS #bound #model checking #named #satisfiability #towards
CirCUs: A Satisfiability Solver Geared towards Bounded Model Checking (HJ, MA, FS), pp. 519–522.
CAVCAV-2004-KroeningOSS #satisfiability
Abstraction-Based Satisfiability Solving of Presburger Arithmetic (DK, JO, SAS, OS), pp. 308–320.
SATSAT-2004-GummadiNV #algorithm #independence #satisfiability #set #using
Algorithms for Satisfiability using Independent Sets of Variables (RG, NSN, VR), pp. 56–63.
SATSAT-2004-JiaMS #satisfiability
From Spin Glasses to Hard Satisfiable Formulas (HJ, CM, BS), pp. 12–19.
SATSAT-2004-JinS #hybrid #named #satisfiability
CirCUs: A Hybrid Satisfiability Solver (HJ, FS), pp. 47–55.
SATSAT-2004-PanV #satisfiability
Search vs. Symbolic Techniques in Satisfiability Solving (GP, MYV), pp. 137–146.
SATSAT-2004-Stachniak
A Note on Satisfying Truth-Value Assignments of Boolean Formulas (ZS), pp. 104–110.
SATSAT-2004-TangYRM #algorithm #analysis #problem #quantifier #satisfiability
Analysis of Search Based Algorithms for Satisfiability of Quantified Boolean Formulas Arising from Circuit State Space Diameter Problems (DT, YY, DR, SM), pp. 214–223.
DACDAC-2003-AloulMS #named #performance #satisfiability #symmetry
Shatter: efficient symmetry-breaking for boolean satisfiability (FAA, ILM, KAS), pp. 836–839.
DACDAC-2003-DamianoK #satisfiability
Checking satisfiability of a conjunction of BDDs (RFD, JHK), pp. 818–823.
DACDAC-2003-Tahoori #satisfiability #testing #using
Using satisfiability in application-dependent testing of FPGA interconnects (MBT), pp. 678–681.
FMFME-2003-BeekK #automaton #composition
Team Automata Satisfying Compositionality (MHtB, JK), pp. 381–400.
ICEISICEIS-v2-2003-Debenham #constraints #people #process
Agents for High-Level Process Management: The Right Activities, People and Resources to Satisfy Process Constraints (JKD), pp. 434–437.
SACSAC-2003-AtluriAGA #constraints #multi #security #self
Self-Manifestation of Composite Multimedia Objects to Satisfy Security Constraints (VA, NRA, AG, IA), pp. 927–934.
LICSLICS-2003-Drimmelen #logic #satisfiability
Satisfiability in Alternating-time Temporal Logic (GvD), pp. 208–217.
ICSTSAT-2003-DransfieldMT #satisfiability
Satisfiability and Computing van der Waerden Numbers (MRD, VWM, MT), pp. 1–13.
ICSTSAT-2003-FrancoKSWWDV #named #satisfiability
SBSAT: a State-Based, BDD-Based Satisfiability Solver (JVF, MK, JSS, JW, SW, MD, WMV), pp. 398–410.
ICSTSAT-2003-Parisi #approach #on the #probability #problem #random #satisfiability
On the Probabilistic Approach to the Random Satisfiability Problem (GP), pp. 203–213.
ICSTSAT-2003-PorschenRS #algorithm #linear #problem #satisfiability
Linear Time Algorithms for Some Not-All-Equal Satisfiability Problems (SP, BR, ES), pp. 172–187.
ICSTSAT-2003-Pretolani #problem #reduction #satisfiability
Hypergraph Reductions and Satisfiability Problems (DP), pp. 383–397.
ICSTSAT-2003-SemerjianM #case study #physics #problem #random #satisfiability
A Study of Pure Random Walk on Random Satisfiability Problems with “Physical” Methods (GS, RM), pp. 120–134.
DATEDATE-2002-GoldbergPB #algorithm #problem #satisfiability #symmetry #using
Using Problem Symmetry in Search Based Satisfiability Algorithms (EIG, MRP, RKB), pp. 134–141.
KDDKDD-2002-Iyengar #constraints #privacy
Transforming data to satisfy privacy constraints (VSI), pp. 279–288.
CADECADE-2002-Goldberg #satisfiability #testing
Testing Satisfiability of CNF Formulas by Computing a Stable Set of Points (EG), pp. 161–180.
CADECADE-2002-ZhangM #performance #satisfiability
The Quest for Efficient Boolean Satisfiability Solvers (LZ, SM), pp. 295–313.
CAVCAV-2002-BarrettDS #first-order #incremental #satisfiability
Checking Satisfiability of First-Order Formulas by Incremental Translation to SAT (CWB, DLD, AS), pp. 236–249.
CAVCAV-2002-ZhangM #performance #satisfiability
The Quest for Efficient Boolean Satisfiability Solvers (LZ, SM), pp. 17–36.
LICSLICS-2002-Bars #logic #satisfiability
The 0-1 law fails for frame satisfiability of propositional modal logic (JMLB), pp. 225–234.
SATSAT-2002-CreignouD #problem #random #satisfiability
Random generalized satisfiability problems (NC, HD), p. 2.
SATSAT-2002-DrakeFW #satisfiability
Adding resolution to the DPLL procedure for satisfiability (LD, AF, TW), p. 46.
SATSAT-2002-Gelder #reasoning #satisfiability #towards
Toward leaner binary-clause reasoning in a satisfiability solver (AVG), p. 16.
SATSAT-2002-Goldberg #satisfiability #testing
Testing satisfiability of CNF formulas by computing a stable set of points (EG), p. 12.
SATSAT-2002-KaporisKL #algorithm #analysis #probability #satisfiability
The Probabilistic Analysis of a Greedy Satisfiability Algorithm (ACK, LMK, EGL), p. 5.
SATSAT-2002-LynceM1 #algorithm #backtracking #satisfiability #strict
Complete unrestricted backtracking algorithms for satisfiability (IL, JMS), p. 29.
SATSAT-2002-MalerMNA #difference #logic #satisfiability
A satisfiability checker for difference logic (OM, MM, PN, EA), p. 27.
SATSAT-2002-Marques-Silva #reasoning #satisfiability
Hypothetical reasoning in propositional satisfiability (Keynote Talk) (JMS), p. 14.
SATSAT-2002-RuessM #satisfiability
Lemmas on demand for Satisfiability solvers (HR, LdM), p. 17.
SATSAT-2002-TakenakaH #algorithm #problem #satisfiability
An analog algorithm for the satisfiability problem (YT, AH), p. 40.
DACDAC-2001-VelevB #effectiveness #satisfiability #verification
Effective Use of Boolean Satisfiability Procedures in the Formal Verification of Superscalar and VLIW Microprocessors (MNV, REB), pp. 226–231.
DACDAC-2001-WhittemoreKS #incremental #named #satisfiability
SATIRE: A New Incremental Satisfiability Engine (JW, JK, KAS), pp. 542–545.
DATEDATE-2001-NamSR #approach #incremental #satisfiability
A boolean satisfiability-based incremental rerouting approach with application to FPGAs (GJN, KAS, RAR), pp. 560–565.
DATEDATE-2001-RedaS #diagrams #equivalence #satisfiability #using
Combinational equivalence checking using Boolean satisfiability and binary decision diagrams (SR, AS), pp. 122–126.
DATEDATE-2001-ZengKC #approach #named #satisfiability
LPSAT: a unified approach to RTL satisfiability (ZZ, PK, MJC), pp. 398–402.
TACASTACAS-2001-WilliamsAH #diagrams #satisfiability #using
Satisfiability Checking Using Boolean Expression Diagrams (PFW, HRA, HH), pp. 39–51.
CAVCAV-2001-BjesseLM #debugging #satisfiability #using
Finding Bugs in an α Microprocessor Using Satisfiability Solvers (PB, TL, AM), pp. 454–464.
IJCARIJCAR-2001-BaaderT #approach #automaton #satisfiability
The Inverse Method Implements the Automata Approach for Modal Satisfiability (FB, ST), pp. 92–106.
IJCARIJCAR-2001-GiunchigliaMTZ #heuristic #optimisation #satisfiability
Evaluating Search Heuristics and Optimization Techniques in Propositional Satisfiability (EG, MM, AT, DZ), pp. 347–363.
IJCARIJCAR-2001-GiunchigliaNT #named #quantifier #satisfiability
QUBE: A System for Deciding Quantified Boolean Formulas Satisfiability (EG, MN, AT), pp. 364–369.
LICSLICS-2001-LangeS #game studies #logic #satisfiability
Focus Games for Satisfiability and Completeness of Temporal Logic (ML, CS), pp. 357–365.
ICSTSAT-2001-AmirM #composition #problem #satisfiability #using
Solving Satisfiability using Decomposition and the Most Constrained Subproblem (Preliminary Report) (EA, SM), pp. 329–343.
ICSTSAT-2001-BruniS #maintenance #satisfiability
Restoring Satisfiability or Maintaining Unsatisfiability by finding small Unsatisfiable Subformulae (RB, AS), pp. 162–173.
ICSTSAT-2001-BuningZ #satisfiability
Satisfiable Formulas Closed Under Replacement (HKB, XZ), pp. 48–58.
ICSTSAT-2001-Gelder #satisfiability
Combining Preorder and Postorder Resolution in a Satisfiability Solver (AVG), pp. 115–128.
ICSTSAT-2001-KautzRAGSS #problem #satisfiability
Balance and Filtering in Structured Satisfiable Problems (Preliminary Report) (HAK, YR, DA, CPG, BS, MES), pp. 2–18.
ICSTSAT-2001-Kullmann #on the #satisfiability
On the use of autarkies for satisfiability decision (OK), pp. 231–253.
ICSTSAT-2001-LagoudakisL #branch #learning #satisfiability
Learning to Select Branching Rules in the DPLL Procedure for Satisfiability (MGL, MLL), pp. 344–359.
ICSTSAT-2001-LynceBM #algorithm #probability #satisfiability
Stochastic Systematic Search Algorithms for Satisfiability (IL, LB, JMS), pp. 190–204.
ICSTSAT-2001-Morrisette #algorithm #effectiveness #satisfiability
The Unreasonable Effectiveness of Alternation-Based Satisfiability Algorithms (TM), pp. 254–268.
ICSTSAT-2001-RanderathSBHKMSC #graph #problem #satisfiability
A Satisfiability Formulation of Problems on Level Graphs (BR, ES, EB, PLH, AK, KM, BS, OC), pp. 269–277.
DACDAC-2000-SilvaS #automation #design #satisfiability
Boolean satisfiability in electronic design automation (JPMS, KAS), pp. 675–680.
DATEDATE-2000-KallaZCH #framework #paradigm #recursion #satisfiability #using
A BDD-Based Satisfiability Infrastructure Using the Unate Recursive Paradigm (PK, ZZ, MJC, CH), pp. 232–236.
DATEDATE-2000-KimWSS #fault #incremental #on the #satisfiability #testing
On Applying Incremental Satisfiability to Delay Fault Testing (JK, JW, KAS, JPMS), pp. 380–384.
DATEDATE-2000-ManquinhoS #algorithm #on the #satisfiability #using
On Using Satisfiability-Based Pruning Techniques in Covering Algorithms (VMM, JPMS), pp. 356–363.
DATEDATE-2000-SakallahAS #case study #heuristic #satisfiability
An Experimental Study of Satisfiability Search Heuristics (KAS, FAA, JPMS), p. 745.
STOCSTOC-2000-CzumajS #algorithm #approach #problem #satisfiability #scheduling
A new algorithm approach to the general Lovász local lemma with applications to scheduling and satisfiability problems (extended abstract) (AC, CS), pp. 38–47.
STOCSTOC-2000-Gutierrez #equation #satisfiability
Satisfiability of equations in free groups is in PSPACE (CG), pp. 21–27.
KRKR-2000-GinsbergP #algorithm #finite #quantifier #satisfiability
Satisfiability Algorithms and Finite Quantification (MLG, AJP), pp. 690–701.
KRKR-2000-Giunchiglia #concurrent #constraints #nondeterminism #satisfiability
Planning as Satisfiability with Expressive Action Languages: Concurrency, Constraints and Nondeterminism (EG), pp. 657–666.
SACSAC-2000-RossiMK #adaptation #algorithm #problem #satisfiability
An Adaptive Evolutionary Algorithm for the Satisfiability Problem (CR, EM, JNK), pp. 463–469.
CAVCAV-2000-BryantV #constraints #satisfiability #transitive
Boolean Satisfiability with Transitivity Constraints (REB, MNV), pp. 85–98.
CAVCAV-2000-Marques-SilvaS #algorithm #automation #design #satisfiability #tutorial
Invited Tutorial: Boolean Satisfiability Algorithms and Applications in Electronic Design Automation (JPMS, KAS), p. 3.
ICLPCL-2000-ErdemLW #satisfiability
Wire Routing and Satisfiability Planning (EE, VL, MDFW), pp. 822–836.
ICLPCL-2000-JunttilaN #performance #satisfiability #towards
Towards an Efficient Tableau Method for Boolean Circuit Satisfiability Checking (TAJ, IN), pp. 553–567.
CSLCSL-2000-Hemaspaandra #linear #satisfiability
Modal Satisfiability Is in Deterministic Linear Space (EH), pp. 332–342.
LICSLICS-2000-Selman #challenge #problem #satisfiability #testing
Satisfiability Testing: Recent Developments and Challenge Problems (BS), p. 178.
DACDAC-1999-AbramoviciSS #configuration management #hardware #satisfiability #using
A Massively-Parallel Easily-Scalable Satisfiability Solver Using Reconfigurable Hardware (MA, JTdS, DGS), pp. 684–690.
DATEDATE-1999-Marques-SilvaG #equivalence #learning #recursion #satisfiability #using
Combinational Equivalence Checking Using Satisfiability and Recursive Learning (JPMS, TG), pp. 145–149.
DATEDATE-1999-SilvaSM #algorithm #satisfiability
Algorithms for Solving Boolean Satisfiability in Combinational Circuits (LGeS, LMS, JPMS), pp. 526–530.
STOCSTOC-1999-Plandowski #equation #satisfiability #word
Satisfiability of Word Equations with Constants is in NEXPTIME (WP), pp. 721–725.
HCIHCI-CCAD-1999-RuuskaV #communication #design #mobile #research
Contextual research for technological innovation — satisfying user needs in the design of mobile communication devices (SR, KVVM), pp. 28–32.
RTARTA-1999-CaronSTT #quantifier #satisfiability
Deciding the Satisfiability of Quantifier free Formulae on One-Step Rewriting (ACC, FS, ST, MT), pp. 103–117.
DACDAC-1998-FallahDK #functional #generative #linear #modelling #programming #satisfiability #using
Functional Vector Generation for HDL Models Using Linear Programming and 3-Satisfiability (FF, SD, KK), pp. 528–533.
DACDAC-1998-ZhongAMM #case study #configuration management #problem #satisfiability #using
Using Reconfigurable Computing Techniques to Accelerate Problems in the CAD Domain: A Case Study with Boolean Satisfiability (PZ, PA, SM, MM), pp. 194–199.
DATEDATE-1998-RingeLB #satisfiability #using #verification
Path Verification Using Boolean Satisfiability (MR, TL, EB), pp. 965–966.
STOCSTOC-1998-Zwick
Finding Almost-Satisfying Assignments (UZ), pp. 551–560.
KRKR-1998-McCainT #satisfiability
Satisfiability planning with Causal Theories (NM, HT), pp. 212–223.
SACSAC-1998-Nemer-PreeceW #algorithm #parallel #problem #satisfiability #search-based
Parallel genetic algorithm to solve the satisfiability problem (NNP, RWW), pp. 23–28.
SASSAS-1997-Frey #polynomial #type system
Satisfying Subtype Inequalities in Polynomial Space (AF), pp. 265–277.
DACDAC-1996-ChenG #fault #generative #satisfiability
A Satisfiability-Based Test Generator for Path Delay Faults in Combinational Circuts (CAC, SKG), pp. 209–214.
SACSAC-1996-Hartley #problem #satisfiability
Steiner systems and the Boolean satisfiability problem (SJH), pp. 277–281.
CADECADE-1996-ParkG #clustering #satisfiability #scalability #testing
Partitioning Methods for Satisfiability Testing on Large Formulas (TJP, AVG), pp. 748–762.
ICLPICLP-1995-FormicaMT #database #object-oriented #proving #satisfiability #theorem proving
A Theorem Prover for Checking Satisfiability of Object-Oriented Database Schemas (AF, MM, RT), p. 819.
PODSPODS-1994-MumickS #satisfiability
Universal Finiteness and Satisfiability (ISM, OS), pp. 190–200.
PODSPODS-1993-LevyMSS #datalog #equivalence #satisfiability
Equivalence, Query-Reachability, and Satisfiability in Datalog Extensions (AYL, ISM, YS, OS), pp. 109–122.
STOCSTOC-1993-KollerM #constraints
Constructing small sample spaces satisfying given constraints (DK, NM), pp. 268–277.
RTARTA-1993-Fernandez #problem #satisfiability
AC Complement Problems: Satisfiability and Negation Elimination (MF), pp. 358–373.
ICMLML-1992-ConverseH #learning
Learning to Satisfy Conjunctive Goals (TMC, KJH), pp. 117–122.
CSLCSL-1992-Creignou #linear #problem #proving #satisfiability
The Class of Problems that are Linear Equivalent to Satisfiability or a Uniform Method for Proving NP-Completeness (NC), pp. 115–133.
CSLCSL-1992-Schiermeyer #satisfiability
Solving 3-Satisfiability in Less Then 1, 579n Steps (IS), pp. 379–394.
DACDAC-1991-SaldanhaVBS #constraints #encoding #framework
A Framework for Satisfying Input and Output Encoding Constraints (AS, TV, RKB, ALSV), pp. 170–175.
ICALPICALP-1991-JouannaudO #decidability #satisfiability
Satisfiability of Systems of Ordinal Notations with the Subterm Property is Decidable (JPJ, MO), pp. 455–468.
KRKR-1991-Baalen #automation #design #satisfiability
The Completeness of DRAT, A Technique for Automatic Design of Satisfiability Procedures (JVB), pp. 514–525.
ISSTATAV-1989-BiemanS #testing
Estimating the Number of Test Cases Required to Satisfy the All-du-paths Testing Criterion (JMB, JLS), pp. 179–186.
VLDBVLDB-1987-LenzeriniN #constraints #dependence #on the #satisfiability
On The Satisfiability of Dependency Constraints in Entity-Relationship Schemata (ML, PN), pp. 147–154.
SIGIRSIGIR-1987-CaterK #information retrieval #named #requirements
TIRS: A Topological Information Retrieval System Satisfying the Requirements of the Waller-Kraft Wish List (SCC, DHK), pp. 171–180.
CSLCSL-1987-BryM #database #deduction #finite #proving #satisfiability
Proving Finite Satisfiability of Deductive Databases (FB, RM), pp. 44–55.
CSLCSL-1987-Speckenmeyer #backtracking #complexity #on the #problem #satisfiability
On the Average Case Complexity of Backtracking for the Exact-Satisfiability Problem (ES), pp. 281–288.
CADECADE-1986-BuningL #first-order #satisfiability
Classes of First Order Formulas Under Various Satisfiability Definitions (HKB, TL), pp. 553–563.
POPLPOPL-1985-Lamport #concurrent #specification #what #why
What It Means for a Concurrent Program to Satisfy a Specification: Why No One Has Specified Priority (LL), pp. 78–83.
POPLPOPL-1985-LichtensteinP #concurrent #finite #linear #source code #specification
Checking That Finite State Concurrent Programs Satisfy Their Linear Specification (OL, AP), pp. 97–107.
PODSPODS-1984-ImielinskiS #database #on the
On Lossless Transformation of Database Schemes not Necessarily Satisfying Universal Instance Assumption (TI, NS), pp. 258–265.
SIGMODSIGMOD-1984-Piatetsky-ShapiroC #estimation #tuple
Accurate Estimation of the Number of Tuples Satisfying a Condition (GPS, CC), pp. 256–276.
CADECADE-1984-Gelder #calculus #satisfiability
A Satisfiability Tester for Non-Clausal Propositional Calculus (AVG), pp. 101–112.
VLDBVLDB-1982-GelenbeG #dependence #functional
The Size of Projections of Relations Satisfying a Functional Dependency (EG, DG), pp. 325–333.
VLDBVLDB-1980-Demolombe #calculus #estimation #query #tuple
Estimation of the Number of Tuples Satisfying a Query Expressed in Predicate Calculus Language (RD), pp. 55–63.
STOCSTOC-1978-Schaefer #complexity #problem #satisfiability
The Complexity of Satisfiability Problems (TJS), pp. 216–226.
DACDAC-1972-Oishi #problem #specification
Problem areas and the combination of wall-units to satisfy room relation specification between rooms (IO), pp. 239–249.

Bibliography of Software Language Engineering in Generated Hypertext (BibSLEIGH) is created and maintained by Dr. Vadim Zaytsev.
Hosted as a part of SLEBOK on GitHub.