Demo Data from EDBT 2026 / reviewers in the wild / expert
Sota Moriyama
dblp:365/1196
· DBLP profile ↗
3ranked-venue papers
2as first author
3since 2021 · last 2025
0009-0004-2327-7720ORCID · reported
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 3 · 2 first-author · 3 since 2021Theory of computation · 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 |
Knowledge representation and reasoning · 46% Graph learning · 46% Autonomous driving · 7% | |
| Theoretical computer science
1 paper |
Automated reasoning and model checking · 100% |
Topics — the 7 heaviest of 7, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Machine learning › Graph learning › graph neural network › attention-based graph neural network
graph attention network |
0.9 | 1 | 2025 | Graph-Based Attention for Differentiable MaxSAT Solving · NeurIPS 2025 |
Machine learning › Graph learning
graph neural network |
0.9 | 1 | 2025 | Graph-Based Attention for Differentiable MaxSAT Solving · NeurIPS 2025 |
Knowledge, reasoning and agents › Knowledge representation and reasoning
logical constraints |
0.9 | 1 | 2025 | T-norm Selection for Object Detection in Autonomous Driving with Logical Constraints · NeurIPS 2025 |
Knowledge, reasoning and agents › Knowledge representation and reasoning › knowledge incorporation › knowledge-infused learning
neuro-symbolic learning |
0.9 | 1 | 2025 | T-norm Selection for Object Detection in Autonomous Driving with Logical Constraints · NeurIPS 2025 |
Automated reasoning and model checking › satisfiability
MaxSAT solving |
0.9 | 1 | 2025 | Graph-Based Attention for Differentiable MaxSAT Solving · NeurIPS 2025 |
Automated reasoning and model checking
satisfiability |
0.9 | 1 | 2025 | Graph-Based Attention for Differentiable MaxSAT Solving · NeurIPS 2025 |
Robotics › Autonomous driving
autonomous driving perception |
0.3 | 1 | 2025 | T-norm Selection for Object Detection in Autonomous Driving with Logical Constraints · NeurIPS 2025 |
Methods — techniques the papers use, named apart from their topics
t-norm attention · 1.7message passing · 1.7local search · 1.7t-norm · 0.9neuro-symbolic framework · 0.9constrained loss · 0.9
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2025 | T-norm Selection for Object Detection in Autonomous Driving with Logical ConstraintsabstractIntegrating logical constraints into object detection models for autonomous driving (AD) is a promising way to enhance their compliance with rules and thereby increase the safety of the system. T-norms have been utilized to calculate the constrained loss, i.e., the violations of logical constraints as losses. While prior works have statically selected a few t-norms, we conduct an extensive experimental study to identify the most effective choices, as suboptimal t-norms can lead to undesired model behavior. To this end, we present MOD-ECL, a neurosymbolic framework that implements a wide range of t-norms and applies them in an adaptive manner. It includes an algorithm that selects well-performing t-norms during training and a scheduler that regulates the impact of the constrained loss. We evaluate its effectiveness on the ROAD-R and ROAD-Waymo-R datasets for object detection in AD, using attached common-sense constraints. Our results show that careful selection of parameters is crucial for effective constrained loss behavior. Moreover, our framework not only reduces constraint violations but also, in some cases, improves detection performance. Additionally, our methods offer fine-grained control over the trade-off between accuracy and constraint violation. Thomas Eiter, Katsumi Inoue, Nelson Higuera, Sota Moriyama |
NeurIPS | 4 |
| 2025 | Graph-Based Attention for Differentiable MaxSAT SolvingabstractThe use of deep learning to solve fundamental AI problems such as Boolean Satisfiability (SAT) has been explored recently to develop robust and scalable reasoning systems. This work advances such neural-based reasoning approaches by developing a new Graph Neural Network (GNN) to differentiably solve (weighted) Maximum Satisfiability (MaxSAT). To this end, we propose SAT-based Graph Attention Networks (SGATs) as novel GNNs that are built on t-norm based attention and message passing mechanisms, and structurally designed to approximate greedy distributed local search. To demonstrate the effectiveness of our model, we develop a local search solver that uses SGATs to continuously solve any given MaxSAT problem. Experiments on (weighted) MaxSAT benchmark datasets demonstrate that SGATs significantly outperform existing neural-based architectures, and achieve state-of-the-art performance among continuous approaches, highlighting the strength of the proposed model. Sota Moriyama, Katsumi Inoue |
NeurIPS | 1 |
| 2023 | GNN Based Extraction of Minimal Unsatisfiable Subsets
Sota Moriyama, Koji Watanabe, Katsumi Inoue |
ILP | 1 |