Inductive logic programming (ILP) has been a deeply influential paradigm in AI, enjoying decades of research on its theory and implementations. As a natural descendent of the fields of logic programming and machine learning, it admits the incorporation of background knowledge, which can be very useful in domains where prior knowledge from experts is available and can lead to a more data-efficient learning regime.

Be that as it may, the limitation to Horn clauses composed over Boolean variables is a very serious one. Many phenomena occurring in the real-world are best characterized using continuous entities, and more generally, mixtures of discrete and continuous entities. In this position paper, we motivate a reconsideration of inductive declarative programming by leveraging satisfiability modulo theory technology.
Original languageEnglish
Number of pages3
Publication statusPublished - 2 Jul 2020
EventNinth International Workshop on Statistical Relational AI - New York, United States
Duration: 7 Feb 20207 Feb 2020
Conference number: 9


WorkshopNinth International Workshop on Statistical Relational AI
Abbreviated titleStarAI 2020
Country/TerritoryUnited States
CityNew York
Internet address


Dive into the research topics of 'SMT + ILP'. Together they form a unique fingerprint.

Cite this