arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2001.05208cs.AIcs.LG
收藏

SMT + ILP

SMT + ILP

University of Edinburgh(爱丁堡大学);Alan Turing Institute(艾伦·图灵研究所)

Vaishak Belle

摘要:

归纳逻辑程序设计(ILP)是人工智能领域一个影响深远的范式,在理论和实现方面有着数十年的研究。作为逻辑编程和机器学习领域的自然产物,它允许结合背景知识,这在专家的先验知识可用的领域非常有用,并且可以导致更有效的数据学习机制。尽管如此,对由布尔变量组成的Horn子句的限制是非常严重的。现实世界中发生的许多现象最好使用连续实体来表征,更一般地,使用离散和连续实体的混合物来表征。在这篇立场论文中,我们通过利用可满足性模理论技术来重新考虑归纳声明式编程。

英文摘要:

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.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