The 6th Workshop on Probabilistic Logic Programming

An ICLP workshop

21st, September 2019, Las Cruces, New Mexico, USA

Venue | Invited Speakers | Program | Registration | Accepted Papers | Programme Committee

Probabilistic logic programming (PLP) approaches have received much attention in this century. They address the need to reason about relational domains under uncertainty arising in a variety of application domains, such as bioinformatics, the semantic web, robotics, and many more. Developments in PLP include new languages that combine logic programming with probability theory as well as algorithms that operate over programs in these formalisms.

The workshop encompasses all aspects of combining logic, algorithms, programming and probability.

PLP is part of a wider current interest in probabilistic programming. By promoting probabilities as explicit programming constructs, inference, parameter estimation and learning algorithms can be run over programs which represent highly structured probability spaces. Due to logic programming's strong theoretical underpinnings, PLP is one of the more disciplined areas of probabilistic programming. It builds upon and benefits from the large body of existing work in logic programming, both in semantics and implementation, but also presents new challenges to the field. PLP reasoning often requires the evaluation of large number of possible states before any answers can be produced thus breaking the sequential search model of traditional logic programs.

While PLP has already contributed a number of formalisms, systems and well understood and established results in: parameter estimation, tabling, marginal probabilities and Bayesian learning, many questions remain open in this exciting, expanding field in the intersection of AI, machine learning and statistics.

This workshop aims to bring together researchers in all aspects of probabilistic logic programming, including theoretical work, system implementations and applications. Interactions between theoretical and applied minded researchers are encouraged. The presence of this workshop at ICLP is intended to encourage collaboration with researchers from the field of logic programming,

This workshop provides a forum for the exchange of ideas, presentation of results and preliminary work, in the following areas

- probabilistic logic programming formalisms
- parameter estimation
- statistical inference
- implementations
- structure learning
- reasoning with uncertainty
- constraint store approaches
- stochastic and randomised algorithms
- probabilistic knowledge representation and reasoning
- constraints in statistical inference
- applications, such as
- bioinformatics
- semantic web
- robotics

- probabilistic graphical models
- Bayesian learning
- tabling for learning and stochastic inference
- MCMC
- stochastic search
- labelled logic programs
- integration of statistical software

The above list should be interpreted broadly and is by no means exhaustive.

The workshop will take place at Las Cruces, New Mexico, USA.

You can find workshop schedule at: https://www.cs.nmsu.edu/ALP/iclp2019/schedule_plp.html

The workshop will take place at Las Cruces, New Mexico, USA.

- Joohyung Lee (Arizona State University, USA)
- Guy Van den Broeck (University of California, Los Angeles)
- Elena Bellodi (University of Ferrara, Italy)

**DeepLPMLN: A neural probabilistic logic programming language**

This talk will introduce DeepLPMLN, which extends probabilistic answer set programming language LPMLN by embracing neural networks via the notion of neural atoms borrowed from DeepProbLog. The formalism allows for seamless coordination of the perception and the reasoning tasks, as well as joint parameter learning between probabilistic logic programs and neural networks. The gradients from the rules do not stop at updating the weights of the rules but could backpropagate further into neural networks, thereby enabling neural networks to learn not only from implicit correlations from the data but also from explicit complex semantic constraints conveniently expressed by answer set programs.

**Discrete Probabilistic Programming from First Principles.** (slides)

This talk will build up semantics and probabilistic reasoning algorithms for discrete probabilistic programs from first principles. We begin by explaining simple semantics for imperative probabilistic programs, highlighting how they are different from classical representations of uncertainty in AI, and the possible pitfalls along the way. Then we dive into algorithms for reasoning about such programs and exploiting their structure, either through abstraction of the probabilistic program, or by compilation into a tractable representation for inference.

**Efficient inference in discrete and continuous domains for PLP languages under the Distribution Semantics** (slides)

In Probabilistic Logic Programming, a large number of languages have been independently proposed. Many of these however follow a common approach, the distribution semantics (Sato 1995). Since PLP systems generally must solve a large number of inference problems in order to perform learning, they rely critically on the support of efficient inference systems. The talk will provide an overview of the most recent and scalable techniques for exact and approximate reasoning on PLP programs under the distribution semantics, in the presence of discrete or continuous random variables.

Registration open through ICLP registration: https://shopcart.nmsu.edu/shop/icpl2019

Papers due: | |

Notification to authors: | |

Camera ready version due: | |

Workshop date: | 21, September 2019 |

(the deadline for all dates is 23:59 BST)

- Efficient Learning of Relational Gaifman Models using Probabilistic Logic (Devendra Dhami, Gautam Kunapuli and Sriraam Natarajan)
- Elicitation of probabilistic logic rules from medical records: A preliminary study in learning policies for the management of critically ill children (Michael Skinner, Sriraam Natarajan, Lakshmi Raman, Neel Shah and Abdelaziz Farhat)
- Bridging Commonsense Reasoning and Probabilistic Planning via a Probabilistic Action Language (Yi Wang, Shiqi Zhang and Joohyung Lee)

At least one author of each accepted paper will be required to attend the workshop to present the contribution.

- Sriraam Natarajan (The University of Texas at Dallas, USA) [co-chair]
- Yi Wang (Arizona State University, USA) [co-chair]
- Joohyung Lee (Arizona State University, USA)
- Elena Bellodi (University of Ferrara, Italy)
- Fabio Cozman (University of Sao Paulo, Brasil)
- Luke Dickens (University College London, UK)
- Matthias Nickles (National University of Ireland, Ireland)
- Rolf Schwitter (Macquarie University, Australia)
- Chung-Chieh Shan (Indiana University Bloomington, USA)

- Nicos Angelopoulos (Sanger Institute, UK)
- Vitor Santos Costa (Universidade do Porto, Portugal)
- James Cussens (University of York, UK)
- Arjen Hommersom (Open University, The Netherlands)
- Angelika Kimmig (Cardiff University, UK)
- Evelina Lamma (University of Ferrara, Italy)
- David Poole (University of British Columbia, Canada)
- Luc De Raedt (KU Leuven, Belgium)
- Fabrizio Riguzzi (University of Ferrara, Italy)
- Alessandra Russo (Imperial College, UK)
- Joost Vennekens (KU Leuven, Belgium)

Last modified: Wed 31 July 2019