Symbolic Logic meets Machine Learning: A Brief Survey in Infinite Domains
Vaishak Belle

TL;DR
This survey explores the connections between symbolic logic and machine learning, emphasizing their interplay in infinite domains and challenging misconceptions about logic's applicability to continuous properties.
Contribution
It provides a comprehensive overview of how logic and learning intersect, especially in infinite domains, highlighting recent advances and misconceptions.
Findings
Logic can be effectively applied to continuous properties.
Recent work bridges the gap between deduction and induction.
Logic's role extends beyond discrete properties in AI.
Abstract
The tension between deduction and induction is perhaps the most fundamental issue in areas such as philosophy, cognition and artificial intelligence (AI). The deduction camp concerns itself with questions about the expressiveness of formal languages for capturing knowledge about the world, together with proof systems for reasoning from such knowledge bases. The learning camp attempts to generalize from examples about partial descriptions about the world. In AI, historically, these camps have loosely divided the development of the field, but advances in cross-over areas such as statistical relational learning, neuro-symbolic systems, and high-level control have illustrated that the dichotomy is not very constructive, and perhaps even ill-formed. In this article, we survey work that provides further evidence for the connections between logic and learning. Our narrative is structured in…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
