On the public citation graph

Accelerated Deletion-based Extraction of Minimal Unsatisfiable Cores

https://doi.org/10.3233/sat190100

0 signed · 70 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.

Claim with ORCID

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.

See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/11814948_5openalex-snapshot

A Scalable Algorithm for Minimal Unsatisfiable Core Extraction

inferredcites →https://doi.org/10.1007/11817963_13openalex-snapshot

Deriving Small Unsatisfiable Cores with Dominators

inferredcites →https://doi.org/10.1007/11941439_89openalex-snapshot

Extracting Minimum Unsatisfiable Cores with a Greedy Genetic Algorithm

inferredcites →https://doi.org/10.1007/3-540-36577-x_2openalex-snapshot

Automatic Abstraction without Counterexamples

inferredcites →https://doi.org/10.1007/3-540-44798-9_4openalex-snapshot

Pruning Techniques for the SAT-Based Bounded Model Checking Problem

inferredcites →https://doi.org/10.1007/978-3-540-24605-3_37openalex-snapshot

An Extensible SAT-solver

inferredcites →https://doi.org/10.1007/978-3-540-45069-6_1openalex-snapshot

Interpolation and SAT-Based Model Checking

inferredcites →https://doi.org/10.1007/978-3-540-79719-7_27openalex-snapshot

Finding Guaranteed MUSes Fast

inferredcites →https://doi.org/10.1007/978-3-540-89439-1_2openalex-snapshot

Efficient Generation of Unsatisfiability Proofs and Cores in SAT

inferredcites →https://doi.org/10.1007/978-3-642-02777-2_23openalex-snapshot

Minimizing Learned Clauses

inferredcites →https://doi.org/10.1007/978-3-642-04222-5_21openalex-snapshot

Efficient Combination of Decision Procedures for MUS Computation

inferredcites →https://doi.org/10.1007/978-3-642-21581-0_14openalex-snapshot

On Improving MUS Extraction Algorithms

inferredcites →https://doi.org/10.1007/978-3-642-21581-0_15openalex-snapshot

Faster Extraction of High-Level Minimal Unsatisfiable Cores

inferredcites →https://doi.org/10.1007/978-3-642-32770-4_4openalex-snapshot

Improvements to Satisfiability-Based Boolean Function Bi-Decomposition

inferredcites →https://doi.org/10.1007/978-3-642-33558-7_49openalex-snapshot

Understanding, Improving and Parallelizing MUS Finding Using Model Rotation

inferredcites →https://doi.org/10.1007/978-3-642-39071-5_21openalex-snapshot

Factoring Out Assumptions to Speed Up MUS Extraction

inferredcites →https://doi.org/10.1007/978-3-642-39799-8_39openalex-snapshot

Minimal Sets over Monotone Predicates in Boolean Formulae

inferredcites →https://doi.org/10.1007/s10601-008-9058-8openalex-snapshot

A branch and bound algorithm for extracting smallest minimal unsatisfiable subformulas

inferredcites →https://doi.org/10.1007/s10703-008-0051-zopenalex-snapshot

An approach for extracting a small unsatisfiable core

inferredcites →https://doi.org/10.1007/s10817-007-9084-zopenalex-snapshot

Algorithms for Computing Minimal Unsatisfiable Subsets of Constraints

inferredcites →https://doi.org/10.1007/s10878-008-9142-4openalex-snapshot

Using heuristics to find minimal unsatisfiable subformulas in satisfiability problems

inferredcites →https://doi.org/10.1016/0022-0000(88)90042-6openalex-snapshot

The complexity of facets resolved

inferredcites →https://doi.org/10.1016/j.ejor.2007.06.066openalex-snapshot

Using local search to find MSSes and MUSes

inferredcites →https://doi.org/10.1016/s0166-218x(02)00399-2openalex-snapshot

Approximating minimal unsatisfiable subformulae by means of adaptive core search

inferredcites →https://doi.org/10.1016/s1571-0661(05)82542-3openalex-snapshot

Temporal Induction by Incremental SAT Solving

inferredcites →https://doi.org/10.1109/dac.2001.935567openalex-snapshot

SATIRE: A new incremental satisfiability engine

inferredcites →https://doi.org/10.1109/date.2003.1253718openalex-snapshot

Verification of proofs of unsatisfiability for CNF formulas

inferredcites →https://doi.org/10.1109/fmcad.2009.5351129openalex-snapshot

A compositional theory for post-reboot observational equivalence checking of hardware

inferredcites →https://doi.org/10.1109/fmcad.2013.6679410openalex-snapshot

Efficient MUS extraction with resolution

inferredcites →https://doi.org/10.1109/iccad.2003.1257811openalex-snapshot

Iterative abstraction using SAT-based BMC with proof analysis

inferredcites →https://doi.org/10.1109/ismvl.2010.11openalex-snapshot

Minimal Unsatisfiability: Models, Algorithms and Applications (Invited Paper)

inferredcites →https://doi.org/10.1145/1278480.1278630openalex-snapshot

On-the-fly resolve trace minimization

inferredcites →https://doi.org/10.1145/1391469.1391634openalex-snapshot

Bi-decomposing large Boolean functions via interpolation and satisfiability solving

inferredcites →https://doi.org/10.1145/378239.379019openalex-snapshot

SATIRE

inferredcites →https://doi.org/10.1145/996566.996710openalex-snapshot

AMUSE

inferredcites →https://doi.org/10.1287/ijoc.3.2.157openalex-snapshot

