1 Conference program

We received 93 submissions of abstracts across the main track, IJCAI Fast Track, and RPR Track. Out of these, 90 resulted in paper submissions, distributed as follows: ICLP main track regular papers (67 papers), ICLP main track TC papers (twelve papers), IJCAI Fast Track (six papers), and the RPR Track (five papers). The Program Chairs organized the refereeing process that involved the Program Committee and several external reviewers. Each paper was reviewed by at least three referees who provided detailed written evaluations. This yielded submissions short-listed as candidates for rapid communication. The authors of these papers revised their submissions in light of the reviewers’ suggestions, and the papers were subject to a second round of reviewing. Of these candidates papers, 23 were accepted to appear for publication in the TPLP journal as rapid communications. Additionally, one paper from the IJCAI Fast Track was accepted for TPLP publication as well. The 24 papers selected for publication in TPLP are as follows:

• • Felicidad Aguado, Pedro Cabalar, Brais Muñiz Castro, Gilberto Pérez, and Concepcion Vidal. Comparing Non-minimal Semantics for Disjunction in Answer Set Programming

• • Mario Alviano, Wolfgang Faber, and Luis Angel Rodriguez Reiners. ASP Chef Grows Mustache to Look Better

• • Damiano Azzolini, Marco Duca, Stefano Forti, Francesco Gallo, and Antonio Ielo. Application Placement with Constraints Relaxation

• • Damiano Azzolini, Fabrizio Riguzzi, and Theresa Swift. Integrating Belief Domains into Probabilistic Logic Programming

• • Lucia Balažová, Richard Comploi-Taupe, Susana Hahn, Nicolas Rühling, and Gottfried Schenner. Smart Expansion Techniques for ASP-based Interactive Configuration

• • Alexander Beiser, Markus Hecher, and Stefan Woltran. Automated Hybrid Grounding Using Structural and Data-Driven Heuristics (Best Student Paper Award)

• • Rachel Ben-Eliyahu-Zohary. Splitting a Disjunctive Logic Program

• • Alessandro Bertagnon, Marcello Dalpasso, Michele Favalli, and Marco Gavanelli. Fine-grained Timing Analysis of Digital Integrated Circuits in Answer Set Programming

• • Aysu Bogatarkan and Esra Erdem. A General Framework for Dynamic MAPF using Multi-Shot ASP and Tunnels

• • Pierangela Bruno, Carmine Dodaro, Giuseppe Galatà, Marco Maratea, and Marco Mochi. Improving ASP-based ORS Schedules through Machine Learning Predictions

• • Pedro Cabalar, Martín Diéguez, François Olivier, Torsten Schaub, and Igor Stéphan. Towards Constraint Temporal Answer Set Programming

• • Angelos Charalambidis, Babis Kostopoulos, Christos Nomikos, and Panos Rondogiannis. The Power of Negation in Higher-Order Datalog

