报告人:顾韬 (UCL)
题目:Probabilistic logic programming and Bayesian networks: a string diagram perspective
时间:2021/6/15 15:10-18:00
线上腾讯会议ID :440 883 947
摘要:Probabilistic logic programming (PLP) is an emerging subfield of artificial intelligence as a formalism to reason about uncertainty. It generalises logic programming by allowing annotation of clauses with probability values. We develop a categorical perspective of PLP based on a clear distinction between the syntax and semantics. In the spirit of Lawvere's functorial semantics of algebraic theories, we identify ground PLP with functors from some syntax categories (as freely generated categories of string diagrams) to a semantics category (of probabilistic transitions). Based on this, we retrieve the transformations between acyclic ground PLP and boolean-valued Bayesian networks at a functorial levels. Thanks to the syntax/semantics distinction as different categories, we can make precise the intuition that such transformations are syntactic. At the end of the talk we will briefly present how this framework can be adapted to the settings of classical logic programming and weighted logic programming
相关背景文献: