On the public citation graph

A Scalable Algorithm for Minimal Unsatisfiable Core Extraction

0 signed · 90 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/11499107_13openalex-snapshot

On Finding All Minimally Unsatisfiable Subformulas

inferredcites →https://doi.org/10.1007/11499107_4openalex-snapshot

A Clause-Based Heuristic for SAT Solvers

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/11527695_25openalex-snapshot

Fifty-Five Solvers in Vancouver: The SAT 2004 Competition

inferredcites →https://doi.org/10.1007/11527695_27openalex-snapshot

Zchaff2004: An Efficient SAT Solver

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

Automatic Abstraction without Counterexamples

inferredcites →https://doi.org/10.1007/3-540-49059-0_14openalex-snapshot

Symbolic Model Checking without BDDs

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-24605-3_37openalex-snapshot

An Extensible SAT-solver

inferredcites →https://doi.org/10.1016/j.jcss.2004.04.009openalex-snapshot

Minimal unsatisfiable formulas with bounded clause-variable difference are fixed-parameter tractable

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-0653(04)00320-8openalex-snapshot

Restoring Satisfiability or Maintaining Unsatisfiability by finding small Unsatisfiable Subformulae

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

GRASP: a search algorithm for propositional satisfiability

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

Effective use of Boolean satisfiability procedures in the formal verification of superscalar and VLIW microprocessors

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

Effective use of Boolean satisfiability procedures in the formal verification of superscalar and VLIW microprocessors

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

Verification of proofs of unsatisfiability for CNF formulas

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

MUP

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

A comparative study of two Boolean formulations of FPGA detailed routing constraints

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

Effective use of boolean satisfiability procedures in the formal verification of superscalar and VLIW

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

Chaff

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

The complexity of facets (and some facets of complexity)

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

AMUSE

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-30048-7_14openalex-snapshot

Constraint-Based Techniques in Stochastic Local Search MaxSAT Solving

inferred← citeshttps://doi.org/10.1007/978-3-030-45234-6_3openalex-snapshot

Integrating Topological Proofs with Model Checking to Instrument Iterative Design

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

MUS Extraction Using Clausal Proofs

inferred← citeshttps://doi.org/10.1007/978-3-319-10575-8_9openalex-snapshot

Propositional SAT Solving

inferred← citeshttps://doi.org/10.1007/978-3-319-21690-4_43openalex-snapshot

Fast Interpolating BMC

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

Incrementally Computing Minimal Unsatisfiable Cores of QBFs via a Clause Group Solver API

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-24318-4_8openalex-snapshot

Mining Backbone Literals in Incremental SAT

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/978-3-540-68237-0_23openalex-snapshot

Finding Minimal Unsatisfiable Cores of Declarative Specifications

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-75867-9_69openalex-snapshot

Compressing Propositional Proofs by Common Subproof 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-540-79719-7_18openalex-snapshot

Searching for Autarkies to Trim Unsatisfiable Clause Sets

inferred← citeshttps://doi.org/10.1007/978-3-540-79719-7_27openalex-snapshot

Finding Guaranteed MUSes Fast

inferred← citeshttps://doi.org/10.1007/978-3-540-89982-2_19openalex-snapshot

Detecting Inconsistencies in Large Biological Networks with Answer Set Programming

inferred← citeshttps://doi.org/10.1007/978-3-642-01702-5_14openalex-snapshot

Linear-Time Reductions of Resolution Proofs

inferred← citeshttps://doi.org/10.1007/978-3-642-02658-4_11openalex-snapshot

Explaining Counterexamples Using Causality

inferred← citeshttps://doi.org/10.1007/978-3-642-11623-0_7openalex-snapshot

Towards a Notion of Unsatisfiable Cores for LTL

inferred← citeshttps://doi.org/10.1007/978-3-642-21581-0_14openalex-snapshot

On Improving MUS Extraction Algorithms

inferred← citeshttps://doi.org/10.1007/978-3-642-21581-0_15openalex-snapshot

Faster Extraction of High-Level Minimal Unsatisfiable Cores

inferred← citeshttps://doi.org/10.1007/978-3-642-33386-6_10openalex-snapshot

Improved Single Pass Algorithms for Resolution Proof Reduction

inferred← citeshttps://doi.org/10.1007/978-3-642-33558-7_14openalex-snapshot

On Computing Minimal Equivalent Subformulas

inferred← citeshttps://doi.org/10.1007/978-3-642-39091-3_27openalex-snapshot

A Reasoning Platform Based on the MI Shapley Inconsistency Value

inferred← citeshttps://doi.org/10.1007/978-3-642-39799-8_39openalex-snapshot

Minimal Sets over Monotone Predicates in Boolean Formulae

inferred← citeshttps://doi.org/10.1007/s10009-010-0167-5openalex-snapshot