• • Marco Ciccalè, Daniel Jurjo, Jose F. Morales, Pedro Lopez-Garcia, and Manuel V. Hermenegildo. Hiord $^{\#}$ : An Approach to the Specification and Verification of Higher-Order (C)LP Programs

• • Wlodek Drabent. Systematic Construction of Correct Logic Programs

• • Thomas Eiter, Tobias Geibinger, Nysret Musliu, Johannes Oetsch, and Tobias Kaminski. ASP-FZN: A Translation-based Constraint Answer Set Solver

• • Jorge Fandinno, Christoph Glinzer, Zachary Hansen, Jan Heuer, Yuliya Lierler, Vladimir Lifschitz, Torsten Schaub, and Tobias Stolzmann. ANTHEM: Answer Set Programming and Automated Theorem Proving (Best Paper Award)

• • Müge Fidan and Esra Erdem. Finding Personalized Good-Enough Solutions to Unsatisfiable Stable Roommates Problems

• • Mohimenul Kabir, Supratik Chakraborty, and Kuldeep S Meel. Counting Answer Sets of Disjunctive Answer Set Programs

• • Parth Padalkar and Gopal Gupta. Symbolic Rule Extraction from Attention-Guided Sparse Representations in Vision Transformers

• • Etienne Payet. Non-Termination of Logic Programs Using Patterns

• • Enrico Santi, Fabio Tardivo, Agostino Dovier, and Andrea Formisano. GPU Accelerated Compact-Table Propagation

• • Johannes Schmidt, Mohamed Maizia, Victor Lagerkvist, and Johannes K. Fichte. Complexity of Faceted Explanations in Propositional Abduction

• • Alice Tarzariol, Marco Maratea, and Mauro Vallati. A CASP-based Solution for Traffic Signal Optimisation

• • Baturay Yılmaz and Esra Erdem. Generating Solvable Benchmark Instances for Stable Roommates Problems with Optimization

In addition to the TPLP papers, the Program Committee recommended 40 papers to be accepted as technical communications (36 from the main track and four from the IJCAI Fast Track), to appear at Electronic Proceedings in Theoretical Computer Science (EPTCS), either as full papers or extended abstracts, of which 36 were presented at ICLP 2025 (four were withdrawn). Four papers were accepted for presentation among the submissions to the RPR Track.

The technical program of ICLP 2025 also included four keynote talks:

• • Stefania Costantini. Paso Double between Logic Programming and Epistemic Logics

• • Esra Erdem. Applications of ASP in Robotic Construction

• • Georg Gottlob. Using LLMs for Knowledge Base Construction and Curation

• • Vladimir Lifschitz. Reasoning about Programs and User Guides

2 Conference awards

The conference presented the following awards:

• • Best Paper Award: Jorge Fandinno, Christoph Glinzer, Zachary Hansen, Jan Heuer, Yuliya Lierler, Vladimir Lifschitz, Torsten Schaub, and Tobias Stolzmann. ANTHEM: Answer Set Programming and Automated Theorem Proving

• • Best Student Paper Award: Alexander Beiser, Markus Hecher, and Stefan Woltran. Automated Hybrid Grounding Using Structural and Data-Driven Heuristics.

Furthermore, after an in-depth analysis of citation indices (e.g., SCOPUS, Web of Science, and Google Scholar), two Test-of-Time awards were identified:

• • The John Alan Robinson 20-Year Test-of-Time Award: Sabrina Baselice, Piero A. Bonatti, and Michael Gelfond (2005). Towards an Integration of Answer Set and Constraint Solving. In: Gabbrielli, M., Gupta, G. (eds) ICLP 2005. Lecture Notes in Computer Science, vol. 3668, pp. 52–66. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11562931_7

• • The 10-Year Test-of-Time Award: Martin Gebser, Amelia Harrison, Roland Kaminski, Vladimir Lifschitz, and Torsten Schaub (2015). Abstract Gringo. TPLP 15(4 – 5): 449–463. https://doi.org/10.1017/S1471068415000150

3 Affiliated events

In addition to the main technical program, ICLP 2025 hosted the 21^st Doctoral Consortium on Logic Programming, the 2025 Autumn School on Logic Programming, and the following workshops:

• • 32^nd RCRA Workshop on Experimental Evaluation of Algorithms for Solving Problems with Combinatorial Explosion (RCRA 2025)

• • 18^th Workshop on Answer Set Programming and Other Computing Paradigms (ASPOCP 2025)

• • 12^th Workshop on Probabilistic Logic Programming (PLP 2025)

• • 9^th Workshop on Advances in Argumentation in Artificial Intelligence (AI $^{3}$ 2025)

• • Third Prolog Education Workshop (PEG 2025)

• • Second Annual Workshop on Prolog Improvement Proposals (PIPs)

• • Workshop on Logic Programming and Legal Reasoning (LPLR 2025)

• • 1^st Workshop on Cognitive Architectures for Robotics: LLMs and Logic in Action (CARLA)

ICLP 2025 was co-located with the 35^th International Symposium on Logic-Based Program Synthesis and Transformation (LOPSTR 2025) and the 27^th International Symposium on Principles and Practice of Declarative Programming (PPDP 2025).

4 Conference organization

The organizers of ICLP 2025 are listed below.

General chair:

• • Francesco Ricca, University of Calabria, Italy

Program chairs:

• • Martin Gebser, University of Klagenfurt, Austria

• • Daniela Inclezan, Miami University, USA

Organizing chairs:

• • Carmine Dodaro, University of Calabria, Italy

• • Antonio Ielo, University of Calabria, Italy

• • Giuseppe Mazzotta, University of Calabria, Italy

Workshop chairs:

• • Pierangela Bruno, University of Calabria, Italy

• • Jorge Fandinno, University of Nebraska at Omaha, USA

Recently published research track chairs:

• • Manuel Carro, IMDEA Software Institute and Universidad Politécnica de Madrid, Spain

• • Miroslaw Truszczynski, University of Kentucky, USA

Doctoral consortium chairs:

• • Markus Hecher, CNRS, Artois University, France

• • Alice Tarzariol, University of Klagenfurt, Austria

Autumn school chairs:

• • Sarah Gaggl, TU Dresden, Germany

• • Manuel Hermenegildo, IMDEA Software Institute and Universidad Politécnica de Madrid, Spain

Programming contest chairs:

• • Mario Alviano, University of Calabria, Italy

• • Wolfgang Faber, University of Klagenfurt, Austria

Publicity chairs:

• • Manuel Alejandro Borroto Santana, University of Calabria, Italy

• • Francesco Calimeri, University of Calabria, Italy

Program committee:

• • Salvador Abreu, NOVA-LINCS / University of Evora

• • Mario Alviano, University of Calabria

• • Nicos Angelopoulos, The Pirbright Institute

• • Marcello Balduccini, Saint Joseph’s University

• • Mutsunori Banbara, Nagoya University

• • Elena Bellodi, University of Ferrara

• • Stefano Bistarelli, University of Perugia

• • Bart Bogaerts, KU Leuven

• • Pedro Cabalar, University of Corunna

• • Roberta Calegari, Alma Mater Studiorum–University of Bologna

• • Angelos Charalambidis, Harokopio University

• • Michael Codish, Ben-Gurion University of the Negev

• • Stefania Costantini, University of L’Aquila

• • Alessandro Dal Palù, University of Parma

• • Marina De Vos, University of Bath

• • Marc Denecker, KU Leuven

• • Carmine Dodaro, University of Calabria

• • Thomas Eiter, TU Wien

• • Esra Erdem, Sabanci University

• • Wolfgang Faber, University of Klagenfurt

• • François Fages, INRIA Saclay

• • Jorge Fandinno, University of Nebraska Omaha

• • Johannes K. Fichte, Linköping University

• • Fabio Fioravanti, University of Chieti-Pescara

• • Andrea Formisano, University of Udine

• • Gerhard Friedrich, University of Klagenfurt

• • Sarah Alice Gaggl, TU Dresden

• • Marco Gavanelli, University of Ferrara

• • Laura Giordano, DISIT, University of Eastern Piedmont

• • Ricardo Gonçalves, NOVA University Lisbon

• • Gopal Gupta, The University of Texas at Dallas

• • Carito Guziolowski, Centrale Nantes

• • Markus Hecher, CNRS, Artois University

• • Giovambattista Ianni, University of Calabria

• • Tomi Janhunen, Tampere University

• • Nikos Katzouris, NCSR Demokritos

• • Gabriele Kern-Isberner, TU Dortmund

• • Matthias Knorr, NOVA University Lisbon

• • Isabelle Kuhlmann, University of Hagen

• • Joao Leite, NOVA University Lisbon

• • Michael Leuschel, Heinrich-Heine University of Düsseldorf

• • Vladimir Lifschitz, The University of Texas at Austin

• • Francesca Alessandra Lisi, University of Bari Aldo Moro

• • Yanhong A. Liu, Stony Brook University

• • Marco Maratea, University of Calabria

• • Viviana Mascardi, DIBRIS, University of Genova

• • Jose F. Morales, IMDEA Software Institute and Technical University of Madrid

• • Johannes Oetsch, Jönköping University

• • Simona Perri, University of Calabria

• • Enrico Pontelli, New Mexico State University

• • Fabrizio Riguzzi, University of Ferrara

• • Ricardo Rocha, University of Porto

• • Chiaki Sakama, Wakayama University

• • Zeynep G. Saribatur, TU Wien

• • Torsten Schaub, University of Potsdam

• • Konstantin Schekotihin, University of Klagenfurt

• • Tom Schrijvers, KU Leuven

• • Dietmar Seipel, University of Würzburg

• • Theresa Swift, Johns Hopkins Applied Physics Lab

• • Paul Tarau, University of North Texas

• • Hans Tompits, TU Wien

• • Mirek Truszczynski, University of Kentucky

• • Athénaïs Vaginay, University of Caen Normandy

• • Concepcion Vidal, University of Corunna

• • Germán Vidal, VRAIN, Polytechnic University of Valencia

• • Alicia Villanueva, VRAIN, Polytechnic University of Valencia

• • Johannes P. Wallner, TU Graz

• • Kewen Wang, Griffith University

• • David S. Warren, Stony Brook University

• • Felix Weitkämper, German UDS Potsdam

• • Stefan Woltran, TU Wien

• • Roland Yap, National University of Singapore

• • Jia-Huai You, University of Alberta

• • Zhizheng Zhang, Southeast University

• • Yuanlin Zhang, Texas Tech University

• • Neng-Fa Zhou, CUNY Brooklyn College and Graduate Center

The external reviewers were: