On the public citation graph

Considering Circuit Observability Don't Cares in CNF Satisfiability

0 signed · 39 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/978-3-642-81955-1_28openalex-snapshot
On the Complexity of Derivation in Propositional Calculus
inferredcites →https://doi.org/10.1109/43.3211openalex-snapshot
Multi-level logic minimization using implicit don't cares
inferredcites →https://doi.org/10.1109/54.867894openalex-snapshot
RT-level ITC'99 benchmarks and first ATPG results
inferredcites →https://doi.org/10.1109/dac.2002.1012722openalex-snapshot
Combining strengths of circuit-based and CNF-based algorithms for a high-performance SAT solver
inferredcites →https://doi.org/10.1109/date.2004.1268858openalex-snapshot
Managing don't cares in Boolean satisfiability
inferredcites →https://doi.org/10.1109/iccad.1993.580110openalex-snapshot
Verification of large synthesized designs
inferredcites →https://doi.org/10.1145/378239.378470openalex-snapshot
Circuit-based Boolean Reasoning
inferredcites →https://doi.org/10.1145/378239.379017openalex-snapshot
Chaff
inferredcites →https://doi.org/10.1145/378239.379018openalex-snapshot
Dynamic detection and removal of inactive clauses in SAT with application in image computation
inferredcites →https://doi.org/10.1145/513918.514105openalex-snapshot
Combining strengths of circuit-based and CNF-based algorithms for a high-performance SAT solver
inferredcites →https://doi.org/10.1145/775832.775947openalex-snapshot
A signal correlation guided ATPG solver and its applications for solving difficult industrial cases
inferredcites →https://doi.org/10.5555/259794.259883openalex-snapshot
Verification of large synthesized designs
inferredcites →https://doi.org/10.5555/968878.969032openalex-snapshot
Managing don't cares in Boolean satisfiability

What points at this work

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

inferred← citeshttps://doi.org/10.1007/11814948_34openalex-snapshot
Solving Quantified Boolean Formulas with Circuit Observability Don’t Cares
inferred← citeshttps://doi.org/10.1007/978-1-4419-7518-8_8openalex-snapshot
SAT Sweeping with Local Observability Don’t-Cares
inferred← citeshttps://doi.org/10.1007/978-3-319-24318-4_19openalex-snapshot
Recognition of Nested Gates in CNF Formulas
inferred← citeshttps://doi.org/10.1109/aspdac.2007.358021openalex-snapshot
Node Mergers in the Presence of Don't Cares
inferred← citeshttps://doi.org/10.1109/ats.2009.26openalex-snapshot
Speeding up SAT-Based ATPG Using Dynamic Clause Activation
inferred← citeshttps://doi.org/10.1109/dac.2006.229206openalex-snapshot
SAT sweeping with local observability don't-cares
inferred← citeshttps://doi.org/10.1109/date.2006.244148openalex-snapshot
Quantifier structure in search based procedures for QBFs
inferred← citeshttps://doi.org/10.1109/iccad51958.2021.9643515openalex-snapshot
Compatible Equivalence Checking of X-Valued Circuits
inferred← citeshttps://doi.org/10.1109/icsict.2008.4735041openalex-snapshot
An improved all-solution SAT solver
inferred← citeshttps://doi.org/10.1109/icycs.2008.84openalex-snapshot
Hybrid SAT Solver Considering Circuit Observability
inferred← citeshttps://doi.org/10.1109/snpd.2008.12openalex-snapshot
A Novel Method for All Solutions SAT Problem
inferred← citeshttps://doi.org/10.1109/tcad.2006.888264openalex-snapshot
Quantifier Structure in Search-Based Procedures for QBFs
inferred← citeshttps://doi.org/10.1109/test.2005.1584069openalex-snapshot
Efficient SAT-based combinational ATPG using multi-level don't-cares
inferred← citeshttps://doi.org/10.1109/test.2006.297647openalex-snapshot
Diagnostic Test Generation for Arbitrary Faults
inferred← citeshttps://doi.org/10.1109/test.2008.4700567openalex-snapshot
SAT-based State Justification with Adaptive Mining of Invariants
inferred← citeshttps://doi.org/10.1109/test.2010.5699289openalex-snapshot
Robust algorithms for high quality Test Pattern Generation using Boolean Satisfiability
inferred← citeshttps://doi.org/10.1109/tse.2016.2520468openalex-snapshot
Model Checking Software with First Order Logic Specifications Using AIG Solvers
inferred← citeshttps://doi.org/10.1109/vlsi.2008.90openalex-snapshot
Exploiting Circuit Reconvergence through Static Learning in CNF SAT Solvers
inferred← citeshttps://doi.org/10.1109/vlsid.2007.81openalex-snapshot
Extracting Logic Circuit Structure from Conjunctive Normal Form Descriptions
inferred← citeshttps://doi.org/10.1109/vlsid.2014.16openalex-snapshot
Techniques to Improve the Efficiency of SAT Based Path Delay Test Generation
inferred← citeshttps://doi.org/10.1145/1146909.1146970openalex-snapshot
SAT sweeping with local observability don't-cares
inferred← citeshttps://doi.org/10.1145/1344418.1344420openalex-snapshot
SAT-based ATPG using multilevel compatible don't-cares
inferred← citeshttps://doi.org/10.1145/1555860.1555870openalex-snapshot
Property based coverage criterion
inferred← citeshttps://doi.org/10.2991/iccnce.2013.70openalex-snapshot
An Improved Hybrid SAT Solver for Bounded Model Checking in Circuit Design
inferred← citeshttps://doi.org/10.3233/sat190050openalex-snapshot
Improved SAT-based Reachability Analysis with Observability Don’t Cares
inferred← citeshttps://doi.org/10.5555/1998496.1998538openalex-snapshot
Propelling SAT and SAT-based BMC using careset
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.