profile picture

Paulius Dilkas

I am a Research Fellow at the National University of Singapore School of Computing, hosted by Kuldeep Meel. I did my PhD in Robotics and Autonomous Systems jointly at the University of Edinburgh and Heriot-Watt University, supervised by Vaishak Belle. I received my MSci in Computing Science degree from the University of Glasgow.

I am interested in discrete algorithms that count and compute sums of products from a logic-based description of the problem. Specifically, my recent work is on weighted model counting (i.e., a weighted version of #SAT) and first-order model counting. Algorithmic techniques used to solve these problems include dynamic programming, knowledge compilation, and various representations of Boolean and pseudo-Boolean functions. Solving such model counting problems efficiently is crucial for many areas of artificial intelligence (AI) such as explainable AI, neural-symbolic AI, probabilistic programming, and statistical relational AI. Other applications include bioinformatics, data mining, natural language processing, prognostics, and robotics. I am also interested in graph algorithms, constraint satisfaction, and search algorithms. Previously, I have worked on graph algorithms, algorithm portfolios, formal modelling with bigraphs, and inverse reinforcement learning.

paulius.dilkas@nus.edu.sg

Publications

PBP
Paulius Dilkas, Vaishak Belle. Weighted Model Counting Without Parameter Variables. SAT 2021
paper video slides code
CW
Paulius Dilkas, Vaishak Belle. Weighted Model Counting with Conditional Weights for Bayesian Networks. UAI 2021
paper supplement video slides poster code
random
Paulius Dilkas, Vaishak Belle. Generating Random Logic Programs Using Constraint Programming. CP 2020
paper video slides code

Previous Unpublished Work

VIGPIRL
Variational Inference for Inverse Reinforcement Learning with Gaussian Processes (with Bjørn Sand Jensen)
report slides code
NBRS
Nondeterministic Bigraphical Reactive Systems for Markov Decision Processes (with Michele Sevegnani)
report slides code
MCS
Algorithm Selection for Maximum Common Subgraph (with Ciaran McCreesh, Patrick Prosser)
dissertation slides code
GED
Clique-Based Encodings for Graph Edit Distance (with Ciaran McCreesh)
report slides code

Teaching

2019-2022
At the School of Informatics, University of Edinburgh, I worked on the following courses:
2017-2019
At the School of Computing Science, University of Glasgow I worked as a demonstrator for the following courses:
2012-2017
Before that, I worked as a Distance Learning Teacher in Mathematics at the National Student Academy in Lithuania

Awards

  • 2019
    • 3-Year Scholarship from the EPSRC CDT in Robotics and Autonomous Systems
    • MSci Class Prize
  • 2018
    • EPSRC Vacation Scholarship
    • Level 4 Project with Best Product
  • 2017
    • EPSRC Vacation Scholarship
    • Level 3 Honours Class Prize for Computing Science
  • 2016
  • 2015
    • O'Reilly Academic Prize for Best Overall Performance in Assessed Coursework in Level 1 Computing Science
    • Lorimer Bursary Prize