{"id":904,"date":"2026-02-01T10:03:45","date_gmt":"2026-02-01T10:03:45","guid":{"rendered":"http:\/\/147.102.205.42\/?page_id=904"},"modified":"2026-09-15T21:44:35","modified_gmt":"2026-09-15T19:44:35","slug":"accepted-papers","status":"publish","type":"page","link":"https:\/\/sum2026.math.ntua.gr\/?page_id=904","title":{"rendered":"Accepted Papers"},"content":{"rendered":"\t\t
\n\t\t\t\t
\n\t\t\t\t\t
\n\t\t\t\t
\n\t\t\t\t\t\t\t
\n\t\t\t
<\/div>\n\t\t<\/div>\n\t\t\t\t\t\t<\/div>\n\t\t\t\t\t<\/div>\n\t\t\t\t<\/div>\n\t\t\t\t
\n\t\t\t\t\t\t
\n\t\t\t\t\t
\n\t\t\t
\n\t\t\t\t\t\t
\n\t\t\t\t\t

Accepted Papers<\/h2>\t\t\t\t<\/div>\n\t\t\t\t\t<\/div>\n\t\t<\/div>\n\t\t\t\t\t<\/div>\n\t\t<\/section>\n\t\t
\n\t\t\t\t\t
\n\t\t\t\t
\n\t\t\t\t\t\t\t\t\t<\/colgroup>
Title<\/strong><\/td>Author(s)<\/strong><\/td><\/tr>

A Modal Framework for Relational Analogies<\/p><\/td>

Philippe Balbiani, Andreas Herzig, and Emiliano Lorini<\/td><\/tr>
From Logical Proportions to a New Clustering Algorithm<\/td>Myriam Bounhas and Henri Prade<\/td><\/tr>
Temporal Argumentation for Continuous Cyber-Safety Assurance of AI-Enabled Aerospace Systems<\/td>Sofia Almpani\u00a0<\/td><\/tr>
Analogenesis: A Platform for Analogy Games with a Tiny AI Assistant<\/td>Stergos Afantenos, Miguel Couceiro, Emiliano Lorini, Ndeye-Emilie Mbengue<\/td><\/tr>
lxp-SPARQL: Expressing Lexicographic Preferences for Knowledge Graphs<\/td>Antonis Troumpoukis and Angelos Charalambidis<\/td><\/tr>
Reconciling Consistency-Based Diagnosis with Actual-Causality-Based Explanations<\/td>Leopoldo Bertossi<\/td><\/tr>
When AI Influence Helps or Hurts: Guarantees for Ranking-Based Human\u2013AI Aggregation<\/td>Jonas Karge, Roy Ferguson, Daniel Grimaldi, Jonas Haldimann, Ruvarashe Madzime, and Thomas Meyer<\/td><\/tr>
Uncertainty-Aware Discrete Bayesian Classification under Bounded Input Perturbations<\/td>Dongcheng Qiu, Wenlong Chen, Benjamin Quost, Cyprien Gilet, and S\u00e9bastien Destercke<\/td><\/tr>
Prime Implicants Beyond Consistency<\/td>Rim Belaiche, Jean-Francois Condotta, and Yakoub Salhi<\/td><\/tr>
Compositional Boundaries for Density Fusion<\/td>Ratan Bahadur Thapa , Ali Darijani , J\u00fcrgen Beyerer , and Steffen Staab<\/td><\/tr>
Managing Uncertainty in LLM-Generated Procedural Knowledge for Virtual Laboratory Planning<\/td>Polychronis Karpodinis and Dimitris Kalles<\/td><\/tr>
Causal Structure Preservation in Neural Assemblies under Encoding Uncertainty<\/td>Evangelia Kopadi and Dimitris Kalles<\/td><\/tr>
Spatial interpolation under incomplete covariate data set<\/td>Priscillia Labourg, Romain Guillaume, Jeremy Rohmer, and S\u00e9bastien Destercke<\/td><\/tr>
The Curious Case of Exploding DecPOMDPs: Containing the Fire through Policy Counting<\/td>Nazl\u0131 Nur Karabulut and Tanya Braun<\/td><\/tr>
Lifted Model Construction under Approximate Commutativity<\/td>Malte Luttermann, Jan Speller, Tanya Braun, Marcel Gehrke, and Ralf Moller<\/td><\/tr>
Improving Multivariate Time Series Classification with Class-Wise Training and Model Aggregation<\/td>Mouhamadou Mansour LO, Gildas MORVAN, Mathieu ROSSI, Fabrice MORGANTI and David MERCIER<\/td><\/tr>
A Probabilistic Extension of a Logic of Evidence and Truth<\/td>V. Borja-Mac\u00edas, M.E. Coniglio, L. Godo, A. Hern\u00e1ndez-Tello<\/td><\/tr>
Diversified and Perceptible Counterfactual Examples Leveraging Expert Knowledge<\/td>Akram Bensalem, Fahima Djelil, Marie-Jeanne Lesot, and Gr\u00e9gory Smits<\/td><\/tr>
An efficient integer programming formulation for producing robust covering explanations<\/td>Armand Gaudillier, Khaled Belahc\u00e8ne, Wassila Ouerdane, and S\u00e9bastien Destercke<\/td><\/tr>
Approximate Unification in Possibilistic Logic<\/td>Didier Dubois and Henri Prade<\/td><\/tr>
Governed Blind Commitment Planning under Null-Observation Windows<\/td>Irmaan (Mohammad) Mirzanejad, Nadjet Bourdache, and Abdel-Illah Mouaddib<\/td><\/tr>
TrustForest: Typed Semantic Trust Graphs for Uncertainty-Aware Cybersecurity Decision Fusion<\/td>Laurent Bobelin, Sabine Frittella, and Mariam Wehbe<\/td><\/tr>
Probabilistic Relational Argumentation for Dynamic Belief Revision under Uncertainty<\/td>Konstantinos Mponos, Asterios Gkantzounis, Petros Stefaneas, and Panayiotis Frangos<\/td><\/tr>
Incomplete Data and Datalog+\/- Knowledge Bases: X-Raying the Chase<\/td>Andrea Cal\u00ed<\/td><\/tr>
Explainable Analogical Learning of Preferences<\/td>Myriam Bounhas and Henri Prade<\/td><\/tr>
Symmetric sums in numerical proportional analogies<\/td>Miguel Couceiro, Henri Prade and Gilles Richard<\/td><\/tr>
Making Implicit Premises Explicit in Logical Understanding of Enthymemes<\/td>Xuyao Feng and Anthony Hunter<\/td><\/tr>
On Probabilistic Inference Through Parametric Tensor Decomposition in Base Tensor Networks<\/td>Sagad Hamid and Tanya Braun<\/td><\/tr>
Continuous Reasons for Random Forests via Budgeted Ordered Binary Decision Diagrams Compilation<\/td>Daniel Amadori, Emanuele Chini, Pietro Sala<\/td><\/tr><\/tbody><\/table>\t\t\t\t\t\t\t\t<\/div>\n\t\t\t\t\t<\/div>\n\t\t\t\t<\/div>\n\t\t
\n\t\t\t\t\t
\n\t\t\t\t\t<\/div>\n\t\t\t\t<\/div>\n\t\t
\n\t\t\t\t\t
\n\t\t\t\t
\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\"To\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t<\/div>\n\t\t\t\t\t<\/div>\n\t\t\t\t<\/div>\n\t\t
\n\t\t\t\t\t
\n\t\t\t\t\t<\/div>\n\t\t\t\t<\/div>\n\t\t
\n\t\t\t\t\t
\n\t\t
\n\t\t\t\t
\n\t\t\t\t\t

Our Sponsors<\/h2>\t\t\t\t<\/div>\n\t\t\t\t<\/div>\n\t\t\t\t\t<\/div>\n\t\t\t\t<\/div>\n\t\t
\n\t\t\t\t\t
\n\t\t
\n\t\t\t\t
\n\t\t\t\t\t\t\t
\n\t\t\t
<\/div>\n\t\t<\/div>\n\t\t\t\t\t\t<\/div>\n\t\t\t\t<\/div>\n\t\t\t\t\t<\/div>\n\t\t\t\t<\/div>\n\t\t\t\t<\/div>\n\t\t","protected":false},"excerpt":{"rendered":"

Accepted Papers Title Author(s) A Modal Framework for Relational Analogies Philippe Balbiani, Andreas Herzig, and Emiliano Lorini From Logical Proportions to a New Clustering Algorithm Myriam Bounhas and Henri Prade Temporal Argumentation for Continuous Cyber-Safety Assurance of AI-Enabled Aerospace Systems Sofia Almpani\u00a0 Analogenesis: A Platform for Analogy Games with a Tiny AI Assistant Stergos Afantenos, […]<\/p>\n","protected":false},"author":1,"featured_media":0,"parent":0,"menu_order":0,"comment_status":"closed","ping_status":"closed","template":"","meta":{"site-sidebar-layout":"no-sidebar","site-content-layout":"page-builder","ast-site-content-layout":"full-width-container","site-content-style":"unboxed","site-sidebar-style":"unboxed","ast-global-header-display":"","ast-banner-title-visibility":"","ast-main-header-display":"","ast-hfb-above-header-display":"","ast-hfb-below-header-display":"","ast-hfb-mobile-header-display":"","site-post-title":"disabled","ast-breadcrumbs-content":"","ast-featured-img":"disabled","footer-sml-layout":"","ast-disable-related-posts":"","theme-transparent-header-meta":"","adv-header-id-meta":"","stick-header-meta":"","header-above-stick-meta":"","header-main-stick-meta":"","header-below-stick-meta":"","astra-migrate-meta-layouts":"set","ast-page-background-enabled":"default","ast-page-background-meta":{"desktop":{"background-color":"","background-image":"","background-repeat":"repeat","background-position":"center center","background-size":"auto","background-attachment":"scroll","background-type":"","background-media":"","overlay-type":"","overlay-color":"","overlay-opacity":"","overlay-gradient":""},"tablet":{"background-color":"","background-image":"","background-repeat":"repeat","background-position":"center center","background-size":"auto","background-attachment":"scroll","background-type":"","background-media":"","overlay-type":"","overlay-color":"","overlay-opacity":"","overlay-gradient":""},"mobile":{"background-color":"","background-image":"","background-repeat":"repeat","background-position":"center center","background-size":"auto","background-attachment":"scroll","background-type":"","background-media":"","overlay-type":"","overlay-color":"","overlay-opacity":"","overlay-gradient":""}},"ast-content-background-meta":{"desktop":{"background-color":"var(--ast-global-color-5)","background-image":"","background-repeat":"repeat","background-position":"center center","background-size":"auto","background-attachment":"scroll","background-type":"","background-media":"","overlay-type":"","overlay-color":"","overlay-opacity":"","overlay-gradient":""},"tablet":{"background-color":"var(--ast-global-color-5)","background-image":"","background-repeat":"repeat","background-position":"center center","background-size":"auto","background-attachment":"scroll","background-type":"","background-media":"","overlay-type":"","overlay-color":"","overlay-opacity":"","overlay-gradient":""},"mobile":{"background-color":"var(--ast-global-color-5)","background-image":"","background-repeat":"repeat","background-position":"center center","background-size":"auto","background-attachment":"scroll","background-type":"","background-media":"","overlay-type":"","overlay-color":"","overlay-opacity":"","overlay-gradient":""}},"footnotes":""},"class_list":["post-904","page","type-page","status-publish","hentry"],"_links":{"self":[{"href":"https:\/\/sum2026.math.ntua.gr\/index.php?rest_route=\/wp\/v2\/pages\/904","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/sum2026.math.ntua.gr\/index.php?rest_route=\/wp\/v2\/pages"}],"about":[{"href":"https:\/\/sum2026.math.ntua.gr\/index.php?rest_route=\/wp\/v2\/types\/page"}],"author":[{"embeddable":true,"href":"https:\/\/sum2026.math.ntua.gr\/index.php?rest_route=\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/sum2026.math.ntua.gr\/index.php?rest_route=%2Fwp%2Fv2%2Fcomments&post=904"}],"version-history":[{"count":12,"href":"https:\/\/sum2026.math.ntua.gr\/index.php?rest_route=\/wp\/v2\/pages\/904\/revisions"}],"predecessor-version":[{"id":1186,"href":"https:\/\/sum2026.math.ntua.gr\/index.php?rest_route=\/wp\/v2\/pages\/904\/revisions\/1186"}],"wp:attachment":[{"href":"https:\/\/sum2026.math.ntua.gr\/index.php?rest_route=%2Fwp%2Fv2%2Fmedia&parent=904"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}