Accepted papers

The recently accepted papers in TPLP are the following:

 

    1. Question Answering with LLMs and Learning from Answer Sets. Manuel Borroto, Katie Gallagher, Antonio Ielo, Irfan Kareem, Francesco Ricca, Alessandra Russo [SPI]
    2. A Category-Theoretic Perspective on Higher-Order Approximation Fixpoint Theory. Samuele Pollaci, Babis Kostopoulos, Marc Denecker, and Bart  Bogaerts [SPI]
    3. Autonomous Agents and Policy Compliance: A Framework for Reasoning About Penalties. Vineel Tummala, Daniela Inclezan [SPI]
    4. Nils Küchenmeister, Alex Ivliev, Markus Krötzsch. [SPI]
    5. Towards Industrial-scale Product Configuration. Joachim Baumeister, Susana Hahn, Konstantin Herud, Max Ostrowski, Jochen Reutelshöfer, Nicolas Rühling, Torsten Schaub, Philipp Wanko.  [SPI]
    6. Applications of Intuitionistic Temporal Logic to Temporal Answer Set Programming
      Pedro Cabalar, Martín Diéguez, David Fernández-Duque, François Laferrière, Torsten Schaub, Igor Stéphan [SPI]
    7. Multi-paradigm Logic Programming in the ErgoAI System
      Michael Kifer, Theresa Swift. [SPI]
    8. Explaining Neural Networks in Preference Learning: a Post-hoc Inductive Logic Programming Approach Daniele Fossemò, Filippo Mignosi, Giuseppe Placidi, Luca Raggioli, Matteo Spezialetti, Fabio Aurelio D’Asaro.
    9. A Monadic Implementation of Functional Logic Programs Michael Hanus,   Kai-Oliver, Prott, Finn  Teegen
    10. SET-LIKE OPERATIONS ON PROPOSITIONAL LOGIC PROGRAMS Christian Antić

SPECIAL ISSUE ON THE 2026 EDITION OF ICLP

  1. F. Pennino, B. Raimondi, M. Rondelli, A. Gurioli, M. Gabbrielli. From Reasoning to Code: GRPO Optimization for Underrepresented Languages 
  2. A. Ielo, F. Doria, S. Castellanos-Paez, M. Maratea, F. Percassi, M. Vallati. Long- term Power Grid Planning via Answer Set Programming
  3. R. Brancas, V. Manquinho, R. Martins. ProDebug: An Automated Debugging Sys- tem for Prolog
  4. J. Fandinno, P. Cabalar, T. Schaub, P. Wanko. flingo – Instilling ASP Expressive- ness into Linear Integer Constraints
  5. J. Fandinno, Y. Lierler, T. Schaub. Parametric Modular Answer Set Programs Made Declarative
  6. G. Amato, F. Scozzari. Experimental evaluation of optimal abstract operators for sharing and linearity analysis
  7. R. Bankosegger, T. Eiter, J. Oetsch. Answer-Set-Programming-based Abstractions for Reinforcement Learning
  8. A. Cuteri, G. Mazzotta, F. Ricca. 2-ASP(Q) programs with weak constraints: Complexity and efficient implementation
  9. E. Yanakieva, A. Bieniusa, S. Dumbrava. A Datalog Framework for Conflict-Free Replicated Data Types
  10. M. Alviano, L. Grillo, N. Leone, F. Lo Scudo. Logic-Guided Data Extraction with Answer Set Programming and Large Language Models
  11. A. Charalambidis, G. Chatziagapis, B. Kostopoulos, P. Rondogiannis. Equilibrium Semantics and Strong Equivalence for Higher-Order Logic Programs
  12. S. Hahn, A. Nemes, J. Romero, T. Schaub. Meta Programming for Linear-time Temporal Answer Set Programming
  13. M. Dieguez, S. Hahn, T. Schaub, I. Stephan. Reducing Arbitrary Metric Temporal Formulas into Logic Programs under Answer Set Semantics
  14. A. Charalambidis, B. Kostopoulos, P. Rondogiannis. From Time to Space: The Impact of Linearity in Higher-Order Datalog
  15. O. Vaší?ek, J. Arias, J. Davíla, J. Fiedor, G. Gupta, B. K?ena, J. N?mec, T. Vojnar. Event Calculus Meets Hybrid ASP
  16. A. Rader, A. Russo. Accelerating NeurASP with vectorization and caching
  17. E. Skvortsov, Y. Xia, S. Bowers, O. Garg, B. Lud ?ascher. Diamonds Are Forever: Stabilization Semantics for Unrestricted Aggregation and Recursion in Logica ì
  18. A. Liu, J. Idogun, S. Stoller, Y. Tong. Efficiency of Analysis of Transitive Relations using Query-Driven, Ground-and-Solve, and Fact-Driven Inference ì
  19. D. Jurjo-Rivas, D. Ferreiro, M. Ciccalè, J. Morales, P. López-García, M. Hermenegildo. Exploiting Multiple Abstract Call Patterns for Optimizing Run-Time Checks