Fetching the paper…
Reading the bibliography…
Computational learning theory states that many classes of boolean formulas are learnable in polynomial time.
On random graphs I
P. Erdös and A. Rényi · 1959
Earlier work this paper cites.
On the Uniform Convergence of Relative Frequencies of Events to Their Probabilities
V. N. Vapnik and A. Ya. Chervonenkis · 1971
Earlier work this paper cites.
A theory of the learnable
L. G. Valiant · 1972
Earlier work this paper cites.
Cliques in random graphs
B. Bollobás and P. Erdös · 1976
Earlier work this paper cites.
Approximation of boolean functions by sigmoidal networks: Part i: Xor and other two-variable functions
E. K. Blum · 1989
Earlier work this paper cites.
Where the really hard problems are
Peter Cheeseman, Bob Kanefsky, and William Taylor · 1991
Earlier work this paper cites.
Cryptography and machine learning
Ronald L Rivest · 1991
Earlier work this paper cites.
Realization of boolean functions using binary pi-sigma networks
Yoan Shin and Joydeep Ghosh · 1991
Earlier work this paper cites.
An Introduction to Computational Learning Theory
M.J. Kearns and U. Vazirani · 1994
Earlier work this paper cites.
Experimental results on the crossover point in random 3-SAT
James Crawford and Larry Auton · 1996
Earlier work this paper cites.
Refining the phase transition in combinatorial search
Tad Hogg · 1996
Earlier work this paper cites.
Generating hard satisfiability problems
Bart Selman, David G Mitchell, and Hector J Levesque · 1996
Earlier work this paper cites.
Extracting propositions from trained neural networks
Hiroshi Tsukimoto · 1997
Earlier work this paper cites.
An empirical study of the efficiency of learning boolean functions using a Cartesian Genetic Programming approach
Julian F Miller · 1999
Earlier work this paper cites.
Neural networks–a model of boolean functions
Bernd Steinbach and Roman Kohut · 2002
Earlier work this paper cites.
From statistical relational to neuro-symbolic artificial intelligence
L. De Raedt, S. Dumancic, R. Manhaeve, and G. Marra · 2003
Earlier work this paper cites.
MiniSat: A SAT Solver with Conflict-Clause Minimization
Niklas Sorensson and Niklas Een · 2003
Earlier work this paper cites.
Bounds on the number of hidden neurons in three-layer binary neural networks
Zhaozhi Zhang, Xiaomin Ma, and Yixian Yang · 2003
Earlier work this paper cites.
On a generalization complexity measure for boolean functions
Leonardo Franco and Martin Anthony · 2004
Earlier work this paper cites.
Generalization ability of boolean functions implemented in feedforward neural networks
Leonardo Franco · 2006
Earlier work this paper cites.
The influence of oppositely classified examples on the generalization complexity of boolean functions
Leonardo Franco and Martin Anthony · 2006
Earlier work this paper cites.
Optimal synthesis of boolean functions by threshold functions
José Luis Subirats, Iván Gómez, José M Jerez, and Leonardo Franco · 2006
Cited alongside, same era.
Applicability of feed-forward and recurrent neural networks to boolean function complexity modeling
Azam Beg, PW Chandana Prasad, and Ajmal Beg · 2008
Cited alongside, same era.
The Art of Computer Programming, Vol. 4, Fascicle 0: Introduction to Combinatorial Algorithms and Boolean Functions
Donald E. Knuth · 2008
Cited alongside, same era.
A new decomposition algorithm for threshold synthesis and generalization of boolean functions
José L Subirats, José M Jerez, and Leonardo Franco · 2008
Cited alongside, same era.
Computational Complexity: A Modern Approach
Sanjeev Arora and Boaz Barak · 2009
Cited alongside, same era.
Neural-Symbolic Cognitive Reasoning
A Unified Approach to Interpreting Model Predictions
S. Lundberg and Su-In Lee · 2017
Later among the works it cites.
On the Glucose SAT solver
Gilles Audemard and Laurent Simon · 2018
Later among the works it cites.
Deep logic networks: Inserting and extracting knowledge from deep belief networks
S. Tran and A. Garcez · 2018
Later among the works it cites.
Neural-symbolic computing: An effective methodology for principled integration of machine learning and reasoning
A. d’Avila Garcez, M. Gori, L. C. Lamb, L. Serafini, M. Spranger, and S. Tran · 2019
Later among the works it cites.
Decoupling gating from linearity
Jonathan Fiat, Eran Malach, and Shai Shalev-Shwartz · 2019
Later among the works it cites.
On the hardness of robust classification
Pascale Gourdeau, Varun Kanade, Marta Kwiatkowska, and James Worrell · 2019
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
A. d’Avila Garcez, L.C. Lamb, and D.M. Gabbay · 2009
Cited alongside, same era.
Investigating data preprocessing methods for circuit complexity models
PW Chandana Prasad and Azam Beg · 2009
Cited alongside, same era.
Neural networks and boolean functions
Martin Anthony · 2010
Cited alongside, same era.
The SMT-lib standard: Version 2.0
Clark Barrett, Aaron Stump, Cesare Tinelli, et al · 2010
Cited alongside, same era.
Rectified Linear Units Improve Restricted Boltzmann Machines
Vinod Nair and Geoffrey Hinton · 2010
Cited alongside, same era.
Scikit-learn: Machine learning in Python
F. Pedregosa, G. Varoquaux, A. Gramfort, V. Michel, B. Thirion, O. Grisel, M. Blondel, P. Prettenhofer, R. Weiss, V. Dubourg, J. Vanderplas, A. Passos, D. Cournapeau, M. Brucher, M. Perrot, and E. Duchesnay · 2011
Cited alongside, same era.
Binary higher order neural networks for realizing boolean functions
C. Zhang, J. Yang, and W. Wu · 2011
Cited alongside, same era.
Later among the works it cites.
CNFgen: Combinatorial benchmarks for SAT solvers, 2019
Massimo Lauria, Jan Elffers, Jakob Nordström, and Marc Vinyals · 2019
Later among the works it cites.
The Neuro-Symbolic Concept Learner: Interpreting scenes, words, and sentences from natural supervision
J. Mao, C. Gan., P. Kohli, J. Tenenbaum, and J. Wu · 2019
Later among the works it cites.
2020 AI predictions from IBM research
S. Raghavan · 2019
Later among the works it cites.
Ganak: A scalable probabilistic exact model counter
Shubham Sharma, Subhajit Roy, Mate Soos, and Kuldeep S Meel · 2019
Later among the works it cites.
Learning local search heuristics for boolean satisfiability
Emre Yolcu and Barnabás Póczos · 2019
Later among the works it cites.
The next decade in AI: Four steps towards robust artificial intelligence
G. Marcus · 2020
Closest in time.
Tinted, detached, and lazy CNF-XOR solving and its applications to counting and sampling
M. Soos, S. Gocht, and K. Meel · 2020
Closest in time.
Logic Explained Networks, 2021
Gabriele Ciravegna, Pietro Barbiero, Francesco Giannini, Marco Gori, Pietro Lió, Marco Maggini, and Stefano Melacci · 2021
Closest in time.
Temporal and object quantification networks
Jiayuan Mao, Zhezheng Luo, Chuang Gan, Joshua B. Tenenbaum, Jiajun Wu, Leslie Pack Kaelbling, and Tomer D. Ullman · 2021
Closest in time.
How to augment learning with reasoning?
Leslie G. Valiant · 2021
Closest in time.
Neural-symbolic learning and reasoning: A survey and interpretation
T.R. Besold, A.S. d’Avila Garcez, S. Bader, H. Bowman, P. Domingos, P. Hitzler, K.-U. Kühnberger, L.C. Lamb, P.M. Vieira Lima, L. de Penning, G. Pinkas, H. Poon, and G. Zaverucha · 2022
Closest in time.
Neuro-symbolic inductive logic programming with logical neural networks
P. Sen, B.W. de Carvalho, R. Riegel, and A.G. Gray · 2022
Closest in time.
Learning neuro-symbolic skills for bilevel planning
T. Silver, A. Athalye, J.B. Tenenbaum, T. Lozano-Perez, and L.P. Kaelbling · 2022
Closest in time.
Neurosymbolic AI: the 3rd wave
A. d’Avila Garcez and L. C. Lamb · 2023
Closest in time.
AAAI-20 fireside chat with Daniel Kahneman
D. Kahneman, G. Hinton, Y. Bengio, Y. LeCun, and F. Rossi · 2025
Closest in time.