I am currently a Postdoctoral Fellow at the University of Toronto, working under the supervision of Kuldeep S. Meel. Before this, I held a position as a Research Fellow at the National University of Singapore, also under the guidance of Kuldeep S. Meel. I earned my PhD in Robotics and Autonomous Systems from a joint program between the University of Edinburgh and Heriot-Watt University. My doctoral supervisor was Vaishak Belle. Additionally, I obtained an MSci degree in Computing Science from the University of Glasgow.
My research focuses on discrete algorithms that count and compute sums of products based on a logical problem description. Specifically, I study weighted model counting—a weighted version of the #SAT problem—and first-order model counting. To solve these problems, I employ algorithmic techniques such as dynamic programming, knowledge compilation, and different representations of Boolean and pseudo-Boolean functions. Efficiently solving model counting problems is of utmost importance in various domains of artificial intelligence (AI), including explainable AI, neuro-symbolic AI, probabilistic programming, and statistical-relational AI. Moreover, these techniques find applications in bioinformatics, data mining, natural language processing, prognostics, and robotics.
In addition to my primary research interests, I am interested in graph algorithms, constraint satisfaction, and search algorithms. Previously, I have worked on projects involving graph algorithms, algorithm portfolios, formal modelling using bigraphs, and inverse reinforcement learning.
Paulius Dilkas. Generating Random Instances of Weighted Model Counting: An Empirical Analysis with Varying Primal Treewidth. CPAIOR 2023
paper slides codeMapping the Neuro-Symbolic AI Landscape by Architectures: A Handbook on Augmenting Deep Learning Through Symbolic Reasoning (with Jonathan Feldstein, Vaishak Belle, and Efthymia Tsamoura, 2024)
preprintVariational Inference for Inverse Reinforcement Learning with Gaussian Processes (supervised by Bjørn Sand Jensen, 2019)
MSci report slides codeNondeterministic Bigraphical Reactive Systems for Markov Decision Processes (supervised by Michele Sevegnani, 2018)
internship report slides codeAlgorithm Selection for Maximum Common Subgraph (supervised by Ciaran McCreesh and Patrick Prosser, 2018)
BSc dissertation slides codeClique-Based Encodings for Graph Edit Distance (supervised by Ciaran McCreesh, 2017)
internship report slides code