46 papers:
CAV-2015-BacchusK #satisfiability #set #using- Using Minimal Correction Sets to More Efficiently Compute Minimal Unsatisfiable Sets (FB, GK), pp. 70–86.
SAT-2015-LonsingE #api #incremental #satisfiability- Incrementally Computing Minimal Unsatisfiable Cores of QBFs via a Clause Group Solver API (FL, UE), pp. 191–198.
ASE-2014-HagiharaESY #satisfiability #set #specification- Minimal strongly unsatisfiable subsets of reactive system specifications (SH, NE, MS, NY), pp. 629–634.
TACAS-2014-HeizmannCDHLMSWP #contest #satisfiability- Ultimate Automizer with Unsatisfiable Cores — (Competition Contribution) (MH, JC, DD, JH, ML, BM, CS, SW, AP), pp. 418–420.
QAPL-2013-Schuppan #ltl #satisfiability- Enhancing Unsatisfiable Cores for LTL with Information on Temporal Relevance (VS), pp. 49–65.
ICALP-v1-2012-AchlioptasM #bound #random #satisfiability- Unsatisfiability Bounds for Random CSPs from an Energetic Interpolation Method (DA, RMM), pp. 1–12.
CHI-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.
ICLP-2012-AndresKMS #optimisation #satisfiability- Unsatisfiability-based optimization in clasp (BA, BK, OM, TS), pp. 211–221.
- SAT-2012-KullmannZ #on the #reduction #satisfiability
- On Davis-Putnam Reductions for Minimally Unsatisfiable Clause-Sets (OK, XZ), pp. 270–283.
- ICALP-v1-2011-NordstromR #on the #satisfiability #trade-off
- On Minimal Unsatisfiability and Time-Space Trade-offs for k-DNF Resolution (JN, AAR), pp. 642–653.
- SAT-2011-BelovS #satisfiability
- Minimally Unsatisfiable Boolean Circuits (AB, JPMS), pp. 145–158.
- SAT-2011-RyvchinS #performance #satisfiability
- Faster Extraction of High-Level Minimal Unsatisfiable Cores (VR, OS), pp. 174–187.
- SAT-2010-ManquinhoML #algorithm #optimisation #satisfiability
- Improving Unsatisfiability-Based Algorithms for Boolean Optimization (VMM, RM, IL), pp. 181–193.
CADE-2009-ClaessenL #automation #finite #satisfiability- Automated Inference of Finite Unsatisfiability (KC, AL), pp. 388–403.
DATE-2008-Marques-SilvaP #algorithm #satisfiability #using- Algorithms for Maximum Satisfiability using Unsatisfiable Cores (JMS, JP), pp. 408–413.
FM-2008-TorlakCJ #declarative #satisfiability #specification- Finding Minimal Unsatisfiable Cores of Declarative Specifications (ET, FSHC, DJ), pp. 326–341.
ICEIS-DISI-2008-GroppeL #query #satisfiability #xpath- Discovering Veiled Unsatisfiable Xpath Queries (JG, VL), pp. 149–158.
- SAT-2008-LiffitonS #satisfiability #set
- Searching for Autarkies to Trim Unsatisfiable Clause Sets (MHL, KAS), pp. 182–195.
- SAT-2008-Marques-SilvaM #algorithm #effectiveness #satisfiability #towards
- Towards More Effective Unsatisfiability-Based Maximum Satisfiability Algorithms (JMS, VMM), pp. 225–230.
- SAT-2008-SchederZ #how #question #satisfiability
- How Many Conflicts Does It Need to Be Unsatisfiable? (DS, PZ), pp. 246–256.
- 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-Gelder #satisfiability #verification
- Verifying Propositional Unsatisfiability: Pitfalls to Avoid (AVG), pp. 328–333.
- ICEIS-DISI-2006-GroppeG #query #satisfiability #xpath
- Filtering Unsatisfiable XPATH Queries (JG, SG), pp. 157–162.
- CAV-2006-GershmanKS #satisfiability
- Deriving Small Unsatisfiable Cores with Dominators (RG, MK, OS), pp. 109–122.
- SAT-2006-Buresh-OppenheimM #satisfiability
- Minimum Witnesses for Unsatisfiable 2CNFs (JBO, DGM), pp. 42–47.
- SAT-2006-DershowitzHN #algorithm #satisfiability #scalability
- A Scalable Algorithm for Minimal Unsatisfiable Core Extraction (ND, ZH, AN), pp. 36–41.
- SAT-2006-KullmannLM #agile #categorisation #kernel #normalisation #satisfiability
- Categorisation of Clauses in Conjunctive Normal Forms: Minimally Unsatisfiable Sub-clause-sets and the Lean Kernel (OK, IL, JMS), pp. 22–35.
- SAT-2006-PrestwichL #satisfiability
- Local Search for Unsatisfiability (SDP, IL), pp. 283–296.
PADL-2005-BaileyS #constraints #satisfiability #set #using- Discovery of Minimal Unsatisfiable Subsets of Constraints Using Hitting Set Dualization (JB, PJS), pp. 174–186.
CSL-2005-Tiwari #algebra #approach #constraints #satisfiability- An Algebraic Approach for the Unsatisfiability of Nonlinear Constraints (AT), pp. 248–262.
- SAT-2005-LiffitonS #on the #satisfiability
- On Finding All Minimally Unsatisfiable Subformulas (MHL, KAS), pp. 173–186.
- SAT-2005-MneimnehLASS #algorithm #bound #satisfiability
- A Branch-and-Bound Algorithm for Extracting Smallest Minimal Unsatisfiable Formulas (MNM, IL, ZSA, JPMS, KAS), pp. 467–474.
DAC-2004-OhMASM #named #satisfiability- AMUSE: a minimally-unsatisfiable subformula extractor (YO, MNM, ZSA, KAS, ILM), pp. 518–523.
SAT-2004-HooryS #satisfiability- Computing Unsatisfiable k-SAT Instances with Few Occurrences per Variable (SH, SS), pp. 86–95.
- ASE-2003-ShlyakhterSJST #debugging #declarative #modelling #satisfiability #using
- Debugging Overconstrained Declarative Models Using Unsatisfiable Cores (IS, RS, DJ, MS, MT), pp. 94–105.
- DATE-2003-GoldbergN #proving #satisfiability #verification
- Verification of Proofs of Unsatisfiability for CNF Formulas (EIG, YN), pp. 10886–10891.
PPDP-2003-BandaSW #satisfiability #set- Finding all minimal unsatisfiable subsets (MJGdlB, PJS, JW), pp. 32–43.
LICS-2002-Atserias #random #satisfiability- Unsatisfiable Random Formulas Are Hard to Certify (AA), pp. 325–334.
- SAT-2002-Bruni #satisfiability
- Exact selection of minimal unsatisfiable subformulae for special classes of propositional formulae (RB), p. 22.
- SAT-2002-BueningX #complexity #morphism #satisfiability
- The complexity of homomorphisms and renamings of minimal unsatisfiable formulas (HKB, DX), p. 9.
- ICALP-2001-FriedmanG #random #satisfiability
- Recognizing More Unsatisfiable Random 3-SAT Instances Efficiently (JF, AG), pp. 310–321.
- SAT-2001-BruniS #maintenance #satisfiability
- Restoring Satisfiability or Maintaining Unsatisfiability by finding small Unsatisfiable Subformulae (RB, AS), pp. 162–173.
- SAT-2001-Goldberg #proving #satisfiability
- Proving unsatisfiability of CNFs locally (EG), pp. 96–114.
- SAT-2001-KaporisKSVZ #revisited #satisfiability
- The unsatisfiability threshold revisited (ACK, LMK, YCS, MV, MZ), pp. 81–95.
STOC-1998-BeameKPS #complexity #on the #proving #random #satisfiability- On the Complexity of Unsatisfiability Proofs for Random k-CNF Formulas (PB, RMK, TP, MES), pp. 561–571.
- STOC-1996-CleggEI #algorithm #proving #satisfiability #using
- Using the Groebner Basis Algorithm to Find Proofs of Unsatisfiability (MC, JE, RI), pp. 174–183.
