On the public citation graph
Extracting Minimum Unsatisfiable Cores with a Greedy Genetic Algorithm
0 signed · 43 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/11499107_13openalex-snapshot
On Finding All Minimally Unsatisfiable Subformulas
inferredcites →https://doi.org/10.1007/11499107_40openalex-snapshot
A Branch-and-Bound Algorithm for Extracting Smallest Minimal Unsatisfiable Formulas
inferredcites →https://doi.org/10.1007/3-540-36577-x_2openalex-snapshot
Automatic Abstraction without Counterexamples
inferredcites →https://doi.org/10.1007/978-3-540-24605-3_22openalex-snapshot
Cache Performance of SAT Solvers: a Case Study for Efficient Implementation of Algorithms
inferredcites →https://doi.org/10.1007/978-3-540-24730-2_35openalex-snapshot
A Temporal Logic of Nested Calls and Returns
inferredcites →https://doi.org/10.1007/978-3-540-30557-6_14openalex-snapshot
Discovery of Minimal Unsatisfiable Subsets of Constraints Using Hitting Set Dualization
inferredcites →https://doi.org/10.1016/0022-0000(88)90042-6openalex-snapshot
The complexity of facets resolved
inferredcites →https://doi.org/10.1016/s1571-0653(04)00320-8openalex-snapshot
Restoring Satisfiability or Maintaining Unsatisfiability by finding small Unsatisfiable Subformulae
inferredcites →https://doi.org/10.1023/a:1018999721141openalex-snapshot
Boosting complete techniques thanks to local search methods
inferredcites →https://doi.org/10.1145/296399.296450openalex-snapshot
Satisfiability-based layout revisited
inferredcites →https://doi.org/10.7551/mitpress/1090.001.0001openalex-snapshot
Adaptation in Natural and Artificial Systems
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/int.20497openalex-snapshot
A hybrid algorithm for finding minimal unsatisfiable subsets in over-constrained CSPs
inferred← citeshttps://doi.org/10.1007/11499107_40openalex-snapshot
A Branch-and-Bound Algorithm for Extracting Smallest Minimal Unsatisfiable Formulas
inferred← citeshttps://doi.org/10.1007/978-3-319-28228-2_2openalex-snapshot
The KB Paradigm and Its Application to Interactive Configuration
inferred← citeshttps://doi.org/10.1007/978-3-540-72788-0_32openalex-snapshot
A Simple and Flexible Way of Computing Small Unsatisfiable Cores in SAT Modulo Theories
inferred← citeshttps://doi.org/10.1007/978-3-540-74484-9_56openalex-snapshot
A Heuristic Local Search Algorithm for Unsatisfiable Cores Extraction
inferred← citeshttps://doi.org/10.1007/978-3-540-77226-2_40openalex-snapshot
Finding Unsatisfiable Subformulas with Stochastic Method
inferred← citeshttps://doi.org/10.1007/978-3-642-16373-9_5openalex-snapshot
Finding Solutions in Goal Models: An Interactive Backward Reasoning Approach
inferred← citeshttps://doi.org/10.1007/978-3-642-28789-3_11openalex-snapshot
Evolutive Approaches for Variable Selection Using a Non-parametric Noise Estimator
inferred← citeshttps://doi.org/10.1007/978-3-642-39071-5_19openalex-snapshot
Quantified Maximum Satisfiability:
inferred← citeshttps://doi.org/10.1007/s10009-019-00547-xopenalex-snapshot
IC3 software model checking
inferred← citeshttps://doi.org/10.1007/s10601-008-9058-8openalex-snapshot
A branch and bound algorithm for extracting smallest minimal unsatisfiable subformulas
inferred← citeshttps://doi.org/10.1007/s10601-015-9195-9openalex-snapshot
Quantified maximum satisfiability
inferred← citeshttps://doi.org/10.1017/s1471068416000156openalex-snapshot
The KB paradigm and its application to interactive configuration
inferred← citeshttps://doi.org/10.1109/fmcad.2016.7886661openalex-snapshot
Minimal unsatisfiable core extraction for SMT
inferred← citeshttps://doi.org/10.1109/host45689.2020.9300277openalex-snapshot
Attack of the Genes: Finding Keys and Parameters of Locked Analog ICs Using Genetic Algorithm
inferred← citeshttps://doi.org/10.1109/ictai.2008.39openalex-snapshot
On Approaches to Explaining Infeasibility of Sets of Boolean Clauses
inferred← citeshttps://doi.org/10.1109/ismvl.2010.11openalex-snapshot
Minimal Unsatisfiability: Models, Algorithms and Applications (Invited Paper)
inferred← citeshttps://doi.org/10.1109/models.2017.26openalex-snapshot
Why is My Component and Connector Views Specification Unsatisfiable?
inferred← citeshttps://doi.org/10.1109/tcad.2010.2049152openalex-snapshot
Synthesizing Complementary Circuits Automatically
inferred← citeshttps://doi.org/10.1145/1687399.1687472openalex-snapshot
Synthesizing complementary circuits automatically
inferred← citeshttps://doi.org/10.1145/2351676.2351683openalex-snapshot
Improving the effectiveness of spectra-based fault localization using specifications
inferred← citeshttps://doi.org/10.1145/3548606.3560658openalex-snapshot
Blazing Fast PSI from Improved OKVS and Subfield VOLE
inferred← citeshttps://doi.org/10.1504/ijhpsa.2008.024211openalex-snapshot
Minimising the delta test for variable selection in regression problems
inferred← citeshttps://doi.org/10.15168/11572_368265openalex-snapshot
An Effective SMT Engine for Formal Verification
inferred← citeshttps://doi.org/10.1613/jair.3196openalex-snapshot
Computing Small Unsatisfiable Cores in Satisfiability Modulo Theories
inferred← citeshttps://doi.org/10.2298/csis101019024zopenalex-snapshot
Extracting minimal unsatisfiable subformulas in satisfiability modulo theories
inferred← citeshttps://doi.org/10.3233/sat190100openalex-snapshot
Accelerated Deletion-based Extraction of Minimal Unsatisfiable Cores
inferred← citeshttps://doi.org/10.3390/e16020854openalex-snapshot
Fast Feature Selection in a GPU Cluster Using the Delta Test
inferred← citeshttps://doi.org/10.4304/jsw.4.1.42-49openalex-snapshot
Tracking Unsatisfiable Subformulas from Reduced Refutation Proof
inferred← citeshttps://doi.org/10.5555/1998496.1998537openalex-snapshot
Boosting minimal unsatisfiable core extraction
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.