Papers
Robust Lazy Conflict Detection via Multi-Conflict Extraction and Genetic Diversity Control
Viet-Man Le, Lukas André Feldgrill, Alexander Felfernig
Tractable Weighted First-Order Model Counting with Bounded Treewidth Binary Evidence
Václav Kůla, Qipeng Kuang, Yuyi Wang et al.
Can You Tell the Difference? Contrastive Explanations for ABox Entailments
Patrick Koopmann, Yasir Mahmood, Axel-Cyrille Ngonga Ngomo et al.
Causal, Strategic, and Combined Responsibility Attribution in Situation Calculus Concurrent Game Structures
MohammadHossein Karimian, Shakil M Khan, Yves Lesperance
Enhancing Strategy Logic with Procedural Rationality
Ruiqi Jin, Shuyi Li, Yongmei Liu
Enumerating Minimal Unsatisfiable Cores of LTLf Formulae
Antonio Ielo, Giuseppe Mazzotta, Rafael Peñaloza et al.
Revisiting Conjunctive Query Entailment for S
Yazmín Ibáñez-García, Jean Christoph Jung, Vincent Michielini et al.
Extending Description Logics with Generic Concepts – the Case of Terminologies
Joshua Hirschbrunn, Yevgeny Kazakov
The Correspondence Between Bounded Graph Neural Networks and Fragments of First-Order Logic
Bernardo Cuenca Grau, Eva Feng, Przemysław Andrzej Wałęga
Non-Monotonic S4F Standpoint Logic
Piotr Gorczyca, Hannes Strass
Heterogeneous Graph Neural Networks for Assumption-Based Argumentation
Preesha Gehlot, Anna Rapberger, Fabrizio Russo et al.
Matrix Editing Meets Fair Clustering: Parameterized Algorithms and Complexity
Robert Ganian, Hung P. Hoang, Simon Wietheger
Formal Verification of Diffusion Auctions
Rustam Galimullin, Munyque Mittelmann, Laurent Perrussel
Active Learning of Symbolic Automata over Rational Numbers
Sebastian Hagedorn Gaete, Martín Muñoz, Cristian Riveros et al.
Two Heads Are Better than One: Distilling Large Language Model Features into Small Models with Feature Decomposition and Mixture
Tianhao Fu, Xinxin Xu, Weichen Xu et al.
Computing Syntax Tree-based Minimal Unsatisfiable Cores of LTLf Formulas
Valeria Fionda, Antonio Ielo, Francesco Ricca
Decidable Multi-agent Epistemic Planning: A Situation Calculus Approach
Qihui Feng, Gerhard Lakemeyer
GraphOracle: Efficient Fully-Inductive Knowledge Graph Reasoning via Relation-Dependency Graphs
Enjun Du, Siyi Liu, Yongqi Zhang
Strategic Reasoning over Golog Programs in the Nondeterministic Situation Calculus
Giuseppe De Giacomo, Yves Lesperance, Matteo Mancanelli
A Topological Rewriting of Tarski’s Mereogeometry
Richard Dapoigny
2-ASP(Q) Solving Based on CEGAR
Andrea Cuteri, Giuseppe Mazzotta, Francesco Ricca
Generalizing Analogical Inference from Boolean to Continuous Domains
Francisco Cunha, Yves Lepage, Miguel Couceiro et al.
Symmetry Breaking for Inductive Logic Programming
Andrew Cropper, David M. Cerna, Matti Järvisalo
Efficient Rule Induction by Ignoring Pointless Rules
Andrew Cropper, David M. Cerna
Foundations of Formal Reasoning over Knowledge Bases Combining Symbolic and Sub-Symbolic Knowledge
Gianluca Cima, Marco Console, Laura Papi