On the public citation graph

Rotation Based MSS/MCS Enumeration

https://doi.org/10.29007/8btb
0 signed · 45 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/3-540-16780-3_87openalex-snapshot
A theory of diagnosis from first principles
inferredcites →https://doi.org/10.1007/978-3-030-01090-4_9openalex-snapshot
Recursive Online Enumeration of All Minimal Unsatisfiable Subsets
inferredcites →https://doi.org/10.1007/978-3-030-45190-5_8openalex-snapshot
MUST: Minimal Unsatisfiable Subsets Enumeration Tool
inferredcites →https://doi.org/10.1007/978-3-319-09284-3_5openalex-snapshot
MUS Extraction Using Clausal Proofs
inferredcites →https://doi.org/10.1007/978-3-319-21668-3_5openalex-snapshot
Using Minimal Correction Sets to More Efficiently Compute Minimal Unsatisfiable Sets
inferredcites →https://doi.org/10.1007/978-3-319-24318-4_3openalex-snapshot
Speeding up MUS Extraction with Preprocessing and Chunking
inferredcites →https://doi.org/10.1007/978-3-319-24489-1_17openalex-snapshot
Efficient Axiom Pinpointing with EL2MCS
inferredcites →https://doi.org/10.1007/978-3-319-33954-2_3openalex-snapshot
Finding a Collection of MUSes Incrementally
inferredcites →https://doi.org/10.1007/978-3-319-66263-3_12openalex-snapshot
Improving MCS Enumeration via Caching
inferredcites →https://doi.org/10.1007/978-3-319-92970-5_12openalex-snapshot
Online Enumeration of All Minimal Inductive Validity Cores
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.1007/978-3-642-36742-7_8openalex-snapshot
Formula Preprocessing in MUS Extraction
inferredcites →https://doi.org/10.1007/978-3-642-38171-3_11openalex-snapshot
Enumerating Infeasibility: Finding Multiple MUSes Quickly
inferredcites →https://doi.org/10.1007/bf02136172openalex-snapshot
On computing minimal models
inferredcites →https://doi.org/10.1007/s00165-015-0348-9openalex-snapshot
Analysing sanity of requirements for avionics systems
inferredcites →https://doi.org/10.1007/s10601-015-9183-0openalex-snapshot
Fast, flexible MUS enumeration
inferredcites →https://doi.org/10.1016/0004-3702(87)90063-4openalex-snapshot
Diagnosing multiple faults
inferredcites →https://doi.org/10.1017/s0890060411000011openalex-snapshot
An efficient diagnosis algorithm for inconsistent constraint sets
inferredcites →https://doi.org/10.1109/ase.2017.8115632openalex-snapshot
Proof-based coverage metrics for formal verification
inferredcites →https://doi.org/10.1109/fmcad.2016.7886661openalex-snapshot
Minimal unsatisfiable core extraction for SMT
inferredcites →https://doi.org/10.1145/3092703.3098239openalex-snapshot
Consistency checking in requirements analysis
inferredcites →https://doi.org/10.1609/aaai.v26i1.8231openalex-snapshot
Exploring the Duality in Conflict-Directed Model-Based Diagnosis
inferredcites →https://doi.org/10.1609/aaai.v27i1.8657openalex-snapshot
Partial MUS Enumeration
inferredcites →https://doi.org/10.1609/aaai.v28i1.8849openalex-snapshot
Relaxation Search: A Simple Way of Managing Optional Clauses
inferredcites →https://doi.org/10.1609/aaai.v28i1.9118openalex-snapshot
An Experimentally Efficient Method for (MSS,CoMSS) Partitioning
inferredcites →https://doi.org/10.1609/aaai.v32i1.12213openalex-snapshot
Premise Set Caching for Enumerating Minimal Correction Subsets
inferredcites →https://doi.org/10.24963/ijcai.2018/188openalex-snapshot
Core-Guided Minimal Correction Set and Core Enumeration
inferredcites →https://doi.org/10.29007/sxzbopenalex-snapshot
Evaluation of Domain Agnostic Approaches for Enumeration of Minimal Unsatisfiable Subsets
inferredcites →https://doi.org/10.3233/sat190094openalex-snapshot
MUSer2: An Efficient MUS Extractor1
inferredcites →https://doi.org/10.3233/sat190100openalex-snapshot
Accelerated Deletion-based Extraction of Minimal Unsatisfiable Cores
inferredcites →https://doi.org/10.5555/2157654.2157663openalex-snapshot
Accelerating MUS extraction with recursive model rotation

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-72016-2_16openalex-snapshot
Timed Automata Relaxation for Reachability
inferred← citeshttps://doi.org/10.1007/978-3-031-16681-5_19openalex-snapshot
OuterCount: A First-Level Solution-Counter for Quantified Boolean Formulas
inferred← citeshttps://doi.org/10.1007/978-3-031-31414-8_2openalex-snapshot
Logic-Based Explainability in Machine Learning
inferred← citeshttps://doi.org/10.1007/978-3-031-43619-2_50openalex-snapshot
Computing MUS-Based Inconsistency Measures
inferred← citeshttps://doi.org/10.1007/978-3-032-04590-4_10openalex-snapshot
Explanations of Unsatisfiability Beyond Minimal Subsets
inferred← citeshttps://doi.org/10.1007/978-981-16-1877-2_1openalex-snapshot
Accelerating Predicate Abstraction by Minimum Unsatisfiable Cores Extraction
inferred← citeshttps://doi.org/10.1007/s00500-025-10854-yopenalex-snapshot
A comprehensive review of frugal artificial intelligence: challenges, applications, and the road to sustainable AI
inferred← citeshttps://doi.org/10.1007/s10703-023-00419-wopenalex-snapshot
Hashing-based approximate counting of minimal unsatisfiable subsets
inferred← citeshttps://doi.org/10.1109/qrs54544.2021.00099openalex-snapshot
An Incomplete Unsatisfiable Cores Extracting Algorithm to Promote Routing
inferred← citeshttps://doi.org/10.1609/aaai.v35i5.16481openalex-snapshot
Counting Maximal Satisfiable Subsets
inferred← citeshttps://doi.org/10.1613/jair.1.15333openalex-snapshot
From Single-Objective to Bi-Objective Maximum Satisfiability Solving
inferred← citeshttps://doi.org/10.46298/lmcs-18(3:12)2022openalex-snapshot
Timed Automata Robustness Analysis via Model Checking
inferred← citeshttps://doi.org/10.5121/csit.2020.1015openalex-snapshot
Computer Science & Information Technology (CS & IT)
inferred← citeshttps://doi.org/10.5121/csit.2020.101507openalex-snapshot
FPGA Routing Acceleration by Extracting Unsatisfiable Subformulas
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.