StarAI 2017

Seventh International Workshop on Statistical Relational AI

The purpose of the Statistical Relational AI (StarAI) workshop is to bring together researchers and practitioners from two fields: logical (or relational) AI and probabilistic (or statistical) AI. These fields share many key features and often solve similar problems and tasks. Until recently, however, research in them has progressed independently with little or no interaction. The fields often use different terminology for the same concepts and, as a result, keeping-up and understanding the results in the other field is cumbersome, thus slowing down research. Our long term goal is to change this by achieving a synergy between logical and statistical AI. As a stepping stone towards realizing this big picture view on AI, we are organizing the Seventh International Workshop on Statistical Relational AI at the 33rd Conference on Uncertainty in Artificial Intelligence (UAI) in Sydney, on August 15th 2017.



StarAI will be a one day workshop with short paper presentations, a poster session, and two invited speakers:

  • Michael Thielscher (UNSW) 
  • Maximilian Nickel (FAIR) 


Authors should submit either a full paper reporting on novel technical contributions or work in progress (AAAI style, up to 7 pages excluding references), a short position paper (AAAI style, up to 2 pages excluding references), or an already published work (verbatim, no page limit, citing original work) in PDF format via EasyChair. All submitted papers will be carefully peer-reviewed by multiple reviewers and low-quality or off-topic papers will be rejected. Accepted papers will be presented as a short talk and poster.

Important Dates

  • Paper Submission: June 26
  • Notification of Acceptance: July 15
  • Camera-Ready Papers: July 24
  • Date of Workshop: August 15



  •  9:00 a.m.: Welcome and introduction
  •  9:10 a.m.: Invited talk -- Michael Thielscher
    • Title: General Game Playing

      Abstract: General game-playing systems can understand descriptions of new games at runtime and learn to play them without human intervention. In the first part of this talk, I will give an overview of the Game Description Language (GDL) as a formal representation language for general games. I will show how to model imperfect-information games and so-called epistemic games, in which rules depend on what players can and cannot deduce from the information they get during gameplay. In the second part, I will give an overview of successful approaches to general game playing and in particular discuss methods to represent and automatically generate game-specific knowledge from a set of game rules.

  • 10:10 a.m.: Poster Spotlights (3 minutes each)
  • 10:30 a.m.: Coffee break & Poster Session
  • 11:30 a.m.: Invited talk -- Maximilian Nickel
    • Title: Learning Hierarchical Representations of Relational Data

      Abstract: Representation learning has become an invaluable approach for making statistical inferences from relational data. In this talk, I will first give an overview over state-of-the-art methods for learning representations of multi-relational data and discuss how they can be used for tasks such as link prediction and entity resolution. However, while complex relational datasets often exhibit a latent hierarchical structure, such embeddings typically do not account for this property. In the second part of the talk, I will introduce a novel approach to learning such hierarchical representations of symbolic data by embedding them into hyperbolic space -- or more precisely into an n-dimensional Poincaré ball. I will discuss how the underlying hyperbolic geometry allows us to learn parsimonious representations which simultaneously capture hierarchy and similarity. Furthermore, I will show that Poincaré embeddings can outperform Euclidean embeddings significantly on data with latent hierarchies, both in terms of representation capacity and in terms of generalization ability. (slides)

  • 12:30 p.m.: Lunch break


  • 2:00 p.m.: Contributed Talks
    • Non-Count Symmetries in Boolean & Multi-Valued Prob. Graphical Models
    • Probabilistic Program Abstractions
    • Anytime Exact Belief Propagation
    • Sequential Lifted Bayesian Filtering in Multiset Rewriting Systems
    • Stochastic Gradient Descent for Relational Logistic Regression via Partial Network Crawls
  • 3:15 p.m.: Coffee break & Poster Session
  • 5:30 p.m.: End

