Conference Program

Schedule for 2026-07-20

Keynote 09:00 - 10:00
    Coffee Break 10:00 - 10:30
      Opening 10:30 - 11:00
        Block 1 (3 TPLP) 11:00 - 12:30
        • 11:00-11:30 2-ASP(Q) programs with weak constraints: Complexity and efficient implementation
          Andrea Cuteri (University of Calabria), Giuseppe Mazzotta (University of Calabria), Francesco Ricca (University of Calabria)
        • 11:30-12:00 Parametric Modular Answer Set Programs Made Declarative
          Jorge Fandinno (University of Nebraska Omaha), Yuliya Lierler (University of Nebraska Omaha), Torsten Schaub (University of Postdam)
        • 12:00-12:30 flingo - Instilling ASP Expressiveness into Linear Integer Constraints
          Jorge Fandinno (University of Nebraska Omaha), Pedro Cabalar (University of A Coruña), Torsten Schaub (University of Potsdam), Philipp Wanko (University of Potsdam)
        Lunch 12:30 - 14:00
          Block 2 (6 TC) 14:00 - 15:30
          • 14:00-14:15 Representative Sets in Propositional Abduction
            Mohamed Maizia (Linköping University, Jönköping University), Victor Lagerkvist (Linköping University), Johannes Schmidt (Jönköping University), Johannes Fichte (Linköping University)
          • 14:15-14:30 Explaining Weather Bulletins via ILP
            Enrico Santi (University of Udine), Alessandro Dal Palù (University of Parma), Agostino Dovier (University of Udine), Talissa Dreossi (University of Udine), Andrea Formisano (University of Udine)
          • 14:30-14:45 Differentiable Logic Programming to Mitigate Reasoning Shortcuts in Neurosymbolic Systems
            Akihiro Takemura (National Institute of Informatics), Katsumi Inoue (National Institute of Informatics)
          • 14:45-15:00 On the (Intuitionistic) Logic of Next-Token Prediction
            Paul Tarau (University of North Texas)
          • 15:00-15:15 Case study: proving sqrt(2) irrational with LPTP and an LLM
            Fred Mesnard (Université de La Réunion), Etienne Payet (Université de La Réunion), Wim Vanhoof (Université de Namur)
          • 15:15-15:30 Identifying Good Rules for Efficient SAT Encodings of Single-Constant Multiplication Using Machine Learning
            Chufeng Jiang (City University of New York), Neng-Fa Zhou (City University of New York)
          Coffee Break 15:30 - 16:00
            Block 3 (Best DC + 4 RPR) 16:00 - 17:15
            • 16:00-16:15 Best DC contribution
              Alice Tarzariol (University of Klagenfurt), Markus Hecher (CRIL)
            • 16:15-16:30 New Encodings of the (Euclidean) Traveling Salesperson Problem in Constraint Answer Set Programming on Difference Logic
              Alessandro Bertagnon (University of Ferrara), Marco Gavanelli (University of Ferrara)
            • 16:30-16:45 Relational Programming in Rel
              Leonid Libkin (RelationalAI and Univ of Edinburgh), Molham Aref (RelationalAI), Wim Martens (RelationalAI and U Bayreuth), Cristina Sirangelo (U Paris Cite), Domagoj Vrgoc (PUC), Filip Murlak (U Warsaw), David Zhao (RelationalAI), Abdul Zreika (RelationalAI), George Kastrinis (RelationalAI), Allison Rogers (RelationalAI), Nathaniel Nystrom, Paolo Guagliardo (U Edinburgh), Victor Marsault (U Paris Est), Liat Peterfreund (Hebrew U), Mary McGrath (RelationalAI)
            • 16:45-17:00 Contrast Sequential Pattern Mining with Answer Set Solving
              Gioacchino Sterlicchio (Polytechnic University of Bari), Francesca Alessandra Lisi (University of Bari Aldo Moro)
            • 17:00-17:15 ASP-Bench: From Natural Language to Logic Programs
              Stefan Szeider (Technical University of Vienna)
            Reception 18:00 - 20:00

              Schedule for 2026-07-21

              Invited Talk 1 09:00 - 10:00
              • 09:00-10:00 ASP in the Loop: From Structured Prompting to Agentic Logic Programming
                Mario Alviano (University of Calabria, Italy)
              Coffee Break 10:00 - 10:30
                Block 4 (4 TPLP) 10:30 - 12:30
                • 10:30-11:00 Answer-Set-Programming-based Abstractions for Reinforcement Learning
                  Rafael Bankosegger (Siemens AG Österreich, Vienna, Austria), Thomas Eiter (TU Wien, Austria), Johannes Oetsch (Jönköping University, Sweden)
                • 11:00-11:30 Logic-Guided Data Extraction with Answer Set Programming and Large Language Models
                  Mario Alviano (University of Calabria), Lorenzo Grillo (University of Calabria), Nicola Leone (University of Calabria), Fabrizio Lo Scudo (University of Calabria)
                • 11:30-12:00 Accelerating NeurASP with vectorization and caching
                  Alexander Philipp Rader (Imperial College London), Alessandra Russo (Imperial College, London)
                • 12:00-12:30 From Reasoning to Code: GRPO Optimization for Underrepresented Languages
                  Federico Pennino (Università di Bologna), Bianca Raimondi (Università di Bologna), Massimo Rondelli (Università di Bologna), Andrea Gurioli (Università di Bologna), Maurizio Gabbrielli (Università di Bologna)
                Lunch 12:30 - 14:00
                  20 Years Test of Time Award 14:00 - 14:30
                    Block 5 (2 TPLP) 14:30 - 15:30
                    • 14:30-15:00 Equilibrium Semantics and Strong Equivalence for Higher-Order Logic Programs
                      Angelos Charalambidis (Harokopio University of Athens), Giannos Chatziagapis (National and Kapodistrian University of Athens), Babis Kostopoulos (Harokopio University of Athens), Panos Rondogiannis (National and Kapodistrian University of Athens)
                    • 15:00-15:30 From Time to Space: The Impact of Linearity in Higher-Order Datalog
                      Angelos Charalambidis (Harokopio University of Athens), Babis Kostopoulos (Harokopio University of Athens), Panos Rondogiannis (National and Kapodistrian University of Athens)
                    Coffee Break 15:30 - 16:00
                      Block 6 (8 TC) 16:00 - 18:00
                      • 16:00-16:15 GLP: A Grassroots, Multiagent, Concurrent, Logic Programming Language
                        Ehud Shapiro (London School of Economics)
                      • 16:15-16:30 Encoding Event-B Proof Rules in Prolog: An Interactive Sequent Prover for ProB
                        Katharina Engels (University of Düsseldorf), Jan Gruteser (University of Düsseldorf), Michael Leuschel (University of Düsseldorf)
                      • 16:30-16:45 Animation, Verification and Visualisation of Prolog Transition Systems with ProB
                        Jan Gruteser (University of Düsseldorf), Michael Leuschel (University of Düsseldorf), Katharina Engels (University of Düsseldorf), Fabian Vu (University of Düsseldorf)
                      • 16:45-17:00 What Bugs Do Prolog Students Write? An Empirical Taxonomy and Data-Driven Mutation Framework
                        Ricardo Brancas (INESC-ID / Instituto Superior Técnico), Pedro Orvalho (Artificial Intelligence Research Institute, Consejo Superior de Investigaciones Científicas), Carolina Carreira (Carnegie Mellon University / INESC-ID / Instituto Superior Técnico), Vasco Manquinho (INESC-ID / Instituto Superior Técnico), Ruben Martins (Carnegie Mellon University)
                      • 17:00-17:15 Can Automated Feedback Turn Students into Happy Prologians?
                        Ricardo Brancas (INESC-ID / Instituto Superior Técnico), Pedro Orvalho (Artificial Intelligence Research Institute, Consejo Superior de Investigaciones Científicas), Carolina Carreira (Carnegie Mellon University / INESC-ID / Instituto Superior Técnico), Vasco Manquinho (INESC-ID / Instituto Superior Técnico), rubenm@andrew.cmu.edu
                      • 17:15-17:30 chess db: A framework for working with large chess game datasets
                        Nicos Angelopoulos (Imperial College London), Jan Wielemaker (SWI-Prolog Solutions)
                      • 17:30-17:45 Case study: solving P-99 with LPTP and an LLM
                        Fred Mesnard (Université de La Réunion), Thierry Marianne (Université de La Réunion), Etienne Payet (Université de La Réunion), Wim Vanhoof (Université de Namur)
                      • 17:45-18:00 Towards Relating Ciao Assertions and LPTP Theorems
                        Marco Pérez (UPM, IMDEA), Pedro López-García (CSIC, IMDEA), Jose F. Morales (UPM, IMDEA), Manuel V. Hermenegildo (UPM, IMDEA), Fred Mesnard (Université de La Réunion)

                      Schedule for 2026-07-22

                      Keynote 09:00 - 10:00
                        Coffee Break 10:00 - 10:30
                          Block 7 (4 TPLP) 10:30 - 12:30
                          • 10:30-11:00 Reducing Arbitrary Metric Temporal Formulas into Logic Programs under Answer Set Semantics
                            Martin Diéguez (University of Angers), Susana Hahn (University of Potsdam), Torsten Schaub (University of Potsdam), Igor Stéphan (University of Angers)
                          • 11:00-11:30 Meta Programming for Linear-time Temporal Answer Set Programming
                            Susana Hahn (University of Potsdam), Amade Nemes (University of Potsdam), Javier Romero (University of Potsdam), Torsten Schaub (University of Potsdam)
                          • 11:30-12:00 Long-term Power Grid Planning via Answer Set Programming
                            Antonio Ielo (University of Calabria), Francesco Doria (University of Calabria), Sandra Castellanos-Paez (University of Huddersfield), Marco Maratea (University of Calabria), Francesco Percassi (University of Huddersfield), Mauro Vallati (University of Huddersfield)
                          • 12:00-12:30 Event Calculus Meets Hybrid ASP
                            Ondřej Vašíček (Brno University of Technology), Joaquín Arias (Universidad Rey Juan Carlos), Javier Romero Davíla (University of Potsdam), Jan Fiedor (Brno University of Technology and Honeywell International s.r.o.), Gopal Gupta (University of Texas at Dallas), Bohuslav Křena (Brno University of Technology), Jakub Němec (Masaryk University), Tomáš Vojnar (Masaryk University and Brno University of Technology)
                          Lunch 12:30 - 14:00
                            10 Years Test of Time Award 14:00 - 14:30
                              Block 8 (2 TPLP) 14:30 - 15:30
                              • 14:30-15:00 Experimental evaluation of optimal abstract operators for sharing and linearity analysis
                                Gianluca Amato (University of Chieti-Pescara), Francesca Scozzari (University of Chieti-Pescara)
                              • 15:00-15:30 Exploiting Multiple Abstract Call Patterns for Optimizing Run-Time Checks
                                Daniel Jurjo-Rivas (Instituto IMDEA Software & UPM), Daniela Ferreiro (Instituto IMDEA Software & UPM), Marco Ciccalè (Instituto IMDEA Software & UPM), Jose F. Morales (Instituto IMDEA Software & UPM), Pedro López-García (Instituto IMDEA Software & CSIC), Manuel Hermenegildo (Instituto IMDEA Software & UPM)
                              Coffee Break 15:30 - 16:00
                                Block 9 (8 TC) 16:00 - 18:00
                                • 16:00-16:15 Streamliners for Answer Set Programming
                                  Florentina Voboril (Technical University of Vienna), Martin Gebser (University of Klagenfurt), Stefan Szeider (Technical University of Vienna), Alice Tarzariol (University of Klagenfurt)
                                • 16:15-16:30 Declarative Problem Solving in UAM Strategic Deconfliction
                                  Gioacchino Sterlicchio (Polytechnic University of Bari), Angelo Oddi (Institute of Cognitive Sciences and Technologies, National Research Council), Riccardo rasconi (Institute of Cognitive Sciences and Technologies, National Research Council), Francesca Alessandra Lisi (University of Bari "Aldo Moro")
                                • 16:30-16:45 ASPIC: Proof-of-Concept ASP to Picat Transpiler
                                  Cristian Grozea (Fraunhofer), Marius Popescu (University of Bucharest)
                                • 16:45-17:00 EZASP - Facilitating the usage of ASP
                                  Rafael Martins (Universidade Nova de Lisboa - Faculdade de Ciências e Tecnologia), Matthias Knorr (NOVA FCT Lisbon), Ricardo Gonçalves (NOVA University Lisbon)
                                • 17:00-17:15 Walk-In Multi-Stage Patient Flow Scheduling: An ASP Model with DES-Based Evaluation
                                  Ngoc-Mai Pham (Knowledge Technology Laboratory, Faculty of Information Technology, VNU University of Engineering and Technology, Hanoi, Vietnam), Trang-Linh Nguyen (Knowledge Technology Laboratory, Faculty of Information Technology, VNU University of Engineering and Technology, Hanoi, Vietnam), Thi-Hai-Yen Vuong (Knowledge Technology Laboratory, Faculty of Information Technology, VNU University of Engineering and Technology, Hanoi, Vietnam), Ha-Thanh Nguyen (National Institute of Informatics, Tokyo, Japan), Van-Giang Trinh (Faculty of Computer Science and Engineering, Ho Chi Minh City University of Technology (HCMUT), VNU-HCM, Ho Chi Minh City, Vietnam)
                                • 17:15-17:30 Towards a Certifying Grounder
                                  Daimy Van Caudenberg (KU Leuven), Alexander Ek (KU Leuven), Carlos Cantero (KU Leuven), Bart Bogaerts (KU Leuven)
                                • 17:30-17:45 Modeling Deontic Modal Logic in ASP
                                  Gopal Gupta (University of Texas at Dallas), Alexis Tudor (University of Texas at Dallas), Joaquín Arias (Universidad Rey Juan Carlos), Elmer Salazar (University of Texas at Dallas), Abhiramon.Rajasekharan@UTDallas.edu
                                • 17:45-18:00 An Approach to the Abstract Interpretation of Goal-Directed Answer Set Programming
                                  Daniel Jurjo-Rivas (Instituto IMDEA Software & UPM), Joaquín Arias (Universidad Rey Juan Carlos), Gopal Gupta (University of Texas at Dallas), Jose F. Morales (Instituto IMDEA Software & UPM), Pedro López-García (Instituto IMDEA Software & CSIC), Manuel V. Hermenegildo (Instituto IMDEA Software & UPM)
                                Banquet 19:00 - 23:00

                                  Schedule for 2026-07-23

                                  Invited Talk 2 09:00 - 10:00
                                  • 09:00-10:00 From CLP(R) to MiniZinc: There and Back Again
                                    Peter Stuckey (Monash University, Australia)
                                  Coffee Break 10:00 - 10:30
                                    Block 10 (4 TPLP) 10:30 - 12:30
                                    • 10:30-11:00 ProDebug: An Automated Debugging System for Prolog
                                      Ricardo Brancas (INESC-ID / Instituto Superior Técnico), Vasco Manquinho (NESC-ID / Instituto Superior Técnico, Universidade de Lisboa, Portugal), Ruben Martins (Carnegie Mellon University, USA)
                                    • 11:00-11:30 Efficiency of Analysis of Transitive Relations using Query-Driven, Ground-and-Solve, and Fact-Driven Inference
                                      Annie Liu (Stony Brook University), John Idogun (Stony Brook University), Scott D. Stoller (Stony Brook University), Yi Tong (Stony Brook University)
                                    • 11:30-12:00 Diamonds Are Forever: Stabilization Semantics for Unrestricted Aggregation and Recursion in Logica
                                      Evgeny Skvortsov (Google), Yilin Xia (University of Illinois Urbana-Champaign), Shawn Bowers (Gonzaga University), Ojaswa Garg (Google), Bertram Lud\"{a}scher (University of Illinois Urbana-Champaign)
                                    • 12:00-12:30 A Datalog Framework for Conflict-Free Replicated Data Types
                                      Elena Yanakieva (RPTU University Kaiserslautern-Landau), Annette Bieniusa (RPTU University Kaiserslautern-Landau), Stefania Dumbrava (ENSIIE, INRIA Paris, SAMOVAR (Télécom SudParis))
                                    Lunch 12:30 - 14:00
                                      Block 11 (6 TC) 14:00 - 15:30
                                      • 14:00-14:15 Bound-Founded Semantics for Answer Set Programming with Difference Constraints
                                        Pedro Cabalar (University of A Coruña), Jorge Fandinno (University of Nebraska Omaha), Nicolas Ruehling (University of Potsdam), Torsten Schaub (University of Potsdam), Sebastian Schellhorn (University of Potsdam), Philipp Wanko (University of Potsdam)
                                      • 14:15-14:30 hMKNGneg: Hybrid MKNF with Classical Negation
                                        Arun Raveendran Nair Sheela (Université Clermont Auvergne, LIMOS, Thales), Christophe REY (Université Clermont Auvergne, LIMOS, CNRS, France), DE GRANCEY Florence (Thales)
                                      • 14:30-14:45 A New Well-Supported Semantics for Description Logic Programs
                                        Spencer Killen (University of Alberta), Jia-Huai You (University of Alberta)
                                      • 14:45-15:00 chrKanren: Constraint Handling Rules in a Relational Language
                                        Rafaello Sanna (Harvard University), William E. Byrd (University of Alabama at Birmingham), Nada Amin (Harvard University)
                                      • 15:00-15:15 Delayed Constraints in Narrowing for the Logic-Based Analyses of Real-Time Systems
                                        Santiago Escobar (Universitat Politècnica de València), Raúl López-Rueda (Universitat Politècnica de València), Carlos Olarte (Université Sorbonne Paris Nord)
                                      • 15:15-15:30 CaVE: A Constraint Storage Approach to Handling Integrity Constraints
                                        Xiangyu Guo (Arizona State University), Ajay Bansal (Arizona State University)
                                      Coffee Break 15:30 - 16:00
                                        Block 12 (1 RPR + 6 TC) 16:00 - 17:45
                                        • 16:00-16:15 Learning from Answer Sets via Single-Shot Disjunctive ASP Encoding
                                          Roberto Borelli (University of Padova), Agostino Dovier (University of Udine)
                                        • 16:15-16:30 A ProbLog program to infer individual genotypes from familial phenotypes in autosomal, X-linked, and Y-linked Mendelian disorders
                                          Maxime Mahout (Inria Saclay, EPI Lifeware, 91120, Palaiseau, France)
                                        • 16:30-16:45 How Rules Represent Causal Knowledge: Causal Modeling with Probabilistic Logic Programming
                                          Kilian Rückschloß (Universität Tübingen), Felix Weitkämper (German University of Digital Science)
                                        • 16:45-17:00 Logic programming semantics for causal processes
                                          Felix Weitkämper (German University of Digital Science)
                                        • 17:00-17:15 A Counterfactual Cause in Situation Calculus
                                          Daxin Liu (Nanjing University), Vaishak Belle (The University of Edinburgh)
                                        • 17:15-17:30 Explainability Framework for Policy-Aware Autonomous Agents
                                          Heather Merhout (Miami University), Daniela Inclezan (Miami University)
                                        • 17:30-17:45 Explainable Belief Harmonization under Dynamic Epistemic Partitions
                                          Adam Kostka (Warsaw University of Technology), Jarosław A. Chudziak (Warsaw University of Technology)
                                        Closing 17:30 - 17:45