Locating Minimal Infeasible Constraint Sets in Linear Programs

inferredcites →https://doi.org/10.1613/jair.1410openalex-snapshot

Towards Understanding and Harnessing the Potential of Clause Learning

inferredcites →https://doi.org/10.3233/aic-2012-0523openalex-snapshot

Towards efficient MUS extraction

inferredcites →https://doi.org/10.3233/sat190094openalex-snapshot

MUSer2: An Efficient MUS Extractor1

inferredcites →https://doi.org/10.4304/jsw.4.1.42-49openalex-snapshot

Tracking Unsatisfiable Subformulas from Reduced Refutation Proof

inferredcites →https://doi.org/10.5555/1998496.1998537openalex-snapshot

Boosting minimal unsatisfiable core extraction

inferredcites →https://doi.org/10.5555/2157654.2157663openalex-snapshot

Accelerating MUS extraction with recursive model rotation

inferredcites →https://doi.org/10.5555/996070.1009924openalex-snapshot

Iterative Abstraction using SAT-based BMC with Proof Analysis

inferredcites →https://doi.org/10.7873/date.2013.288openalex-snapshot

Core Minimization in SAT-based Abstraction

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/978-3-030-01090-4_9openalex-snapshot

Recursive Online Enumeration of All Minimal Unsatisfiable Subsets

inferred← citeshttps://doi.org/10.1007/978-3-030-45190-5_8openalex-snapshot

MUST: Minimal Unsatisfiable Subsets Enumeration Tool

inferred← citeshttps://doi.org/10.1007/978-3-030-53288-8_21openalex-snapshot

Approximate Counting of Minimal Unsatisfiable Subsets

inferred← citeshttps://doi.org/10.1007/978-3-030-81688-9_15openalex-snapshot

Counting Minimal Unsatisfiable Subsets

inferred← citeshttps://doi.org/10.1007/978-3-032-27242-3_17openalex-snapshot

Cost-Minimal Parameter Correction Subsets for Unsatisfiable Constraint Problems

inferred← citeshttps://doi.org/10.1007/978-3-319-21668-3_5openalex-snapshot

Using Minimal Correction Sets to More Efficiently Compute Minimal Unsatisfiable Sets

inferred← citeshttps://doi.org/10.1007/978-3-319-24318-4_28openalex-snapshot

A New Approach to Partial MUS Enumeration

inferred← citeshttps://doi.org/10.1007/978-3-319-24318-4_3openalex-snapshot

Speeding up MUS Extraction with Preprocessing and Chunking

inferred← citeshttps://doi.org/10.1007/978-3-319-33954-2_3openalex-snapshot

Finding a Collection of MUSes Incrementally

inferred← citeshttps://doi.org/10.1007/978-3-319-44953-1_54openalex-snapshot

Finding Unsatisfiable Cores of a Set of Polynomials Using the Gröbner Basis Algorithm

inferred← citeshttps://doi.org/10.1007/978-3-319-94144-8_4openalex-snapshot

Solving MaxSAT with Bit-Vector Optimization

inferred← citeshttps://doi.org/10.1007/s12652-020-02247-wopenalex-snapshot

Computation of minimal unsatisfiable subformulas for SAT-based digital circuit error diagnosis

inferred← citeshttps://doi.org/10.1017/s147106841600020xopenalex-snapshot

Anytime answer set optimization via unsatisfiable core shrinking

inferred← citeshttps://doi.org/10.1109/fmcad.2016.7886661openalex-snapshot

Minimal unsatisfiable core extraction for SMT

inferred← citeshttps://doi.org/10.1109/tse.2019.2891709openalex-snapshot

Inductive Validity Cores

inferred← citeshttps://doi.org/10.1142/s0218213018400031openalex-snapshot

Boolean-Based Dependency Management for the Eclipse Ecosystem

inferred← citeshttps://doi.org/10.1145/3092703.3098239openalex-snapshot

Consistency checking in requirements analysis

inferred← citeshttps://doi.org/10.1609/aaai.v37i5.25694openalex-snapshot

Strategyproofness and Proportionality in Party-Approval Multiwinner Elections

inferred← citeshttps://doi.org/10.23919/fmcad.2017.8102238openalex-snapshot

Efficient generation of all minimal inductive validity cores

inferred← citeshttps://doi.org/10.24963/ijcai.2017/666openalex-snapshot

Unsatisfiable Core Shrinking for Anytime Answer Set Optimization

inferred← citeshttps://doi.org/10.24963/ijcai.2018/182openalex-snapshot

Boosting MCSes Enumeration

inferred← citeshttps://doi.org/10.29007/8btbopenalex-snapshot

Rotation Based MSS/MCS Enumeration

inferred← citeshttps://doi.org/10.29007/sxzbopenalex-snapshot

Evaluation of Domain Agnostic Approaches for Enumeration of Minimal Unsatisfiable Subsets

inferred← citeshttps://doi.org/10.48550/arxiv.1608.00731openalex-snapshot

Anytime answer set optimization via unsatisfiable core shrinking

inferred← citeshttps://doi.org/10.70675/6ef488bbz240ez4bcdz98e9z9b15980a474copenalex-snapshot

Informatique ubiquitaire : techniques de curage d'informations perverties

inferred← citeshttps://doi.org/10.70675/e74c615fz12cbz4425z8bc7z8f651a87f9d8openalex-snapshot

Modèles prédictifs & raisonnement avec les explications

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.