Reducing the size of resolution proofs in linear time

inferred← citeshttps://doi.org/10.1007/s10462-022-10149-wopenalex-snapshot

A formal proof and simple explanation of the QuickXplain algorithm

inferred← citeshttps://doi.org/10.1007/s10626-023-00388-6openalex-snapshot

Conflict-free electric vehicle routing problem: an improved compositional algorithm

inferred← citeshttps://doi.org/10.1007/s10703-008-0051-zopenalex-snapshot

An approach for extracting a small unsatisfiable core

inferred← citeshttps://doi.org/10.1007/s10703-011-0132-2openalex-snapshot

Explaining counterexamples using causality

inferred← citeshttps://doi.org/10.1007/s10703-014-0208-xopenalex-snapshot

Resolution proof transformation for compression and interpolation

inferred← citeshttps://doi.org/10.1007/s11767-007-0088-yopenalex-snapshot

An ant colony algorithm for minimum unsatisfiable core extraction

inferred← citeshttps://doi.org/10.1016/j.infsof.2014.07.012openalex-snapshot

Infeasible path generalization in dynamic symbolic execution

inferred← citeshttps://doi.org/10.1016/j.scico.2010.11.004openalex-snapshot

Towards a notion of unsatisfiable and unrealizable cores for LTL

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

Detecting inconsistencies in large biological networks with answer set programming

inferred← citeshttps://doi.org/10.1080/17445760.2025.2576032openalex-snapshot

Clause connectivity and isolated solutions: a structural heuristic for SAT variable ordering

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

Efficient MUS extraction with resolution

inferred← citeshttps://doi.org/10.1109/iaecst64597.2024.11117547openalex-snapshot

Template-Guided Loop Invariant Synthesis Driven by Program Comprehension

inferred← citeshttps://doi.org/10.1109/iri.2019.00017openalex-snapshot

How Do Firms Transact? Guesstimation and Validation of Financial Transaction Networks with Satisfiability

inferred← citeshttps://doi.org/10.1109/ismvl.2010.11openalex-snapshot

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

inferred← citeshttps://doi.org/10.1109/iwqos70441.2026.11661289openalex-snapshot

DNSMedic: Automated Precision Diagnosis and Repair Guidance for DNS Misconfigurations

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.1109/tkde.2014.2339855openalex-snapshot

Polarity Consistency Checking for Domain Independent Sentiment Dictionaries

inferred← citeshttps://doi.org/10.1134/s0361768821080053openalex-snapshot

SafeComp: Protocol for Certifying Cloud Computations Integrity

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/2993422.2993426openalex-snapshot

Systematically Debugging IoT Control System Correctness for Building Automation

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

Conquering the extensional scalability problem for value-flow analysis frameworks

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

Conflict Extraction in Probabilistic Datalog Analyses

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

Unsatisfiable Core Guided Constraint Solving in Symbolic Execution

inferred← citeshttps://doi.org/10.14288/1.0044107openalex-snapshot

Problem solving with SAT oracles

inferred← citeshttps://doi.org/10.15168/11572_368265openalex-snapshot

An Effective SMT Engine for Formal Verification

inferred← citeshttps://doi.org/10.1613/jair.1.14260openalex-snapshot

Efficiently Explaining CSPs with Unsatisfiable Subset Optimization

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.23919/date64628.2025.10993011openalex-snapshot

DE2: SAT-Based Sequential Logic Decryption with a Functional Description

inferred← citeshttps://doi.org/10.24963/ijcai.2019/165openalex-snapshot

Integrating Pseudo-Boolean Constraint Reasoning in Multi-Objective Evolutionary Algorithms

inferred← citeshttps://doi.org/10.24963/ijcai.2020/682openalex-snapshot

Reasoning About Inconsistent Formulas

inferred← citeshttps://doi.org/10.24963/ijcai.2021/191openalex-snapshot

Efficiently Explaining CSPs with Unsatisfiable Subset Optimization

inferred← citeshttps://doi.org/10.25932/publishup-41246openalex-snapshot

Detecting Inconsistencies in Large Biological Networks with Answer Set Programming

inferred← citeshttps://doi.org/10.3233/aic-2012-0523openalex-snapshot

Towards efficient MUS extraction

inferred← citeshttps://doi.org/10.3233/sat190100openalex-snapshot

Accelerated Deletion-based Extraction of Minimal Unsatisfiable Cores

inferred← citeshttps://doi.org/10.4304/jsw.4.1.42-49openalex-snapshot

Tracking Unsatisfiable Subformulas from Reduced Refutation Proof

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

A Linear Algebra Formulation for Boolean Satisfiability Testing

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

Understanding the QuickXPlain Algorithm: Simple Explanation and Formal 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.