Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

David Debot

dblp:383/6030 · DBLP profile ↗
← Back
2ranked-venue papers
2as first author
2since 2021 · last 2025
0009-0006-4782-3233ORCID · reported

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 2 · 2 first-author · 2 since 2021Graphics, computer vision, multimedia, augmented reality and games · 1 · 1 first-author · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Artificial intelligence
2 papers
Reinforcement learning · 34% Knowledge representation and reasoning · 32% Trustworthy machine learning · 30%

Topics — the 7 heaviest of 7, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Machine learning › Reinforcement learning › knowledge-based reinforcement learning
neuro-symbolic reinforcement learning
0.912025
Neurosymbolic Reinforcement Learning: Playing MiniHack with Probabilistic Logic Shields · AAAI 2025
Knowledge, reasoning and agents › Knowledge representation and reasoning
probabilistic reasoning
0.912025
Neurosymbolic Reinforcement Learning: Playing MiniHack with Probabilistic Logic Shields · AAAI 2025
Machine learning › Reinforcement learning
safe reinforcement learning
0.912025
Neurosymbolic Reinforcement Learning: Playing MiniHack with Probabilistic Logic Shields · AAAI 2025
Machine learning › Trustworthy machine learning › interpretability
concept bottleneck model
0.812024
Interpretable Concept-Based Memory Reasoning · NeurIPS 2024
Machine learning › Trustworthy machine learning
interpretability
0.812024
Interpretable Concept-Based Memory Reasoning · NeurIPS 2024
Knowledge, reasoning and agents › Knowledge representation and reasoning
logic rules
0.812024
Interpretable Concept-Based Memory Reasoning · NeurIPS 2024
Robotics › Motion planning and robot control
safety guarantees
0.312025
Neurosymbolic Reinforcement Learning: Playing MiniHack with Probabilistic Logic Shields · AAAI 2025

Methods — techniques the papers use, named apart from their topics

probabilistic logic shields · 0.9deep reinforcement learning · 0.9symbolic evaluation · 0.8neural selection mechanism · 0.8
YearPublicationVenuePosition
2025 Neurosymbolic Reinforcement Learning: Playing MiniHack with Probabilistic Logic Shields
abstract
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 that streamlines the design of custom MiniHack environments where neurosymbolic RL agents leverage probabilistic logic shields to learn safe and interpretable policies with strong guarantees. Our framework allows expert users to easily define and train agents that integrate deep neural policies with probabilistic logic in arbitrarily complex games: from simple exploration to planning and interacting with enemies. Additionally, we provide a web-based platform that showcases our application, offering an interactive interface for the broader community to experiment with and explore the capabilities of neurosymbolic reinforcement learning. This lowers the barrier for researchers and developers, making it accessible for a wider audience to engage with safety-critical RL scenarios.
David Debot, Gabriele Venturato, Giuseppe Marra, Luc De Raedt
AAAI1
2024 Interpretable Concept-Based Memory Reasoning
abstract
The lack of transparency in the decision-making processes of deep learning systems presents a significant challenge in modern artificial intelligence (AI), as it impairs users’ ability to rely on and verify these systems. To address this challenge, Concept Bottleneck Models (CBMs) have made significant progress by incorporating human-interpretable concepts into deep learning architectures. This approach allows predictions to be traced back to specific concept patterns that users can understand and potentially intervene on. However, existing CBMs’ task predictors are not fully interpretable, preventing a thorough analysis and any form of formal verification of their decision-making process prior to deployment, thereby raising significant reliability concerns. To bridge this gap, we introduce Concept-based Memory Reasoner (CMR), a novel CBM designed to provide a human-understandable and provably-verifiable task prediction process. Our approach is to model each task prediction as a neural selection mechanism over a memory of learnable logic rules, followed by a symbolic evaluation of the selected rule. The presence of an explicit memory and the symbolic evaluation allow domain experts to inspect and formally verify the validity of certain global properties of interest for the task prediction process. Experimental results demonstrate that CMR achieves better accuracy-interpretability trade-offs to state-of-the-art CBMs, discovers logic rules consistent with ground truths, allows for rule interventions, and allows pre-deployment verification.
David Debot, Pietro Barbiero, Francesco Giannini, Gabriele Ciravegna, Michelangelo Diligenti, Giuseppe Marra
NeurIPS1