On the public citation graph

Automatic Extraction of Functional Dependencies

0 signed · 46 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/10722167_36openalex-snapshot
Tuning SAT Checkers for Bounded Model Checking
inferredcites →https://doi.org/10.1007/3-540-45744-5_26openalex-snapshot
Evaluating Search Heuristics and Optimization Techniques in Propositional Satisfiability
inferredcites →https://doi.org/10.1007/3-540-46135-3openalex-snapshot
Principles and Practice of Constraint Programming - CP 2002
inferredcites →https://doi.org/10.1007/3-540-46135-3_13openalex-snapshot
Recovering and Exploiting Structural Knowledge from CNF Formulas
inferredcites →https://doi.org/10.1007/978-3-540-24605-3_26openalex-snapshot
Effective Preprocessing with Hyper-Resolution and Equality Reduction
inferredcites →https://doi.org/10.1007/s10472-005-7034-1openalex-snapshot
Unrestricted vs restricted cut in a tableau method for Boolean circuits
inferredcites →https://doi.org/10.1016/s1571-0653(04)00314-2openalex-snapshot
Exploiting the real power of unit propagation lookahead
inferredcites →https://doi.org/10.1080/00029890.1985.11971545openalex-snapshot
AUTOMATED REASONING
inferredcites →https://doi.org/10.1090/dimacs/026/20openalex-snapshot
SAT versus UNSAT
inferredcites →https://doi.org/10.1108/ir.1999.04926fae.001openalex-snapshot
Lecture Notes in Computer Science 1205
inferredcites →https://doi.org/10.1145/368273.368557openalex-snapshot
A machine program for theorem-proving

What points at this work

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

inferred← citeshttps://doi.org/10.1007/11499107_5openalex-snapshot
Effective Preprocessing in SAT Through Variable and Clause Elimination
inferred← citeshttps://doi.org/10.1007/11564751_59openalex-snapshot
Using Boolean Constraint Propagation for Sub-clauses Deduction
inferred← citeshttps://doi.org/10.1007/978-3-030-06167-8_5openalex-snapshot
Reasoning with Propositional Logic: From SAT Solvers to Knowledge Compilation
inferred← citeshttps://doi.org/10.1007/978-3-319-11558-0_11openalex-snapshot
Enumerating Prime Implicants of Propositional Formulae in Conjunctive Normal Form
inferred← citeshttps://doi.org/10.1007/978-3-540-72397-4_6openalex-snapshot
Eliminating Redundant Clauses in SAT Instances
inferred← citeshttps://doi.org/10.1007/978-3-540-72788-0_5openalex-snapshot
Circuit Based Encoding of CNF Formula
inferred← citeshttps://doi.org/10.1007/978-3-540-76631-5_11openalex-snapshot
From Horn Strong Backdoor Sets to Ordered Strong Backdoor Sets
inferred← citeshttps://doi.org/10.1007/978-3-642-02777-2_25openalex-snapshot
Improving Variable Selection Process in Stochastic Local Search for Propositional Satisfiability
inferred← citeshttps://doi.org/10.1007/978-3-642-39071-5_8openalex-snapshot
Recovering and Utilizing Partial Duality in QBF
inferred← citeshttps://doi.org/10.1007/s10472-015-9452-zopenalex-snapshot
About some UP-based polynomial fragments of SAT
inferred← citeshttps://doi.org/10.1007/s10817-006-9025-2openalex-snapshot
An Efficient Approach to Solving Random k-sat Problems
inferred← citeshttps://doi.org/10.1016/j.artint.2007.12.003openalex-snapshot
On propositional definability
inferred← citeshttps://doi.org/10.1016/j.jalgor.2008.02.001openalex-snapshot
SAT graph-based representation: A new perspective
inferred← citeshttps://doi.org/10.1016/j.jalgor.2008.02.005openalex-snapshot
The effect of structural branching on the efficiency of clause learning SAT solving: An experimental study
inferred← citeshttps://doi.org/10.1109/iccad.2007.4397270openalex-snapshot
Scalable exploration of functional dependency by interpolation and incremental SAT solving
inferred← citeshttps://doi.org/10.1109/ictai.2006.43openalex-snapshot
Computing Horn Strong Backdoor Sets Thanks to Local Search
inferred← citeshttps://doi.org/10.1109/ictai.2009.71openalex-snapshot
Learning in Local Search
inferred← citeshttps://doi.org/10.1109/ictai.2009.85openalex-snapshot
Detecting Boolean Functions for Proving Unsatisfiability
inferred← citeshttps://doi.org/10.1109/ictai.2010.40openalex-snapshot
A Dynamic Boolean Knowledge Base
inferred← citeshttps://doi.org/10.1109/ictai.2012.124openalex-snapshot
Local Search Based on Conflict Analysis for the Satisfiability Problem
inferred← citeshttps://doi.org/10.1109/ictai.2012.145openalex-snapshot
Extending Resolution by Dynamic Substitution of Boolean Functions
inferred← citeshttps://doi.org/10.1109/ictai.2014.74openalex-snapshot
Extensions and Variants of Dalal's Quad Polynomial Fragments of SAT
inferred← citeshttps://doi.org/10.1109/ijcnn.2018.8489382openalex-snapshot
Arithmetic Circuit Classification Using Convolutional Neural Networks
inferred← citeshttps://doi.org/10.1109/ijcnn48605.2020.9207323openalex-snapshot
A Continuous Restricted Boltzmann Machine and Logistic Regression Framework for Circuit Classification
inferred← citeshttps://doi.org/10.1109/iri.2007.4296591openalex-snapshot
Reducing hard SAT instances to polynomial ones
inferred← citeshttps://doi.org/10.1109/mcsoc.2013.24openalex-snapshot
Solving SAT-encoded Formal Verification Problems on SoC Based on a WSAT Algorithm with a New Heuristic for Hardware Acceleration
inferred← citeshttps://doi.org/10.1109/tc.2010.12openalex-snapshot
To SAT or Not to SAT: Scalable Exploration of Functional Dependency
inferred← citeshttps://doi.org/10.1145/2505515.2505576openalex-snapshot
Mining-based compression approach of propositional formulae
inferred← citeshttps://doi.org/10.1145/3231712openalex-snapshot
Errors and Complications in SQL Query Formulation
inferred← citeshttps://doi.org/10.1587/transinf.2016edp7487openalex-snapshot
An Approach for Solving SAT/MaxSAT-Encoded Formal Verification Problems on FPGA
inferred← citeshttps://doi.org/10.3233/aic-2009-0445openalex-snapshot
Structure-based satisfiability checking
inferred← citeshttps://doi.org/10.46298/arima.6434openalex-snapshot
Enhancing Reasoning with the Extension Rule in CDCL SAT Solvers
inferred← citeshttps://doi.org/10.5555/1326073.1326120openalex-snapshot
Scalable exploration of functional dependency by interpolation and incremental SAT solving
inferred← citeshttps://doi.org/10.70675/5732022dzaf3bz44e9zae98z41d4facf3deaopenalex-snapshot
Contributions à la résolution du problème de la Satisfiabilité Propositionnelle
inferred← citeshttps://doi.org/10.70675/932a7c81z8d8dz4199z9e7bz02240dcf3998openalex-snapshot
Reasoning and inference for (maximum) satisfiability : new insights
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.