Accepted Papers

  1. Ankit Anand, Ritesh Noothigattu, Parag Singla and Mausam.
    Non-Count Symmetries in Boolean & Multi-Valued Prob. Graphical Models
  2. Haroun Habeeb, Ankit Anand, Mausam and Parag Singla.
    Coarse-to-Fine Lifted MAP Inference in Computer Vision
  3. Max Schröder, Stefan Lüdtke, Sebastian Bader, Frank Krüger and Thomas Kirste.
    Sequential Lifted Bayesian Filtering in Multiset Rewriting Systems
  4. Jiasen Yang, Bruno Ribeiro and Jennifer Neville.
    Stochastic Gradient Descent for Relational Logistic Regression via Partial Network Crawls
  5. Théo Trouillon and Maximilian Nickel.
    Complex and Holographic Embeddings of Knowledge Graphs: A Comparison
  6. Steven Holtzen, Todd Millstein and Guy Van den Broeck.
    Probabilistic Program Abstractions
  7. Seyed Mehran Kazemi, Angelika Kimmig, Guy Van den Broeck and David Poole.
    Domain Recursion for Lifted Inference with Existential Quantifiers
  8. Pasquale Minervini, Thomas Demeester, Tim Rocktäschel and Sebastian Riedel.
    Adversarial Sets for Regularising Neural Link Predictors
  9. Gabriel Azevedo Ferreira, Quentin Bertrand, Charles Maussion and Rodrigo de Salvo Braz. Anytime Exact Belief Propagation.
    Anytime Exact Belief Propagation
  10. Seyed Mehran Kazemi, Bahare Fatemi, Alexandra Kim, Zilun Peng, Moumita Roy Tora, Xing Zeng, Matthew Dirks and David Poole.
    Comparing Aggregators for Relational Probabilistic Models
  11. Francisco Henrique Otte Vieira de Faria, Arthur Colombini Gusmão, Fabio Gagliardi Cozman and Denis Mauá.
    Speeding-up ProbLog’s Parameter Learning
  12. Parisa Kordjamshidi, Sameer Singh, Daniel Khashabi, Christos Christodoulopoulos, Mark Sammons, Saurabh Sinha and Dan Roth.
    Relational Learning and Feature Extraction by Querying over Heterogeneous Information Networks


Organizing Committee

For comments, queries and suggestions, please contact:
  • Angelika Kimmig (Cardiff) 
  • David Poole (UBC) 
  • Jay Pujara (UCSC) 
  • Tim Rocktäschel (Oxford) 

Program Committee

  • Hendrik Blockeel (KU Leuven) 
  • Jaesik Choi (UNIST) 
  • Vitor Santos Costa (Universidade do Porto)
  • Rajarashi Das (UMass)
  • Lucas Sterckx (Ghent)
  • Richard Evans (Google DeepMind)
  • Vibhav Gogate (UT Dallas) 
  • Kristian Kersting (TU Darmstadt) 
  • Daniel Lowd (University of Oregon) 
  • Pasquale Minervini (University College London)
  • Mathias Niepert (NEC Labs)
  • Sriram Natarajan (Indiana)
  • Scott Sanner (Oregon State University) 
  • Sameer Singh (University of Washington) 
  • Dhanya Sridhar (UC Santa Cruz) 
  • Guy Van den Broeck (UCLA) 
  • Johannes Welbl (University College London) 


StarAI is currently provoking a lot of new research and has tremendous theoretical and practical implications. Theoretically, combining logic and probability in a unified representation and building general-purpose reasoning tools for it has been the dream of AI, dating back to the late 1980s. Practically, successful StarAI tools will enable new applications in several large, complex real-world domains including those involving big data, social networks, natural language processing, bioinformatics, the web, robotics and computer vision. Such domains are often characterized by rich relational structure and large amounts of uncertainty. Logic helps to effectively handle the former while probability helps her effectively manage the latter. We seek to invite researchers in all subfields of AI to attend the workshop and to explore together how to reach the goals imagined by the early AI pioneers.

The focus of the workshop will be on general-purpose representation, reasoning and learning tools for StarAI as well as practical applications. Specifically, the workshop will encourage active participation from researchers in the following communities: satisfiability (SAT), knowledge representation (KR), constraint satisfaction and programming (CP), (inductive) logic programming (LP and ILP), graphical models and probabilistic reasoning (UAI), statistical learning (NIPS, ICML, and AISTATS), graph mining (KDD and ECML PKDD) and probabilistic databases (VLDB and SIGMOD). It will also actively involve researchers from more applied communities, such as natural language processing (ACL and EMNLP), information retrieval (SIGIR, WWW and WSDM), vision (CVPR and ICCV), semantic web (ISWC and ESWC) and robotics (RSS and ICRA).

Previous Workshops

Previous StarAI workshops were held in conjunction with AAAI 2010, UAI 2012, AAAI 2013, AAAI 2014, UAI 2015, and IJCAI 2016 and were among the most popular workshops at the conferences.