On the public citation graph
On the Learnability of Disjunctive Normal Form Formulas
0 signed · 63 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.
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.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1006/inco.1995.1149openalex-snapshot
Read-Twice DNF Formulas Are Properly Learnable
inferredcites →https://doi.org/10.1007/bf00992675openalex-snapshot
Learning conjunctions of Horn clauses
inferredcites →https://doi.org/10.1007/bf00993160openalex-snapshot
Randomly Fallible Teachers: Learning Monotone DNF with an Incomplete Membership Oracle
inferredcites →https://doi.org/10.1016/0020-0190(94)90057-4openalex-snapshot
On using the Fourier transform to learn disjoint DNF
inferredcites →https://doi.org/10.1016/0022-0000(79)90045-xopenalex-snapshot
Fast probabilistic algorithms for hamiltonian circuits and matchings
inferredcites →https://doi.org/10.1016/0890-5401(87)90052-6openalex-snapshot
Learning regular sets from queries and counterexamples
inferredcites →https://doi.org/10.1016/b978-1-55860-146-8.50027-8openalex-snapshot
LEARNING DNF UNDER THE UNIFORM DISTRIBUTION IN QUASI-POLYNOMIAL TIME
inferredcites →https://doi.org/10.1016/b978-1-55860-213-7.50020-1openalex-snapshot
Learning Monotone kμ DNF Formulas on Product Distributions
inferredcites →https://doi.org/10.1016/b978-1-55860-213-7.50022-5openalex-snapshot
Learning 2μDNF Formulas and kμ Decision Trees
inferredcites →https://doi.org/10.1023/a:1022689015665openalex-snapshot
Learning Conjunctions of Horn Clauses
inferredcites →https://doi.org/10.1109/sfcs.1991.185366openalex-snapshot
Exact learning of read-twice DNF formulas
inferredcites →https://doi.org/10.1109/sfcs.1992.267799openalex-snapshot
Read-thrice DNF is hard to learn with membership and equivalence queries
inferredcites →https://doi.org/10.1109/sfcs.1993.366857openalex-snapshot
Exact learning via the Monotone theory
inferredcites →https://doi.org/10.1109/sfcs.1994.365706openalex-snapshot
An efficient membership-query algorithm for learning DNF with respect to the uniform distribution
inferredcites →https://doi.org/10.1137/0222080openalex-snapshot
Learning Decision Trees Using the Fourier Spectrum
inferredcites →https://doi.org/10.1145/103418.103420openalex-snapshot
When won't membership queries help?
inferredcites →https://doi.org/10.1145/129712.129748openalex-snapshot
Fast learning of k -term DNF formulas with queries
inferredcites →https://doi.org/10.1145/130385.130393openalex-snapshot
Exact learning of read- k disjoint DNF and not-so-disjoint DNF
inferredcites →https://doi.org/10.1145/130385.130394openalex-snapshot
Learning k -term DNF formulas with an incomplete membership oracle
inferredcites →https://doi.org/10.1145/130385.130395openalex-snapshot
Learning DNF formulae under classes of probability distributions
inferredcites →https://doi.org/10.1145/138027.138061openalex-snapshot
Learning read-once formulas with queries
inferredcites →https://doi.org/10.1145/168304.168309openalex-snapshot
Linear time deterministic learning of k -term DNF
inferredcites →https://doi.org/10.1145/168304.168362openalex-snapshot
On learning visual concepts and DNF formulae
inferredcites →https://doi.org/10.1145/180139.181051openalex-snapshot
On learning Read-k-Satisfy-j DNF
inferredcites →https://doi.org/10.5555/92571.92659openalex-snapshot
Learning DNF under the uniform distribution in quasi-polynomial time
inferredcites →https://doi.org/10.5555/93025.93062openalex-snapshot
Learning k-DNF with noise in the attributes
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1006/jcss.2001.1794openalex-snapshot
A New Abstract Combinatorial Dimension for Exact Learning via Queries
inferred← citeshttps://doi.org/10.1007/11538462_29openalex-snapshot
On Learning Random DNF Formulas Under the Uniform Distribution
inferred← citeshttps://doi.org/10.1007/3-540-46695-9_17openalex-snapshot
A Simulated Annealing-Based Learning Algorithm for Boolean DNF
inferred← citeshttps://doi.org/10.1007/3-540-49381-6_26openalex-snapshot
Generalized Graph Colorability and Compressibility of Boolean Formulae
inferred← citeshttps://doi.org/10.1007/3-540-49730-7_27openalex-snapshot
Learning Sub-classes of Monotone DNF on the Uniform Distribution
inferred← citeshttps://doi.org/10.1007/978-1-4471-1523-6_17openalex-snapshot
The Psychological Limits of Neural Computation
inferred← citeshttps://doi.org/10.1007/978-3-031-19135-0_1openalex-snapshot
SAT-Based Invariant Inference and Its Relation to Concept Learning
inferred← citeshttps://doi.org/10.1007/978-3-540-85363-3_38openalex-snapshot
Learning Random Monotone DNF
inferred← citeshttps://doi.org/10.1007/s10618-019-00657-9openalex-snapshot
Grafting for combinatorial binary model using frequent itemset mining
inferred← citeshttps://doi.org/10.1007/s10729-014-9276-0openalex-snapshot
A machine learning approach to create blocking criteria for record linkage
inferred← citeshttps://doi.org/10.1016/j.artint.2003.04.003openalex-snapshot
Version spaces and the consistency problem
inferred← citeshttps://doi.org/10.1016/j.jcss.2019.07.004openalex-snapshot
Proper learning of k-term DNF formulas from satisfying assignments
inferred← citeshttps://doi.org/10.1023/a:1007610422992openalex-snapshot
Learning Function-Free Horn Expressions
inferred← citeshttps://doi.org/10.1023/b:coap.0000004980.80957.05openalex-snapshot
Approximation of Boolean Functions by Local Search
inferred← citeshttps://doi.org/10.1109/ccc.1999.766279openalex-snapshot
Learning DNF by approximating inclusion-exclusion formulae
inferred← citeshttps://doi.org/10.1109/iecon.2013.6700419openalex-snapshot
Complexity reduction for automated design problems of building automation systems
inferred← citeshttps://doi.org/10.1109/kes.1998.725916openalex-snapshot
Polynomial-sample learnability about distance-0 and 1 DNF formulas
inferred← citeshttps://doi.org/10.1137/s0097539794274398openalex-snapshot
On Learning Read-k-Satisfy-j DNF
inferred← citeshttps://doi.org/10.1145/1536414.1536424openalex-snapshot
Exact learning of random DNF over the uniform distribution
inferred← citeshttps://doi.org/10.1145/3434296openalex-snapshot
Learning the boundary of inductive invariants
inferred← citeshttps://doi.org/10.1145/3717823.3718262openalex-snapshot
DNF Learning via Locally Mixing Random Walks
inferred← citeshttps://doi.org/10.1145/3798129.3800766openalex-snapshot
Learning CNF Formulas from Uniform Random Solutions in the Local Lemma Regime
inferred← citeshttps://doi.org/10.1587/transinf.2023lop0001openalex-snapshot
On Easily Reconstructable Logic Functions
inferred← citeshttps://doi.org/10.1613/jair.183openalex-snapshot
Translating between Horn Representations and their Characteristic Models
inferred← citeshttps://doi.org/10.25911/5d666a53f0984openalex-snapshot
Indexing techniques for real-time entity resolution
inferred← citeshttps://doi.org/10.48550/arxiv.1203.0594openalex-snapshot
Learning DNF Expressions from Fourier Spectrum
inferred← citeshttps://doi.org/10.48550/arxiv.1711.02478openalex-snapshot
Grafting for Combinatorial Boolean Model using Frequent Itemset Mining
inferred← citeshttps://doi.org/10.7916/d8w66sm1openalex-snapshot
On the Learnability of Monotone Functions
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.