Symbolic Logic Meets Machine Learning: A Brief Survey in Infinite Domains

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 terms of three strands: logic versus learning, machine learning for logic, and logic for machine learning, but naturally, there is considerable overlap. We place an emphasis on the following "sore" point: there is a common misconception that logic is for discrete properties, whereas probability theory and machine learning, more generally, is for continuous properties. We report on results that challenge this view on the limitations of logic, and expose the role that logic can play for learning in infinite domains.

Syntactic Requirements for Well-defined Hybrid Probabilistic Logic Programs

“…As future work, we plan to develop algorithms to automatically check these properties as well as developing new inference algorithms that can manage infinite domains [5].…”

Is Neuro-Symbolic AI Meeting its Promise in Natural Language Processing? A Structured Review

“…Several surveys have already been conducted which cover the overall NeSy landscape going as far back as 2005, and as recently as 2021, so we will not attempt to replicate that here [1,4,8,[13][14][15][16][17][18][19][20][21][22][23][24][25]. In fact, our understanding of the field is guided by the works of these scholars.…”

Explainable and Ethical AI: A Perspective on Argumentation and Logic Programming

“…ILP makes it possible to learn from data enabling inductive construction of first-order clausal theories from examples and background knowledge. ILP is a good candidate to meet R 6 and preliminary studies show ILP can be the glue between symbolic techniques and sub-symbolic ones such as numerical/statistical machine learning (ML) and deep learning [3].…”