← Search

Luc de Raedt

21 accepted papers

2026

DeepLog: A Software Framework for Modular Neurosymbolic AI

IJCAI 2026

DeepLog is an operational neurosymbolic framework that unifies logic and deep learning within standard PyTorch workflows. While existing neurosymbolic systems focus on a particular paradigm and semantics, DeepLog serves as a universal backend that can emulate many systems in the neurosymbolic alphab

Cited by 0Scholar
2026

DeepProofLog: Efficient Proving in Deep Stochastic Logic Programs

AAAI 2026technical

Neurosymbolic (NeSy) AI combines neural architectures and symbolic reasoning to improve accuracy, interpretability, and generalization. While logic inference on top of subsymbolic modules has been shown to effectively guarantee these properties, this often comes at the cost of reduced scalability, w

Cited by 0SourcePDFScholar
2025

LexiCon: a Benchmark for Planning under Temporal Constraints in Natural Language

NeurIPS 2025poster

Owing to their reasoning capabilities, large language models (LLMs) have been evaluated on planning tasks described in natural language. However, LLMs have largely been tested on planning domains without constraints. In order to deploy them in real-world settings where adherence to constraints, in p…

Cited by 0SourceScholar
2025

Neurosymbolic Reinforcement Learning: Playing MiniHack with Probabilistic Logic Shields

AAAI 2025technical

Probabilistic logic shields integrate deep reinforcement learning (RL) with probabilistic logic reasoning to train agents that operate in uncertain environments while giving strong guarantees with respect to logical constraints, such as safety properties. In this demo paper, we introduce a codebase…

2025

Relational Neurosymbolic Markov Models

AAAI 2025technical

Sequential problems are ubiquitous in AI, such as in reinforcement learning or natural language processing. State-of-the-art deep sequential models, like transformers, excel in these settings but fail to guarantee the satisfaction of constraints necessary for trustworthy deployment. In contrast, neu…

2024

CLEVR-POC: Reasoning-Intensive Visual Question Answering in Partially Observable Environments

COLING 2024main

The integration of learning and reasoning is high on the research agenda in AI. Nevertheless, there is only a little attention to using existing background knowledge for reasoning about partially observed scenes to answer questions about the scene. Yet, we as humans use such knowledge frequently to…

Cited by 2SourcePDFScholar
2024

Inference and Learning in Dynamic Decision Networks Using Knowledge Compilation

AAAI 2024technical

Decision making under uncertainty in dynamic environments is a fundamental AI problem in which agents need to determine which decisions (or actions) to make at each time step to maximise their expected utility. Dynamic decision networks (DDNs) are an extension of dynamic Bayesian networks with decis…

2024

SayCanPay: Heuristic Planning with Large Language Models Using Learnable Domain Knowledge

AAAI 2024technical

Large Language Models (LLMs) have demonstrated impressive planning abilities due to their vast "world knowledge". Yet, obtaining plans that are both feasible (grounded in affordances) and cost-effective (in plan length), remains a challenge, despite recent progress. This contrasts with heuristic pla…

Cited by 42SourcePDFScholar
2023

Safe Reinforcement Learning via Probabilistic Logic Shields

IJCAI 2023poster

Safe Reinforcement learning (Safe RL) aims at learning optimal policies while staying safe. A popular solution to Safe RL is shielding, which uses a logical safety specification to prevent an RL agent from taking unsafe actions. However, traditional shielding techniques are difficult to integrate wi…

2022

DeepStochLog: Neural Stochastic Logic Programming

AAAI 2022technical

Recent advances in neural-symbolic learning, such as DeepProbLog, extend probabilistic logic programs with neural predicates. Like graphical models, these probabilistic logic programs define a probability distribution over possible worlds, for which inference is computationally hard. We propose Deep…

2022

Inference and Learning with Model Uncertainty in Probabilistic Logic Programs

AAAI 2022technical

An issue that has so far received only limited attention in probabilistic logic programming (PLP) is the modelling of so-called epistemic uncertainty, the uncertainty about the model itself. Accurately quantifying this model uncertainty is paramount to robust inference, learning and ultimately decis…

2021

Learning CNF Theories Using MDL and Predicate Invention

IJCAI 2021poster

We revisit the problem of learning logical theories from examples, one of the most quintessential problems in machine learning. More specifically, we develop an approach to learn CNF-formulae from satisfiability. This is a setting in which the examples correspond to partial interpretations and an ex…

Cited by 7SourcePDFScholar
2021

Mapping probability word problems to executable representations

EMNLP 2021main

While solving math word problems automatically has received considerable attention in the NLP community, few works have addressed probability word problems specifically. In this paper, we employ and analyse various neural models for answering such word problems. In a two-step approach, the problem t…

Cited by 12SourcePDFScholar
2020

From Statistical Relational to Neuro-Symbolic Artificial Intelligence

IJCAI 2020poster

Neuro-symbolic and statistical relational artificial intelligence both integrate frameworks for learning with logical reasoning. This survey identifies several parallels across seven different dimensions between these two fields. These cannot only be used to characterize and position neuro-symbolic…

Cited by 0SourcePDFScholar
2020

ProbAnch: a Modular Probabilistic Anchoring Framework

IJCAI 2020poster

Modeling object representations derived from perceptual observations, in a way that is also semantically meaningful for humans as well as autonomous agents, is a prerequisite for joint human-agent understanding of the world. A practical approach that aims to model such representations is perceptual…

2019

How to Exploit Structure while Solving Weighted Model Integration Problems

UAI 2019poster

Weighted model counting (WMC) is a state-of-the-art technique for probabilistic inference in discrete domains. WMC has recently been extended towards weighted model integration (WMI) in order to handle discrete and continuous distributions alike. While a number of WMI solvers have been introduced, t…

Cited by 21SourcePDFScholar
2018

DeepProbLog: Neural Probabilistic Logic Programming

NeurIPS 2018spotlight

We introduce DeepProbLog, a probabilistic logic programming language that incorporates deep learning by means of neural predicates. We show how existing inference and learning techniques can be adapted for the new language. Our experiments demonstrate that DeepProbLog supports (i) both symbolic and…