PROGRAM

Days: Friday, 17 July 2026 Saturday, 18 July 2026 Sunday, 19 July 2026 Monday, 20 July 2026 Tuesday, 21 July 2026 Wednesday, 22 July 2026 Thursday, 23 July 2026 Friday, 24 July 2026 Saturday, 25 July 2026 Sunday, 26 July 2026 Monday, 27 July 2026 Tuesday, 28 July 2026 Wednesday, 29 July 2026

Friday, 17 July 2026
09:05-10:00 Invited Speaker: Jean Christoph Jung DL
Location: B1.03
09:05-10:00
Computing Interpolants in Description Logics (abstract) 55 min
Jean Jung1
1 TU Dortmund University
09:15-09:30 Opening NMR
Location: B1.04
09:30-10:30 Leila Amgoud NMR
Location: B1.04
10:00-10:30 Coffee Break DL
Location: B1.03
10:30-11:10 Poster & Demo Announcements DL
Location: B1.03
10:30-10:36
Introducing DeepEL (Extended Abstract) (abstract) 6 min
Alessandro Longato1, Ignacio Huitzil2, Rafael Peñaloza1
1 University of Milano-Bicocca
2 University of Zaragoza
10:36-10:42
Towards Visual Decision Support in Interactive Repair (abstract) 6 min
Christian Alrabbaa1, Franz Baader1, Raimund Dachselt1, Pratistha Kansakar1, Julián Méndez1, Afshin Zanganeh1
1 TU Dresden
10:42-10:48
Optimization and Empirical Evaluation of the CATS ABox Abduction Solver (Extended Abstract) (abstract) 6 min
Janka Boborová1, Jakub Kloc2, Martin Homola1, Júlia Pukancová1
1 Comenius University Bratislava
2 SOFTEC
10:48-10:54
Visualizing HS-Tree-Based Abductive Reasoning: An Educational Tool for Algorithm Exploration (abstract) 6 min
Michaela Tóthová1, Janka Boborová1, Júlia Pukancová1, Jakub Kloc2, Martin Homola1
1 Comenius University Bratislava
2 SOFTEC
10:54-11:00
DeLTA: A Description Logic–based Annotation Schema for Constructing Expressive OWL DL Axioms from Text (abstract) 6 min
Ildar Baimuratov1
1 L3S Research Center, Leibniz University Hannover
10:30-11:00 Coffee Break NMR
Location: B1.04
11:00-12:30 Argumentation 1 NMR
Location: B1.04
11:00-11:30
A many-valued multi-preferential propositional typicality logic and a conditional interpretation for gradual argumentation (Extended Abstract) (abstract) 30 min
Mario Alviano1, Laura Giordano2, Daniele Theseider Dupré2
1 Università della Calabria
2 DISIT, Università del Piemonte Orientale
11:30-12:00
Towards a Characterization of Stable Labelling Realizability - The Problem of Inherent Non-Determinism (abstract) 30 min
Anne-Marie Heine1,2, Ringo Baumann1,2
1 Leipzig University, Scads.AI Dresden
2 Leipzig
12:00-12:30
Tenability: Non-Uniform Defense in Abstract Argumentation (abstract) 30 min
John Spoerl1, Uri Andrews1, Luca San Mauro2
1 University of Wisconsin - Madison
2 University of Bari
11:20-12:00 DL in Practice DL
Session Chair:
Patrick Koopmann
Location: B1.03
11:20-11:40
QBF Reasoning for Concept Satisfiability via an Optimised Reduction From K (abstract) 20 min
Momen Hassan1, Uli Sattler1
1 University of Manchester
11:40-12:00
ontopEO: VKGs over Earth Observation Data (Extended Abstract) (abstract) 20 min
Albulen Pano1, Davide Lanti1, Diego Calvanese1, Piero Campalani2, Alexander Jacob2, Alessandro Mosca3
1 Free University of Bozen-Bolzano
2 Eurac Research
3 ISTC Laboratory for Applied Ontology, National Research Council (CNR
12:00-13:30 Lunch DL
Location: B1.03
12:30-14:00 Lunch NMR
Location: B1.04
13:30-14:50 Taming the Structure. Transitive Closure, Regular Expressions, Tree Descriptions DL
Session Chair:
Sebastian Rudolph
Location: B1.03
13:30-13:50
Revisiting Conjunctive Query Entailment for S (Extended Abstract) (abstract) 20 min
Yazmin Ibanez-Garcia1, Jean Jung2, Vincent Michielini3, Filip Murlak4
1 Cardiff University
2 TU Dortmund University
3 University of Bordeaux
4 University of Warsaw
13:50-14:10
Baby Steps towards Finite Satisfiability for LoopPDL (abstract) 20 min
Bartosz Bednarczyk1, Mikołaj Swoboda2
1 TU Wien & University of Wrocław
2 University of Wrocław
14:10-14:30
Subsumption for FL_⊥reg Is in ExpTime. (abstract) 20 min
Michał Henne1, Barbara Morawska1, Paweł Parys2
1 University of Opole
2 University of Warsaw
14:30-14:50
Tree Description Dependencies (abstract) 20 min
David Toman1, Grant Weddell1
1 University of Waterloo
14:00-15:30 Belief Change NMR
Location: B1.04
14:00-14:30
Understanding Zhang's Partial Expansion (abstract) 30 min
Daniel Grimaldi1, Leandro Riera2, Ricardo O. Rodriguez2
1 University of Cape Town and CAIR
2 Departamento de Computación, Facultad de Ciencias Exactas y Naturales, Universidad de Buenos Aires - Instituto de Investigación en Ciencias de la Computación, UBA-CONICET
14:30-15:00
Constructive Preference Relations: Navigating Undecidability in Rational LTL Contraction (abstract) 30 min
Hannes Gaißer1, Dominik Klumpp2, Jandson S. Ribeiro3
1 University of Tübingen
2 LIX - CNRS - École Polytechnique
3 Cardiff University
15:00-15:30
Truth-tracking by Belief Merge (abstract) 30 min
Nina Gierasimczuk1, Thomas Løye Skafte2
1 Technical University of Denmark
2 University of Luxembourg
15:00-15:20 Poster Announcements DL
Location: B1.03
15:00-15:03
Formal Reasoning with Learned Predicates (Extended Abstract) (abstract) 3 min
Gianluca Cima1, Marco Console1, Laura Papi1
1 Sapienza University of Rome
15:03-15:06
Preferential Temporal Description Logics with Typicality, Weighted KBs and Preference Combination (abstract) 3 min
Mario Alviano1, Laura Giordano2, Daniele Theseider Dupré2
1 Università della Calabria, Italy
2 DISIT, Università del Piemonte Orientale
15:06-15:09
OxidOWL: Development and Maintenance of OWL DL Reasoners with Coding Agents (abstract) 3 min
Riccardo Sieve1
1 University of Oslo
15:09-15:12
BoxLitE: A Faithful Knowledge Base Embedding Based on Convex Optimization (Extended Abstract) (abstract) 3 min
Bruno F. Lourenço1, Hesham Morgan2, Ana Ozaki3, Aleksandar Pavlovic4, Emanuel Sallinger2
1 Institute of Statistical Mathematics
2 TU Wien
3 University of Oslo
4 University of Applied Sciences Campus Vienna
15:12-15:15
Modeling Bias in Machine Learning with Description Logics and Epistemic Modalities (abstract) 3 min
Mattia Petrolo1, Ekaterina Kubyshkina2
1 University of Lisbon
2 University of Milan
15:20-16:00 Learning DL
Session Chair:
Rafael Peñaloza
Location: B1.03
15:20-15:40
Reaching for the stars in EL concept learning (abstract) 20 min
Bente Gortworst1, Cem Okulmus2, Magdalena Ortiz1, Anni-Yasmin Turhan2
1 TU Vienna
2 Paderborn University
15:40-16:00
Finite Characterizations of ℰℒ Ontologies and Concept Inclusions (abstract) 20 min
Maurice Funk1, Simon Hosemann1, Carsten Lutz1
1 Leipzig University
15:30-16:00 Coffee Break NMR
Location: B1.04
16:00-17:30 NMR & Explainable AI NMR
Location: B1.04
16:00-16:30
Toward Defeasible Machine Learning: When Learned Rule Sets Become Defeasible Theories (abstract) 30 min
Ruvarashe Madzime1, Thomas Meyer2
1 University of the Western Cape and CAIR
2 University of Cape Town and CAIR
16:30-17:00
A Resource-Aware Structural Causal Semantics for Feasibility Analysis of Counterfactuals (abstract) 30 min
Pinaki Chakraborty1, David Pym2, Tristan Caulfield1
1 University College London
2 University College London and Institute of Philosophy, University of London
17:00-17:30
Learning Symbolic Temporal Advice for Guiding Reinforcement Learning (abstract) 30 min
Paulius Skaisgiris1, Celeste Veronese2, Mantas Šimkus1, Daniele Meli2
1 TU Wien
2 University of Verona
16:00-16:30 Coffee Break DL
Location: B1.03
16:30-17:30 Poster & Demo Session DL
Location: B1.03
17:00-17:30 Closing NMR
Location: B1.04
Saturday, 18 July 2026
08:20-10:30 Opening + DC Session 1 ICLP-DC-SS
Session Chair:
Alice Tarzariol
Location: B2.02
08:20-08:30
Opening (abstract) 10 min
Alice Tarzariol1
1 University of Klagenfurt
08:30-08:50
Enhancing the Extensibility of Answer Set Programming via Meta-Programming (abstract) 20 min
Amadé Nemes1
1 University of Potsdam
08:50-09:10
Advancing Knowledge-Based Reasoning for Automated Workflow Composition (abstract) 20 min
Nikolas Bertrand1
1 University of Potsdam
09:10-09:30
Formal Methods for Answer Set Programming (abstract) 20 min
Jan Heuer1
1 University of Potsdam
09:30-09:50
Defeasible Normative Reasoning: a Deontic Equilibrium Logic approach (abstract) 20 min
Ovidio Manteiga1
1 University of A Coruña
09:50-10:10
A Three-Layer Reduction Framework for Scalable Verification of Maritime Vessel Systems under Uncertainty (abstract) 20 min
Hiba Ben Lahbib1, M. Taha Bennani2, Jüri Vain1
1 Tallinn University of Technology
2 University of Tunis El Manar
10:10-10:30
Differentiable Answer Set Programming for Neurosymbolic AI (abstract) 20 min
Sota Moriyama1
1 The Graduate University of Advanced Studies, SOKENDAI and NII
08:45-10:30 Opening + Neurosymbolic and Metaprogramming ASPOCP
Session Chair:
Brais Muñiz
Location: C2.01
08:45-08:50
Opening (abstract) 5 min
Brais Muñiz1
1 University of Coruña
08:50-09:15
Neural Decision-Propagation for Answer Set Programming (Extended Abstract) (abstract) 25 min
Thomas Eiter1, Katsumi Inoue2, Sota Moriyama3
1 TU Wien
2 NII
3 The Graduate University of Advanced Studies, SOKENDAI and NII
09:15-09:40
Instance-Aware AMOSUM Propagator Selection in ASP (abstract) 25 min
Mario Alviano1, Carmine Dodaro1, Thomas Eiter2, Salvatore Fiorentino1, Tobias Geibinger2, Megan Macrì1
1 University of Calabria
2 TU Wien
09:40-10:05
aspen-tree: A system for non-ground meta-programming in ASP (Preliminary Report) (abstract) 25 min
Amade Nemes1, Torsten Schaub1
1 University of Potsdam, Germany
10:05-10:29
Implementing Operator-Based Semantics for Normal Logic Programs using Meta-Programming in ASP (abstract) 24 min
Jesse Heyninck1, Spencer Killen2, Jeroen Spaans1
1 Open Universiteit
2 University of Alberta
08:45-09:00 Opening OVERLAY
Session Chair:
Nicola Gigante
Location: C1.04
08:50-09:00 Introduction, Frédéric Blanqui and Olivier Hermant TGD
Location: C6.08
09:00-09:30 On the Normative Power of Logical Frameworks, Frank Pfenning TGD
Location: C6.08
09:00-10:30 Ugo Dal Lago (Invited Tutorial, joint with ITRS) TLLA
Session Chair:
Olimpieri
Location: C5.07
09:00-10:30
Quantitative Typing Across Effects, Machines, and Notions of Cost (abstract) 90 min
Ugo Dal Lago1
1 Università di Bologna
09:00-10:10 Opening and Invited Talk SKILLED-LLMs
Session Chair:
Nourhan Ehab
Location: B2.01
09:00-10:00 Invited Talk: Magdalena Ortiz ST4DM
Session Chair:
Davide Lanti
Location: C5.05
09:00-10:00
Is ontology-mediated graph querying finally within reach? (abstract) 60 min
Magdalena Ortiz1
1 Freie Universitä Wien
09:00-10:00 Planning OVERLAY
Session Chair:
Nicola Gigante
Location: C1.04
09:00-09:30
Proper Open World Automated Planning (abstract) 30 min
Mikhail Soutchanski1
1 Toronto Metropolitan University
09:30-10:00
A Practical and Didactic Epistemic Planning Toolkit (abstract) 30 min
Alessandro Burigana1
1 Free University of Bozen-Bolzano
09:00-10:00 Tommie Meyer NMR
Location: B1.04
09:00-10:00 Invited Talk 1 MSFP
Location: C5.01
09:00-10:00
Equational theories for scoped effects (abstract) 60 min
Cristina Matache1
1 University of Birmingham
09:00-10:00 The ASP Language ELASP
Location: C3.02
09:00-10:30 Session 1 LSFA
Location: C4.07
09:00-10:00
Linearisation of the Lambda-Calculus: A Road Trip (abstract) 60 min
Sandra Alves1
1 Universidade do Porto
10:00-10:30
A Typing System for the Linear Lambda-Calculus in de Bruijn Notation (abstract) 30 min
Philippe de Groote1, Vincent Tourneur2
1 Inria
2 Université de Lorraine
09:00-10:00 Invited Speaker: Tommie Meyer DL
Session Chair:
Nico Potyka
Location: B1.03
09:00-10:00
Defeasible Reasoning (abstract) 60 min
Thomas Meyer1
1 University of Cape Town and CAIR
09:00-10:30 Introduction DPSOLVE
Location: C3.01
09:00-09:15
Introduction to Domain Independent Dynamic Programming Algorithms (abstract) 15 min
Christopher Beck1
1 University of Toronto
09:15-09:30
Decision Diagram-Based Branch-and-Bound Solvers (abstract) 15 min
Willem-Jan van Hoeve1
1 University of Toronto
09:00-10:00 Session 1 IFIP16
Location: C1.01
09:00-10:00
Finding small steps for approaching hard questions, in work on the process semantics of regular expressions (abstract) 60 min
Clemens Grabmayer1
1 Gran Sasso Science Institute
09:00-10:40 Saturday morning 1 LCC
Session Chair:
Isabel Oitavem
Location: C4.06
09:00-10:00
The Switching Lemma shows what the Switching Lemma cannot prove: The natural proofs barrier in constant-depth-circuits (abstract) 60 min
Bruno Loff1
1 Lisbon
10:00-10:40
Recurrent Arithmetic Circuits (abstract) 40 min
Vivian Holzapfel1
1 Leibniz Universität Hannover
09:00-10:30 Joint Invited Talk with TLLA ITRS
Location: C6.02
09:00-09:15 Welcome CPSATDP
Location: C1.03
09:00-10:20 Paper session 1 EULP
Location: C2.02
09:00-09:10
Opening (abstract) 10 min
Mario Alviano1, Susana Hahn2, Luis Angel Rodriquez Reiners1, Torsten Schaub3, Simon Vandevelde4
1 University of Calabria
2 Potassco Solutions
3 University of Potsdam
4 KU Leuven
09:10-09:40
mkdoclingo: A system for automatic documentation of ASP programs (abstract) 30 min
Susana Hahn1, Dominik Gerndt1
1 Potassco Solutions
09:40-10:10
Defining Routines in DaaS: Visual Logic Programming for Mesh Network Policies - Preliminary Report (abstract) 30 min
Lorenzo Grillo1, Pierpaolo Sestito1
1 University of Calabria
09:00-10:00 Opening and Keynote FMQC
Session Chair:
Alfons Laarman
Location: C5.08
09:00-10:00
From quantum in pictures to interpretable and scalable quantum AI (abstract) 60 min
Bob Coecke1
1 Oxford University
09:00-10:00 Keynote talk - Corina Cirstea GALOP
Location: C5.06
09:00-10:00
From Traces to Strategies, via Coalgebra (abstract) 60 min
Corina Cirstea1
1 University of Southampton
09:15-10:00 Invited Talk CPSATDP
Location: C1.03
09:15-10:00 Part 1 - Introduction: Definite Descriptions and Free Logic Semantics DefDesKR
Session Chair:
Andrzej Indrzejczak
Location: C2.05
09:15-09:30 Opening RCRA
Location: C4.02
09:15-09:30 Opening remarks SmP
09:30-10:30 Invited talk SmP
09:30-10:30
TBA (abstract) 60 min
Ichiro Hasuo1
1 National Institute of Informatics
09:30-10:00 Modeling and Proof Methods in Set Theory using Deduction Modulo Theory, Catherine Dubois and David Delahaye TGD
Location: C6.08
09:30-10:30 Constraint Satisfaction, SAT e Heuristics RCRA
Location: C4.02
09:30-09:50
Symmetry Breaking Constraints for SAT Solving (abstract) 20 min
Martin Struk1, Mikoláš Janota2
1 Charles University, Faculty of Mathematics and Physics
2 Czech Technical University in Prague
09:50-10:10
Components of information flow underlying heuristic decisions in constraint satisfaction search (abstract) 20 min
Richard Wallace1
1 University College Cork
10:10-10:30
Neural Network Based Analysis of Amenability of CSPs to Different Heuristic Actions (abstract) 20 min
Richard Wallace1
1 University College Cork
09:30-10:30 Invited talk 1 ML4SP
Location: C4.08
10:00-10:30 Coffee Break ELASP
Location: C3.02
10:00-11:00 Coffee Break SteamingNeSy
Location: C4.05
10:00-11:00 Coffee Break MoST
Location: C2.05
10:00-11:00 Coffee Break ST4DM
Location: C5.05
10:00-10:30 Conservativity Made Easy, Thiago Felicissimo TGD
Location: C6.08
10:00-10:45 Coffee Break MSFP
Location: C5.01
10:00-11:00 Coffee Break ML4SP
Location: C4.08
10:00-10:30 Coffee Break NMR
Location: B1.04
10:00-10:30 Coffee Break OVERLAY
Location: C1.04
10:00-11:00 Coffee Break PC
Location: C5.09
10:00-11:00 Coffee Break DefDesKR
Location: C2.05
10:00-10:30 Coffee Break DL
Location: B1.03
10:00-11:00 Coffee Break CARLA
Location: C4.01
10:00-11:00 Coffee Break CPSATDP
Location: C1.03
10:00-10:40 Coffee Break GALOP
Location: C5.06
10:00-10:30 Coffee Break FMQC
Location: C5.08
10:00-10:30 Coffee Break IFIP16
Location: C1.01
10:10-11:00 Coffee Break EULP
Location: C2.02
10:10-10:35 Coffee Break SKILLED-LLMs
Location: B2.01
10:15-11:00 Part 2 - Definite Descriptions in Description Logics DefDesKR
Session Chair:
Przemysław Wałęga
Location: C2.05
10:30-11:50 Conflicts and Exceptions DL
Session Chair:
Ivan Varzinczak
Location: B1.03
10:30-10:50
Deontic Defeasible Description Logic (abstract) 20 min
Giovanni Casini1, Rafael Penaloza Nyssen2, Thomas Meyer3, Leendert van der Torre4
1 ISTI - CNR
2 University of Milano-Bicocca
3 University of Cape Town and CAIR
4 University of Luxembourg
10:50-11:10
Neighbourhood Description Logics for Multiperspective Reasoning (abstract) 20 min
Tiziano Dalmonte1, Andrea Mazzullo1, Rafael Peñaloza2
1 Free University of Bozen-Bolzano
2 University of Milano-Bicocca
11:10-11:30
Towards Putting Perspective into OWL (Extended Abstract) (abstract) 20 min
Lucía Gómez Álvarez1, Sebastian Rudolph2
1 Inria
2 TU Dresden
11:30-11:50
Using ASP(Q) to Handle Inconsistent Prioritized Data (Extended Abstract) (abstract) 20 min
Meghyn Bienvenu1, Camille Bourgaux2, Robin Jean1, Giuseppe Mazzotta3
1 CNRS & University of Bordeaux
2 CNRS & DI ENS
3 University of Calabria
10:30-11:00 Coffee Break ASPOCP
Location: C2.01
10:30-12:00 Representation of Quantum Information FMQC
Session Chair:
Ondřej Lengál
Location: C5.08
10:30-11:00
Minimal-size decision diagrams for quantum-circuit simulation (abstract) 30 min
Tim Coopmans1
1 Delft University
11:00-11:20
From Tensor Networks to Tractable Circuits, and Back (abstract) 20 min
Arend-Jan Quist1, Marc Farreras, Alexis de Colnet1, John van de Wetering2, Alfons Laarman1
1 Leiden University
2 University of Amsterdam
11:20-11:40
GPU-Accelerated Quantum Simulation of Stabilizer Circuits (abstract) 20 min
Dimitrios Thanos1, Muhammad Mahmoud1, Alfons Laarman1
1 Leiden University
11:40-12:00
A Complete Equational Presentation of Qudit Circuits via Polycontrolled PROPs (abstract) 20 min
Colin Blake1
1 INRIA, LORIA, Université de Lorraine
10:30-12:15 Session 2 IFIP16
Location: C1.01
10:30-11:30
All-Path Reachability Analysis for Runtime-Error Verification (abstract) 60 min
Misaki Kojima1
1 Nagoya University
11:30-12:15
Closures versus Freeness (abstract) 45 min
Vincent van Oostrom1
1 University of Sussex
10:30-11:00 Coffee Break 1 DPSOLVE
10:30-11:00 Coffee Break ICLP-DC-SS
Location: B2.02
10:30-11:00 Coffee Break ITRS
Location: C6.02
10:30-11:00 Coffee Break RCRA
Location: C4.02
10:30-11:00 Coffee Break TGD
Location: C6.08
10:30-11:00 Coffee break SmP
10:30-11:00 Coffee Break TLLA
Location: C5.07
10:30-12:00 Multi-agent systems OVERLAY
Session Chair:
Nicola Gigante
Location: C1.04
10:30-11:00
A Formal Framework for Strategic Reasoning in Agentic Business Process Management (abstract) 30 min
Giuseppe De Giacomo1, Timotheus Kampik2,4, Lukas Kirchdorfer2,5, Marco Montali3, Christoph Weinhuber1
1 University of Oxford
2 SAP
3 Free University of Bozen-Bolzano
4 Umeå University
5 University of Mannheim
11:00-11:30
Bridging Formal Strategic Reasoning and Video Games (abstract) 30 min
Salvatore Romano1
1 University of Naples "Federico II"
11:30-12:00
A Formal Argumentation Protocol in the Event Calculus (abstract) 30 min
Periklis Mantenoglou1, Alexander Artikis2
1 Örebro University, Sweden
2 University of Piraeus & NCSR Demokritos, Greece
10:30-12:00 DL & NMR NMR
Location: B1.04
10:30-11:00
On Combining Abstract Argumentation Frameworks with Knowledge Bases (abstract) 30 min
Gianvincenzo Alfano1, Sergio Greco1, Tariq Mahmood1, Cristian Molinaro1, Francesco Parisi1, Irina Trubitsyna1
1 University of Calabria
11:00-11:30
Semantics for Description Logics via Assumption-Based Argumentation: Preliminary Results (abstract) 30 min
Giovanni Buraglio1, Federica Di Stefano1, Mantas Simkus1
1 TU Wien
11:30-12:00
Postulates here, postulates everywhere: a discussion of contraction postulates (abstract) 30 min
Anne C. Rocha1, Renata Wassermann2
1 University of São Paulo
2 University of Sao Paulo
10:30-11:00 Coffee Break LSFA
Location: C4.07
10:30-11:00 Solving Problems with ASP ELASP
Location: C3.02
10:35-12:35 Session 1: Structured Knowledge Meets Language Models SKILLED-LLMs
Session Chair:
Elena Umili
Location: B2.01
10:35-10:55
A Semantic Knowledge Graph Construction Pipeline for Vehicle Intention Prediction in nuScenes (abstract) 20 min
Khaled Nowara1, Mohamed Manzour2, Catherine Elias1
1 German University in Cairo
2 Computer Engineering Department, University of Alcalá, Madrid, Spain
10:55-11:15
Automatic Chain of Concepts: Conceptual Prompting for LLMs by Constructing Concept Trees (abstract) 20 min
Hurile Borjigin1, Nishtha N. Vaidya1, Thomas A. Runkler1, Veronika Haderlein-Høgberg2
1 Technical University of Munich, Siemens AG, Munich, Germany
2 Siemens AG, Munich, Germany
11:15-11:35
Identifying Semantic Gaps between Legal Case Descriptions and Logical Fact Formulas Using LLMs: Definition and Preliminary Evaluation (abstract) 20 min
Wachara Funwacharakorn1, May Myo Zin1, Ken Satoh1
1 Center for Juris-Informatics, ROIS-DS, Tokyo, Japan
11:35-11:55
When AI Should Refuse to Decide: Formal Irresolution and the Ethics of Legal Indeterminacy in LLM-Based Reasoning for Biodiversity Law (abstract) 20 min
Rohan Nanda1, Henrique Marcos2, Júlia Schütz Veiga3
1 Law & Tech Lab, Department of Advanced Computing Sciences, Maastricht University
2 Faculty of Law, Maastricht University
3 Ocean Voices Programme, University of Edinburgh
11:55-12:15
On the Reliability of LLM Orchestration Under Horizontal Knowledge Partitioning (abstract) 20 min
Mayar Abdelwahab1, Nourhan Ehab1, Mervat Abuelkheir1
1 German University in Cairo
12:15-12:35
KGP-QG: Multi-hop Reasoning with Knowledge Graphs in LLMs (abstract) 20 min
Al Hasib Mahamud1, Yllias Chali1
1 University of Lethbridge
10:40-11:10 Coffee Break LCC
Location: C4.06
10:40-12:20 Contributed Talks - Session 1 GALOP
Location: C5.06
10:40-11:15
Contextual MetaML: Syntax and Full Abstraction (abstract) 35 min
Haoxuan Yin1, Andrzej Murawski1, Luke Ong2
1 University of Oxford
2 Nanyang Technological University
11:15-11:50
An operational approach to blindness for ground references in the pi-calculus (abstract) 35 min
Iwan Quémerais1
1 ENS de Lyon, University of Bologna
11:50-12:20
The Game Semantics of Reachability Types (abstract) 30 min
Benedict Bunting1, Andrzej Murawski2
1 Corpus Christi College, Cambridge
2 University of Oxford
10:45-12:00 Contributed Talks 1 MSFP
Location: C5.01
10:45-11:10
Effects with Variable Binding (abstract) 25 min
Jaro Reinders1, Casper Bach2, Benedikt Ahrens1, Nicolas Wu3
1 Delft University of Technology
2 University of Southern Denmark
3 Imperial College London
11:10-11:35
Free Semiarrows (abstract) 25 min
Alexandre Garcia de Oliveira1,2
1 Fatec Rubens Lara
2 Obsidian Systems
11:35-12:00
A Type Theory for Comprehension Categories (abstract) 25 min
Niyousha Najmaei1, Niels van der Weide2, Benedikt Ahrens3, Paige Randall North4
1 École Polytechnique
2 Radboud University
3 Delft University of Technology
4 Utrecht University
11:00-11:40 Invited Talk 1 PC
Session Chair:
Olaf Beyersdorff
Location: C5.09
11:00-11:40
Limits of Lifting (abstract) 40 min
Jan Pich1
1 University of Oxford
11:00-12:00 Session 1: Temporal and Ontological Foundations for Semantic Data Management ST4DM
Session Chair:
Davide Lanti
Location: C5.05
11:00-11:30
Towards Monitoring of Patients with Bipolar Disorder (abstract) 30 min
Kajsa Pedersen1, Greta Adamo2, Roman Kontchakov3, Davide Lanti4, Andrey Rivkin1
1 Technical University of Denmark
2 Free University of Bozen-Bolzano
3 Birbeck University of London, UK
4 Free Unviersity of Bozen-Bolzano
11:30-12:00
Temporal Path Queries: Challenges and Open Questions (abstract) 30 min
Julien Corman1, Ognjen Savkovic1
1 Free University of Bozen-Bolzano
11:00-12:00 AI Reasoning, Explainability e LLMs RCRA
Location: C4.02
11:00-11:20
Efficient Interpretability Reasoning for Decision Trees (abstract) 20 min
Joao Marques-Silva1, Alexey Ignatiev2
1 ICREA & Univ. Lleida
2 Monash University
11:20-11:40
Contextualizing Large Language Models Alongside Specialized Information Extraction and Question Answering Systems (abstract) 20 min
Joshua Gryzen1, Yuliya Lierler1, Francisco Ramirez1
1 University of Nebraska Omaha
11:40-12:00
Declarative Communication Filters for Controlled LLM Integration in Logic-Based Multi-Agent Systems (abstract) 20 min
Lorenzo De Lauretis1, Stefania Costantini1
1 Univaq
11:00-12:40 S1.2 TLLA
Session Chair:
Olimpieri
Location: C5.07
11:00-11:25
Classical Linear Logic is not Conservative over System F (abstract) 25 min
Olivier Laurent1
1 CNRS - ENS Lyon
11:25-11:50
Confluence Modulo and Undecidability of Cut-Elimination (abstract) 25 min
Rémi Di Guardia1
1 Université Paris Cité, Inria, CNRS, IRIF, F-75013, Paris, France
11:50-12:15
On the role of connectivity in Linear Logic proofs (abstract) 25 min
Raffaele Di Donna1, Lorenzo Tortora de Falco2
1 Université Paris Cité (IRIF), Università Roma Tre
2 Università Roma Tre
12:15-12:40
A story of tensorial logic with two negations (abstract) 25 min
Paul-André Melliès1
1 CNRS, Université Paris Cité, INRIA
11:00-12:30 Contributed talk SmP
11:00-11:30
TBA (abstract) 30 min
Yoàv Montacute1
1 National Institute of Informatics
11:30-12:00
Monads Distributive Law and Markov Decision Processes (abstract) 30 min
Yun-Chen Tsai1
1 National Institute of Informatics
12:00-12:30
A Categorical Perspective on Kripke Models and Dynamic Epistemic Logic (abstract) 30 min
Haitian Wang1
1 ILLC
11:00-11:30 From Ecumenical Proof Theory to Automation, Elaine Pimentel and Luiz Carlos Pereira TGD
Location: C6.08
11:00-12:00 Beyond NP: ASP with Quantifiers ELASP
Location: C3.02
11:00-12:40 Paper talks 1 ML4SP
Location: C4.08
11:00-11:20
An LLM-based Recommendation System for PVS (abstract) 20 min
Nikson Bernardes Fernandes Ferreira1, Mariano Miguel Moscato2, Mauricio Ayala-Rincon1
1 Universidade de Brasília
2 Analytical Mechanics Associates Inc.
11:20-11:40
Neural Local Search Enhanced with Knowledge Compilation (abstract) 20 min
Alexandre Dubray1, Hélène Verhaeghe2, Quentin Cappart3, Siegfried Nijssen1
1 KU Leuven
2 UCLouvain
3 UC Louvain and Polytechnique Montréal
11:40-12:00
Algorithm Selection with Zero Domain Knowledge via Text Embeddings (abstract) 20 min
Stefan Szeider1
1 TU Wien
12:00-12:20
Do LLMs Scale on Inductive Proofs? A Controlled Study of Elementary Arithmetical Proofs (abstract) 20 min
Risako Ando1, Koji Mineshima1, Mitsuhiro Okada1
1 Keio University
12:20-12:40
Learning Better Representations From Less Data For Propositional Satisfiability (abstract) 20 min
Mohamed Ghanem1, Frederik Schmitt1, Julian Siber1, Bernd Finkbeiner1
1 CISPA Helmholtz Center for Information Security
11:00-12:30 Session 2 LSFA
Location: C4.07
11:00-11:30
Linearising Explicit Substitutions using Intersection Types (abstract) 30 min
Ana Jorge Almeida1, Sandra Alves1, Mário Florido1
1 Universidade do Porto
11:30-12:00
Phase Semantic Cut-elimination for Intuitionistic Linear Logic with Least and Greatest Fixed Points (abstract) 30 min
Jun Suzuki1, Charles Grellois2, Katsuhiko Sano1
1 Hokkaido University
2 University of Sheffield
12:00-12:30
A Logical 3-valued Semantics for Non-Deterministic Choice (abstract) 30 min
Alessandro Aldini1, Pierluigi Graziani1, Claudio Antares Mezzina1, Gandolfo Vergottini1
1 University of Urbino Carlo Bo
11:00-12:30 Contributed talks I SmP
11:00-11:30
Monads Distributive Law and Markov Decision Processes (abstract) 30 min
Yun-Chen Tsai1
1 National Institute of Informatics
11:30-12:00
A Categorical Perspective on Kripke Models and Dynamic Epistemic Logic (abstract) 30 min
Haitian Wang1
1 ILLC
11:00-12:00 Invited talk EULP
Location: C2.02
11:00-12:00
EasyASP (abstract) 60 min
Javier Romero Davila1
1 University of Potsdam
11:00-12:30 Session 1 CPSATDP
Location: C1.03
11:00-12:00 Session 1 ITRS
11:00-11:30
(Re)Painting (and Polarizing) Arrow Types (abstract) 30 min
Adrienne Lancelot1, Giulio Manzonetto2, Guy McCusker3, Gabriele Vanoni2
1 University of Bologna
2 IRIF, Université Paris Cité
3 University of Bath
11:30-12:00
Higher-order Matching via Intersection Type Inhabitation in Bounded Dimension (abstract) 30 min
Andrej Dudenhefner1, Aleksy Schubert2
1 TU Dortmund University
2 University of Warsaw
11:00-12:00 SS Invited Talk 1 ICLP-DC-SS
Location: B2.02
11:00-12:40 Talks 1 DPSOLVE
Location: C3.01
11:00-11:25
Neural Self-Improvement Learning for Domain-Independent Dynamic Programming (abstract) 25 min
Minori Narita1, Eldan Cohen1, Chris Beck1
1 University of Toronto
11:25-11:50
Domain-Independent Dynamic Programming with Constraint Propagation (abstract) 25 min
Imko Marijnissen1, J. Christopher Beck2, Emir Demirovic1, Ryo Kuroiwa3
1 Delft
2 University of Toronto
3 Unkown
11:50-12:15
Search Strategies for CODD (abstract) 25 min
Eli Shattuck1, Laurent Michel1, Willem-Jan van Hoeve2
1 School of Computing, University of Connecticut, Storrs, CT, USA
2 Tepper School of Business, Carnegie Mellon University, Pittsburgh, PA, USA
12:15-12:40
Dynamic Programming for Optimal Decision Trees (abstract) 25 min
Koos van der Linden1
1 Delft University
11:00-12:40 Planning and Temporal Reasoning ASPOCP
Session Chair:
Djordje Markovic
Location: C2.01
11:00-11:25
Towards ASP-based Composition of Scientific Workflows (abstract) 25 min
Nikolas Bertrand1, Charlotte Grunert1, Mario Frank1, Anna-Lena Lamprecht1
1 University of Potsdam
11:25-11:50
Declarative Spatial Reasoning in Temporal Here-and-There with Constraints (abstract) 25 min
François Olivier1, Martin Dieguez2, Carl Schultz3
1 Sorbonne University
2 University of Angers
3 University of Aarhus
11:50-12:15
Flaspland: A Test-bed for Routing and Scheduling in Answer Set Programming (Preliminary Report) (abstract) 25 min
Ryan Murphy1, Amade Nemes1, Javier Romero1, Torsten Schaub1
1 University of Potsdam, Germany
12:15-12:39
Dynamic Equilibrium Logic for Action and Change: Abridged report (abstract) 24 min
Arvid Becker1, Martin Dieguez2, Susana Hahn1, Torsten Schaub1
1 University of Potsdam, Germany
2 University of Angers, France
11:10-12:30 Saturday morning 2 LCC
Session Chair:
Heribert Vollmer
Location: C4.06
11:10-11:50
On the Expressive Power of Modification Problems (abstract) 40 min
Florian Chudigiewitsch1, Till Tantau1
1 Universität zu Lübeck
11:50-12:30
Quantum Programming in Polylogarithmic Time (abstract) 40 min
Florent Ferrari1, Emmanuel Hainry2, Romain Péchoux2, Mário Silva3
1 ENS Lyon, France
2 Université de Lorraine, CNRS, Inria, LORIA, F-54000 Nancy, France
3 Laboratoire Méthodes Formelles, Université Paris-Saclay, Inria
11:15-12:00 Part 3 - Definite Descriptions in First-Order Modal and Temporal Logics DefDesKR
Session Chair:
Alessandro Artale
Location: C2.05
11:30-11:45 Connecting Higher-Order Logics using Kolmogorov's Translation à la Dowek-Werner, Thomas Traversié TGD
Location: C6.08
11:30-12:00 Contributed talk SmP
11:30-12:00
Monads Distributive Law and Markov Decision Processes (abstract) 30 min
Yun-Chen Tsai1
1 National Institute of Informatics
11:40-12:00 Contributed Talks 1 PC
Session Chair:
Olaf Beyersdorff
Location: C5.09
11:40-12:00
Size-degree inequalities in Sherali-Adams and Sum-of-Squares made simple (abstract) 20 min
Ilario Bonacina1
1 Universitat Politecnica de Catalunya
11:45-12:00 Parallel proof checking with short and long term memory, Michael Färber (online) TGD
Location: C6.08
12:00-12:30 Theoretical and Practical Advances of Polarized Deduction Modulo Theory, Guillaume Burel TGD
Location: C6.08
12:00-12:30 Contributed talk SmP
12:00-12:30
A Categorical Perspective on Kripke Models and Dynamic Epistemic Logic (abstract) 30 min
Haitian Wang1
1 ILLC
12:00-12:15 Closing RCRA
Location: C4.02
12:00-14:00 Lunch MoST
Location: C2.05
12:00-14:00 Lunch ST4DM
Location: C5.05
12:00-14:00 Lunch PC
Location: C5.09
12:00-13:30 Lunch NMR
Location: B1.04
12:00-14:00 Lunch OVERLAY
Location: C1.04
12:00-13:15 Lunch MSFP
Location: C5.01
12:00-14:00 Lunch SteamingNeSy
Location: C4.05
12:00-12:30 Combing ASP and LLMs ELASP
Location: C3.02
12:00-14:00 Lunch DefDesKR
Location: C2.05
12:00-12:30 Part 4 - Conclusion and Discussion DefDesKR
Session Chair:
Oliver Kutz
Location: C2.05
12:00-12:40 “To infinity and beyond!” DL
Session Chair:
Bartosz Bednarczyk
Location: B1.03
12:00-12:20
Two-Variable Logic for Hierarchically Partitioned and Ordered Data (Extended Abstract) (abstract) 20 min
Oskar Fiuk1, Emanuel Kieroński1, Vincent Michielini2
1 University of Wroclaw
2 University of Bordeaux
12:20-12:40
Will My Favorite Chases Terminate if Evaluating Conjunctive Queries Does? One Does Not Simply Decide This (Extended Abstract) (abstract) 20 min
Lucas Larroque1, Quentin Manière2
1 École Normale Supérieure - PSL
2 Inria, LIRMM
12:00-14:00 Lunch CARLA
Location: C4.01
12:00-13:30 Lunch ITRS
Location: C6.02
12:00-14:00 Lunch ICLP-DC-SS
Location: B2.02
12:00-14:00 Lunch EULP
Location: C2.02
12:00-13:20 Lunch FMQC
Location: C5.08
12:15-13:45 Lunch IFIP16
Location: C1.01
12:15-14:00 Lunch RCRA
Location: C4.02
12:20-14:30 Lunch GALOP
Location: C5.06
12:30-14:00 Lunch CPSATDP
Location: C1.03
12:30-14:00 Lunch LCC
Location: C4.06
12:30-14:00 Lunch SmP
Location: C5.02
12:30-14:00 Lunch TGD
Location: C6.08
12:30-14:00 Lunch LSFA
Location: C4.07
12:30-14:30 Lunch ELASP
Location: C3.02
12:35-14:00 Lunch SKILLED-LLMs
Location: B2.01
12:40-14:00 Lunch TLLA
Location: C5.07
12:40-14:00 Lunch ML4SP
Location: C4.08
12:40-14:00 Lunch DPSOLVE
Location: C3.01
12:40-14:10 Lunch DL
Location: B1.03
12:40-13:40 Lunch ASPOCP
Location: C2.01
13:15-14:15 Invited Talk 2 MSFP
Location: C5.01
13:15-14:15
Structural Functoriality in Dependent Type Theory (abstract) 60 min
Kenji Maillard1
1 Inria
13:20-15:00 Model Counting FMQC
Session Chair:
Tim Coopmans
Location: C5.08
13:20-13:50
Model Counting: Solving, Complexity, and Applications (abstract) 30 min
Johannes Klaus Fichte1
1 Linköping University
13:50-14:20
New Insights into Counting Complexity and Quantitative Reasoning with Complex Numbers (abstract) 30 min
Markus Hecher1
1 University of Potsdam + Artois University
14:20-14:40
Quantum Physics using Weighted Model Counting (abstract) 20 min
Joon Lee1, Dirck van den Ende1, Alfons Laarman1, Henning Basold1
1 Leiden University
14:40-15:00
Noisy Quantum Circuit Simulation Via Automated Reasoning (abstract) 20 min
Max Bannach1, Thore Gerlach1, Jai Grover1, Dolf Huybrechts1
1 European Space Agency
13:30-14:30 Session 2 ITRS
13:30-14:00
Autoformalizing Intersection Type Systems (abstract) 30 min
Gabriele Vanoni1
1 Université Paris Cité
14:00-14:30
Relational semantics: from simple to non-idempotent intersection types and back (abstract) 30 min
Giulio Guerrieri1, Vincent Sommella1
1 University of Sussex
13:30-15:00 Defeasible Beliefs NMR
Location: B1.04
13:30-14:00
Towards Non-Monotonic Entailment in Propositional Defeasible Standpoint Logic (abstract) 30 min
Nicholas Leisegang1, Thomas Meyer1, Ivan Varzinczak2
1 University of Cape Town and CAIR
2 Université Sorbonne Paris Nord
14:00-14:30
Standpoint Logics with Defeasible Beliefs (abstract) 30 min
Nicholas Leisegang1, Thomas Meyer1, Sebastian Rudolph2
1 University of Cape Town and CAIR
2 TU Dresden
14:30-15:00
Probabilistic epistemic spaces, Lockean beliefs, Stable beliefs and change (abstract) 30 min
Tommaso Flaminio1, Lluis Godo1, Ramón Pino Pérez2, Ricardo Rodriguez3, Lluis Subirana4
1 IIIA - CSIC
2 Universidad de Los Andes
3 Universidad de Buenos Aires
4 Universitat de Barcelona
13:40-14:40 Invited Speaker ASPOCP
Session Chair:
Brais Muñiz
Location: C2.01
13:40-14:39
ASPECT: Answer Set rePresentation as vEctorgraphiCs in laTex (abstract) 59 min
Marco Gavanelli marco1
1 Department of Engineering, University of Ferrara
13:45-15:15 Session 3 IFIP16
Location: C1.01
13:45-14:45
Clause orderings: What's in between weight-based orderings and multiset extensions? (abstract) 60 min
Uwe Waldmann1
1 Max Planck Institute Germany
14:45-15:15
the International School on Rewriting (abstract) 30 min
Cynthia Kop1
1 Radboud University Nijmegen
14:00-15:40 Talks 2 DPSOLVE
Location: C3.01
14:00-14:25
GPU-Accelerated State Expansion for Anytime Exact Decision-Diagram Search (abstract) 25 min
Fabio Tardivo1, Laurent Michel2
1 UNKNOWN
2 UCONN
14:25-14:50
CP or DP? Why Not Both: A Case Study in the Partial Shop Scheduling Problem. (abstract) 25 min
Emma Legrand1, Roger Kameugne1, Pierre Schaus1
1 UCLouvain
14:50-15:15
Decision Diagram-Based Exact Optimization for Assembly Line Balancing with Human-Robot Collaboration (abstract) 25 min
Jiaxin Zhang1, Yiting Sun1, Roger Kameugne2, Pierre Schaus2
1 College of Management and Economics, Tianjin University, Tianjin, China
2 UCLouvain
15:15-15:40
Column Elimination Applied to Scheduling Problems (abstract) 25 min
Vianney Coppé1
1 Hexaly
14:00-15:00 SS Invited Talk 2 ICLP-DC-SS
Location: B2.02
14:00-15:20 Saturday afternoon 1 LCC
Session Chair:
Isabel Oitavem
Location: C4.06
14:00-14:40
Complexity of Entailment for Cumulative Propositional Dependence Logics (abstract) 40 min
Kai Sauerwald1, Juha Kontinen2, Arne Meier3
1 FernUniversität in Hagen
2 University of Helsinki
3 Leibniz Universität Hannover
14:40-15:20
Uniformity in Transformer Models (abstract) 40 min
Laura Strieker1
1 Leibniz Universität Hannover
14:00-15:30 Paper session 2 EULP
Location: C2.02
14:00-14:30
LLMASP-LGX: A Lightweight Gateway to Logic-Guided Reasoning with LLMs and ASP (abstract) 30 min
Mario Alviano1, Lorenzo Grillo1, Nicola Leone1, Fabrizio Lo Scudo1
1 University of Calabria
14:30-15:00
Generating RTEC Programs with LLMs (abstract) 30 min
Andreas Kouvaras1, Periklis Mantenoglou2, Alexander Artikis3
1 University of Piraeus
2 Örebro University
3 University of Piraeus & NCSR 'Demokritos'
15:00-15:30
Verbalizing Answer Sets: the Map–Summarize Paradigm (abstract) 30 min
Mario Alviano1, Matteo Capalbo1, Sebastiano Antonio Piccolo1
1 University of Calabria
14:00-15:30 Temporal, Modal and Logical Foundations OVERLAY
Session Chair:
Nicola Gigante
Location: C1.04
14:00-14:30
Reasoning About Intuitionistic Alternating-Time Temporal Logic (abstract) 30 min
Andrea Capone1
1 Università degli Studi di Napoli Federico II
14:30-15:00
Counting worlds branching time semantics for post-hoc bias mitigation in generative AI (abstract) 30 min
Alessandro G. Buda1, Giuseppe Primiero2, Leonardo Ceragioli2, Melissa Antonelli3
1 University School for Advanced Studies IUSS Pavia
2 University of Milan
3 University of Tübingen (CFvW)
15:00-15:30
A note on the fragment of modal μ-calculus equivalent to First Order Logic over infinite trees (abstract) 30 min
Angelo Matteo1, Massimo Benerecetti2, Dario Della Monica1, Fabio Mogavero2, Gabriele Puppis1
1 University of Udine
2 University of Napoli "Federico II"
14:00-14:40 Invited Talk 2 PC
Session Chair:
Jan Johannsen
Location: C5.09
14:00-14:40
Lower Bounds via Friedman-Pippenger Technique (abstract) 40 min
Dmitry Sokolov1
1 EPFL, Lausanne
14:00-15:00 Brigitte Pientka (Invited) TLLA
Session Chair:
Olimpieri
Location: C5.07
14:00-15:00
Mechanizing Substructural Systems: Challenges and Lessons Learned (abstract) 60 min
Brigitte Pientka1
1 McGill University
14:00-15:00 Invited talk SmP
14:00-15:00
TBA (abstract) 60 min
Cameron Calk1
1 Laboratoire d’Informatique et Systèmes
14:00-14:30 You Cannot Go Slower Than Your Speed, Cesar Muñoz (online) TGD
Location: C6.08
14:00-16:00 Session 2: Neuro-Symbolic Integration: Logic, Belief, and Agent Design SKILLED-LLMs
Session Chair:
Mervat Abuelkheir
Location: B2.01
14:00-14:20
Neurosymbolic Clinical Reasoning: From Evidence Extraction to Reason-Based Decision (abstract) 20 min
Henrique Marcos1, Foivos Ioannis Tzavellos2, Rohan Nanda3
1 Faculty of Law, Maastricht University
2 Graduate school of Informatics, University of Amsterdam
3 Law and Tech Lab, Department of Advanced Computing Sciences, Maastricht University
14:20-14:40
Toward a Requirements-Driven Neuro-Symbolic Approach to Developing Trustworthy AI Agents Systems (abstract) 20 min
Bita Banihashemi1, Yves Lespérance2, Sotirios Liaskos2
1 IGDORE
2 York University
14:40-15:00
Epistemically-Constrained Belief Harmonization: Integrating Symbolic Structure with Probabilistic Consensus (abstract) 20 min
Adam Kostka1, Jarosław A. Chudziak1
1 Warsaw University of Technology
15:00-15:20
A Parametric Model of Cognitive Complexity for Symbolic Knowledge-Based Decision Systems (abstract) 20 min
Federico Sabbatini1
1 University of Bologna
15:20-15:40
PrologMCP: A Standardized Prolog Tool Interface for LLM Agents (abstract) 20 min
Agnieszka Mensfelt1, Adarsh Prabhakaran1, Adrian Haret1, Vince Trencsenyi2, Kostas Stathis1
1 Royal Holloway, University of London
2 Royal Holloway University of London, United Kingdom
15:40-16:00
NL2UNIFOL: from Natural Language Sentences to Uniform First-Order Logic Formulae (abstract) 20 min
Matteo Magnini1, Davide Liga1, Luca Pasetto1
1 University of Luxembourg
14:00-15:30 Session 2: Semantic Technologies for Data-centric AI and Knowledge Graph Construction ST4DM
Session Chair:
Davide Lanti
Location: C5.05
14:00-14:30
FORGE: Framework for Ontology-grounded Retrieval and Graph Extraction (abstract) 30 min
João P. Lima1, Renata Wassermann1
1 University of São Paulo
14:30-15:00
Using Knowledge Graphs to Restrict the Context of LLM Analysis: A GraphRAG Approach for Personnel Management (abstract) 30 min
Jose Parente de Oliveira1, Antonio Silveira Dantas
1 Professor of Computer Science, Aeronautics Institute of Technology
15:00-15:30
AgenticVKG : Towards Memory-Driven Agentic AI for VKG Mapping Construction (abstract) 30 min
Kamal Hamaz1, Marco Di Panfilo1, Davide Lanti1, Diego Calvanese1
1 Free University of Bozen-Bolzano
14:00-15:30 Session 1 MoST
Session Chair:
Lars-Phillip Spiegel
Location: C2.05
14:00-14:30
Variable Elimination for Forgetting in Probabilistic Graphical Models - A Work in Progress (abstract) 30 min
Tanya Braun1, Marcel Gehrke2, Kai Sauerwald3, Jan Speller1
1 University of Münster
2 University of Hamburg
3 University of Hagen
14:30-15:00
Independence axioms for ordinal conditional functions (abstract) 30 min
Roy Ferguson1, Ameerah Allie1, Thomas Meyer1
1 University of Cape Town and CAIR
15:00-15:30
Rarity and Structure of Syntax Splittings for Ranking Functions and Total Preorders (abstract) 30 min
Fabian Bräuer1, Simon Bräuer1
1 Unaffiliated
14:00-15:00 Invited talk 2 ML4SP
Location: C4.08
14:00-14:45 Part I. Introduction to Complex Event Recognition (CER) SteamingNeSy
Location: C4.05
14:00-16:00 Session 3 LSFA
Location: C4.07
14:00-15:00
Not Your Average Session Types (abstract) 60 min
Diana Costa1
1 Universidade de Lisboa
15:00-15:30
Colimit-Based Composition of High-Level Computing Devices (abstract) 30 min
Damian Arellanes1
1 Lancaster University
15:30-16:00
MaudeTypedLog: A Typed Interpreter for Prolog in Maude (abstract) 30 min
Enrique Gallifa-Tronch1, João Barbosa2, Santiago Escobar1
1 VRAIN, Universitat Politècnica de València
2 Faculty of Science, University of Porto
14:00-14:45 Invited Talk CPSATDP
Location: C1.03
14:10-17:00 Special Session DL
Location: B1.03
14:15-15:30 Contributed Talks 2 MSFP
Location: C5.01
14:15-14:40
Mathematical foundations for symmetric programming (abstract) 25 min
Ohad Kammar1, Matija Pretnar2
1 University of Edinburgh
2 University of Ljubljana
14:40-15:05
Towards Minimal Axioms for Probabilistic Programming (abstract) 25 min
Eigil Rischel1
1 Tallinn University of Technology
15:05-15:30
Categorical E-Graphs for Lambda Calculi (abstract) 25 min
Aleksei Tiurin1, Dan Ghica1, Nick Hu2
1 University of Birmingham
2 Kyoto University
14:30-15:00 Secure development of dependently typed programs using proxy-based small inversions, Pierre Corbineau, Basile Gros and Jean-François Monin TGD
Location: C6.08
14:30-15:30 CARLA Workshop CARLA
Session Chair:
Manuel Borroto
Location: C4.01
14:30-14:40
Opening (abstract) 10 min
Manuel Borroto1
1 University of Calabria, Italy
14:40-14:55
A Neuro-Symbolic Agent for Video Anomaly Detection (abstract) 15 min
Alessia Donata Camarda1, Giovambattista Ianni1, Angelo Laface1
1 University of Calabria
14:55-15:10
ASPembly: Neuro-Symbolic Robotic Assembly Planning with Answer Set Programming (abstract) 15 min
Mario Alviano1, Lorenzo Grillo1, Pierpaolo Sestito1
1 University of Calabria
15:10-15:25
Logic-Based Multi-Robot Coordination in Digital Twins: A DALI2 + CoppeliaSim Case Study for Cooperative Search and Rescue (abstract) 15 min
Lorenzo De Lauretis1, Giovanni De Gasperis1, Stefania Costantini1
1 Univaq
14:30-15:30 Joint keynote talk with ITRS - Simon Forest GALOP
Location: C5.06
14:30-15:30
Thin spans and their associated rigid intersection type system (abstract) 60 min
Simon Forest1
1 Loria & University of Lorraine
14:30-15:30 Joint Invited Talk with GaLoP ITRS
Location: C6.02
14:40-15:30 Industrial applications ASPOCP
Session Chair:
Brais Muñiz
Location: C2.01
14:40-15:05
Modeling the Resource-Constrained Project Scheduling Problem with Answer Set Programming (abstract) 25 min
Mohammed M. S. El-Kholany1, Martin Gebser2, Đorđe Marković2, Gianluca Zavan2
1 Cairo University
2 University of Klagenfurt
15:05-15:29
Solving configuration problems with unbounded cardinalities in COOM: Preliminary report (abstract) 24 min
Joachim Baumeister1, Konstantin Herud2, Jan Heuer3, Jochen Reutelshöfer2, Nicolas Rühling3, Abdallah Saffidine4, Torsten Schaub5
1 University of Würzburg
2 denkbares
3 UP Transfer
4 Potassco Solutions
5 University of Potsdam
14:40-15:20 Contributed Talks 2 PC
Session Chair:
Jan Johannsen
Location: C5.09
14:40-15:00
Lower Bounds against the Ideal Proof System in Finite Fields (abstract) 20 min
Tal Elbaz1, Nashlen Govindasamy1, Jiaqi Lu1, Iddo Tzameret1
1 Imperial College London
15:00-15:20
Symmetric Proofs in the Ideal Proof System (abstract) 20 min
Anuj Dawar1
1 University of Cambridge
14:45-15:30 Part II. Formal Methods for CER SteamingNeSy
Location: C4.05
14:45-15:30 Session 2 CPSATDP
Location: C1.03
15:00-15:30 Coffee Break FMQC
Location: C5.08
15:00-16:00 DC Session 2 ICLP-DC-SS
Location: B2.02
15:00-15:20
Integrating Description Logics and Answer Set Programming for Explainable Decision-Making in Digital Health (abstract) 20 min
Alina Vozna1
1 University Of Pisa, University of L'Aquila
15:20-15:40
Computational methods for Dynamic Answer Set Programming (abstract) 20 min
Susana Hahn1
1 University of Potsdam
15:40-16:00
Logical Foundations of Dynamical Answer Set Programming (abstract) 20 min
Arvid Becker1
1 University of Potsdam
15:00-15:40 Paper talks 2 ML4SP
Location: C4.08
15:00-15:20
Predicting Assignments of MaxSAT Variables with Graph Neural Networks (abstract) 20 min
Jonathan Oliva1, Peter Nightingale1, Felix Ulrich-Oltean1
1 University of York
15:20-15:40
Caching and Batching for Neural Clause Selection in Saturation-Based Theorem Proving (abstract) 20 min
Alexander Pluska1, Florian Zuleger1
1 TU Wien
15:00-15:30 Coffee Break NMR
Location: B1.04
15:00-15:15 TBD, Valentin Blot TGD
Location: C6.08
15:00-15:30 Coffee break SmP
15:00-15:25 S4.1 TLLA
Session Chair:
Olimpieri
Location: C5.07
15:00-15:25
From linear types to relational higher-order logic for analyzing program sensitivity (abstract) 25 min
Artur Szafarczyk1, Patrick Baillot2
1 Cristal, INRIA LIlle, Université de Lille
2 CNRS, Université de Lille
15:15-15:30 Reconstructing SMT Proofs in the λΠ/≡-calculus, Alessio Coltellacci TGD
Location: C6.08
15:15-15:45 Coffee Break IFIP16
Location: C1.01
15:20-15:50 Coffee Break LCC
Location: C4.06
15:25-16:00 Coffee Break TLLA
Location: C5.07
15:30-17:00 Contributed talk SmP
15:30-16:00
Comonadic Approach to Hypertree Parameters and Loosely-Guarded Logics (abstract) 30 min
Elias Percy1
1 University of Cambridge
16:00-16:30
Arboreal Adjunctions from Shapes (abstract) 30 min
Gabriel Goren-Roig1
1 Universidad de Buenos Aires & CONICET
16:30-17:00
NP-completeness, and coherence for associativity (abstract) 30 min
Peter Hines1
1 University of York
15:30-16:00 Coffee Break TGD
Location: C6.08
15:30-16:00 Coffee Break MoST
Location: C2.05
15:30-16:30 Coffee Break RCRA
Location: C4.02
15:30-16:30 Coffee Break ST4DM
Location: C5.05
15:30-17:00 Foundations NMR
Location: B1.04
15:30-16:00
An Infinitary and a Cyclic Sequent Calculus for Non-Monotone Inductive Definitions (abstract) 30 min
Robbe Van den Eede1
1 KU Leuven, Vrije Universiteit Brussel
16:00-16:30
Categorical independence in nonmonotonic reasoning (abstract) 30 min
Roy Ferguson1, Jonas Haldimann1, Jesse Heynick2, Thomas Meyer1
1 University of Cape Town and CAIR
2 Open Universiteit, the Netherlands
16:30-17:00
Constrained Input/Output Logic in HOL: An Algebraic Embedding (abstract) 30 min
ali farjami1, Luca Pasetto1
1 University of Luxembourg
15:30-16:00 Coffee Break OVERLAY
Location: C1.04
15:30-16:30 Coffee Break PC
Location: C5.09
15:30-16:10 Coffee Break MSFP
Location: C5.01
15:30-16:30 Coffee Break ELASP
Location: C3.02
15:30-16:30 Coffee Break SteamingNeSy
Location: C4.05
15:30-16:30 Coffee Break ITRS
Location: C6.02
15:30-16:40 Verification and Synthesis FMQC
Session Chair:
Max Bannach
Location: C5.08
15:30-16:00
Automata-Based Verification of Size-Parameterized Quantum Circuits (abstract) 30 min
Yu-Fang Chen1
1 Academia Sinica, Taiwan
16:00-16:20
Synthesizing Quantum Circuits using SMT and MILP (abstract) 20 min
Jakub Havlík1, Ondřej Lengál1
1 Brno University of Technology
16:20-16:40
Static Resource Analysis of Hybrid Programs with Unbounded Loops (abstract) 20 min
Jad Issa1, Christophe Chareton2, Romain Péchoux3
1 CEA List, Palaiseau, France and Université de Lorraine, CNRS, Inria, LORIA, F-54000 Nancy, France
2 CEA List, Palaiseau, France
3 Université de Lorraine, CNRS, Inria, LORIA, F-54000 Nancy, France
15:30-16:00 Coffee Break GALOP
Location: C5.06
15:30-16:30 Coffee Break CPSATDP
Location: C1.03
15:30-16:30 Coffee Break EULP
Location: C2.02
15:30-16:00 Coffee Break ASPOCP
Location: C2.01
15:30-16:00 Coffee Break DL
Location: B1.03
15:30-16:30 Coffee Break DefDesKR
Location: C2.05
15:30-16:30 Coffee Break CARLA
Location: C4.01
15:40-16:10 Coffee Break DPSOLVE
Location: C3.01
15:40-16:10 Coffee Break ML4SP
Location: C4.08
15:45-17:15 Session 4 IFIP16
Location: C1.01
15:45-16:15
update on the rewriting.inria.fr Website Project (abstract) 30 min
Luigi Liquori1
1 Inria
16:15-17:15
Business Meeting (members-only) (abstract) 60 min
Cynthia Kop1, Carsten Fuhs2
1 Radboud University Nijmegen
2 Birkbeck, University of London
15:50-17:10 Saturday afternoon 2 LCC
Session Chair:
Bruno Loff
Location: C4.06
15:50-16:30
The CNF Encoding Complexity of Boolean Functions and Non-Uniform Computation (abstract) 40 min
Andrew Krapivin1, Benjamin Przybocki1, Bernardo Subercaseaux1
1 Carnegie Mellon University
16:30-17:10
Approximating the Values of Boolean Formulae in TC0 (abstract) 40 min
Klaus-Jörn Lange1
1 Universität Tübingen
16:00-16:30 Coffee Break ICLP-DC-SS
Location: B2.02
16:00-16:30 Panel discussion EULP
Location: C2.02
16:00-17:40 Contributed Talks - Session 2 GALOP
Location: C5.06
16:00-16:35
Tensorial logic with global stores (abstract) 35 min
Paul-André Melliès1
1 CNRS
16:35-17:10
Infinitary Proof systems and Concurrent game semantics (abstract) 35 min
Sayna Behnia1
1 Aix Marseille Université
17:10-17:40
Sequential algorithms as a Dialectica interpretation (abstract) 30 min
Valentin Blot1
1 INRIA - Nantes Université
16:00-17:20 System and Tools + Closing ASPOCP
Session Chair:
Alice Tarzariol
Location: C2.01
16:00-16:25
Between Two Worlds: Logica Intertwines ASP and SQL (abstract) 25 min
Evgeny Skvortsov1, Shawn Bowers2, Yilin Xia3, Ojaswa Garg1, Bertram Ludäscher3
1 Google
2 Gonzaga University
3 University of Illinois, Urbana-Champaign
16:25-16:50
Finding Counterexamples for External Equivalence: Preliminary Report (abstract) 25 min
Jorge Fandinno1, Jan Heuer2, Tomi Janhunen3, Javier Romero2, Torsten Schaub2
1 University of Nebraska Omaha, USA
2 University of Potsdam, Germany
3 Tampere University, Finland
16:50-17:15
asplain: An ASP System for Contrastive Explanations (abstract) 25 min
Susana Hahn1, Brais Muñiz2, Orkunt Sabuncu1, Torsten Schaub1, Tran Cao Son1, Hannes Weichelt1
1 Potassco Solutions GmbH, Germany
2 University of Coruña, Spain
17:15-17:19
Closing (abstract) 4 min
Alice Tarzariol1
1 University of Klagenfurt
16:00-16:30 Coffee Break LSFA
Location: C4.07
16:00-17:00 Temporal, Modal and Logical Foundations 2 OVERLAY
Session Chair:
Nicola Gigante
Location: C1.04
16:00-16:30
Strategy Logic: Where are we? (abstract) 30 min
Aniello Murano1, Bastien Maubert1
1 University of Naples Federico II
16:30-17:00
Auditing, Monitoring, and Intervention for Compliance of Advanced AI Systems (Abridged Version) (abstract) 30 min
Parand A. Alamdari1, Toryn Klassen1, Sheila McIlraith1
1 University of Toronto
16:00-16:30 Coffee Break SKILLED-LLMs
Location: B2.01
16:00-17:30 Session 2 MoST
Session Chair:
Alexander Hahn
Location: C2.05
16:00-16:30
Computation of Conditional Syntax Splittings for Inductive Inference from Belief Bases (abstract) 30 min
Lars-Phillip Spiegel1, Franziska Herkner, Christoph Beierle1
1 FernUniversität in Hagen
16:30-17:00
Lessons from the Inheritance Paradox - On Desiderata for Reasoning with and about Defaults (abstract) 30 min
Emil Weydert1
1 University of Luxembourg
17:00-17:30
Next Steps in Conditional Inference under Disjunctive Rationality: Relevance and the Trans-rational Closure (Preliminary Results) (abstract) 30 min
Richard Booth1, Mihai Craciun1, Ivan Varzinczak2
1 Cardiff University
2 Université Sorbonne Paris Nord
16:00-16:30 Confluence of non-left-linear higher-order rewriting, Jean-Pierre Jouannaud TGD
Location: C6.08
16:00-16:30 Contributed talk SmP
16:00-16:30
Arboreal Adjunctions from Shapes (abstract) 30 min
Gabriel Goren-Roig1
1 Universidad de Buenos Aires & CONICET
16:00-17:15 S4 TLLA
Session Chair:
Olimpieri
Location: C5.07
16:00-16:25
A Linear Logic for Fixpoints and Deadlock Freedom in the Pi-Calculus (abstract) 25 min
Juan Jaramillo1, Damiano Mazza2, Jorge A. Pérez1
1 University of Groningen
2 CNRS, LIPN, Université Sorbonne Paris Nord
16:25-16:50
From Phase Semantics to Base-extension Semantics (and back) (abstract) 25 min
Ekaterina Piotrovskaya1
1 University College London
16:50-17:15
Adapted Pairs and Logical Relations in Linear Logic (abstract) 25 min
Thomas Waring1
1 Università Roma Tre
16:10-17:00 Contributed Talks 3 MSFP
Location: C5.01
16:10-16:35
Symmetric List Objects (abstract) 25 min
Fiona Blackett1, Vikraman Choudhury1, Rin Liu1
1 University of Strathclyde
16:35-17:00
Concurrent monads as monads in a 2-category (abstract) 25 min
Bjarki Gunnarsson1, Exequiel Rivas2, Tarmo Uustalu3
1 University of Iceland
2 Tallinn University of Technology
3 Reykjavik University and Tallinn University of Technology
16:10-17:10 Paper talks 3 ML4SP
Location: C4.08
16:10-16:30
A priori knowledge for learning combinations of heuristics for CSPs (abstract) 20 min
Anastasia Paparrizou1, Michael Sioutis1, Yoan Thomas1, Christian Bessiere1
1 CNRS, University of Montpellier
16:30-16:50
KissatEvolve: Controllable and Scalable Synthesis of SAT Heuristics with Densely Annotated Memory Bank (abstract) 20 min
Meru Gopalan1, Jialin Lu2, Jialin Song2, Shimin Zhang1, Hieu Nguyen1, Wuyang Chen2, Vijay Ganesh1
1 Georgia Institute of Technology
2 Simon Fraser University
16:50-17:10
Revealing the limits of Machine Learning for Satisfiability Testing: a dataset for learning minimal moves (abstract) 20 min
Laurent Simon1,2,3,4
1 LaBRI
2 Bordeaux INP
3 Univ Bordeaux
4 CNRS
16:10-17:10 Open Discussion DPSOLVE
Location: C3.01
16:30-17:15 DC Session 3 + Closing ICLP-DC-SS
Location: B2.02
16:30-16:50
Hybrid Answer Set Programming: Foundations and Applications (abstract) 20 min
Nicolas Rühling1
1 University of Potsdam
16:50-17:10
Modeling Railway Systems in Answer Set Programming (abstract) 20 min
Ryan Kepler James Murphy1
1 University of Potsdam
17:10-17:15
Closing (abstract) 5 min
Alice Tarzariol1
1 University of Klagenfurt
16:30-16:45 Closing EULP
Location: C2.02
16:30-18:00 Session 3 CPSATDP
Location: C1.03
16:30-17:35 CARLA Workshop - II Sessions CARLA
Session Chair:
Manuel Borroto
Location: C4.01
16:30-16:45
CoSP-TL: Common Sense enhanced Planning under Temporal Logics constraints with LLMs (abstract) 15 min
Emanuele Musumeci1, Alessio Saladino1, Elena Umili1, Luca Iocchi1, Daniele Nardi1
1 Sapienza University of Rome
16:45-17:00
Collaborating with Ad Hoc Agents through Reasoning and Learning (abstract) 15 min
Hasra Dodampegama1, Mohan Sridharan1
1 University of Edinburgh
17:00-17:30
Invited Talk (abstract) 30 min
Nico Potyka1
1 Cardiff University
17:30-17:35
Closing (abstract) 5 min
Manuel Borroto1
1 University of Calabria, Italy
16:30-17:15 Part III. Probabilistic CER SteamingNeSy
Location: C4.05
16:30-17:30 Session 4 LSFA
Location: C4.07
16:30-17:00
Collusion Relations and their Applications to Balance Theory (abstract) 30 min
Jean-Baptiste Joinet1, Carlos Olarte2
1 Université Jean Moulin Lyon 3
2 Université Sorbonne Paris Nord
17:00-17:30
Dynamic Logic with Parallel Operator for Verifying Communication Protocols (abstract) 30 min
Mario Benevides1, Luiz Fernadez2
1 Universidade Federal Fluminese
2 Universidade Federal do Rio de Janeiro
16:30-17:30 Contributed Talks 3 PC
Session Chair:
Jan Johannsen
Location: C5.09
16:30-16:50
Cardinality Constraints are Hard for Resolution (abstract) 20 min
Ilario Bonacina1, Jordi Levy2, Ion Mikel Liberal2
1 Universitat Politecnica de Catalunya
2 IIIA-CSIC
16:50-17:10
Cutting Planes with Cover Cuts (abstract) 20 min
Jake Anderson1, Wietze Koops2, Massimo Lauria3, Marc Vinyals1
1 University of Auckland
2 Lund University and University of Copenhagen
3 Sapienza Università di Roma
17:10-17:30
Cardinality Cuts & Saturation (abstract) 20 min
Jake Anderson1, Marc Vinyals1, Massimo Lauria2, Wietze Koops3
1 University of Auckland
2 Sapienza Università di Roma
3 Lund University & University of Copenhagen
16:30-17:00 Contributed talk SmP
16:30-17:00
NP-completeness, and coherence for associativity (abstract) 30 min
Peter Hines1
1 University of York
16:30-17:00 When Quantum Computing Challenges Logic, Alejandro Díaz-Caro TGD
Location: C6.08
16:30-17:50 Session 3: Symbolic Constraints in Learning and Inference SKILLED-LLMs
Session Chair:
Federico Sabbatini
Location: B2.01
16:30-16:50
First Steps Towards Human-AI Ranking Aggregation (abstract) 20 min
Jonas Karge1, Roy Ferguson2, Daniel Grimaldi2, Jonas Haldimann2, Ruvarashe Madzime3, Thomas Meyer2
1 TU Dresden
2 University of Cape Town and CAIR
3 University of the Western Cape and CAIR
16:50-17:10
Neuro-Symbolic Injection of LTLf Constraints in Autoregressive Reinforcement Learning Policies (abstract) 20 min
Ashkan Ansarifard1, Matteo Mancanelli1, Elena Umili1, Fabio Patrizi1
1 Sapienza University of Rome
17:10-17:30
Enhancing Retrieval-Augmented Generators with Symbolic Query Definitions (abstract) 20 min
Filippo Bianchini1, Marco Calamo1, Marco Console1, Massimo Mecella1, Laura Papi1
1 Sapienza University of Rome
17:30-17:50
Deep Weighted Finite Automata (abstract) 20 min
Francesco Casone1, Rafael Peñaloza1
1 University of Milano-Bicocca
16:40-17:10 Discussion FMQC
Location: C5.08
17:00-17:30 Explainability and the related issues in the digital-AI environments, Mitsuhiro Okada TGD
Location: C6.08
17:10-18:00 Panel discussion ML4SP
Location: C4.08
17:15-18:00 Part IV. Neuro-Symbolic CER SteamingNeSy
Location: C4.05
17:30-18:00 I, Computer: Gilles’ Children’s Book on the Foundations of Computing, Nachum Dershowitz (online) TGD
Location: C6.08
17:30-18:00 Closing MoST
Session Chair:
Gaby Kern-Isberner
Location: C2.05
17:50-18:00 Closing SKILLED-LLMs
Session Chair:
Elena Umili
Location: B2.01
Sunday, 19 July 2026
08:30-10:00 ThEdu Session 1 ThEdu
Session Chair:
Julien Narboux
Location: C2.01
08:30-09:00
Complete, Transparent & Interactive Systems for Highschool Mathematics (abstract) 30 min
Walther Neuper1
1 JKU University Linz
09:00-09:30
MiniHOL: A minimal object logic for teaching Isabelle/HOL’s foundations (abstract) 30 min
Terru Stübinger1, Henriette Färber1
1 Karlsruhe Institute of Technology
09:30-10:00
CoreCalc: A Core Sequent Calculus Tool (abstract) 30 min
Jørgen Villadsen1
1 Technical University of Denmark
08:45-09:00 Opening PoS
Location: C4.08
08:45-09:00
Opening (abstract) 15 min
Bart Bogaerts1, Dominik Schreiber2
1 KU Leuven
2 Karlsruhe Institute of Technology
09:00-10:30 Session 1: Proofs PoS
Location: C4.08
09:00-09:20
Proof-Guided SAT Encoding Selection for Bit-Vector Multiplication (abstract) 20 min
Armin Biere1, Daniel Kroening1, Norbert Manthey1, Martin Nyx Brain2, Michael Tautschnig1
1 Amazon Web Services
2 City St George’s, University of London
09:20-09:40
Certified Variable Reordering in Cardinality Encodings (abstract) 20 min
Joseph Reeves1, Marijn Heule1, Randal Bryant1
1 Carnegie Mellon University
09:40-10:00
Trimming Pseudo-Boolean Proofs (abstract) 20 min
Berhan Oumer Adame1, Bart Bogaerts2, Benjamin Bogø3, Simon Dold4, Arthur Gontier5, Wietze Koops3, Ciaran McCreesh5, Matthew McIlree5, Jakob Nordstrom3, Andy Oertel6, Adrian Rebola-Pardo7, Mark Turnbull5
1 Vrije Universiteit Brussel
2 KU Leuven, Belgium
3 University of Copenhagen, Denmark
4 University of Basel, Switzerland
5 University of Glasgow, United Kingdom
6 Lund University, Sweden
7 Vienna University of Technology, Austria
10:00-10:20
PBLean: Pseudo-Boolean Proof Certificates for Lean 4 (abstract) 20 min
Stefan Szeider1
1 TIUWien
10:20-10:30
Scaling Zero Knowledge UNSAT Verification via Normalized Chaining (abstract) 10 min
Ashwin Karthikeyan1, Ethan Kharitonov2, Kuldeep S. Meel3, Anwar Hithnawi1
1 University of Toronto
2 Independent
3 Georgia Institute of Technology, University of Toronto
09:00-10:00 Hugo Paquet (Invited, joint with Galop) TLLA
Session Chair:
Olimpieri
Location: C5.07
09:00-10:00
Concurrency in linear and non-linear game semantics (abstract) 60 min
Hugo Paquet1
1 INRIA Paris
09:00-10:00 Learning OVERLAY
Session Chair:
Nicola Gigante
Location: C1.04
09:00-09:30
Learning Formal Models of Parametrized Systems (abstract) 30 min
Dana Fisman1, Noa Izsak2, Swen Jacobs2
1 Ben-Gurion University of the Negev
2 CISPA Helmholtz Center for Information Security
09:30-10:00
Fairness Certificates via a Lean-Backed Trustworthy Probabilistic Typed Natural Deduction (abstract) 30 min
Fabio Aurelio D'Asaro1, Giuseppe Primiero2
1 University of Verona, University College London
2 University of Milan
09:00-09:30 Informat meet & greet MW1
Location: C5.01
09:00-09:10 Opening ModRef
Session Chair:
Jordi Coll
Location: C3.02
09:00-09:10
Welcome and Introduction (abstract) 10 min
Jordi Coll1
1 Universitat de Girona
09:00-09:50 Talk1 LLM-Solve
Location: C5.08
09:00-10:10 Contributed Talks 1 JoeFest
Session Chair:
Sander Beckers
Location: C4.01
09:00-09:10
Introduction (abstract) 10 min
Sander Beckers1
1 University College London
09:10-09:30
Operationalising Relative Causal Knowledge: Backbone Identifiability from Private Reports (abstract) 20 min
Fabrizio Russo1, Mark Somers2
1 Imperial College London
2 Fifty One Degrees Ltd
09:30-09:50
Salient Preference Dynamics: A Model of Attention-Driven Preference Change (abstract) 20 min
David Hyland1, Sarit Kraus2, Michael Wooldridge1
1 University of Oxford
2 Bar-Ilan University
09:50-10:10
Lessons from the Past for the Future of Robotics (abstract) 20 min
Mohan Sridharan1
1 University of Edinburgh
09:00-10:30 Session 5 LSFA
Session Chair:
Cynthia Kop
Location: C4.07
09:00-10:00
A General Approach for SMT Proof Skeletons (abstract) 60 min
Haniel Barbosa1
1 Universidade Federal de Minas Gerais
10:00-10:30
Efficient Decision Procedures for RNMatrix Semantics (abstract) 30 min
Renato R. Leme1, Carlos Olarte2, Elaine Pimentel3
1 UNICAMP
2 Université Sorbonne Paris Nord
3 University College London
09:00-10:00 Session 1 WPTE
Location: C5.05
09:00-10:00
Staging for Synthesis and Analysis (abstract) 60 min
Nada Amin1
1 Harvard University
09:00-10:30 Arguing in dynamic and uncertain situations: From theoretical insights to application (tutorial) ADU
Session Chair:
Jean-Guy Mailly
Location: C2.05
09:00-10:20 Pragmatics of QBF QBF
Session Chair:
Tony Tan
Location: C5.02
09:00-09:40
Invited Talk - Dependency Schemes from Antiquity to Modernity (abstract) 40 min
Tomáš Peitl1
1 TU Wien
09:40-10:00
Certification of True QBF Formulas in Expansion-Based Solving (abstract) 20 min
Sidhant Bhavnani1, Clemens Hofstadler1, Martina Seidl1
1 Johannes Kepler University - Linz
10:00-10:20
Solving Connect Four with QBF: The Progress So Far (abstract) 20 min
Valentin Mayer-Eichberger1, Abdallah Saffidine2
1 University of Potsdam, Potsdam, Germany
2 Potassco Solutions, Potsdam, Germany
09:00-10:00 Giuseppe Perelli 'Mechanism Redesign: Repairing Techniques for Synthesis and Rational Synthesis' LAMAS-SR
Location: B2.01
09:00-10:00
Mechanism Redesign: Repairing Techniques for Synthesis and Rational Synthesis (abstract) 60 min
Giuseppe Perelli1
1 Sapienza University of Rome
09:00-10:30 Part 1 LLM4R
Location: B2.02
09:00-10:30 Papers 1 WHOOPS
Location: C1.01
09:00-09:10
Opening Remarks (abstract) 10 min
Ciaran McCreesh1
1 University of Glasgow
09:10-09:30
Efficient and Reliable Hitting-Set Computations for the Implicit Hitting Set Approach (abstract) 20 min
Hannes Ihalainen1, Dieter Vandesande2, André Schidler3, Jeremias Berg1, Bart Bogaerts4, Matti Järvisalo1
1 University of Helsinki
2 Vrije Universiteit Brussel & KU Leuven
3 University of Freiburg
4 KU Leuven & Vrije Universiteit Brussel
09:30-09:50
Towards Practical Zero-Knowledge Proof for PSPACE (abstract) 20 min
Ashwin Karthikeyan1, Hengyu Liu2, Kuldeep S. Meel3, Ning Luo2
1 University of Toronto
2 University of Illinois Urbana-Champaign
3 University of Toronto, Georgia Institute of Technology
09:50-10:10
Trimming Pseudo-Boolean Proofs (abstract) 20 min
Berhan Oumer Adame1, Bart Bogaerts2, Benjamin Bogø3, Simon Dold4, Arthur GONTIER5, Wietze Koops6, Ciaran McCreesh5, Matthew J. McIlree5, Jakob Nordström3, Andy Oertel6, Adrian Rebola-Pardo7, Mark Turnbull5
1 Vrije Universiteit Brussel, Belgium\\ Arba Minch University, Ethiopia
2 KU Leuven, Belgium\\ Vrije Universiteit Brussel, Belgium
3 University of Copenhagen, Denmark\\ Lund University, Sweden
4 University of Basel, Switzerland
5 University of Glasgow, United Kingdom
6 Lund University, Sweden\\ University of Copenhagen, Denmark
7 Vienna University of Technology, Austria\\ Johannes Kepler University Linz, Austria
10:10-10:30
Proving back and forth with the same rules (abstract) 20 min
Peter Pfeiffer1, Adrian Rebola-Pardo2
1 JKU Linz
2 TU Wien, JKU Linz
09:00-10:00 Joint keynote talk with TLLA - Hugo Paquet GALOP
Location: C5.06
09:00-10:00
Concurrency in linear and non-linear game semantics (abstract) 60 min
Hugo Paquet1
1 Inria & École Normale Supérieure
09:00-10:00 Session 4 CPSATDP
Location: C1.03
09:00-10:40 Sunday morning 1 LCC
Session Chair:
Isabel Oitavem
Location: C4.06
09:00-10:00
On the Complexity of Confluence and Church-Rosser Proofs, with Applications to Bounded Arithmetic (abstract) 60 min
Arnold Beckmann1
1 Swansea
10:00-10:40
Towards Higher-Order Logarithmic Space (abstract) 40 min
Martino D'Adda1, Gabriele Vanoni2
1 Università di Milano
2 Université Paris Cité
09:00-10:00 First invited talk DIALOCO
Location: C4.02
09:00-10:00
TBA (abstract) 60 min
Dan R. Ghica1
1 University of Birmingham, Huawei Central Software Institute
09:10-10:30 Session 1: Constraint Modelling and Propagation ModRef
Location: C3.02
09:10-09:30
Defining Propagators in MiniZinc (abstract) 20 min
Jip J. Dekker1, Peter J. Stuckey1, Guido Tack1, Huu Quang Tran1, Markus Wagner1
1 Monash University
09:30-09:50
Propagation Algorithms for the Minimum-Distance Constraint over Selected Points (abstract) 20 min
Mikael Zayenz Lagerkvist1
1 Independent researcher, Sambanova
09:50-10:10
Machine Learning-Based Generalization Queries for Constraint Acquisition (abstract) 20 min
Dimos Tsouros1, Senne Berden2, Tias Guns2
1 University of Western Macedonia
2 KU Leuven
10:10-10:30
Paramita: An Extensible Framework for SATisfiability Solving (abstract) 20 min
Josep Alòs1, Carlos Ansótegui1, Juan Luis Esteban2, Eduard Torres1
1 Universitat de Lleida
2 Universitat Politècnica Catalunya
09:15-10:10 Invited Speaker: Stefan Borgwardt DL
Location: B1.03
09:15-10:10
Explaining Description Logic Reasoning (abstract) 55 min
Stefan Borgwardt1
1 TU Dresden
09:20-10:00 Contributed Talks 4 PC
Session Chair:
Massimo Lauria
Location: C5.09
09:20-09:40
Toward a Characterization of Simulation Between Arithmetic Theories (abstract) 20 min
Hunter Monroe1
1 International Monetary Fund (retired)
09:40-10:00
Towards a positive version of Cook’s PV (abstract) 20 min
Adriana Baldacchino1, Anupam Das1
1 University of Birmingham
09:30-10:30 Matthias Knorr NMR
Location: B1.04
09:30-09:40 Kickoff MW1
Location: C5.01
09:40-10:10 Ichiro Hasuo MW1
Location: C5.01
09:40-10:10
Finding Mathematical Problems in the Jungle of Automated Driving (abstract) 30 min
Ichiro Hasuo1
1 National Institute for Informatics
09:50-10:30 Session 1 - Explanations with LLMs LLM-Solve
Location: C5.08
09:50-10:10
Towards Human Readable Explanations (abstract) 20 min
Kha Luân Feltus1, Victor Poucet1, Helene Verhaeghe1
1 UCLouvain
10:10-10:30
Large Language Models for Explaining Unsatisfiable Constraint Satisfaction Problems (abstract) 20 min
Ignace Bleukx1, Tias Guns1
1 KU Leuven
10:00-10:30 Coffee Break OVERLAY
Location: C1.04
10:00-11:00 Coffee Break PC
Location: C5.09
10:00-10:30 Coffee Break TLLA
Location: C5.07
10:00-11:00 Coffee Break ThEdu
Location: C2.01
10:00-11:00 Coffee Break PEG
Location: C3.01
10:00-10:30 Coffee Break WPTE
Location: C5.05
10:00-11:00 Coffee Break LLM4R
Location: B2.02
10:00-11:00 Session I LAMAS-SR
Location: B2.01
10:00-10:15
Temporal Self-Reference Paradox in Finite-Horizon Agents: Semantic and Proof-Theoretic Treatment (abstract) 15 min
Michał Tomasz Godziszewski1,3, Davide Catta2
1 University of Łódź
2 Université Sorbonne Paris Nord (LIPN)
3 Samsung AI Center Warsaw
10:15-10:30
Minimal Rational Synthesis (abstract) 15 min
Kokulan Thangasuthan1, Muhammad Najib2, Ignacio Carlucho2
1 University of Edinburgh & Heriot-Watt University
2 Heriot-Watt University
10:30-10:45
Multi-Property Synthesis (abstract) 15 min
Yannik Schnitzer1, Christoph Weinhuber1, Alessandro Abate1, David Parker1, Giuseppe De Giacomo1, Moshe Y. Vardi2
1 University of Oxford
2 Rice University
10:45-11:00
Symbolic Synthesis for LTLf+ Obligations (abstract) 15 min
Giuseppe De Giacomo1, Christian Hagemeier1, Daniel Hausmann2, Nir Piterman3
1 University of Oxford, UK
2 University of Liverpool, UK
3 University of Gothenburg and Chalmers University of Technology, Sweden
10:00-11:00 Coffee Break GOE
Location: C2.05
10:00-11:00 Coffee Break TERMGRAPH
Location: C6.02
10:00-10:30 Contributed talks DIALOCO
Location: C4.02
10:00-10:30
Monoidal substitution diagrams (abstract) 30 min
Samuel Steakley1, Florian Schwarz2
1 Tallinn University of Technology
2 University of Calgary
10:00-11:00 Coffee Break CPSATDP
Location: C1.03
10:00-10:40 Coffee Break GALOP
Location: C5.06
10:10-10:40 Coffee Break DL
Location: B1.03
10:10-10:40 Coffee Break JoeFest
Location: C4.01
10:10-10:30 Ice-breakers MW1
Location: C5.01
10:20-10:50 Coffee Break QBF
Location: C5.02
10:30-11:00 Coffee Break PoS
Location: C4.08
10:30-11:20 S2.1 TLLA
Session Chair:
Olimpieri
Location: C5.07
10:30-10:55
Internal Models of Linear Type Theories (abstract) 25 min
Sam Speight1, Niels van der Weide2,3
1 University of Birmingham
2 Radboud University
3 Eötvös Loránd University
10:55-11:20
Linear and Monoidal Differential Turing Categories (abstract) 25 min
Isaiah Hilsenrath1, Jean-Simon Pacaud Lemay2
1 University of Pennsylvania
2 Macquarie University
10:30-11:00 Coffee Break MW1
Location: C5.01
10:30-11:00 Coffee Break LLM-Solve
Location: C5.08
10:30-11:00 Coffee Break ModRef
Location: C3.02
10:30-11:00 Coffee Break LSFA
Location: C4.07
10:30-12:00 Verification and Model Checking OVERLAY
Session Chair:
Nicola Gigante
Location: C1.04
10:30-11:00
Progress-Aware Runtime Monitoring of Abstract Scenario Specifications (abstract) 30 min
Nelson Brüchmann1, Ishan Saxena1, Bernd Westphal1
1 German Aerospace Center (DLR)
11:00-11:30
Verified Computational Graph for Safety-Critical ML: From static model to execution semantics (abstract) 30 min
João Machado1, Ricardo Silva1, João Galego2, Eric Jenn3, Hugo Daniel Macedo4,5, Jorge Sousa Pinto4,5
1 Universidade do Minho & Critical Software, Portugal
2 ISEG Executive Education & Critical Software, Portugal
3 IRT Saint-Exupéry, Toulouse, France
4 HASLab
5 INESC TEC & Universidade do Minho, Portugal
11:30-12:00
Widest Path Games and Maximality Inheritance in Bounded Value Iteration for Stochastic Games (abstract) 30 min
Kittiphon Phalakarn1, Yun Chen Tsai1, Ichiro Hasuo1
1 National Institute of Informatics
10:30-11:00 Coffee Break NMR
Location: B1.04
10:30-11:00 Coffee Break ADU
Location: C2.05
10:30-12:30 Session 2 WPTE
Location: C5.05
10:30-11:00
An Interactive Proof Mode for Dafny Based on Back Translation of Verification Obligations (abstract) 30 min
Ștefan Ciobâcă1, K. Rustan M. Leino2, Ștefan-Alexandru Mercas1, Roxana-Mihaela Timon1
1 Alexandru Ioan Cuza University, Iasi, Romania
2 Amazon Web Services Seattle, WA, US
11:00-11:30
Improvement Theory for Probabilistic Call-by-Need (abstract) 30 min
David Sabel1, Manfred Schmidt-Schauß2
1 Hochschule RheinMain - University of Applied Sciences and Arts
2 Goethe-University Frankfurt
11:30-12:00
A Cyclic Proof System for Trace Formula Implication with Least and Greatest Fixpoints (abstract) 30 min
Takumi Sato1, Koji Nakazawa1
1 Nagoya University
12:00-12:30
Sound Rewrites for Measurement-Bearing Expressions via Token-Sensitive Enclosure Semantics (abstract) 30 min
David B. Hulak1, Arthur Freitas Ramos2, Ruy J.G.B. de Queiroz3
1 Independent Researcher
2 Microsoft
3 Centro de Informatica, Universidade Federal de Pernambuco
10:30-11:00 Coffee Break WHOOPS
Location: C1.01
10:30-11:00 Coffee Break DIALOCO
Location: C4.02
10:40-12:30 Explanations DL
Session Chair:
Christian Alrabbaa
Location: B1.03
10:40-11:00
In the Heart of the Beholder: User-Tailored Explanations for Description Logics (abstract) 20 min
Stefan Borgwardt1, Anke Hirsch2, Nina Knieriemen2, Alisa Kovtunova1
1 TU Dresden
2 Saarland University
11:00-11:20
ProofTeller: Exposing Recency Bias in LLM Reasoning and Its Side Effects on Communication (Extended Abstract) (abstract) 20 min
Mayank Jobanputra1, Alisa Kovtunova2, Brisca Balthes3, Fedor Grigoryevich Pogulskiy2, Yifan Wang1, Stefan Borgwardt2, Vera Demberg1
1 Saarland University
2 TU Dresden
3 Saarland University & Zuse School ELIZA
11:20-11:40
The More the Merrier: Combining Properties for ABox Abduction under Repair Semantics in EL_bot (abstract) 20 min
Anselm Haak1, Patrick Koopmann2, Yasir Mahmood1, Anni-Yasmin Turhan1
1 Paderborn University
2 Vrije Universiteit Amsterdam
11:40-12:00
LPX-AbPoint: Abduction and Pinpointing for Explaining Link Predictions on DL Knowledge Graphs (abstract) 20 min
Roberto Barile1, Claudia d'Amato1, Nicola Fanizzi1
1 Dipartimento di Informatica, Università di Bari
12:00-12:20
Introducing Prism Embeddings: A New Family of Geometric Ontology Embeddings (abstract) 20 min
Giuseppe Federico1, Mena Leemhuis2, Oliver Kutz3
1 Free university of Bozen-Bolzano -Sony AI, Barcellona
2 Institute for Symbolic AI, Johannes Kepler University, Linz
3 Free university of Bozen-Bolzano
10:40-12:20 Contributed Talks - Session 3 GALOP
Location: C5.06
10:40-11:15
Seeking the primitive categorical structure of concurrent game semantics (abstract) 35 min
Pierre Clairambault1, Hugo Paquet2
1 CNRS and Aix-Marseille Université
2 Inria & École Normale Supérieure
11:15-11:50
An Adjunction Between the Lens and the Int Construction in Categorical Game Semantics (abstract) 35 min
Sangwoo Kim1
1 The University of Tokyo, Graduate School of Mathematical Sciences
11:50-12:20
Finitely partitioned trees (work in progress) (abstract) 30 min
Paul Blain Levy1
1 University of Birmingham, UK
10:40-11:10 Coffee Break LCC
Location: C4.06
10:40-12:20 Contributed Talks 2 JoeFest
Session Chair:
Hana Chockler
Location: C4.01
10:40-11:00
Proof-theoretic approach to representable qualitative probabilities (abstract) 20 min
Ondrej Majer1, Paolo Baldi2
1 Institute of Philosophy, Czech Academy of Sciences
2 University of Salento
11:00-11:20
Cheap Talk Games with Dempster-Shafer Priors (abstract) 20 min
Krishna Manoorkar1, Willem Conradie2, Alessandra Palmigiano3, Nachoem Wijnberg4, Apostolos Tzimoulis5
1 Institute of Computer Science, Czech Academy of Sciences, Czechia
2 School of Mathematics, University of the Witwatersrand, Johannesburg
3 School of Business and Economics, Vrije Universiteit Amsterdam
4 Faculty of Economics and Business, University of Amsterdam
5 Deaprtment of Computer Science, University of Luxembourg, Luxembourg
11:20-11:40
Answer Set Programming for Actual Causality: The Role of Negations (abstract) 20 min
Thomas Eiter1, Tobias Geibinger1, Xinghan Liu1
1 TU Wien
11:40-12:00
Causality, Harm, and Elections (abstract) 20 min
Jerome Lang1
1 LAMSADE, CNRS, Universit e Paris-Dauphine PSL
12:00-12:20
Computing Actual Causes for Neural Network Predictions under Structured Causal Inputs (abstract) 20 min
Jannick Strobel1, Muqsit Azeem2, Stefan Leue2
1 University of Konstanz
2 University of Kosntanz
10:50-12:10 Dependency QBF QBF
Session Chair:
Leroy Chew
Location: C5.02
10:50-11:10
Strengthening the Implication-Free DQBF Dependency Scheme (abstract) 20 min
Ralf Wimmer1, Christoph Scholl2, Franz-Xaver Reichl2
1 Altair Engineering GmbH
2 University of Freiburg
11:10-11:30
Symmetry Breaking in Dependency Quantified Boolean Formulas (abstract) 20 min
Paul Seip1, Clemens Hofstadler1, Manuel Kauers1, Martina Seidl1
1 JKU Linz
11:30-11:50
On the Practicality of DQBF Solving for Succinctly Represented Graph Problems (abstract) 20 min
Chen-Ching Nieh1, Chi-Kit Ng1, Jie-Hong R. Jiang1, Tony Tan2
1 National Taiwan University
2 University of Liverpool
11:50-12:10
QBF Gallery (abstract) 20 min
Martina Seidl1, Cynthia Peyrer1, Luca Pulina2
1 JKU
2 University of Sassari
11:00-11:30 Coffee Break I LAMAS-SR
Location: B2.01
11:00-12:30 Part 2 LLM4R
Location: B2.02
11:00-12:00 Invited Talk: Stefan Szeider WHOOPS
Location: C1.01
11:00-12:30 Arguing in dynamic and uncertain situations: From theoretical insights to application (tutorial) ADU
Session Chair:
Jean-Guy Mailly
Location: C2.05
11:00-12:30 Session 6 LSFA
Location: C4.07
11:00-11:30
A Machine-checked Proof of Consistency for Impredicative Pure Type Systems (abstract) 30 min
Sebastián Urciuoli1
1 Universidad ORT Uruguay
11:30-12:00
Templates in Rewriting Induction (abstract) 30 min
Kasper Hagens1, Cynthia Kop1
1 Radboud University
12:00-12:30
Computer Science as Infrastructure: the Spine of the Lean Computer Science Library (CSLib) (abstract) 30 min
Christopher Henson1, Fabrizio Montesi2
1 Drexel University
2 University of Southern Denmark
11:00-12:40 Session 2 - LLMs for Constraint Model Generation LLM-Solve
Location: C5.08
11:00-11:20
Learn2Zinc: Fine-tuning Small Language Models for Text-to-Model Translation in MiniZinc (abstract) 20 min
Karthik Uppuluri1, Serdar Kadioglu1
1 Fidelity Investments
11:20-11:40
CP-SynC: Multi-Agent Zero-Shot Constraint Modeling in MiniZinc with Synthesized Checkers (abstract) 20 min
Yuliang Song1, Eldan Cohen1
1 University of Toronto
11:40-12:00
Using LLMs to Generate CoPTIC Constraint Models (abstract) 20 min
Martin Mariusz Lester1
1 University of Reading
12:00-12:20
Solving MaxSAT Problems from Natural Language Descriptions with LLMs and PySAT (abstract) 20 min
Pedro Orvalho1, Marta Kwiatkowska2, Guillem Alenyà3, Felip Manyà1
1 Artificial Intelligence Research Institute (IIIA), Spanish National Research Council (CSIC), Barcelona, Spain
2 Department of Computer Science, University of Oxford, Oxford, UK
3 Institut de Robòtica i Informàtica Industrial (IRI-CSIC-UPC), Barcelona, Spain
12:20-12:40
ZebraProlog: Solving the Zebra Logic Benchmark1 with the Help of Prolog and CLP(FD) (abstract) 20 min
Aladdin Ben Salah1, Étienne Lozes2, Pascal Urso2
1 Ensimag
2 Université Côte d'Azur
11:00-11:40 Session 2: Puzzles ModRef
Location: C3.02
11:00-11:20
An Interactive Application to Solve Sudoku Variant Puzzles (abstract) 20 min
Helmut Simonis1, Luis Quesada1
1 Insight Centre, University College Cork
11:20-11:40
Scaling Sudoku as a Constraint Problem (abstract) 20 min
Mikael Zayenz Lagerkvist1
1 Independent researcher, Sambanova
11:00-11:30 Jakub Gajarský MW1
Location: C5.01
11:00-11:30
How to Present Your Work Without Losing the Audience (abstract) 30 min
Jakub Gajarsky1
1 Masaryk University
11:00-12:30 ASP NMR
Location: B1.04
11:00-11:30
Knowledge Engineering and Reasoning with Answer Set Programs and Conditional Belief Bases (abstract) 30 min
Gabriele Kern-Isberner1, Alexander Hahn1, Andre Thevapalan2, Christoph Beierle3, Lars-Phillip Spiegel3, Marco Wilhelm4
1 Technische Universität Dortmund
2 Institute of Medical Biostatistics, Epidemiology and Informatics (IMBEI), University Medical Center of the Johannes Gutenberg University, Mainz
3 FernUniversität Hagen
4 Federal Institute for Occupational Safety and Health
11:30-12:00
Applying Answer Set Programming with fuzzy membership functions: a case study (abstract) 30 min
Ilenia Galati1, Francesco Scarcello1, Luca Ferragina1, Lorena Gullone1
1 University of Calabria
12:00-12:30
A Definitional Fragment of Temporal Equilibrium Logic: from Temporal Programs to Compact Automata (abstract) 30 min
Mantas Šimkus1
1 TU Wien, Austria
11:00-11:40 Invited Talk 3 PC
Session Chair:
Massimo Lauria
Location: C5.09
11:00-11:40
Provable Reductions (abstract) 40 min
Noah Fleming1
1 Lund University
11:00-12:00 ThEdu Session 2 ThEdu
Session Chair:
Walther Neuper
Location: C2.01
11:00-11:30
Addressing, with the concourse of CAS, diverse open issues dealing with the manifold and subtle concept of geometric locus (abstract) 30 min
Rosario Rubio1, Tomás Recio1, María Pilar Vélez Melón1
1 Universidad Nebrija
11:30-12:00
Teaching Isabelle to Secondary-School Students: A Case Study (abstract) 30 min
Daniel Luckhardt1, Paul Baumgartner2
1 None
2 Gymnasium Mariano-Josephinum
11:00-11:50 Session 2: Optimization PoS
Location: C4.08
11:00-11:20
Revising the Implicit Hitting Set Solver MaxHS (abstract) 20 min
Edgar Justus1, Jakob Berg1, André Schidler1, Mathias Fleury1, Tobias Paxian1, Armin Biere1
1 University of Freiburg
11:20-11:40
Aperture: an Anytime, Complete, and Incremental Solver for MaxSAT and Beyond (Work-in-Progress) (abstract) 20 min
Alexander Nadel1, Yam Slonimski1, Ofer Strichman1
1 Faculty of Data and Decision Sciences, Technion
11:40-11:50
Smallest MUS Extraction via Branch-and-Cut (abstract) 10 min
Konstantin Sidorov1, Jacobus G. M. van der Linden1
1 Delft University of Technology
11:00-12:30 Session 5 CPSATDP
Location: C1.03
11:00-12:00 Contributed talks DIALOCO
Location: C4.02
11:00-11:30
Scalable Graphical Framework for Fermionic Computing : From premonoidality in the semantics to non-natural symmetry in the diagrammatic syntax (abstract) 30 min
Thomas Perez1, Titouan Carette2
1 INRIA, LIX, Ecole Polytechnique
2 LIX, Ecole Polytechnique
11:30-12:00
Towards a Combinatorial Representation of First-Order Bicategories (abstract) 30 min
Leo Lobski1, Ralph Sarkis1, Paul Wilson2, Fabio Zanasi1
1 University College London
2 Hellas AI
11:10-12:30 Sunday morning 2 LCC
Session Chair:
Arnold Beckmann
Location: C4.06
11:10-11:50
Characterizing levels of computational complexity by restrictions on hypothetical reasoning (abstract) 40 min
Marcel Ertel1, Eduardo Skapinakis2
1 Universität Tübingen
2 NOVA University of Lisbon
11:50-12:30
Notes on Sequential Theories (abstract) 40 min
Juvenal Murwanashyaka1
1 None
11:25-12:40 S2 TLLA
Session Chair:
Olimpieri
Location: C5.07
11:25-11:50
An Algebraic View on the Linear Lambda Calculus (abstract) 25 min
Arturo De Faveri1
1 Université Paris Cité, CNRS, IRIF
11:50-12:15
The lambda calculus as a 2-dimensional operad (abstract) 25 min
Emilie Uthaiwat1
1 Aix-Marseille Université
12:15-12:40
Multicategories and representability for substructural intuitionistic modal logics (abstract) 25 min
Michel Smykalla1, Tarmo Uustalu2, Niccolò Veltri1, Cheng-Syuan Wan1
1 Tallinn University of Technology
2 Reykjavik University and Tallinn University of Technology
11:30-12:00 Anela Lolić MW1
Location: C5.01
11:30-12:00
Rethinking Soundness: From Local Rules to Global Correctness (abstract) 30 min
Anela Lolíc1
1 TU Wien
11:30-12:45 Session II LAMAS-SR
Location: B2.01
11:30-11:45
A Probabilistic Package for L-DINF: Reasoning, Resources and Action Selection in Cooperative Agents (abstract) 15 min
stefania costantini1, valentina pitoni1
1 Università di L'Aquila
11:45-12:00
Strategy Repair for Probabilistic Games (abstract) 15 min
Pierre Gaillard1,2, Fabio Patrizi1, Giuseppe Perelli1
1 Sapienza University of Rome
2 LaBRI, University of Bordeaux
12:00-12:15
Indistinguishable Agents in Decentralised POMDPs (abstract) 15 min
NAZLI NUR KARABULUT1, TANYA BRAUN1
1 University of Münster
12:15-12:30
On the Exponential Succinctness of Shannon-Uncertainty Modalities over Probabilistic Beliefs in Temporal Logic (abstract) 15 min
Michał Tomasz Godziszewski1,2
1 University of Łódź
2 Samsung AI Center Warsaw
12:30-12:45
Consensus is Strategically Insufficient: Reasoning-Trace Disagreement as a Knowledge-Representation Signal (abstract) 15 min
Michał Wawer1, Jarosław A. Chudziak2
1 Laboratory of The New Ethos, Warsaw University of Technology, Warsaw, Poland
2 Faculty of Electronics and Information Technology, Warsaw University of Technology, Warsaw, Poland
11:40-12:20 Invited Talk ModRef
Location: C3.02
11:40-12:20
Invited (abstract) 40 min
Carlos Ansótegui1
1 Lleida
11:40-12:00 Contributed Talks 5 PC
Session Chair:
Massimo Lauria
Location: C5.09
11:40-12:00
Proof Systems Based on Structured Circuits (abstract) 20 min
Matthäus Micun1, Christoph Berkholz1
1 Technical University of Ilmenau
11:50-12:20 Session 3: Enumeration & Counting PoS
Location: C4.08
11:50-12:10
Extending CDCL-based Model Enumeration with Weights (abstract) 20 min
Giuseppe Spallitta1, Moshe Y. Vardi1
1 Rice University
12:10-12:20
Formalization of Component-Based Projected Model Counting (abstract) 10 min
Kenta Ito1, Kenji Hashimoto2, Masahiko Sakai3, Hidetomo Nabeshima1
1 University of Yamanashi
2 Kagawa University
3 Nagoya University
12:00-14:00 Lunch PEG
Location: C3.01
12:00-14:00 Lunch ThEdu
Location: C2.01
12:00-14:00 Lunch PC
Location: C5.09
12:00-14:00 Lunch OVERLAY
Location: C1.04
12:00-12:30 Tommie Meyer MW1
Location: C5.01
12:00-12:30
How to Manage Your Supervisor (abstract) 30 min
Tommie Meyer1
1 University of Cape Town
12:00-13:30 Lunch WHOOPS
Location: C1.01
12:00-14:00 Lunch TERMGRAPH
Location: C6.02
12:00-14:00 Lunch GOE
Location: C2.05
12:00-14:00 Lunch DIALOCO
Location: C4.02
12:10-14:00 Lunch QBF
Location: C5.02
12:20-14:00 Lunch PoS
Location: C4.08
12:20-13:50 Lunch Break ModRef
12:20-13:50 Lunch JoeFest
Location: C4.01
12:20-14:30 Lunch GALOP
Location: C5.06
12:30-14:00 Lunch CPSATDP
Location: C1.03
12:30-14:00 Lunch LCC
Location: C4.06
12:30-14:00 Lunch DL
Location: B1.03
12:30-14:00 Lunch LSFA
Location: C4.07
12:30-14:00 Lunch MW1
Location: C5.01
12:30-14:00 Lunch NMR
Location: B1.04
12:30-14:00 Lunch ADU
Location: C2.05
12:30-14:30 Lunch WPTE
Location: C5.05
12:30-14:30 Lunch LLM4R
Location: B2.02
12:40-14:00 Lunch LLM-Solve
Location: C5.08
12:40-14:00 Lunch TLLA
Location: C5.07
12:45-14:00 Lunch LAMAS-SR
Location: B2.01
13:30-14:30 Invited Talk: Haniel Barbosa WHOOPS
Location: C1.01
13:50-15:05 In-Person Invited Talks JoeFest
Session Chair:
Sander Beckers
Location: C4.01
13:50-14:05
Invited Talk (abstract) 15 min
Hana Chockler1
1 King’s College London
14:05-14:20
Invited Talk (abstract) 15 min
Moshe Vardi1
1 Rice University
14:20-14:35
Invited Talk (abstract) 15 min
Ron van der Meyden1
1 University of New South Wales
14:35-14:50
Invited Talk (abstract) 15 min
Dov Samet1
1 Tel Aviv University
14:50-15:00
Invited Talk (abstract) 10 min
Gerhard Lakemeyer1
1 RWTH Aachen University
15:00-15:05
Invited Talk (abstract) 5 min
Hector Geffner1
1 RWTH Aachen University
13:50-14:30 Session 3: Automated Generation and Reformulation ModRef
Location: C3.02
13:50-14:10
Computing Gadgets (abstract) 20 min
Josep Alòs1, Carlos Ansótegui1, Supratik Chakraborty2, Eduard Torres1
1 Universitat de Lleida
2 IIT Bombay
14:10-14:30
Towards Automated Generation of Benchmark Instances with Diverse Solver Performance (abstract) 20 min
Tianchen Wu1, Ian Miguel1, Nguyen Dang1
1 University of St Andrews
14:00-14:50 Talk 2 LLM-Solve
Location: C5.08
14:00-14:30 Sandra Kiefer MW1
Location: C5.01
14:00-14:30
On the Relativity of Expertise (abstract) 30 min
Sandra Kiefer1
1 Oxford University
14:00-15:30 Argumentation 2 NMR
Location: B1.04
14:00-14:30
Ranking-based Semantics for Incomplete Argumentation Frameworks (abstract) 30 min
Kenneth Skiba1, Jean-Guy Mailly2, Jérôme Delobelle3
1 Artificial Intelligence Group - University of Hagen
2 IRIT, université Toulouse Capitole
3 Universite Paris Cite, LIPADE, F-75006 Paris, France
14:30-15:00
On the Complexity of the Discussion-based Semantics in Abstract Argumentation (abstract) 30 min
Lydia Blümel1, Kai Sauerwald1, Kenneth Skiba1, Matthias Thimm1
1 University of Hagen
15:00-15:30
On Algorithmic Shortcuts for Skeptical Preferred Reasoning in Abstract Argumentation (abstract) 30 min
Lars Bengel1, Julian Sander1, Matthias Thimm1
1 Artificial Intelligence Group, University of Hagen
14:00-15:00 Invited Talk OVERLAY
Session Chair:
Nicola Gigante
Location: C1.04
14:00-15:00
Preservation Theorems: From Tarski to Graph Neural Networks (abstract) 60 min
Przemyslaw Walega1
1 University of Oxford
14:00-14:40 QBF Joint Invited Talk PC
Session Chair:
Lea Kasche
Location: C5.09
14:00-14:40
The Complexity of Quantified CDCL (abstract) 40 min
Benjamin Böhm1
1 Friedrich Schiller University Jena
14:00-15:00 Lison Blondeau-Patissier (Invited) TLLA
Session Chair:
Olimpieri
Location: C5.07
14:00-15:00
Game Semantics of Extensional Taylor Expansion (abstract) 60 min
Lison Blondeau-Patissier1
1 ENS Lyon
14:00-15:30 ThEdu Session 3 ThEdu
Session Chair:
Jørgen Villadsen
Location: C2.01
14:00-14:30
The Educational Proof Assistant Waterproof in an Introductory Proof Course: Proof Construction and Learning Processes (abstract) 30 min
Pim Otte1, Rogier Bos1, Johan Commelin1, Jim Portegies2
1 Utrecht University
2 Eindhoven University Of Technology
14:30-15:00
Waterproof River: An AI Tutor for Waterproof (abstract) 30 min
Dick Arends1, Pim Otte2, Mikołaj Pujanek3, Jim Portegies3
1 Radboud University Nijmegen
2 Eindhoven University Of Technology & Utrecht University
3 Eindhoven University Of Technology
15:00-15:30
A Readable Formalization of Propositional Logic in Lean with Yalep (abstract) 30 min
Sébastien Lahaye1
1 IRIF
14:00-15:10 Session 4: Exploring Solvers and Instances PoS
Location: C4.08
14:00-14:20
SAT-IT: an Online Interactive SAT Tracer (abstract) 20 min
Wilber Bermeo Quito1, Pau Ferrer i Font1, Jordi Coll Caballero1, Villaret Ausellé Mateu1
1 Universitat de Girona
14:20-14:40
Exploring 3-CNF Formulas Generated From Partial Steiner Triple Systems (abstract) 20 min
Wyatt Olson1, Jared Soundy1, Justin Schroeder1
1 Dakota State University
14:40-15:00
The Multi-Skill Project Scheduling Problem: To SAT, or to PB, that is the question. (abstract) 20 min
Wilber Bermeo Quito1, Jordi Coll Caballero1, Villaret Ausellé Mateu1
1 Universitat de Girona
15:00-15:10
Orthologic for SAT Solving (abstract) 10 min
Simon Guilloud1, Vladislas De Haldat Du Lys2, Viktor Kun\v{c}ak1
1 EPFL
2 ENS Paris-Saclay
14:00-15:00 Stéphane Demri 'Strategic Reasoning Under Limited Resource Production' LAMAS-SR
Location: B2.01
14:00-15:00
Strategic Reasoning Under Limited Resource Production (abstract) 60 min
Stéphane Demri1
1 CNRS, ENS Paris-Saclay
14:00-15:40 QBF Proof Complexity (PC and QBF Joint Session) QBF
Session Chair:
Lea Kasche
Location: C5.02
14:00-14:40
Invited Talk - The Complexity of Quantified CDCL (abstract) 40 min
Benjamin Böhm1
1 University of Jena
14:40-15:00
Quantified CDCL and Dependency Schemes: A proof-theoretic study (abstract) 20 min
Abhimanyu Choudhury1, Meena Mahajan2
1 IIT Bombay
2 The Institute of Mathematical Sciences, Homi Bhabha National Institute
15:00-15:20
A Boolean static proof system for Quantified Boolean Formulas. (abstract) 20 min
Jan Johannsen1, Marc Vinyals2
1 LMU
2 University of Auckland
15:20-15:40
A QBF-like Fragment of EPR (abstract) 20 min
Leroy Chew1, Mikoláš Janota1, Martin Suda1, Miroslav Olšák1
1 Czech Institute of Informatics Robotics and Cybernetics
14:00-15:30 Tutorial on Geometric Ontology Embeddings - Part 1 GOE
Location: C2.05
14:00-16:00 Session 7 LSFA
Session Chair:
Mauricio Ayala-Rincón
Location: C4.07
14:00-15:00
NuITP: An Inductive Theorem Prover for Maude (abstract) 60 min
Santiago Escobar1
1 Universidad Politécnica de Valencia
15:00-15:30
Multiparty Session Types for GDPR Purpose Compliance (abstract) 30 min
Evangelia Vanezi1, Dimitrios Kouzapas1, Anna Philippou1
1 University of Cyprus
15:30-16:00
Basic Model Theory for Path Predicate Modal Logic (abstract) 30 min
Raul Fervari1, Santiago Figueira2, Gabriel Goren-Roig2, Leonardo Torres3
1 CONICET and Universidad Nacional de Córdoba, Argentina
2 CONICET and Universidad de Buenos Aires, Argentina
3 IMDEA Software Institute, Spain
14:00-15:00 Temporal Extensions DL
Session Chair:
Andrea Mazzullo
Location: B1.03
14:00-14:20
Temporal EL and Equations over Sets of Integers (abstract) 20 min
Anton Gnatenko1, Roman Kontchakov2
1 DI ENS, ENS, CNRS, PSL University & Inria, Paris, France
2 Birkbeck, University of London
14:20-14:40
Towards Monitoring of Patients with Bipolar Disorder (Extended Abstract) (abstract) 20 min
Greta Adamo1, Roman Kontchakov2, Davide Lanti1, Kajsa A. Pedersen3, Andrey Rivkin3
1 Free University of Bozen-Bolzano
2 Birkbeck, University of London
3 Technical University of Denmark
14:40-15:00
Finding New Boxes for the Diamonds: On the Behavior of Convex Modal Operators for Temporal Description Logics (abstract) 20 min
Stefan Borgwardt1, Alisa Kovtunova1
1 TU Dresden
14:00-15:00 Second invited talk DIALOCO
Location: C4.02
14:00-15:00
Proof Nets and Combinatorial Proofs — Hilbert's 24th Problem in the 21st Century (abstract) 60 min
Lutz Straßburger1
1 Inria & LIX
14:00-15:20 Sunday afternoon 1 LCC
Session Chair:
Heribert Vollmer
Location: C4.06
14:00-14:40
On the Expressive Power of Ontology-Mediated Queries: Capturing coNP (abstract) 40 min
Sanja Lukumbuzya1, Magdalena Ortiz1, Mantas Simkus1
1 TU Wien
14:40-15:20
Counting Complexity of ASP (abstract) 40 min
Max Bannach1, Johannes Klaus Fichte2, Johanna Groven2, Markus Hecher3
1 European Space Agency
2 Linköping University
3 CNRS, CRIL
14:00-15:00 Invited Talk CPSATDP
Location: C1.03
14:30-15:30 Joint keynote talk with WPTE - Nikos Tzevelekos GALOP
Location: C5.06
14:30-15:30
Concurrency in linear and non-linear game semantics (abstract) 60 min
Nikos Tzevelekos1
1 Queen Mary University of London
14:30-15:30 Session 3 WPTE
Location: C5.05
14:30-15:30
Fully Abstract Normal Form Bisimulation for Call-by-Value PCF (abstract) 60 min
Nikos Tzevelekos1
1 Queen Mary University of London
14:30-15:30 Papers 2 WHOOPS
Location: C1.01
14:30-14:50
Proof Logging for Nonlinear Boundary-Value Solvers: A Falkner-Skan Case Study (abstract) 20 min
Karthikhesvaran S. S.1
1 Indiana University Bloomington
14:50-15:10
Certifying Algorithms for Nonlinear Real Arithmetic (abstract) 20 min
Tomaz Mascarenhas1, Haniel Barbosa1
1 Universidade Federal de Minas Gerais
15:10-15:30
Pseudo-Boolean Blasting for the SMT Theory of Bit-Vectors (abstract) 20 min
Pedro Saccomani1, Haniel Barbosa2
1 Universidade Federal de Minas Gerais
2 Universidade Federal de MInas Ferais
14:30-15:30 PhD Students Panel MW1
Location: C5.01
14:30-15:30
PhD Students Panel (abstract) 60 min
Neha Rino1, Vincent Moreau2, Yoàv Montacute3
1 University of Warwick
2 Tallinn University of Technology
3 NII Tokyo
14:30-15:20 TBC ModRef
Location: C3.02
14:30-15:20
TBC (abstract) 50 min
Jordi Coll1, Felix Ulrich-Oltean2
1 Universitat de Girona
2 University of York
14:40-15:40 QBF Joint Contrib Talks 1 PC
Session Chair:
Lea Kasche
Location: C5.09
14:40-15:00
Quantified CDCL and Dependency Schemes: A proof-theoretic study (abstract) 20 min
Abhimanyu Choudhury1, Meena Mahajan1
1 IMSc Chennai
15:00-15:20
A Boolean static proof system for Quantified Boolean Formulas (abstract) 20 min
Jan Johannsen1, Marc Vinyals2
1 Ludwig-Maximilians-Universität München
2 University of Auckland
15:20-15:40
A QBF-like Fragment of EPR (abstract) 20 min
Leroy Chew1, Mikoláš Janota2, Martin Suda2, Miroslav Olšák3
1 TU Wien
2 CIIRC, Prague
3 Charles University, Prague
14:50-15:30 Session 3 - Formal Methods for LLMs LLM-Solve
Location: C5.08
14:50-15:10
Escaping Local Optima in Prompt Optimisation via Failure-Driven Refinement and History-Guided Restarting (abstract) 20 min
Ekaterina Averkova1, Nikita Kulin1
1 ITMO University
15:10-15:30
Controlling Agent Behavior with Policy-as-Code via Autoformalization (abstract) 20 min
Adam Mondl1, Matthew Maisel1, John H. Brock1
1 Sondera
15:00-15:30 Coffee Break OVERLAY
Location: C1.04
15:00-15:25 S3.1 TLLA
Session Chair:
Olimpieri
Location: C5.07
15:00-15:25
Generating Functions for Probabilistic Programs via the Weighted Relational Model of Linear Logic (abstract) 25 min
Ugo Dal Lago1, Guido Fiorillo2, Paolo Pistone2
1 University of Bologna and INRIA Sophia Antipolis
2 Université Claude Bernard Lyon 1
15:00-15:15 Coffee Break II LAMAS-SR
Location: B2.01
15:00-15:30 Session 6 CPSATDP
Location: C1.03
15:00-15:30 Contributed talks DIALOCO
Location: C4.02
15:00-15:30
Function-Constructor Nets and their Semantics (abstract) 30 min
Marc Thatcher1
1 University of Sussex
15:05-15:35 Coffee Break JoeFest
Location: C4.01
15:10-15:50 Coffee Break PoS
Location: C4.08
15:10-16:10 All about DL-Lite DL
Session Chair:
Davide Lanti
Location: B1.03
15:10-15:30
Coherence Update Semantics for Horn DL-Lite through Stratified Datalog¬ Rewriting (abstract) 20 min
Stefan Borgwardt1, Duy Nhu1
1 TU Dresden
15:30-15:50
A Horn Extension of DL-Lite with NL data complexity (abstract) 20 min
Janos Arpasi1, Bartosz Jan Bednarczyk2, Magdalena Ortiz1
1 TU Wien
2 TU Wien & University of Wrocław
15:50-16:10
How Hard Is It to Decide if a Fact Is Relevant to a Query? (Extended Abstract) (abstract) 20 min
Meghyn Bienvenu1, Diego Figueira1, Pierre Lafourcade1
1 CNRS & University of Bordeaux
15:15-16:30 Session III LAMAS-SR
Location: B2.01
15:15-15:30
Rational Capability in Concurrent Games (abstract) 15 min
Yinfeng Li1, Emiliano Lorini1, Munyque Mittelmann2
1 IRIT, CNRS, University of Toulouse
2 Université Sorbonne Paris Nord (LIPN)
15:30-15:45
Concurrent Multi-Agent Systems -- A Tale of Two Representations (abstract) 15 min
Senthil Rajasekaran1, Moshe Y. Vardi2
1 Université Libre de Bruxelles
2 Rice University
15:45-16:00
Towards Alternating-time Temporal Logic with Uncertainty and Fuzziness (abstract) 15 min
Churn-Jung Liau1
1 Academia Sinica
16:00-16:15
Strategies in Sabotage Games: Temporal and Epistemic Perspectives (abstract) 15 min
Nina Gierasimczuk1, Katrine B.P. Thoft1
1 Technical University of Denmark
16:15-16:30
Logics for Modelling and Reasoning About Concurrent Multiplayer Games with Admissibility of Action Profiles (abstract) 15 min
Valentin Goranko1, Wei Wang2
1 Stockholm University
2 Tsinghua University
15:20-15:50 Coffee Break ModRef
Location: C3.02
15:20-15:50 Coffee Break LCC
Location: C4.06
15:25-16:00 Coffee Break TLLA
Location: C5.07
15:30-16:30 Coffee Break ThEdu
Location: C2.01
15:30-16:30 Coffee Break PEG
Location: C3.01
15:30-16:00 Coffee Break LLM-Solve
Location: C5.08
15:30-16:00 Coffee Break MW1
Location: C5.01
15:30-16:30 Explainability OVERLAY
Session Chair:
Nicola Gigante
Location: C1.04
15:30-16:00
AIRD: Auditable Composite Distillation on a Sparse Tactical Frontier (abstract) 30 min
Derun Ai1, Laurent Perrussel1
1 IRIT - Université Toulouse Capitole, France
16:00-16:30
Explaining Visual Models with Logic and Concept-Part Networks (abstract) 30 min
Mathilde Bonin1, Sergio Mover1
1 Ecole Polytechnique
15:30-16:00 Coffee Break NMR
Location: B1.04
15:30-16:30 Coffee Break LLM4R
Location: B2.02
15:30-16:00 Coffee Break WHOOPS
Location: C1.01
15:30-16:00 Coffee Break WPTE
Location: C5.05
15:30-16:30 Coffee Break ADU
Location: C2.05
15:30-16:00 Coffee Break GOE
Location: C2.05
15:30-16:30 Coffee Break TERMGRAPH
Location: C6.02
15:30-16:30 Coffee Break CPSATDP
Location: C1.03
15:30-16:00 Coffee Break GALOP
Location: C5.06
15:30-16:00 Coffee Break DIALOCO
Location: C4.02
15:35-17:00 Pre-recorded Invited Talks JoeFest
Session Chair:
Hana Chockler
Location: C4.01
15:35-17:00
Pre-recorded Videos (abstract) 85 min
Various Friends1
1 placeholder
15:40-16:30 Coffee Break PC
Location: C5.09
15:40-16:10 Coffee Break QBF
Location: C5.02
15:50-16:50 Session 5: SAT Solver Technology PoS
Location: C4.08
15:50-16:10
Improving Local Search and adding DDFW to Kissat and CaDiCaL (abstract) 20 min
Florian Pollitt1, Mathias Fleury1, Armin Biere1, Lea Hohl1, Johannes Gröber1, Jakob Peterson1, Rico Andris1
1 University of Freiburg
16:10-16:30
NobleCount: Revisiting a Forgotten Data Structure for Local Search in SAT (abstract) 20 min
Yogev Shalmon1, Alexander Nadel1, Ofer Strichman1
1 Faculty of Data and Decision Sciences, Technion
16:30-16:40
ams-dist: A Scalable Distributed Hybrid Solver for Hard Combinatorial Problems (abstract) 10 min
Maxim Zhulin1, Piyush Jha1, Zhengyu Li1, Richard Vuduc1, Vijay Ganesh1
1 Georgia Institute of Technology
16:40-16:50
MIGSat: A Majority Inverter Graph SAT Solver (abstract) 10 min
Yuanda Liu1, Vijay Ganesh1
1 Georgia Institute of Technology
15:50-17:00 Session 4: Applications ModRef
Location: C3.02
15:50-16:00
Novel Pair- and Topic-Swapping (abstract) 10 min
Frej Knutar Lewander1, Jennifer Gross1, María Andreína Francisco Rodríguez1
1 Uppsala University
16:00-16:20
No More Awkward Silences with Table Talk Tuning (abstract) 20 min
Martin Butler1, Mikael Zayenz Lagerkvist2
1 Toptracer
2 Independent researcher, Sambanova
16:20-16:40
A Simple Yet Efficient Lifted Formulation for Hard-to-Ground Planning Problems (abstract) 20 min
Miquel Bofill1, Cristina Borralleras2, Josu Oca1
1 Universitat de Girona
2 Universitat de Vic - Universitat Central de Catalunya
16:40-17:00
Solution checking with CPMpy (abstract) 20 min
Hendrik Bierlee1, Tias Guns1
1 KU Leuven
15:50-17:00 Sunday afternoon 2 LCC
Session Chair:
Heribert Vollmer
Location: C4.06
15:50-16:50
Proof complexity of QBF: relations to circuits and computationally hard problems (abstract) 60 min
Olaf Beyersdorff1
1 Jena
16:50-17:00
Closing (abstract) 10 min
Isabel Oitavem1, Vollmer Heribert2
1 Lisbon
2 Hannover
16:00-17:40 Contributed Talks - Session 4 GALOP
Location: C5.06
16:00-16:35
Takahashi's Gambit: Avoiding Context Lemmas in Operational Game Semantics (abstract) 35 min
Adrienne Lancelot1
1 University of Bologna
16:35-17:10
Unbounded data nesting for loops in higher-order programs (abstract) 35 min
Adriana Baldacchino1, Andrzej Murawski2
1 University of Birmingham
2 University of Oxford
17:10-17:40
Energy Games for Generalized Equivalence Checking (abstract) 30 min
Benjamin Bisping1
1 Télécom SudParis, Institut Polytechnique de Paris
16:00-17:30 Contributed talks DIALOCO
Location: C4.02
16:00-16:30
Remarks on proof nets as combinatorial maps (abstract) 30 min
Lê Thành Dũng (Tito) Nguyễn1,2
1 CNRS
2 Aix-Marseille Univ.
16:30-17:00
On the role of connectivity in Linear Logic proofs (abstract) 30 min
Raffaele Di Donna1, Lorenzo Tortora de Falco2
1 Université Paris Cité (IRIF), Università Roma Tre
2 Università Roma Tre
17:00-17:30
Representing non-associativity in effectful situation : String diagrams and sequential proof-nets (abstract) 30 min
Éléonore Mangel1, Paul-André Melliès2, Guillaume Munch-Maccagnoni3
1 Univ. Paris Cité, CNRS, INRIA
2 CNRS, Univ. Paris Cité, INRIA
3 INRIA, LS2N CNRS
16:00-16:30 Coffee Break LSFA
Location: C4.07
16:00-17:20 Session 4 - LLMs for Improving Solvers and Models LLM-Solve
Location: C5.08
16:00-16:20
Improving Constraint Models with LLM Agents (abstract) 20 min
Florentina Voboril1, Stefan Szeider1
1 TU Wien
16:20-16:40
LLM-Guided Constraint Model Reformulation for Solving Efficiency (abstract) 20 min
Kostis Michailidis1, Dimos Tsouros2, Nguyen Dang3, Tias Guns1
1 KU Leuven
2 University of Western Macedonia
3 University of St Andrews
16:40-17:00
KissatEvolve: Controllable and Scalable Synthesis of SAT Heuristics with Densely Annotated Memory Bank (abstract) 20 min
Meru Gopalan1, Jialin Lu2, Jialin Song2, Shimin Zhang1, Hieu Nguyen1, Wuyang Chen2, Vijay Ganesh1
1 Georgia Institute of Technology
2 Simon Fraser University
17:00-17:20
Can LLMs Build a MaxSAT Solver from Papers? The CoreForge Experience (abstract) 20 min
Ruben Martins1
1 Carnegie Mellon University
16:00-16:30 Nada Amin MW1
Location: C5.01
16:00-16:30
Follow the Fun (abstract) 30 min
Nada Amin1
1 Harvard University
16:00-17:00 Planning NMR
Location: B1.04
16:00-16:30
Towards Defeasible Reasoning about Actions and their Effects (abstract) 30 min
Jonas Philipp Haldimann1, Thomas Meyer1, Mantas Šimkus2
1 University of Cape Town and CAIR
2 TU Wien
16:30-17:00
On Action Reversibility in Lifted Planning (abstract) 30 min
Michael Morak1, Lukáš Chrpa2, Jakub Med2, Wolfgang Faber1
1 University of Klagenfurt
2 Czech Technical University in Prague
16:00-17:15 S3.2 TLLA
Session Chair:
Olimpieri
Location: C5.07
16:00-16:25
Semi-quantitative semantics (abstract) 25 min
Lê Thành Dũng (Tito) Nguyễn1,3, Vincent Moreau2
1 CNRS
2 Tallinn University of Technology
3 Aix-Marseille Univ.
16:25-16:50
The Reasonable Effectiveness of Linear Logic in Quantitative Methods (abstract) 25 min
Matteo Capucci1,2
1 University of Strathclyde
2 Independent Researcher
16:50-17:15
Syntactic linearity and Linear hyperdoctrines for second-order intuitionistic Linear Logic (abstract) 25 min
Alejandro Díaz-Caro1,5, Malena Ivnisky3,4, Octavio Malherbe2
1 Université de Lorraine, Inria
2 Universidad de la República, FIng, Uruguay
3 Universidad de Buenos Aires, DC
4 ICC, Argentina & Universidad de la República, FIng, Uruguay
5 LORIA, France & Universidad de la República, FIng, Uruguay
16:00-17:30 Tutorial on Geometric Ontology Embeddings - Part 2 GOE
Location: C2.05
16:00-17:30 Session 4 WPTE
Location: C5.05
16:00-16:30
On Comparing Python Programs Based on Differences in Rewrite Sequences to Support Grading Programming Exercises (abstract) 30 min
Misaki Kojima1, Naoki Nishida1
1 Nagoya University
16:30-17:00
Tactic-driven code fusion (abstract) 30 min
Katarzyna Marek1, Clément Pit Claudel1
1 EPFL
17:00-17:30
Business meeting (abstract) 30 min
Naoki Nishida1
1 Nagoya University
16:00-18:00 Papers 3 WHOOPS
Location: C1.01
16:00-16:20
Proof Logging for (Re)Encoding (abstract) 20 min
Marijn Heule1
1 Carnegie Mellon University
16:20-16:40
End-to-End Verification for Constraint Programming: Closing the Encodings Gap (abstract) 20 min
Wietze Koops1, Ciaran McCreesh2, Matthew J. McIlree2, Magnus O. Myreen3, Jakob Nordström4, Philip Rodgers2, Yong Kiam Tan5, Wei-Lin Wu6
1 Lund University and University of Copenhagen
2 University of Glasgow
3 Chalmers University
4 University of Copenhagen and Lund University
5 Nanyang Technological University and Singapore Institute for Infocomm Research
6 Singapore Institute for Infocomm Research
16:40-17:00
Certificate-Based Propagation: Foundations for Correct Propagator Design (abstract) 20 min
Maarten Flippo1, Imko Marijnissen1, Emir Demirović1
1 Delft University of Technology
17:00-17:20
Generalised Clause Learning for Constraint Programming (abstract) 20 min
Justin Pearson1
1 Uppsala universitet
17:20-17:40
How can hard can multiplication be? (abstract) 20 min
Matthew J. McIlree1, Ciaran McCreesh1
1 University of Glasgow
17:40-18:00
Discussion and Closing (abstract) 20 min
Ciaran McCreesh1
1 University of Glasgow
16:10-17:30 QBF Counting, Sampling and Synthesis QBF
Session Chair:
Franz Reichl
Location: C5.02
16:10-16:30
On Knowledge Compilation Languages for QBFs (abstract) 20 min
Sravanthi Chede1, Vaibhav Krishan1, Swagato Sanyal2, Anil Shukla3
1 The Institute of Mathematical Sciences (A CI of Homi Bhabha National Institute), Chennai, India
2 School of Computer Science, The University of Sheffield, Sheffield, United Kingdom
3 Indian Institute of Technology Ropar, Rupnagar, India
16:30-16:50
Solution-based QBF Equivalences And How To Check Them (abstract) 20 min
Peter Pfeiffer1
1 Johannes Kepler University Linz
16:50-17:10
Exploring Toda's Theorem as a QBF Solver (abstract) 20 min
Dror Fried1, Etay Segal1, Gad E. Yaron2
1 The Open University of Israel, Ra'anana, Israel
2 The Hebrew University of Jerusalem, The Open University of Israel
17:10-17:30
Revisiting Encodings of Bounded Synthesis (abstract) 20 min
Che Cheng1, Long-Hin Fung1, Jie-Hong Roland Jiang1, Friedrich Slivovsky2, Tony Tan2
1 National Taiwan University
2 University of Liverpool
16:10-16:30 Espresso Break DL
16:30-17:30 Business Meeting DL
Location: B1.03
16:30-18:00 Session 7 CPSATDP
Location: C1.03
16:30-17:00 Coffee Break III LAMAS-SR
Location: B2.01
16:30-18:00 Session 8 LSFA
Location: C4.07
16:30-17:00
Robust Classification in ML: A Topological Semantics Approach (abstract) 30 min
Dominik Pichler1, Mirko Tagliaferri1
1 TU Wien
17:00-17:30
From Dag-Like Proofs to Boolean Circuits in Lean (abstract) 30 min
Lorenzo Saraiva1, Edward Hermann Haeusler2
1 Pontifícia Universidade Católica do Rio de Janeiro
2 Pontifícia Universidade Católica do Rio de Janeiro (PUC-Rio)
17:30-18:00
Business Meeting (abstract) 30 min
Mauricio Ayala-Rincón1
1 Universidade de Goiás
16:30-17:30 ThEdu Session 4 ThEdu
Session Chair:
Jim Portegies
Location: C2.01
16:30-17:00
Isabelle/jEdit — a Generic Frontend for Formal Mathematics (abstract) 30 min
Walther Neuper1
1 JKU University Linz
17:00-17:30
Rocq Game: A Gamified Web-Based Environment for Interactive Learning with a Proof Assistant (abstract) 30 min
Khaled Jamal Suliman1, Ján Perháč1, Samuel Novotný1
1 Technical University of Košice
16:30-16:45 Closing remarks OVERLAY
Session Chair:
Nicola Gigante
Location: C1.04
16:30-16:50 QBF Joint Contrib Talks 2 PC
Location: C5.09
16:30-16:50
A Boolean static proof system for Quantified Boolean Formulas (abstract) 20 min
Jan Johannsen1, Marc Vinyals2
1 Ludwig-Maximilians-Universität München
2 University of Auckland
16:30-17:30 Researchers Panel MW1
Location: C5.01
16:30-17:30
Researchers Panel (abstract) 60 min
Nada Amin1, Ichiro Hasuo2, Sandra Kiefer3, Tommie Meyer4
1 Harvard University
2 National Institute for Informatics
3 Oxford University
4 University of Cape Town
16:50-17:00 Short Break PoS
Location: C4.08
17:00-17:50 Session 6: Encodings PoS
Location: C4.08
17:00-17:20
Reverse-Engineering Constraint Models from CNFs: An Agentic Approach (abstract) 20 min
Johannes Fichte1, Stefan Szeider2
1 Linköping University
2 TU Wien
17:20-17:40
Coloring Queens with Thousands of Encodings (abstract) 20 min
Bernardo Subercaseaux1, Benjamin Przybocki1, Marijn Heule1
1 Carnegie Mellon University
17:40-17:50
Power Term Polynomial Algebra for Boolean Logic (abstract) 10 min
Emanuele Sansone1,2, Armando Solar-Lezama2
1 KU Leuven
2 MIT
17:00-17:30 Closing NMR
Location: B1.04
17:00-18:00 Session IV LAMAS-SR
Location: B2.01
17:00-17:15
Logic for local strategic reasoning with dynamic action contexts (abstract) 15 min
Valentin Goranko1, Fengkui Ju2
1 Stockholm University
2 Beijing Normal University
17:15-17:30
Nested conditional local strategic reasoning in Basic Strategy Logic (abstract) 15 min
Daniil Khaitovich1, Valentin Goranko2
1 ILLC, University of Amsterdam
2 Stockholm University
17:30-17:45
Subjective Reasoning About Ability Under Cooperativeness Assumptions (abstract) 15 min
Lucas Woolner1, Yves Lesperance1
1 York University
17:45-18:00
Choosing the Lens: Strategic Perspective Activation in Context-Dependent Argumentation (abstract) 15 min
Albert Sadowski1, Jarosław A. Chudziak1
1 Warsaw University of Technology
17:20-17:30 Closing remarks LLM-Solve
Location: C5.08
17:30-18:00 Business Meeting ThEdu
Session Chair:
Jørgen Villadsen
Location: C2.01
17:50-18:00 Closing PoS
Location: C4.08
17:50-18:00
Closing Remarks (abstract) 10 min
Bart Bogaerts1, Dominik Schreiber2
1 KU Leuven
2 Karlsruhe Institute of Technology
Monday, 20 July 2026
09:00-10:00 Keynote: Symbolic Coding Agents: Temporal Synthesis as a Foundation for Strategic Reasoning in Artificial Intelligence
Location: Grande Auditório
09:00-10:00
Symbolic Coding Agents: Temporal Synthesis as a Foundation for Strategic Reasoning in Artificial Intelligence (abstract) 60 min
Giuseppe De Giacomo
10:00-10:30 Coffee Break CP
Location: One01
10:00-10:30 Coffee Break CP
Location: One02
10:00-10:30 Coffee Break ICLP
Location: B2.04
10:00-10:30 Coffee Break FSCD
Location: One03
10:00-10:30 Coffee Break KR
Location: Grande Auditório
10:00-10:30 Coffee Break KR
Location: B1.03
10:00-10:30 Coffee Break KR
Location: B2.03
10:00-10:20 Coffee Break LICS
Location: B1.04
10:00-10:20 Coffee Break LICS
Location: C1.03
10:00-10:30 Coffee Break SAT
Location: JJ Laginha
10:20-10:30 Opening & welcome (room A) LICS
Location: B1.04
10:20-10:30 Opening & welcome (room B) LICS
Location: C1.03
10:30-12:30 Session 1B Automata on Infinite Words and MSO LICS
Session Chair:
Anuj Dawar
Location: C1.03
10:30-11:00
A Naturally-Colored Translation from LTL to Parity and COCOA (abstract) 30 min
Rüdiger Ehlers1, Ayrat Khalimov1
1 TU Clausthal
11:00-11:30
Layered automata: A canonical model for automata over infinite words (abstract) 30 min
Antonio Casares1, Christof Löding2, Igor Walukiewicz3
1 University of Kaiserslautern-Landau
2 RWTH Aachen University
3 CNRS, University of Bordeaux
11:30-12:00
The uniformisation of monadic second-order logic over countable ordinals (abstract) 30 min
Thomas Colcombet1, Alexander Rabinovich2
1 IRIF
2 Tel Aviv University
12:00-12:30
Automata for MSO over infinite trees with quantification over Borel sets of branches (abstract) 30 min
Mikołaj Bojańczyk1, Antonio Casares2, Sven Manthe3, Paweł Parys1
1 MIMUW, University of Warsaw
2 University of Kaiserslautern-Landau
3 University of Bonn
10:30-12:30 Session 1A Lambda Calculi and Abstract Syntax LICS
Session Chair:
Delia Kesner
Location: B1.04
10:30-11:00
A Machine-Independent, Log-Sensitive Space-Cost Measure for the Weak Lambda-Calculus (abstract) 30 min
Thibaut Balabonski1
1 Université Paris-Saclay, LMF
11:00-11:30
A Pointfree Algebraic Metatheory of Syntax-Based Systems (abstract) 30 min
francesco Gavazzo1
1 University of Padova
11:30-12:00
Oracles Just for Fan: A Robust Computational Interpretation of the Fan Theorem (abstract) 30 min
Titouan Leclercq1, Étienne Miquey1
1 Aix-Marseille Université
12:00-12:30
A Unified Treatment of Substitution for Presheaves, Nominal Sets, Renaming Sets, and so on (abstract) 30 min
Fabian Lenke1, Stefan Milius1, Henning Urbat1
1 FAU Erlangen-Nürnberg
10:30-12:00 Session A: Encodings & Preprocessing SAT
Location: JJ Laginha
10:30-11:00
Backtrackable Inprocessing (abstract) 30 min
Alexander Nadel1
1 Technion, NVIDIA
11:00-11:30
Near-Optimal Encodings of Cardinality Constraints (abstract) 30 min
Andrew Krapivin1, Benjamin Przybocki1, Bernardo Subercaseaux1
1 Carnegie Mellon University
11:30-12:00
Automated Reencoding Meets Graph Theory (abstract) 30 min
Benjamin Przybocki1, Bernardo Subercaseaux1, Marijn Heule1
1 Carnegie Mellon University
10:30-11:00 KR Opening KR
Location: Grande Auditório
10:30-12:00 Lambda Calculus FSCD
Session Chair:
Sandra Alves
Location: One03
10:30-11:00
Approximation theory for distant Bang calculus (abstract) 30 min
Kostia Chardonnet1, Jules Chouquet2, Axel Kerinec3
1 Université de Lorraine, CNRS, Inria, LORIA, F-54000 Nancy, France
2 Université d’Orléans, INSA CVL, LIFO, UR 4022, Orléans, France
3 Université Paris Est Creteil, LACL, F-94010 Créteil, France
11:00-11:30
Groups and Inverse Semigroups in Lambda Calculus (abstract) 30 min
Antonio Bucciarelli1, Arturo De Faveri1, Giulio Manzonetto1, Antonino Salibra1
1 Université Paris Cité, CNRS, IRIF
11:30-12:00
Non-Wellfounded Derivations for Intersection Subtyping with Fixpoints (abstract) 30 min
Olivier Laurent1, Jui-Hsuan Wu1
1 ENS Lyon
10:30-11:00 Opening ICLP
Location: B2.04
11:00-12:30 Block 1 (3 TPLP) ICLP
Location: B2.04
11:00-11:30
2-ASP(Q) programs with weak constraints: Complexity and efficient implementation (abstract) 30 min
Andrea Cuteri1, Giuseppe Mazzotta1, Francesco Ricca1
1 University of Calabria
11:30-12:00
Parametric Modular Answer Set Programs Made Declarative (abstract) 30 min
Jorge Fandinno1, Yuliya Lierler1, Torsten Schaub2
1 University of Nebraska Omaha
2 University of Postdam
12:00-12:30
flingo - Instilling ASP Expressiveness into Linear Integer Constraints (abstract) 30 min
Jorge Fandinno1, Pedro Cabalar2, Torsten Schaub3, Philipp Wanko3
1 University of Nebraska Omaha
2 University of A Coruña
3 University of Potsdam
11:00-12:40 Probability KR
Session Chair:
Gaby Kern-Isberner
Location: B2.03
11:00-11:25
Reasoning About Probabilities, Actions, and Knowledge in Fuzzy Modal Logic (abstract) 25 min
Daniil Kozhemiachenko1, Igor Sedlár2
1 Aix-Marseille Univ, Laboratoire d'informatique et des systemes, CNRS
2 The Czech Academy of Sciences, Institute of Computer Science
11:25-11:50
Probabilistic Abduction in a Fuzzy Logic Framework (abstract) 25 min
Tommaso Flaminio1, Katsumi Inoue2, Daniil Kozhemiachenko3
1 IIIA --- CSIC, Campus de la UAB, Bellaterra, Barcelona, Spain
2 NII
3 Aix-Marseille Univ, Laboratoire d'informatique et des systemes, CNRS
11:50-12:15
A Probabilistic Framework for Hierarchical Goal Recognition (abstract) 25 min
Chenyuan Zhang1, Katherine Ip2, Hamid Rezatofighi1, Buser Say1, Mor Vered1
1 Monash University
2 University of Melbourne
12:15-12:40
Large Language Models as Nondeterministic Causal Models (abstract) 25 min
Sander Beckers1
1 University College London
11:00-12:40 Knowledge compilation KR
Session Chair:
Sebastian Rudolph
Location: B1.03
11:00-11:25
A Distributed Framework for Compiling and Reasoning with d-DNNF (abstract) 25 min
Zhenghang Xu1, Minghao Yin1, Jianan Wang1, Jean Marie Lagniez2
1 Northeast Normal University
2 CRIL
11:25-11:50
From Tensor Networks to Tractable Circuits, and back (abstract) 25 min
Arend-Jan Quist1, Marc Farreras1, Alexis de Colnet1, John van de Wetering2, Alfons Laarman1
1 Leiden University
2 University of Amsterdam
11:50-12:15
Compiling Defeasible Inference: A Dynamic Approach To System Z (abstract) 25 min
Luke Slater1, Thomas Meyer1, Jesse Heyninck2
1 University of Cape Town
2 Open University, Heerlen
12:15-12:40
Knowledge Compilation for Quantification in Alternating Automata (abstract) 25 min
Niklas Metzger1, Alfredo Cantarella1, Bernd Finkbeiner1, Supratik Chakraborty2, S. Akshay2
1 CISPA Helmholtz Center for Information Security
2 Indian Institute of Technology Bombay
11:00-12:40 Argumentation 1 KR
Session Chair:
Eduardo Fermé
Location: Grande Auditório
11:00-11:25
Computing Extensions of Abstact Argumentation Frameworks by Enumerating Closed Sets (abstract) 25 min
Sergei Obiedkov1, Barış Sertkaya2
1 TU Dresden
2 Frankfurt University of Applied Sciences
11:25-11:50
Tenability and Weak Semantics: Modeling Non-uniform Defense (abstract) 25 min
Uri Andrews1, Luca San Mauro2, John Spoerl1
1 University of Wisconsin -- Madison
2 University of Bari
11:50-12:15
Belief Function Propagation in Quantitative Bipolar Argumentation Frameworks (abstract) 25 min
Jordan Thieyre1, Aurélie Beynier1, Sébastien Destercke2, Nicolas Maudet1, Srdjan Vesic3
1 LIP6, CNRS - Sorbonne Université
2 Université de technologie de Compiègne, CNRS, Heudiasyc
3 CRIL, CNRS - Univ. Artois
12:15-12:40
Contestability in Edge-Weighted Quantitative Bipolar Argumentation Frameworks (abstract) 25 min
Xiang Yin1, Nico Potyka2, Antonio Rago3, Timotheus Kampik4, Francesca Toni1
1 Imperial College London
2 Cardiff University
3 King's College London
4 Umeå University
12:00-13:30 Lunch SAT
Location: JJ Laginha
12:00-14:00 Lunch FSCD
Location: One03
12:00-14:00 Lunch CP
Location: One01
12:00-14:00 Lunch CP
Location: One02
12:30-14:00 Lunch ICLP
Location: B2.04
12:30-13:30 Lunch LICS
Location: B1.04
12:30-13:30 Lunch LICS
Location: C1.03
12:40-14:00 Lunch KR
Location: Grande Auditório
12:40-14:00 Lunch KR
Location: B1.03
12:40-14:00 Lunch KR
Location: B2.03
13:30-15:00 Session 2A Proof Theory and Linear Logic LICS
Session Chair:
Anupam Das
Location: B1.04
13:30-14:00
The logic of bunched implications is undecidable (abstract) 30 min
Søren Brinck Knudstorp1, Nick Galatos2, Revantha Ramanayake3, Peter Jipsen4
1 University of Amsterdam
2 University of Denver
3 University of Groningen
4 Chapman University
14:00-14:30
Hypersequent calculi have Ackermannian upper bounds (abstract) 30 min
AR Balasubramanian1, Vitor Greati2, Revantha Ramanayake2
1 Max Planck Institute for Software Systems (MPI-SWS)
2 University of Groningen
14:30-15:00
The Logic of Intersection Subtyping (abstract) 30 min
Olivier Laurent1
1 ENS de Lyon
13:30-15:00 Session 2B Automata LICS
Session Chair:
Mahsa Shirmohammadi
Location: C1.03
13:30-14:00
Checking History-Determinism for Parity Automata is in NP (abstract) 30 min
Karoliina Lehtinen1, Keya Prakash2, Michał Skrzypczak3
1 CNRS, Aix Marseille Univ., LIS
2 Aix Marseille Univ., CNRS, LIS
3 University of Warsaw
14:00-14:30
Commutative algebras of series (abstract) 30 min
Lorenzo Clemente1
1 University of Warsaw
14:30-15:00
Minimization of streaming transducers (abstract) 30 min
Gabriele Puppis1, Christian Bianchini1
1 Udine University
13:30-15:30 Session B: Proof Systems & Complexity SAT
Location: JJ Laginha
13:30-14:00
Factoring Learned Clauses (abstract) 30 min
Florian Pollitt1, Zachary Battleman2, Mathias Fleury1, Yakir Vizel3, Marijn Heule2, Armin Biere1, Randal E. Bryant2
1 University Freiburg
2 Carnegie Mellon University
3 Israel Institute of Technology
14:00-14:30
An Exponential Separation between Deterministic CDCL and DPLL Solvers (abstract) 30 min
Sahil Samar1, Marc Vinyals2, Vijay Ganesh1
1 Georgia Institute of Technology
2 University of Auckland
14:30-15:00
Conditional Autarkies: Hard Formulas Made Easy (abstract) 30 min
Ilario Bonacina1, Maria Luisa Bonet1, Antonina Kolokolova2, Massimo Lauria3
1 UPC Universitat Politècnica de Catalunya
2 Memorial University of Newfoundland
3 Sapienza - Università di Roma
15:00-15:30
Proof Systems Based on Structured Circuits (abstract) 30 min
Matthäus Micun1, Christoph Berkholz1
1 Technical University Ilmenau
14:00-15:35 Reasoning on actions KR
Session Chair:
Yves Lesperance
Location: B2.03
14:00-14:25
I Would If I Could: Reasoning about Dynamics of Actions in Multi-Agent Systems (abstract) 25 min
Rustam Galimullin1, Hermine Grosinger2, Munyque Mittelmann3
1 University of Bergen
2 Örebro University
3 LIPN, CNRS
14:25-14:50
Specifying Agent Strategy Spaces via LTL Synthesis (abstract) 25 min
Benjamin Aminof1, Giuseppe De Giacomo2, Aniello Murano3, Sasha Rubin4
1 Technical University of Vienna, Austria
2 University of Oxford, UK
3 University of Naples “Federico II’, Italy
4 University of Sydney, Australia
14:50-15:15
Revisiting Ability-Based Bisimulation (abstract) 25 min
Carlos Areces1, Raul Fervari1, Antonio Mondejar2
1 Consejo Nacional de Investigaciones Científicas (CONICET) and Universidad Nacional de Córdoba, Argentina
2 Universidad Nacional de Córdoba, Argentina
15:15-15:35
Reasoning over Streams of Events with Delayed Effects (abstract) 20 min
Periklis Mantenoglou1, Manolis Pitsikalis2, Alexander Artikis3
1 Örebro University
2 NCSR “Demokritos”
3 NCSR “Demokritos” & University of Piraeus
14:00-15:35 Abduction and diagnosis KR
Session Chair:
Patrick Koopmann
Location: B1.03
14:00-14:25
ABD: Default–Exception Abduction in Finite First-Order Worlds (abstract) 25 min
Serafim Batzoglou1
1 Seer
14:25-14:50
But Not Because You Said So! Implicitly Accepting Information with Abductive Belief-Base Change (abstract) 25 min
Moritz Bayerkuhnlein1, Özgür Lütfü Özcep2, Diedrich Wolter1
1 University of Lübeck
2 University of Hamburg
14:50-15:15
ABox Abduction for Inconsistent Knowledge Bases under Repair Semantics (abstract) 25 min
Anselm Haak1, Patrick Koopmann2, Yasir Mahmood1, Anni-Yasmin Turhan1
1 Paderborn University
2 Vrije Universiteit Amsterdam
15:15-15:35
Summary of: On Validating Propositional Logic System Descriptions for Fault Diagnosis (abstract) 20 min
Alexander Diedrich1, Lukas Moddemann1, Oliver Niggemann1
1 Helmut-Schmidt-University
14:00-15:35 Belief change and epistemic logic KR
Session Chair:
Sebastien Konieczny
Location: Grande Auditório
14:00-14:25
Revealed Epistemic Trust (abstract) 25 min
Xu Li1, Leon van der Torre1, Liuwen Yu2
1 University of Luxembourg
2 Luxembourg Institute of Science and Technology
14:25-14:50
Suspending Judgement: belief contraction in dynamic epistemic logic (abstract) 25 min
Alexandru Baltag1, Virginie Fiutek2, Sonja Smets1
1 ILLC, University of Amsterdam
2 Independent Researcher
14:50-15:15
A Study of Belief Revision Postulates in Multi-Agent Systems (abstract) 25 min
Michael Thielscher1, Tran Cao Son2
1 University of New South Wales
2 New Mexico State University
15:15-15:35
Model Change for Description Logic Concepts (abstract) 20 min
Ana Ozaki1, Jandson S Ribeiro2
1 University of Oslo
2 Cardiff University
14:00-15:30 Block 2 (6 TC) ICLP
Location: B2.04
14:00-14:15
Representative Sets in Propositional Abduction (abstract) 15 min
Mohamed Maizia1, Victor Lagerkvist2, Johannes Schmidt3, Johannes Fichte2
1 Linköping University, Jönköping University
2 Linköping University
3 Jönköping University
14:15-14:30
Explaining Weather Bulletins via ILP (abstract) 15 min
Enrico Santi1, Alessandro Dal Palù2, Agostino Dovier1, Talissa Dreossi1, Andrea Formisano1
1 University of Udine
2 University of Parma
14:30-14:45
Differentiable Logic Programming to Mitigate Reasoning Shortcuts in Neurosymbolic Systems (abstract) 15 min
Akihiro Takemura1, Katsumi Inoue1
1 National Institute of Informatics
14:45-15:00
On the (Intuitionistic) Logic of Next-Token Prediction (abstract) 15 min
Paul Tarau1
1 University of North Texas
15:00-15:15
Case study: proving sqrt(2) irrational with LPTP and an LLM (abstract) 15 min
Fred Mesnard1, Etienne Payet1, Wim Vanhoof2
1 Université de La Réunion
2 Université de Namur
15:15-15:30
Identifying Good Rules for Efficient SAT Encodings of Single-Constant Multiplication Using Machine Learning (abstract) 15 min
Chufeng Jiang1, Neng-Fa Zhou1
1 City University of New York
14:00-15:30 Rewriting FSCD
Session Chair:
Carsten Fuhs
Location: One03
14:00-14:30
How Term Rewriting Structures Shape the Decidability of Knowledge Problems (abstract) 30 min
Raja Damanik1, Alwen Tiu1
1 The Australian National University
14:30-15:00
Undecidability for semirings with fixed points (abstract) 30 min
Anupam Das1, Abhishek De2, Stepan L. Kuznetsov3
1 University of Birmingham
2 Krea University
3 Steklov Mathematical Institute of RAS
15:00-15:30
New and Formalized Proofs for Right-Forward Closures and Core Matrix Interpretations (abstract) 30 min
René Thiemann1, Dieter Hofbauer2, Ulysse Le Huitouze3, Johannes Waldmann4
1 University of Innsbruck
2 ASW Saarland
3 -
4 HTWK Leipzig
15:00-15:30 Coffee Break LICS
Location: B1.04
15:00-15:30 Coffee Break LICS
Location: C1.03
15:30-16:30 Session 3B Automata LICS
Session Chair:
S. Akshay
Location: C1.03
15:30-16:00
A Complexity Bound for Determinisation of Min-Plus Weighted Automata (abstract) 30 min
Shaull Almagor1, Guy Arbel1, Sarai Sheinvald1
1 Technion
16:00-16:30
Differential Tree Automata (abstract) 30 min
Mahsa Shirmohammadi1, Rida Ait El Manssour2, Vincent Cheval2, James Worrell2
1 IRIF, CNRS
2 University of Oxford
15:30-16:30 Session 3A Type Systems LICS
Session Chair:
Luis Caires
Location: B1.04
15:30-16:00
LFPL: Revisited and Mechanized (abstract) 30 min
Nathaniel Glover1, Jan Hoffmann1
1 Carnegie Mellon University
16:00-16:30
Layered Modal ML: Syntax and Full Abstraction (abstract) 30 min
Haoxuan Yin1, Andrzej Murawski1, Luke Ong2
1 University of Oxford
2 Nanyang Technological University
15:30-16:00 Coffee Break SAT
Location: JJ Laginha
15:30-16:00 Coffee Break FSCD
Location: One03
15:30-16:00 Coffee Break ICLP
Location: B2.04
15:30-16:30 Coffee Break CP
Location: One01
15:30-16:30 Coffee Break CP
Location: One02
15:35-16:00 Coffee Break KR
Location: Grande Auditório
15:35-16:00 Coffee Break KR
Location: B1.03
15:35-16:00 Coffee Break KR
Location: B2.03
16:00-17:00 KR Invited: Magdalena Ortiz KR
Session Chair:
Marie-Laure Mugnier
Location: Grande Auditório
16:00-17:00
It's all Connected: Knowledge Representation for Graph Data (abstract) 60 min
Magdalena Ortiz1
1 TU Wien (Vienna University of Technology)
16:00-17:15 Session C: Solver Tools & Explanations SAT
Location: JJ Laginha
16:00-16:15
WhyUnsat: a practical explanation tool (abstract) 15 min
Robert Nieuwenhuis1, Albert Oliveras1, Enric Rodríguez Carbonell1
1 Technical University Catalonia (BarcelonaTech)
16:15-16:30
Shapley-Shubik Attribution from Minimal Subsets (abstract) 15 min
Pablo Martínez-Naredo1, Raúl Mencía1, Joao Marques-Silva2, Carlos Mencía1
1 University of Oviedo
2 ICREA & University of Lleida
16:30-16:45
Unified Programmatic Access to CO Benchmarks, to Connect Constraint Solving Communities (abstract) 15 min
Thomas Sergeys1, Tias Guns1, Ignace Bleukx1
1 KU Leuven
16:45-17:00
Sustainable Benchmarking Tool (abstract) 15 min
Ashlin Iser1, Marie Anastacio2, Théo Matricon3, Laurent Simon4, Holger H. Hoos2
1 Karlsruhe Institute of Technology
2 RWTH Aachen University
3 Rennes University
4 Bordeaux University
17:00-17:15
decdnnf_rs: A framework for Querying d-DNNF (abstract) 15 min
Jean-Marie Lagniez1, Emmanuel Lonca1
1 CRIL
16:00-17:15 Block 3 (Best DC + 4 RPR) ICLP
Location: B2.04
16:00-16:15
Best DC contribution (abstract) 15 min
Alice Tarzariol1, Markus Hecher2
1 University of Klagenfurt
2 CRIL
16:15-16:30
New Encodings of the (Euclidean) Traveling Salesperson Problem in Constraint Answer Set Programming on Difference Logic (abstract) 15 min
Alessandro Bertagnon1, Marco Gavanelli1
1 University of Ferrara
16:30-16:45
Relational Programming in Rel (abstract) 15 min
Leonid Libkin1, Molham Aref2, Wim Martens3, Cristina Sirangelo4, Domagoj Vrgoc5, Filip Murlak6, David Zhao2, Abdul Zreika2, George Kastrinis2, Allison Rogers2, Nathaniel Nystrom, Paolo Guagliardo7, Victor Marsault8, Liat Peterfreund9, Mary McGrath2
1 RelationalAI and Univ of Edinburgh
2 RelationalAI
3 RelationalAI and U Bayreuth
4 U Paris Cite
5 PUC
6 U Warsaw
7 U Edinburgh
8 U Paris Est
9 Hebrew U
16:45-17:00
Contrast Sequential Pattern Mining with Answer Set Solving (abstract) 15 min
Gioacchino Sterlicchio1, Francesca Alessandra Lisi2
1 Polytechnic University of Bari
2 University of Bari Aldo Moro
17:00-17:15
ASP-Bench: From Natural Language to Logic Programs (abstract) 15 min
Stefan Szeider1
1 Technical University of Vienna
16:00-17:00 Higher-Order Logic FSCD
Session Chair:
Dale Miller
Location: One03
16:00-16:30
Investigations on Higher-Order Infinitary Logic (abstract) 30 min
Thomas Traversié1, Olivier Hermant2, Marc Aiguier1
1 Université Paris-Saclay, CentraleSupélec, MICS
2 Université PSL, Mines Paris, CRI
16:30-17:00
Polymorphism Meets Dependently Typed Higher-Order Logic (abstract) 30 min
Daniel Ranalter1, Florian Rabe2, Cezary Kaliszyk3,1
1 University of Innsbruck
2 University of Erlangen-Nuremberg
3 University of Melbourne
16:30-17:00 Test of Time Awards LICS
Location: B1.04
18:00-20:00 Reception
Location: Pala do Pavilhão de Portugal
Tuesday, 21 July 2026
09:00-10:00 Keynote by Nada Amin LICS
Session Chair:
Claudia Faggian
Location: B1.04
09:00-10:00
A Rational Defense of Reasonable Reflection (abstract) 60 min
Nada Amin1
1 Harvard
09:00-10:00 Invited Talk 1 SAT
Location: JJ Laginha
09:00-10:00 KR invited: Carsten Lutz KR
Session Chair:
Franz Baader
Location: Grande Auditório
09:00-10:00
The Logical Expressive Power of Graph Neural Networks (abstract) 60 min
Carsten Lutz1
1 Leipzig University
09:00-10:00 Invited Talk: Laura Kovács FSCD
Session Chair:
Delia Kesner
Location: One03
09:00-10:00
Saturation-Guided Inductive Synthesis (abstract) 60 min
Laura Kovács1
1 TU Wien
09:00-10:00 Invited Talk 1 ICLP
Location: B2.04
09:00-10:00
ASP in the Loop: From Structured Prompting to Agentic Logic Programming (abstract) 60 min
Mario Alviano1
1 University of Calabria, Italy
10:00-10:30 Coffee Break ICLP
Location: B2.04
10:00-10:30 Coffee Break FSCD
Location: One03
10:00-11:00 Coffee Break CP
Location: One01
10:00-11:00 Coffee Break CP
Location: One02
10:00-10:30 KR awards KR
Session Chair:
Tommie Meyer
Location: Grande Auditório
10:00-10:30 Coffee Break SAT
Location: JJ Laginha
10:00-10:30 Coffee Break LICS
Location: B1.04
10:00-10:30 Coffee Break LICS
Location: C1.03
10:30-12:30 Session 4A Verification & Foundations of Probabilistic Systems LICS
Session Chair:
Ichiro Hasuo
Location: B1.04
10:30-11:00
Verifying Exact Samplers for Continuous Distributions with a Discrete Program Logic (abstract) 30 min
Markus de Medeiros1, Puming Liu2, Kwing Hei Li3, Alejandro Aguirre3, Lars Birkedal3, Joseph Tassarotti1
1 New York University
2 NYU Shanghai
3 Aarhus University
11:00-11:30
Complete Supermartingale Certificates for ω-Regular Properties (abstract) 30 min
Alessandro Abate1, Mirco Giacobbe2, Sergey Ichtchenko1, Diptarko Roy2
1 University of Oxford
2 University of Birmingham
11:30-12:00
On Higher-Order Probabilistic Verification via the Weighted Relational Model of Linear Logic (abstract) 30 min
Ugo Dal Lago1, Guido Fiorillo2, Paolo Pistone2
1 Università di Bologna
2 Université Claude Bernard Lyon 1
12:00-12:30
Induction and Recursion Principles in a Higher-Order Quantitative Logic for Probability (abstract) 30 min
Giorgio Bacci1, Rasmus Ejlers Møgelberg2
1 Aalborg University
2 IT University of Copenhagen
10:30-12:30 Session 4B Logic and Structural Graph Theory LICS
Session Chair:
Daniel Neuen
Location: C1.03
10:30-11:00
Existential Positive Transductions of Sparse Graphs (abstract) 30 min
Nikolas Mählmann1, Sebastian Siebertz2
1 University of Warsaw
2 University of Bremen
11:00-11:30
Low Rank MSO (abstract) 30 min
Mikołaj Bojańczyk1, Michał Pilipczuk1, Wojciech Przybyszewski1, Marek Sokołowski2, Giannos Stamoulis3
1 University of Warsaw
2 Max Planck Institute for Informatics, Saarland Informatics Campus
3 IRIF, Université Paris Cité, CNRS, Paris
11:30-12:00
Model checking for low monodimensionality fragments of CMSO on topological-minor-free graph classes (abstract) 30 min
Ignasi Sau1, Nicole Schirrmacher2, Sebastian Siebertz2, Giannos Stamoulis3, Dimitrios Thilikos1, Alexangre Vigny4
1 LIRMM, Univ Montpellier, CNRS
2 University of Bremen
3 IRIF, Université Paris Cité, CNRS, France
4 Univ Clermont Auvergne
12:00-12:30
Well-Quasi-Ordered Classes of Bounded Clique-Width (abstract) 30 min
Aliaume Lopez1, Maël Dumas2
1 INP Bordeaux, LaBRI, CNRS
2 University of Warsaw
10:30-12:00 Session D: MaxSAT & PB Optimization SAT
Location: JJ Laginha
10:30-11:00
Beyond Core-Guided MaxSAT (abstract) 30 min
Ilario Bonacina1, Jordi Levy2, Ion Mikel Liberal2
1 UPC
2 IIIA-CSIC
11:00-11:15
Scuttle: A System for Multi-Objective MaxSAT (abstract) 15 min
Christoph Jabs1, Jeremias Berg1, Matti Järvisalo1
1 University of Helsinki
11:15-11:30
Hermax: A Unified MaxSAT library (abstract) 15 min
Josep Maria Salvia Hornos1, Cèsar Fernández Camón1, Carles Mateu Piñol1
1 University of Lleida
11:30-11:45
HitPBO: An Implicit Hitting Set Solver for Pseudo-Boolean Optimization (abstract) 15 min
Hannes Ihalainen1, Dieter Vandesande2, Andre Schidler3, Jeremias Berg1, Matti Järvisalo1
1 University of Helsinki
2 Vrije Universiteit Brussel, KU Leuven
3 University of Freiburg
11:45-12:00
NLIPSat: Satisfiability-based Nonlinear Integer Programing Encoding Toolkit (abstract) 15 min
Zhengling Yangli1, Zhifei Zheng2, Sami Cherif3, Rui Sá Shibasaki3, Chu-Min Li3
1 Yunnan University
2 Gaoling School of AI, Renmin University of China
3 Laboratoire MIS UR 4290, Université de Picardie Jules Verne, Amiens, France
10:30-11:00 Coffee Break KR
Location: Grande Auditório
10:30-11:00 Coffee Break KR
Location: B1.03
10:30-11:00 Coffee Break KR
Location: B2.03
10:30-12:00 Complexity Analysis FSCD
Session Chair:
Patrick Baillot
Location: One03
10:30-11:00
A Bounded Parallel Intersection Type System (abstract) 30 min
Andrej Dudenhefner1, Aleksy Schubert2, Jakob Rehof1
1 TU Dortmund University
2 University of Warsaw
11:00-11:30
Resource-Aware Quantum Programming with General Recursion and Quantum Control (abstract) 30 min
Kostia Chardonnet1, Emmanuel Hainry1, Romain Péchoux1, Thomas Vinet1
1 Université de Lorraine, Inria, LORIA
11:30-12:00
The Equational Theory of Relational Kleene Algebra with Graph Loop is PSPACE-Complete (abstract) 30 min
Yoshiki Nakamura1
1 Chiba University
10:30-12:30 Block 4 (4 TPLP) ICLP
Location: B2.04
10:30-11:00
Answer-Set-Programming-based Abstractions for Reinforcement Learning (abstract) 30 min
Rafael Bankosegger1, Thomas Eiter2, Johannes Oetsch3
1 Siemens AG Österreich, Vienna, Austria
2 TU Wien, Austria
3 Jönköping University, Sweden
11:00-11:30
Logic-Guided Data Extraction with Answer Set Programming and Large Language Models (abstract) 30 min
Mario Alviano1, Lorenzo Grillo1, Nicola Leone1, Fabrizio Lo Scudo1
1 University of Calabria
11:30-12:00
Accelerating NeurASP with vectorization and caching (abstract) 30 min
Alexander Philipp Rader1, Alessandra Russo2
1 Imperial College London
2 Imperial College, London
12:00-12:30
From Reasoning to Code: GRPO Optimization for Underrepresented Languages (abstract) 30 min
Federico Pennino1, Bianca Raimondi1, Massimo Rondelli1, Andrea Gurioli1, Maurizio Gabbrielli1
1 Università di Bologna
11:00-12:35 Nonmonotonic logic KR
Session Chair:
Tommie Meyer
Location: Grande Auditório
11:00-11:25
Beyond Consistency: A Closer Look at Free Formulas (abstract) 25 min
Ofer Arieli1, Badran Raddaoui2, Christian Strasser3
1 The Academic College of Tel-Aviv
2 Télécom SudParis, Polytechnic Institute of Paris
3 Ruhr Universität Bochum
11:25-11:50
Defeasible Conditional Obligation in a Two-tiered Preference-based Semantics (abstract) 25 min
Xavier Parent1
1 TU Wien
11:50-12:15
Safely Decomposing Conditional Belief Bases Into c-LEG Networks (abstract) 25 min
Gabriele Kern-Isberner1, Alexander Hahn1, Lars-Phillip Spiegel2, Marco Wilhelm3, Christoph Beierle2
1 Technische Universität Dortmund
2 FernUniversität in Hagen
3 Federal Institute for Occupational Safety and Health
12:15-12:35
Representation Theorems for Cumulative Propositional Dependence Logics (abstract) 20 min
Juha Kontinen1, Arne Meier2, Kai Sauerwald3
1 University of Helsinki
2 Leibniz University Hannover
3 FernUniversität in Hagen
11:00-12:35 Graph Data KR
Session Chair:
Andreas Pieris
Location: B1.03
11:00-11:25
Common Foundations for Recursive Shape Languages (abstract) 25 min
Shqiponja Ahmetaj1, Iovka Boneva2, Jan Hidders3, Maxime Jakubowski1, Jose-Emilio Labra-Gayo4, Wim Martens5, Fabio Mogavero6, Filip Murlak7, Cem Okulmus8, Ognjen Savkovic9, Mantas Šimkus1, Dominik Tomaszuk10
1 TU Wien
2 University of Lille
3 Birkbeck, University of London
4 University of Oviedo
5 University of Bayreuth
6 Universita di Napoli Federico II
7 University of Warsaw
8 Paderborn University
9 Free University of Bolzano
10 University of Bialystok
11:25-11:50
Static Analysis of Recursive SHACL (abstract) 25 min
Anouk Michelle Oudshoorn1, Magdalena Ortiz1, Mantas Simkus1
1 Institute of Logic and Computation, TU Wien
11:50-12:15
Almost Certain Query Answering over Incomplete Relational and Graph Data (abstract) 25 min
Heng Liu1, Leonid Libkin2, Eugenia Ternovska1
1 Simon Fraser University
2 RelationalAI & University of Edinburgh
12:15-12:35
A Simple Baseline for Inductive Knowledge Base Completion (abstract) 20 min
Christian Meilicke1, Rainer Gemulla1, Julie Naegelen1, Heiner Stuckenschmidt1
1 University of Mannheim
11:00-11:45 Doctoral Consortium (talks) KR
Location: B2.03
11:00-11:09
Introduction (abstract) 9 min
David Carral1, Munyque Mittelmann2
1 INRIA Sophia Antipolis, France
2 CNRS Paris, France
11:09-11:12
ASP Encodings for Multi-Commodity Batch Scheduling in Logistics Networks (abstract) 3 min
Racquel Dennison1, Jesse Heyninck2, Thomas Meyer1
1 University Of Cape Town
2 Open Universiteit - the Netherlands
11:12-11:15
Knowledge-Based Stable Roommates Problems (abstract) 3 min
Müge Fidan1
1 Sabanci University
11:15-11:18
How Can Inconsistent Agents Become Consistent? (abstract) 3 min
Linda Gutsche1
1 Univ. Grenoble Alpes, Inria, CNRS, Grenoble INP, LIG, F-38000 Grenoble, France
11:18-11:21
Graphical representations of KLM-style defeasible justifications for propositional logic (abstract) 3 min
Jane Imrie1
1 University of Cape Town
11:21-11:24
KLM-Style Defeasibility in Modal and Description Logics (abstract) 3 min
Nicholas Leisegang1
1 University of Cape Town and CAIR
11:24-11:27
Towards Defeasible Semantics for Symbolic Classifiers (abstract) 3 min
Ruvarashe Madzime1
1 University of the Western Cape
11:27-11:30
Integrating and Reasoning with Data-Induced Information: Knowledge Bases of Axioms and Learned Models (abstract) 3 min
Laura Papi1
1 Sapienza University of Rome
11:30-11:33
Defining Goals using Knowledge Representation for Aligned Reinforcement Learning (abstract) 3 min
Paulius Skaisgiris1
1 TU Wien
11:33-11:36
Predictive Control of BDD Growth: Reinforcement Learning for Dynamic Variable Reordering (abstract) 3 min
Luke Slater1
1 University of Cape Town
11:36-11:39
Generalization in Reinforcement Learning from Logical Specifications (abstract) 3 min
Vignesh Subramanian1
1 Georgia Institute of Technology
11:39-11:42
A framework for Counterfactual Explainability in Graph Neural Networks (abstract) 3 min
Maria Myrto Villia1,2
1 computer Science Department, University of Crete, Greece
2 Institute of Computer Science, FORTH, Greece
11:42-11:45
Practical Methods for Concept Interpolation in Realistic Ontologies (abstract) 3 min
Xiaoshuang Yang1
1 Vrije Universiteit Amsterdam
11:45-12:45 Doctoral Consortium (posters) KR
Location: B2.03
12:00-13:30 Lunch SAT
Location: JJ Laginha
12:00-14:00 Lunch FSCD
Location: One03
12:00-14:00 Lunch CP
Location: One01
12:00-14:00 Lunch CP
Location: One02
12:30-14:00 Lunch ICLP
Location: B2.04
12:30-14:00 Lunch LICS
Location: B1.04
12:30-14:00 Lunch LICS
Location: C1.03
12:35-14:00 Lunch KR
Location: Grande Auditório
12:35-14:00 Lunch KR
Location: B1.03
12:35-14:00 Lunch KR
Location: B2.03
13:30-14:30 Session E1: Best Papers SAT
Location: JJ Laginha
13:30-14:00
Simplify, Order, Break, Repeat (abstract) 30 min
Markus Anders1, Cayden Codel2, Marijn J. H. Heule2
1 RPTU Kaiserslautern-Landau
2 Carnegie Mellon University
14:00-14:30
New Algorithms for Parity-SAT and Its Bounded-Occurrence Versions (abstract) 30 min
Sanjay Jain1, Junqiang Peng2, Frank Stephan3,1, Haoyun Tang1, Mingyu Xiao2
1 School of Computing, National University of Singapore, Singapore
2 University of Electronic Science and Technology of China, China
3 Department of Mathematics, National University of Singapore, Singapore
14:00-16:00 Session 5A Logical Aspects of Quantum Computation LICS
Session Chair:
Romain Péchoux
Location: B1.04
14:00-14:30
Graphical Algebraic Geometry: From Ideals and Varieties to Quantum Calculi (abstract) 30 min
Dichuan Gao1, Razin A. Shaikh1, Aleks Kissinger1
1 University of Oxford
14:30-15:00
A Complete Equational Theory for Real-Clifford+CH Quantum Circuits (abstract) 30 min
Alexandre Clément1
1 Université Paris-Saclay, LMF
15:00-15:30
Complete Relational Logic for Infinite-Dimensional Quantum Programs with Unbounded Assertions (abstract) 30 min
Gilles Barthe1, Minbo Gao2,5, Jam Kabeer Ali Khan3, Matthijs Muis3, Ivan Renison3, Keiya Sakabe4, Michael Walter4, Yingte Xu3, Tianshi Yu2, Li Zhou2
1 MPI-SP & IMDEA Software Institute
2 Institute of Software, Chinese Academy of Sciences
3 MPI-SP
4 RUB
5 University of Chinese Academy of Sciences
15:30-16:00
Complexity of Satisfiability in Kochen-Specker Partial Boolean Algebras (abstract) 30 min
Anuj Dawar1, Nihil Shah1
1 University of Cambridge
14:00-16:00 Session 5B Counter and Vector Addition Systems LICS
Session Chair:
Joost-Pieter Katoen
Location: C1.03
14:00-14:30
PVASS Reachability is Decidable (abstract) 30 min
Roland Guttenberg1, Eren Keskin2, Roland Meyer2
1 University of Warsaw
2 TU Braunschweig
14:30-15:00
Reachability in VASS Extended with Integer Counters (abstract) 30 min
Clotilde Bizière1, Wojciech Czerwiński2, Roland Guttenberg2, Jérôme Leroux1, Vincent Michielini1, Łukasz Orlikowski2, Antoni Puch2, Henry Sinclair-Banks2
1 University of Bordeaux
2 University of Warsaw
15:00-15:30
The Complexity of Nested Reset Counter Systems (abstract) 30 min
A. R. Balasubramanian1, Franzisco Schmidt2
1 Max Planck Institute for Software Systems
2 Technical University of Munich
15:30-16:00
The complexity of downward closures of indexed languages (abstract) 30 min
Richard Mandel1, Corto Mascle1, Georg Zetzsche1
1 Max Planck Institute for Software Systems
14:00-16:00 Answer Set Programming 1 KR
Session Chair:
Michael Thielscher
Location: Grande Auditório
14:00-14:25
Beyond Uniform: To Boldly Abstract What Has Not Been Abstracted Before (abstract) 25 min
Matthias Knorr1, Zeynep G. Saribatur2, Ricardo Gonçalves1
1 Universidade NOVA de Lisboa
2 TU Wien
14:25-14:50
A Normal Form for Rules Containing Arithmetic Operations (abstract) 25 min
Jorge Fandinno1, Yuliya Lierler1, Vladimir Lifschitz2
1 University of Nebraska Omaha
2 University of Texas at Austin
14:50-15:15
Optimal Dictionary-Based Compression with Answer Set Programming: Encodings and Empirical Analysis (abstract) 25 min
Mutsunori Banbara1, Hideo Bannai2, Takashi Horiyama3, Dominik Koeppl4, Takuya Mieno5, Hidetomo Nabeshima4
1 Nagoya University
2 Institute of Science Tokyo
3 Hokkaido University
4 University of Yamanashi
5 The University of Electro-Communications
15:15-15:40
Probabilistic Reasoning within Answer Set Programming with Quantifiers (abstract) 25 min
Damiano Azzolini1, Giuseppe Mazzotta2, Francesco Ricca2
1 University of Ferrara
2 University of Calabria
15:40-16:00
Simple Guess-and-Check Programs: Strong and Uniform Equivalence Meet Again (abstract) 20 min
Wolfgang Dvorak1, Zeynep G. Saribatur1, Stefan Woltran1
1 TU Wien
14:00-15:55 Description logics and databases KR
Session Chair:
Magdalena Ortiz
Location: B1.03
14:00-14:25
Partially Finite Model Reasoning in Description Logics (abstract) 25 min
Tomasz Gogacz1, Filip Murlak1, Marcin Przybyłko1, Alexandra Rogova1, Michał Skrzypczak1
1 University of Warsaw
14:25-14:50
How Hard is it to Decide if a Fact is Relevant to a Query? (abstract) 25 min
Meghyn Bienvenu1, Diego Figueira1, Pierre Lafourcade1
1 CNRS & University of Bordeaux
14:50-15:15
Complexity of Logics with Semiring Semantics (abstract) 25 min
Timon Barlag1, Nicolas Fröhlich1, Teemu Hankala2, Miika Hannula3, Minna Hirvonen1, Vivian Holzapfel1, Juha Kontinen2, Arne Meier1, Laura Strieker1
1 Leibniz Universität Hannover
2 University of Helsinki
3 University of Tartu and University of Helsinki
15:15-15:35
Data Complexity of Querying Description Logic Knowledge Bases under Cost-Based Semantics (abstract) 20 min
Meghyn Bienvenu1, Quentin Manière2
1 CNRS & University of Bordeaux
2 Inria
15:35-15:55
Inclusion with Repetitions and Boolean Constants — Implication Problems Revisited (abstract) 20 min
Matilda Häggblom1
1 University of Helsinki
14:00-16:00 Explanation KR
Session Chair:
Antonio Rago
Location: B2.03
14:00-14:25
Precise and Efficient Model-Agnostic Explanations (abstract) 25 min
Jairo Lefebre-Lobaina1, Maria Vanina Martinez1, Joao Marques-Silva2
1 Artificial Intelligence Research Institute - IIIA - CSIC
2 ICREA & Univ. Lleida
14:25-14:50
Model-Agnostic Explanations by Consensus (abstract) 25 min
Carlos Mencía1, Ramon Béjar2, Raúl Mencía1, Joao Marques-Silva3
1 University of Oviedo
2 Universitat de Lleida
3 ICREA & University of Lleida
14:50-15:15
Explaining Classification Through Global Sufficient Reasons and its Complexity (abstract) 25 min
Marco Calautti1, Enrico Malizia2, Cristian Molinaro3
1 University of Milano
2 University of Bologna
3 University of Calabria
15:15-15:35
A Map–Summarize Framework for Answer Set Verbalization (abstract) 20 min
Mario Alviano1, Matteo Capalbo1, Sebastiano Antonio Piccolo1
1 Department of Mathematics and Computer Science - University of Calabria
15:35-16:00
Identifying and Explaining (Non-)Equivalence of First-Order Logic Formulas (abstract) 25 min
Fabian Vehlken1, Thomas Zeume1, Emilio Carrasco Bustamante2, Maëlle Cornély3, Lukas Pradel1
1 Ruhr University Bochum
2 TU Dortmund University
3 Université Paris-Saclay, ENS Paris-Saclay
14:00-14:30 20 Years Test of Time Award ICLP
Location: B2.04
14:00-15:30 Proof Theory FSCD
Session Chair:
José Espírito Santo
Location: One03
14:00-14:30
Ground Stratified Inductive Definitions (abstract) 30 min
Nathan Guermond1, Gopalan Nadathur1
1 University of Minnesota Twin-Cities
14:30-15:00
Treating congruences as equalities within proofs (abstract) 30 min
Dale Miller1
1 Inria Saclay & LIX, IPP
15:00-15:30
Equational Reasoning in Languages with Binders via Permutation Fixed-Points (abstract) 30 min
Ali K. Caires-Santos1, Maribel Fernández2, Murdoch James Gabbay3, Daniele Nantes-Sobrinho1
1 Department of Mathematics, University of Brasília, Brazil
2 Department of Informatics, King's College London, London, UK
3 Heriot-Watt University, Edinburgh, UK
14:30-15:30 Block 5 (2 TPLP) ICLP
Location: B2.04
14:30-15:00
Equilibrium Semantics and Strong Equivalence for Higher-Order Logic Programs (abstract) 30 min
Angelos Charalambidis1, Giannos Chatziagapis2, Babis Kostopoulos1, Panos Rondogiannis2
1 Harokopio University of Athens
2 National and Kapodistrian University of Athens
15:00-15:30
Event Calculus Meets Hybrid ASP (abstract) 30 min
Ondřej Vašíček1, Joaquín Arias2, Javier Romero Davíla3, Jan Fiedor4, Gopal Gupta5, Bohuslav Křena1, Jakub Němec6, Tomáš Vojnar7
1 Brno University of Technology
2 Universidad Rey Juan Carlos
3 University of Potsdam
4 Brno University of Technology and Honeywell International s.r.o.
5 University of Texas at Dallas
6 Masaryk University
7 Masaryk University and Brno University of Technology
14:30-15:30 Session E2: Knowledge Compilation SAT
Location: JJ Laginha
14:30-15:00
The Compilability Thresholds of 2-CNF to OBDD (abstract) 30 min
Alexis de Colnet1, Alfons Laarman1, Joon Hyung Lee1
1 Leiden University
15:00-15:30
A canonical generalization of OBDD (abstract) 30 min
Florent Capelli1, YooJung Choi2, Stefan Mengel3, Martin Munoz3, Guy Van den Broeck4
1 Université d'Artois, CRIL
2 Arizona State University
3 CNRS, CRIL
4 University of California
15:30-16:00 Coffee Break SAT
Location: JJ Laginha
15:30-16:00 Coffee Break ICLP
Location: B2.04
15:30-16:00 Coffee Break FSCD
Location: One03
15:30-16:30 Coffee Break CP
Location: One01
15:30-16:30 Coffee Break CP
Location: One02
16:00-17:30 Quantitative Models FSCD
Session Chair:
Maribel Fernández
Location: One03
16:00-16:30
Evidence-Tracked Tape Semantics for Probabilistic Computation (abstract) 30 min
Liron Cohen1, Tomer Samara1
1 Ben-Gurion University
16:30-17:00
Stable Profunctors and Matrix Representation (abstract) 30 min
Takeshi Tsukada1, Kazuyuki Asada2, Kengo Hirata3
1 Chiba University
2 Tohoku University
3 University of Edinburgh, Kyoto University
17:00-17:30
Type Theory with Erasure (abstract) 30 min
Constantine Theocharis1, Edwin Brady1
1 University of St Andrews
16:00-18:00 Block 6 (8 TC) ICLP
Location: B2.04
16:00-16:15
GLP: A Grassroots, Multiagent, Concurrent, Logic Programming Language (abstract) 15 min
Ehud Shapiro1
1 London School of Economics
16:15-16:30
Encoding Event-B Proof Rules in Prolog: An Interactive Sequent Prover for ProB (abstract) 15 min
Katharina Engels1, Jan Gruteser1, Michael Leuschel1
1 University of Düsseldorf
16:30-16:45
Animation, Verification and Visualisation of Prolog Transition Systems with ProB (abstract) 15 min
Jan Gruteser1, Michael Leuschel1, Katharina Engels1, Fabian Vu1
1 University of Düsseldorf
16:45-17:00
What Bugs Do Prolog Students Write? An Empirical Taxonomy and Data-Driven Mutation Framework (abstract) 15 min
Ricardo Brancas1,4, Pedro Orvalho2, Carolina Carreira3,1,4, Vasco Manquinho1,4, Ruben Martins3
1 INESC-ID
2 Artificial Intelligence Research Institute, Consejo Superior de Investigaciones Científicas
3 Carnegie Mellon University
4 Instituto Superior Técnico
17:00-17:15
Can Automated Feedback Turn Students into Happy Prologians? (abstract) 15 min
Ricardo Brancas1,4, Pedro Orvalho2, Carolina Carreira3,1,4, Vasco Manquinho1,4, rubenm@andrew.cmu.edu
1 INESC-ID
2 Artificial Intelligence Research Institute, Consejo Superior de Investigaciones Científicas
3 Carnegie Mellon University
4 Instituto Superior Técnico
17:15-17:30
chess db: A framework for working with large chess game datasets (abstract) 15 min
Nicos Angelopoulos1, Jan Wielemaker2
1 Imperial College London
2 SWI-Prolog Solutions
17:30-17:45
Case study: solving P-99 with LPTP and an LLM (abstract) 15 min
Fred Mesnard1, Thierry Marianne1, Etienne Payet1, Wim Vanhoof2
1 Université de La Réunion
2 Université de Namur
17:45-18:00
Towards Relating Ciao Assertions and LPTP Theorems (abstract) 15 min
Marco Pérez1, Pedro López-García2, Jose F. Morales1, Manuel V. Hermenegildo1, Fred Mesnard3
1 UPM, IMDEA
2 CSIC, IMDEA
3 Université de La Réunion
16:00-18:00 Session F: CDCL & Parallel Solving SAT
Location: JJ Laginha
16:00-16:30
PASSAT: Deep Cooperation of Unit Propagation and Local Search in Incomplete SAT Solving (abstract) 30 min
Mingming Jin1, Zhijie Kuang1, Jiongzhi Zheng2, Kun Mao2, Kun He1
1 Huazhong University of Science and Technology
2 Huawei OptVerse Solver,China
16:30-17:00
Generalizing CDCL with Graph Backtracking (abstract) 30 min
Robin Coutelier1, Thomas Hader1, Laura Kovács1
1 TU Wien
17:00-17:30
A Natively Parallel Proof Framework for Clause-Sharing SAT Solving (abstract) 30 min
Ruben Götz1, Michael Dörr1, Dominik Schreiber1
1 Karlsruhe Institute of Technology (KIT)
17:30-17:45
CaDiCaL 3.0 (abstract) 15 min
Florian Pollitt1, Mathias Fleury1, Katalin Fazekas2, Nils Froleyks3, André Schidler1, Dominik Schreiber4, Armin Biere1
1 University of Freiburg
2 Vienna University of Technology
3 KU Leuven
4 Karlsruhe Institute of Technology
17:45-18:00
Efficient Identification of Isomorphic SAT Instances (abstract) 15 min
Frederick Gehm1, Ashlin Iser1
1 KIT
16:00-16:30 Coffee Break LICS
Location: B1.04
16:00-16:30 Coffee Break LICS
Location: C1.03
16:00-16:30 Coffee Break KR
Location: Grande Auditório
16:00-16:30 Coffee Break KR
Location: B1.03
16:00-16:30 Coffee Break KR
Location: B2.03
16:30-18:35 Datalog and existential rules KR
Session Chair:
Leonid Libkin
Location: B2.03
16:30-16:55
Why(-Not)-Provenance for Datalog with Negation (abstract) 25 min
Bart Bogaerts1, Marco Calautti2, Andreas Pieris3, Samuele Pollaci4, Robbe Van den Eede1
1 KU Leuven and Vrije Universiteit Brussel
2 University of Milano
3 University of Cyprus & University of Edinburgh
4 Vrije Universiteit Brussel and KU Leuven
16:55-17:20
Efficient Temporal Datalog Materialisation for Composite Event Recognition (abstract) 25 min
Periklis Mantenoglou1
1 Örebro University
17:20-17:45
Efficient Temporal Reasoning with Non-Temporal Engines: Embedding DatalogMTL into Datalog (abstract) 25 min
Mathijs van Noort1, Przemyslaw Walega2
1 Ghent University - imec
2 Queen Mary University of London
17:45-18:10
The Chase in Lean - Crafting a Formal Library for Existential Rule Research (abstract) 25 min
Lukas Gerlach1
1 TU Dresden
18:10-18:35
VADAOrchestra: Neurosymbolic Orchestration of Adaptive Reasoning Workflows (abstract) 25 min
Teodoro Baldazzi1, Luigi Bellomarini2, Andrea Coletta2, Michela Iezzi2, Carsten Maple3, Alessandro Pesare1, Emanuel Sallinger1
1 TU Wien
2 Banca d’Italia
3 University of Warwick
16:30-18:35 Planning KR
Session Chair:
Gerhard Lakemeyer
Location: B1.03
16:30-16:55
Over All, PDDL Semantics is Simultaneously Simple and Hard to Get Right (abstract) 25 min
Nicola Gigante1, Andrea Micheli2, Enrico Scala3, Alessandro Valentini2
1 Free University of Bozen-Bolzano
2 Fondazione Bruno Kessler
3 University of Brescia
16:55-17:20
Synthesis Foundations for Online LTLf Goal Management (abstract) 25 min
Giuseppe De Giacomo1, Yves Lespérance2, Gianmarco Parretti3, Fabio Patrizi3
1 University of Oxford & Sapienza Università di Roma
2 York University
3 Sapienza Università di Roma
17:20-17:45
On-the-fly LTLf Synthesis under Partial Observability (abstract) 25 min
Nadav Alon1, Supratik Chakraborty2, Alexandre Duret-Lutz3,7, Dror Fried1, Lucas Martinelli Tabajara4, Moshe Y. Vardi5, Shufang Zhu6
1 The Open University of Israel
2 IIT Bombay
3 LRE
4 Runtime Verification Inc.
5 Rice University
6 University of Liverpool
7 EPITA
17:45-18:10
Reactive Synthesis for Golog Specifications in the Propositional Situation Calculus (abstract) 25 min
Giuseppe De Giacomo1, Yves Lespérance2, Matteo Mancanelli3, Gianmarco Parretti3
1 University of Oxford
2 York University
3 University of Rome La Sapienza
18:10-18:35
Optimal In-Station Train Dispatching via Symbolic Pattern Planning (abstract) 25 min
Matteo Cardellini1, Enrico Giunchiglia1, Davide Anguita1, Carmelo Lofiego2, Luca Oneto1, Pietro Ratto2
1 Università degli Studi di Genova
2 Hitachi Rail STS
16:30-18:35 Neural-symbolic learning KR
Session Chair:
Mena Leemhuis
Location: Grande Auditório
16:30-16:55
Semantic Foundations of Neuro-Symbolic Multi-Agent Systems (abstract) 25 min
Julian Gutierrez1
1 University of Sussex
16:55-17:20
Hybrid Models for Natural Language Reasoning: The Case of Syllogistic Logic (abstract) 25 min
Manuel Vargas Guzmán1, Jakub Szymanik2, Maciej Malicki1
1 University of Warsaw
2 University of Trento
17:20-17:45
Symbolic Knowledge Transfer for Sample-Efficient Deep Reinforcement Learning (abstract) 25 min
Celeste Veronese1, Alessandro Farinelli1, Daniele Meli1
1 University of Verona
17:45-18:10
SafeTap: Neurosymbolic Language to Quadrupedal Locomotion via Reactive Synthesis Modulo Bitvectors (abstract) 25 min
Andoni Rodriguez1, Cesar Sanchez2
1 IMDEA Software Institute, , Universidad Politecnica de Madrid
2 IMDEA Software Institute
18:10-18:35
Neuro-Symbolic Causal Boosting: A Framework for Interpretable Attribution of Business Fluctuations (abstract) 25 min
Yonghe Zhao1, Yuezhu Wang2, Chao Ma1, Huiyan Sun2
1 Mashang Consumer Finance Co., Ltd.
2 School of Artificial Intelligence, Jilin University
16:30-18:00 Session 6A Logical aspects of Quantum computation LICS
Session Chair:
Claudia Faggian
Location: B1.04
16:30-17:00
Quantum Control and General Recursion beyond the Unitary Case (abstract) 30 min
Kathleen Barsse1, Romain Péchoux1, Simon Perdrix1
1 LORIA, CNRS, INRIA, Université de Lorraine, France
17:00-17:30
Causality in Pure Quantum Computation with Quantum Control (abstract) 30 min
Kengo Hirata1, Takeshi Tsukada2
1 University of Edinburgh, Kyoto University
2 Chiba University
17:30-18:00
One rig to control them all (abstract) 30 min
Chris Heunen1, Robin Kaarsgaard2, Louis Lemonnier1
1 University of Edinburgh
2 University of Southern Denmark
16:30-18:00 Session 6B Quantitative and Analytical Properties of Formal Languages LICS
Session Chair:
Igor Walukiewicz
Location: C1.03
16:30-17:00
Randomness Extraction Fails for Finite-State Dimension (abstract) 30 min
Subin Pulari1, Akhil S2
1 National Research University Higher School of Economics Moscow
2 Indian Institute of Technology Kanpur
17:00-17:30
Unbounded data nesting for loops in higher-order programs (abstract) 30 min
Adriana Baldacchino1, Andrzej Murawski2
1 University of Birmingham
2 University of Oxford
17:30-18:00
Star Complexity of Parikh Images of Languages over Infinite Alphabets (abstract) 30 min
Yoav Danieli1
1 Technion -- Israel Institute of Technology, Haifa, Israel
18:00-19:00 Session M: SAT Association Awards SAT
Location: JJ Laginha
18:10-18:50 LICS General Assembly LICS
Location: B1.04
Wednesday, 22 July 2026
09:00-10:00 Keynote: Learning with Logic: Neuro-Symbolic Methods for Grounded and Robust AI
Location: Grande Auditório
09:00-10:00
Learning with Logic: Neuro-Symbolic Methods for Grounded and Robust AI (abstract) 60 min
Alessandra Russo
10:00-10:30 Coffee Break LICS
Location: B1.04
10:00-10:30 Coffee Break LICS
Location: C1.03
10:00-10:30 Coffee Break SAT
Location: JJ Laginha
10:00-10:30 Coffee Break KR
Location: Grande Auditório
10:00-10:30 Coffee Break KR
Location: B1.03
10:00-10:30 Coffee Break KR
Location: B2.03
10:00-10:30 Coffee Break ICLP
Location: B2.04
10:00-10:30 Coffee Break FSCD
Location: One03
10:00-11:00 Coffee Break CP
Location: One01
10:00-11:00 Coffee Break CP
Location: One02
10:30-12:00 Substructural Logics FSCD
Session Chair:
Olivier Laurent
Location: One03
10:30-11:00
Absolute convergence and Taylor expansion in web based models of linear logic (abstract) 30 min
Christine Tasson1, Aymeric Walch1
1 ISAE-SUPAERO
11:00-11:30
Quantum Bayesian Networks: Compositionality and Typing via Linear Logic (abstract) 30 min
Remi Di Guardia1, Thomas Ehrhard1, Claudia Faggian1
1 IRIF
11:30-12:00
On the consistency of naive set theories over substructural and fuzzy logics (abstract) 30 min
Kazushige Terui1
1 Kyoto University
10:30-12:30 Block 7 (4 TPLP) ICLP
Location: B2.04
10:30-11:00
Reducing Arbitrary Metric Temporal Formulas into Logic Programs under Answer Set Semantics (abstract) 30 min
Martin Diéguez1, Susana Hahn2, Torsten Schaub2, Igor Stéphan1
1 University of Angers
2 University of Potsdam
11:00-11:30
Meta Programming for Linear-time Temporal Answer Set Programming (abstract) 30 min
Susana Hahn1, Amade Nemes1, Javier Romero1, Torsten Schaub1
1 University of Potsdam
11:30-12:00
Long-term Power Grid Planning via Answer Set Programming (abstract) 30 min
Antonio Ielo1, Francesco Doria1, Sandra Castellanos-Paez2, Marco Maratea1, Francesco Percassi2, Mauro Vallati2
1 University of Calabria
2 University of Huddersfield
12:00-12:30
From Time to Space: The Impact of Linearity in Higher-Order Datalog (abstract) 30 min
Angelos Charalambidis1, Babis Kostopoulos1, Panos Rondogiannis2
1 Harokopio University of Athens
2 National and Kapodistrian University of Athens
10:30-11:30 Diversity and inclusion KR
Location: Grande Auditório
10:30-11:30
What Would You Do? Dilemmas from Academic Life (abstract) 60 min
Lucia Gomez1, Sanja Lukumbuzya2, Vanina Martinez3
1 Inria
2 TU Wien
3 IIIA - CSIC
10:30-12:00 Session G: QBF Algorithms SAT
Location: JJ Laginha
10:30-11:00
Bilateral Treewidth for QBF: Where Strategies and Resolution Meet (abstract) 30 min
Robert Ganian1, Marlene Gründel1
1 TU Wien
11:00-11:30
CAQE: Strong as Solver, Weak as Proof System (abstract) 30 min
Benjamin Böhm1, Olaf Beyersdorff1
1 Friedrich Schiller University Jena
11:30-12:00
d-QBF with Few Existential Variables Revisited (abstract) 30 min
Andreas Grigorjew1, Michael Lampis1
1 LAMSADE, Université Paris Dauphine-PSL
10:30-12:30 Session 7A Categorical models: effects, automata & model theory LICS
Session Chair:
Ohad Kammar
Location: B1.04
10:30-11:00
A categorical perspective on constraint satisfaction: The wonderland of adjunctions (abstract) 30 min
Maximilian Hadek1, Tomáš Jakl2, Jakub Opršal3
1 Charles University
2 Czech Technical University
3 University of Birmingham
11:00-11:30
Forgetting Event Order in Higher-Dimensional Automata (abstract) 30 min
SAFA ZOUARI1
1 Norwegian University of Science and Technology (NTNU)
11:30-12:00
A cartesian closed fibration of regular languages (abstract) 30 min
Paul-André Melliès1, Vincent Moreau2
1 CNRS, Université Paris Cité, INRIA
2 Tallinn University of Technology
12:00-12:30
Monads and Distributive Laws in Substructural Contexts (abstract) 30 min
Soichiro Fujii1, Yun Chen Tsai2, Yoàv Montacute1, Ichiro Hasuo3
1 National Institute of Informatics
2 National Institute of Informatics and SOKENDAI
3 National Institute of Informatics, SOKENDAI, and Imiron
10:30-12:30 Session 7B Decidability in Arithmetic and Linear Theories LICS
Session Chair:
Laura Kovacs
Location: C1.03
10:30-11:00
Constructing Small Monadic Decompositions in Presburger Arithmetic (abstract) 30 min
Moses Ganardi1, Marin Ricros1
1 RPTU Kaiserslautern-Landau
11:00-11:30
On Variable-Bounded Non-Linear Expansions of Presburger Arithmetic (abstract) 30 min
Piotr Bacik1,2, Joris Nieuwveld1, Joël Ouaknine2, Mihir Vahanwala2, Madhavan Venkatesh2, Emil Rugaard Wieser2
1 University of Oxford
2 Max Planck Institute for Software Systems, Saarland Informatics Campus
11:30-12:00
Decidability Results for Fragments of First-Order Logic via a Symbolic Model Property (abstract) 30 min
Neta Elad1, Sharon Shoham1
1 Tel Aviv University
12:00-12:30
On the Subspace Orbit Problem and the Simultaneous Skolem Problem (abstract) 30 min
Piotr Bacik1,3, Anton Varonka2
1 University of Oxford
2 TU Wien
3 Max Planck Institute for Software Systems, Saarland Informatics Campus
11:40-12:30 Epistemic logic KR
Session Chair:
Kai Sauerwald
Location: B2.03
11:40-12:05
A Logic of Limited Belief with Introspection Based on Possible Worlds (abstract) 25 min
Gerhard Lakemeyer1, Hector J. Levesque2
1 RWTH Aachen University
2 University of Toronto
12:05-12:30
Cops only need factual knowledge to catch robbers (abstract) 25 min
Dazhu Li1, Sujata Ghosh2
1 University of Chinese Academy of Sciences
2 Indian Statistical Institute
11:40-12:30 SAT encoding KR
Session Chair:
Joao Marques-Silva
Location: B1.03
11:40-12:05
SRIP: A SAT-based System for Independent Set Reconfiguration (abstract) 25 min
Takehide Soh1, Akifumi Kuwahara2, Mutsunori Banbara1, Naoyuki Tamura2, Yasuaki Kobayashi3, Yuta Nozaki3, Takehiro Ito4
1 Nagoya University
2 Kobe University
3 Hokkaido University
4 Tohoku University
12:05-12:30
SAT-based ASP Solving and Optimization via a General Transitive Closure Framework (abstract) 25 min
Masood Feyzbakhsh Rankooh1, Matti Järvisalo1
1 University of Helsinki
11:40-12:25 Reinforcement learning and norms KR
Session Chair:
Gaby Kern-Isberner
Location: Grande Auditório
11:40-12:05
Scalable Learning of Challenging Normative Behaviours with Deep RL (abstract) 25 min
Emery Neufeld1, Thorsten Engesser1, Martin Tappler1
1 TU Wien
12:05-12:25
Normative Narrator: Guiding and Explaining Reinforcement Learning Agents (abstract) 20 min
Emery Neufeld1, Kees van Berkel1
1 TU Wien
12:00-13:30 Lunch SAT
Location: JJ Laginha
12:00-14:00 Lunch FSCD
Location: One03
12:00-14:00 Lunch CP
Location: One01
12:00-14:00 Lunch CP
Location: One02
12:30-14:00 Lunch ICLP
Location: B2.04
12:30-14:00 Lunch LICS
Location: B1.04
12:30-14:00 Lunch LICS
Location: C1.03
12:30-14:00 Lunch KR
Location: Grande Auditório
12:30-14:00 Lunch KR
Location: B1.03
12:30-14:00 Lunch KR
Location: B2.03
13:30-15:30 Session H: QBF Proofs & Dependencies SAT
Location: JJ Laginha
13:30-14:00
Definition-based dependency schemes (abstract) 30 min
David Kattermann1, Martina Seidl1, Clemens Hofstadler1
1 Johannes Kepler University Linz
14:00-14:30
Strong (D)QBF Dependency Schemes via Pure Paths with Applications to Proof Checking (abstract) 30 min
Leroy Chew1, Tomáš Peitl2
1 Czech Institute of Informatics Robotics and Cybernetics
2 TU Wien
14:30-15:00
Proof Systems for QBF Synthesis: Extracting Skolem and Herbrand Functions (abstract) 30 min
S. Akshay1, Olaf Beyersdorff2, Supratik Chakraborty1, Lea Kasche2, Meena Mahajan3, Luc Nicolas Spachmann2
1 IIT Bombay
2 Friedrich Schiller University Jena
3 IMSc Chennai
15:00-15:15
On Proof Systems for #QBF (abstract) 15 min
Sravanthi Chede1, Leroy Chew2, Vaibhav Krishan1, Anil Shukla3
1 Institute of Mathematical Sciences Chennai
2 Czech Technical University in Prague, Czech Republic
3 Indian Institute of Technology Ropar
15:15-15:30
Long-Distance Q(D^{std})Consensus is sound (abstract) 15 min
Abhimanyu Choudhury1, Meena Mahajan1, Friedrich Slivovsky2
1 Institute of Mathematical Sciences, HBNI, Chennai
2 University of Liverpool, UK
14:00-16:00 Session 8A Foundations of Probabilistic Computation LICS
Session Chair:
Hugo Paquet
Location: B1.04
14:00-14:30
Fixed-parameter tractable inference for discrete probabilistic programs, via string diagram algebraisation (abstract) 30 min
Benedikt Peterseim1, Milan Lopuhaä-Zwakenberg1
1 University of Twente
14:30-15:00
A synthetic account of Metropolis--Hastings via categorical probability (abstract) 30 min
Rob Cornish1, Andi Wang2
1 Nanyang Technological University
2 University of Warwick
15:00-15:30
Interpreting De Finetti's Theorem in the Category of Integrable Cones (abstract) 30 min
Raphaëlle Crubillé1
1 LIS, Aix-Marseille Université
15:30-16:00
A convenient fibration for dependently-typed probability theory (abstract) 30 min
Danel Ahman1, Ohad Kammar2, Rasmus Ejlers Møgelberg3
1 University of Tartu
2 University of Edinburgh
3 IT University of Copenhagen
14:00-16:00 Session 8B Graph Isomorphism, Homomorphisms, and Combinatorial Invariants LICS
Session Chair:
Martin Grohe
Location: C1.03
14:00-14:30
Local combinatorial analogues for bounded VC dimension (abstract) 30 min
Olga Medrano Martin del Campo1
1 The University of Chicago
14:30-15:00
Dynamic Planar Graph Isomorphism is in DynFO (abstract) 30 min
Samir Datta1, Asif Khan1, Felix Tschirbs2, Nils Vortmeier2, Thomas Zeume2
1 Chennai Mathematical Institute, India
2 Ruhr University Bochum, Germany
15:00-15:30
The Finite Length Property of the Rado graph and Friends (abstract) 30 min
Jingjie Yang1, Mikołaj Bojańczyk2, Bartek Klin1
1 University of Oxford
2 University of Warsaw
15:30-16:00
Distinguishing Graphs by Counting Homomorphisms from Sparse Graphs (abstract) 30 min
Daniel Neuen1, Tim Seppelt2
1 Max Planck Institute for Informatics
2 IT-University of Copenhagen
14:00-15:35 Belief change KR
Session Chair:
Renata Wassermann
Location: Grande Auditório
14:00-14:20
AGM Belief Revision, Semantically (Extended Abstract) (abstract) 20 min
Sebastian Rudolph1, Kai Sauerwald2
1 TU Dresden
2 University of Hagen
14:20-14:45
Expressiveness of Epistemic Spaces for Iterated Belief Change Operators (abstract) 25 min
Nicolas Schwind1, Sébastien Konieczny2, Ramon Pino Perez3
1 National Institute of Advanced Industrial Science and Technology (AIST)
2 CRIL - CNRS
3 Universidad de Los Andes
14:45-15:10
Truth-Tracking by Iterated Belief Change (abstract) 25 min
Nicolas Schwind1, Patricia Everaere2, Sébastien Konieczny3
1 National Institute of Advanced Industrial Science and Technology (AIST)
2 Univ. Lille, CNRS, Centrale Lille, UMR 9189 CRIStAL, F-59000 Lille, France
3 CRIL - CNRS
15:10-15:35
Interval Orders, Biorders and Credibility-limited Belief Revision (abstract) 25 min
Richard Booth1, Ivan Varzinczak2
1 Cardiff University
2 Université Sorbonne Paris Nord
14:00-15:35 Learning for planning KR
Session Chair:
Hector Geffner
Location: B1.03
14:00-14:25
Learning Numeric Planning Domain Models From Positive Observations (abstract) 25 min
Omar Watted1, Argaman Mordoch1, Roni Stern1
1 Ben Gurion University of the Negev
14:25-14:50
From Next Token Prediction to (STRIPS) World Models (abstract) 25 min
Carlos Núñez-Molina1, Vicenç Gómez2, Hector Geffner1
1 RWTH Aachen University
2 Universitat Pompeu Fabra
14:50-15:15
Learning Lifted Action Models from Traces with Minimal Information About Actions and States (abstract) 25 min
Jonas Gösgens1, Niklas Jansen1, Hector Geffner1
1 RWTH Aachen University
15:15-15:35
Learning Broadcast Protocols (abstract) 20 min
Dana Fisman1, Noa Izsak2, Swen Jacobs2
1 Ben-Gurion University of the Negev
2 CISPA Helmholtz Center for Information Security
14:00-15:15 Preferences KR
Session Chair:
Gerd Brewka
Location: B2.03
14:00-14:25
On Sufficient Conditions for Consistency Checking in CP-theory Preferences (abstract) 25 min
Erik Rauer1, Samik Basu1
1 Iowa State University
14:25-14:50
Voting Compilation Revisited (abstract) 25 min
Yann Chevaleyre1, Jérôme Lang2, Nicolas Maudet3
1 LAMSADE, PSL
2 LAMSADE, CNRS, PSL
3 LIP6 - Sorbonne Université
14:50-15:15
Reasoning about Welfare-Affecting Capabilities in Concurrent Games (abstract) 25 min
Yinfeng Li1, Emiliano Lorini2
1 IRIT
2 IRIT-CNRS
14:00-14:30 10 Years Test of Time Award ICLP
Location: B2.04
14:00-15:30 Concurrency FSCD
Session Chair:
Brigitte Pientka
Location: One03
14:00-14:30
Strong Normalisation for Asynchronous Effects (abstract) 30 min
Danel Ahman1, Ilja Sobolev1
1 University of Tartu
14:30-15:00
Abstract Framework for All-Path Reachability Analysis toward Safety and Liveness Verification (abstract) 30 min
Misaki Kojima1, Naoki Nishida1
1 Nagoya University
15:00-15:30
A Complete Finitary Refinement Type System for Scott-Open Properties (abstract) 30 min
Colin Riba1, Adam Donadille2
1 LIP - ENS de Lyon
2 ENS de Lyon
14:30-15:30 Block 8 (2 TPLP) ICLP
Location: B2.04
14:30-15:00
Experimental evaluation of optimal abstract operators for sharing and linearity analysis (abstract) 30 min
Gianluca Amato1, Francesca Scozzari1
1 University of Chieti-Pescara
15:00-15:30
Exploiting Multiple Abstract Call Patterns for Optimizing Run-Time Checks (abstract) 30 min
Daniel Jurjo-Rivas1, Daniela Ferreiro1, Marco Ciccalè1, Jose F. Morales1, Pedro López-García2, Manuel Hermenegildo1
1 Instituto IMDEA Software & UPM
2 Instituto IMDEA Software & CSIC
15:30-16:00 Coffee Break ICLP
Location: B2.04
15:30-16:00 Coffee Break FSCD
Location: One03
15:30-16:30 Coffee Break CP
Location: One01
15:30-16:30 Coffee Break CP
Location: One02
15:30-16:00 Coffee Break SAT
Location: JJ Laginha
15:35-16:00 Coffee Break KR
Location: Grande Auditório
15:35-16:00 Coffee Break KR
Location: B1.03
15:35-16:00 Coffee Break KR
Location: B2.03
16:00-18:00 Argumentation and applications KR
Session Chair:
Eduardo Fermé
Location: B2.03
16:00-16:25
Causal Discovery as Dialectical Aggregation: A Quantitative Argumentation Framework (abstract) 25 min
Sheng Wei1, Yulin Chen1, Beishui Liao2
1 The College of Computer Science and Technology, Zhejiang University
2 School of Philosophy, Zhejiang University
16:25-16:50
Learnable Multi-Attribute Gradual Semantics for Predicting Persuasion in Argumentative Debates (abstract) 25 min
Elena Cabrio1, Victor David2, Anthony Hunter3, Pierre Monnin2, Nino Pireaud1
1 Université Côte d'Azur
2 Inria
3 University College London
16:50-17:10
Evaluating LLM-Driven Summarisation of Parliamentary Debates with Computational Argumentation (abstract) 20 min
Eoghan Cunningham1, James Cross1, Derek Greene1, Antonio Rago2
1 University College Dublin
2 King's College London
17:10-17:35
Argumentation for Explainable and Globally Contestable Decision Support with LLMs (abstract) 25 min
Adam Dejl1, Matthew Williams1, Francesca Toni1
1 Imperial College London
17:35-18:00
X-ABALearn: Argumentative Learning with Semantics `a la Carte (abstract) 25 min
Emanuele De Angelis1, Maurizio Proietti1, Francesca Toni2
1 CNR-IASI
2 Imperial
16:00-18:00 Temporal reasoning KR
Session Chair:
Kees van Berkel
Location: B1.03
16:00-16:25
Generating Explainable Counterfactual Policies through Temporal Logic Queries (abstract) 25 min
Arnaud Lequen1, Clément Legrand-Lixon2, Léo Saulières3
1 Linköpings Universitet
2 Université de Lille
3 University of Toulouse, INRAE-MIAT
16:25-16:50
Time Robustness for Point-Based Semantics of Metric Interval Temporal Logic (abstract) 25 min
Simone Silvetti1, Ivan Compagnucci2, Francesca Cairoli1, Catia Trubiani2, Laura Nenzi1
1 University of Trieste
2 Gran Sasso Science Institute
16:50-17:10
Hierarchical Models of Multi-Agent Systems: Strategic Ability and Model Checking (abstract) 20 min
Rustam Galimullin1, Wojciech Jamroga2, Damian Kurpiewski2, Vadim Malvone3, Aniello Murano4
1 University of Bergen
2 Institute of Computer Science, Polish Academy of Sciences
3 Telecom Paris
4 University of Naples Federico II
17:10-17:35
Resolving Inconsistencies in Disjunctive Temporal Constraints: a Parameterized Complexity Classification (abstract) 25 min
Konrad K. Dabrowski1, Peter Jonsson2, Sebastian Ordyniak3, George Osipov2, Jorke de Vlas2
1 Newcastle University
2 Linköping University
3 University of Leeds
17:35-18:00
AIGLE: A Tool for Compact, Legible AIGER Circuits from Safety Specifications (abstract) 25 min
Matías Brizzio1, Andoni Rodriguez1, Cesar Sanchez2, Renzo Degiovanni3
1 IMDEA Software Institute and Universidad Politécnica de Madrid
2 IMDEA Software Institute
3 Luxembourg Institute of Science and Technology
16:00-18:00 Expressivity of neural networks KR
Session Chair:
Carsten Lutz
Location: Grande Auditório
16:00-16:25
Unifying approach to uniform expressivity of graph neural networks (abstract) 25 min
Huan Luo1, Jonni Virtema1
1 University of Glasgow
16:25-16:50
Recurrent Graph Neural Networks and Arithmetic Circuits (abstract) 25 min
Timon Barlag1, Vivian Holzapfel1, Laura Strieker1, Jonni Virtema2, Heribert Vollmer1
1 Leibniz Universität Hannover
2 University of Glasgow
16:50-17:15
The Polynomial Counting Capabilities of Message Passing Neural Networks (abstract) 25 min
Marco Sälzer1, Pascal Bergsträßer2, Anthony W. Lin2
1 RPTU, Techinical University of Kaiserslautern
2 RPTU, Technical University of Kaiserslautern
17:15-17:35
Extended Abstract: Aggregate-Combine-Readout GNNs Can Express Logical Classifiers Beyond the Logic C2 (abstract) 20 min
Stan P Hauke1, Przemysław Andrzej Wałęga2
1 King's College London
2 Queen Mary University of London
17:35-18:00
How Aggregation Functions Affect the Uniform Expressiveness of Graph Neural Networks (abstract) 25 min
Stan P Hauke1, Przemysław Andrzej Wałęga2
1 King’s College London
2 Queen Mary University of London
16:00-18:00 Session I: Beyond Propositional SAT SAT
Location: JJ Laginha
16:00-16:30
On Knowledge Compilation For Two-Variable First-Order Logic (abstract) 30 min
Qiaolan Meng1, Juhua Pu1, Hongting Niu1, Yuyi Wang2, Yuanhong Wang3, Ondřej Kuželka4
1 Beihang University
2 CRRC Zhuzhou Insitute
3 Jilin University
4 Czech Technical University in Prague
16:30-17:00
SAT Modulo Well-Founded Semantics (abstract) 30 min
Thomas Eiter1, Tobias Nießen1, Davide Soldà1
1 TU Wien
17:00-17:30
Dsat: A Native SAT Solver for Discrete Logic (abstract) 30 min
Yaofang Zhang1, Ken Zhou1, Adnan Darwiche1
1 University of California, Los Angeles
17:30-18:00
Extending CDCL to disjunctions of parity equations (abstract) 30 min
Paul Beame1, Glenn Sun1
1 University of Washington
16:00-16:30 Coffee Break LICS
Location: B1.04
16:00-16:30 Coffee Break LICS
Location: C1.03
16:00-17:00 FSCD Business Meeting FSCD
Session Chair:
Patrick Baillot
Location: One03
16:00-17:00
FSCD Business Meeting (abstract) 60 min
Patrick Baillot1
1 Université de Lille
16:00-18:00 Block 9 (8 TC) ICLP
Location: B2.04
16:00-16:15
Streamliners for Answer Set Programming (abstract) 15 min
Florentina Voboril1, Martin Gebser2, Stefan Szeider1, Alice Tarzariol2
1 Technical University of Vienna
2 University of Klagenfurt
16:15-16:30
Declarative Problem Solving in UAM Strategic Deconfliction (abstract) 15 min
Gioacchino Sterlicchio1, Angelo Oddi2, Riccardo rasconi2, Francesca Alessandra Lisi3
1 Polytechnic University of Bari
2 Institute of Cognitive Sciences and Technologies, National Research Council
3 University of Bari "Aldo Moro"
16:30-16:45
ASPIC: Proof-of-Concept ASP to Picat Transpiler (abstract) 15 min
Cristian Grozea1, Marius Popescu2
1 Fraunhofer
2 University of Bucharest
16:45-17:00
EZASP - Facilitating the usage of ASP (abstract) 15 min
Rafael Martins1, Matthias Knorr2, Ricardo Gonçalves3
1 Universidade Nova de Lisboa - Faculdade de Ciências e Tecnologia
2 NOVA FCT Lisbon
3 NOVA University Lisbon
17:00-17:15
Walk-In Multi-Stage Patient Flow Scheduling: An ASP Model with DES-Based Evaluation (abstract) 15 min
Ngoc-Mai Pham1, Trang-Linh Nguyen1, Thi-Hai-Yen Vuong1, Ha-Thanh Nguyen2, Van-Giang Trinh3
1 Knowledge Technology Laboratory, Faculty of Information Technology, VNU University of Engineering and Technology, Hanoi, Vietnam
2 National Institute of Informatics, Tokyo, Japan
3 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 (abstract) 15 min
Daimy Van Caudenberg1, Alexander Ek1, Carlos Cantero1, Bart Bogaerts1
1 KU Leuven
17:30-17:45
Modeling Deontic Modal Logic in ASP (abstract) 15 min
Gopal Gupta1, Alexis Tudor1, Joaquín Arias2, Elmer Salazar1, Abhiramon.Rajasekharan@UTDallas.edu
1 University of Texas at Dallas
2 Universidad Rey Juan Carlos
17:45-18:00
An Approach to the Abstract Interpretation of Goal-Directed Answer Set Programming (abstract) 15 min
Daniel Jurjo-Rivas1, Joaquín Arias2, Gopal Gupta3, Jose F. Morales1, Pedro López-García4, Manuel V. Hermenegildo1
1 Instituto IMDEA Software & UPM
2 Universidad Rey Juan Carlos
3 University of Texas at Dallas
4 Instituto IMDEA Software & CSIC
16:30-17:30 Session 9A Semantics of Programming Languages LICS
Session Chair:
Andrzej Murawski
Location: B1.04
16:30-17:00
Lazy Intermediate Representations for Algebraic Effects (abstract) 30 min
Simon Castellan1, Hugo Paquet2
1 Inria, IRISA, Univ. Rennes
2 Inria, École Normale Supérieure
17:00-17:30
Wiring the Pi-calculus to Denotational Semantics (abstract) 30 min
Ken Sakayori1, Davide Sangiorgi2, Simon Castellan3, Pierre Clairambault4
1 The University of Tokyo
2 Bologna University, Inria
3 Inria
4 CNRS, Aix-Marseille Université
16:30-17:30 Session 9B Games and Strategies under Uncertainty LICS
Session Chair:
Nir Piterman
Location: C1.03
16:30-17:00
Dicey Games: Shared Sources of Randomness in Distributed Systems (abstract) 30 min
Léonard Brice1, Thomas A. Henzinger1, K. S. Thejaswini2
1 Institute of Science and Technology Austria
2 Université Libre de Bruxelles
17:00-17:30
Mixing Any Cocktail with Limited Ingredients: On the Structure of Payoff Sets in Multi-Objective POMDPs and its Impact on Randomised Strategies (abstract) 30 min
James C. A. Main1, Mickael Randour2
1 University of Oxford
2 F.R.S.-FNRS & UMONS - Université de Mons
19:00-23:00 Banquet
Location: Praça de Touros do Campo Pequeno
Thursday, 23 July 2026
09:00-10:00 Keynote by Stéphanie Delaune LICS
Session Chair:
Joost-Pieter Katoen
Location: B1.04
09:00-10:00
Formal Verification of Security Protocols: 25 Years of ProVerif (abstract) 60 min
Stephanie Delaune1
1 CNRS
09:00-10:00 Invited Talk 2 SAT
Location: JJ Laginha
09:00-10:00 KR Invited: Joao Marques-Silva KR
Session Chair:
Renata Wassermann
Location: Grande Auditório
09:00-10:00
Rigorous Explainability by Feature Attribution: From SHAP to nuSHAP (abstract) 60 min
Joao Marques-Silva1
1 ICREA (Catalan Institution for Research and Advanced Studies)
09:00-10:00 Invited Talk 2 ICLP
Location: B2.04
09:00-10:00
From CLP(R) to MiniZinc: There and Back Again (abstract) 60 min
Peter Stuckey1
1 Monash University, Australia
09:00-10:00 Invited Talk: Andrej Bauer FSCD
Session Chair:
Frank Pfenning
Location: One03
09:00-10:00
Sheaves as Oracle Computations (abstract) 60 min
Danel Ahman1, Andrej Bauer2
1 Institute of Computer Science, University of Tartu
2 University of Ljubljana
10:00-10:30 Coffee Break FSCD
Location: One03
10:00-10:30 Coffee Break ICLP
Location: B2.04
10:00-11:00 Coffee Break CP
Location: One01
10:00-11:00 Coffee Break CP
Location: One02
10:00-10:30 Coffee Break KR
Location: Grande Auditório
10:00-10:30 Coffee Break KR
Location: B1.03
10:00-10:30 Coffee Break KR
Location: B2.03
10:00-10:30 Coffee Break SAT
Location: JJ Laginha
10:00-10:30 Coffee Break LICS
Location: B1.04
10:00-10:30 Coffee Break LICS
Location: C1.03
10:30-12:30 Session 10B Constraint Satisfaction LICS
Session Chair:
Maria Paola Bonacina
Location: C1.03
10:30-11:00
On the Computational Power of Extensional ESO (abstract) 30 min
Manuel Bodirsky1, Santiago Guzman Pro1
1 Institut für Algebra, TU Dresden
11:00-11:30
Towards infinite PCSP: a dichotomy for monochromatic cliques (abstract) 30 min
Demian Banakh1, Alexey Barsukov2, Tamio-Vesa Nakajima3
1 Jagiellonian University
2 Charles University
3 Philipps-University Marburg
11:30-12:00
Decidability of Interpretability (abstract) 30 min
Roman Feller1, Michael Pinsker1
1 TU Wien
12:00-12:30
Complexity Classes Arising from Circuits over Finite Algebraic Structures (abstract) 30 min
Piotr Kawałek1, Jacek Krzaczkowski2
1 TU Wien
2 Maria Curie-Sklodowska University, Lublin
10:30-12:30 Session 10A Constructive Mathematics & Type Theory LICS
Session Chair:
Marie Kerjane
Location: B1.04
10:30-11:00
The infinity category of infinity categories in simplicial type theory (abstract) 30 min
Daniel Gratzer1, Jonathan Weinberger2, Ulrik Buchholtz3
1 Aarhus University
2 Chapman University
3 University of Nottingham
11:00-11:30
Generalized Decidability via Brouwer Trees (abstract) 30 min
Tom de Jong1, Nicolai Kraus1, Aref Mohammadzadeh1, Fredrik Nordvall Forsberg2
1 University of Nottingham
2 University of Strathclyde
11:30-12:00
Eliminating reversals from cubical type theories (abstract) 30 min
Evan Cavallo1, Christian Sattler1
1 University of Gothenburg and Chalmers University of Technology
12:00-12:30
Fat cell structures and generalized algebraic theories (abstract) 30 min
Xu Huang1, Carlo Angiuli1
1 Indiana University
10:30-12:00 Session J: SMT & Theory Reasoning SAT
Location: JJ Laginha
10:30-11:00
Exact Symbolic Reasoning for Nonlinear Stochastic SMT via Cylindrical Algebraic Decomposition (abstract) 30 min
Jung-Cheng Lin1, Chia-Hsuan Su1, Jie-Hong R. Jiang1, Hiroshi Unno2
1 National Taiwan University
2 Tohoku University
11:00-11:30
d-DNNF Modulo Theories: A General Framework for Polytime SMT Queries (abstract) 30 min
Gabriele Masina1, Emanuele Civini1, Massimo Michelutti, Giuseppe Spallitta2, Roberto Sebastiani1
1 University of Trento
2 Rice University
11:30-12:00
SMT with Uninterpreted Functions and Monotonicity Constraints in Systems Biology (abstract) 30 min
Ondřej Huvar1, Martin Jonáš1, Samuel Pastva1
1 Masaryk University
10:30-12:30 Argumentation 2 KR
Session Chair:
Nico Potyka
Location: B1.03
10:30-10:55
Splitting Assumption-Based Argumentation Frameworks (abstract) 25 min
Giovanni Buraglio1, Wolfgang Dvořák1, Stefan Woltran1
1 TU Wien
10:55-11:15
Computational Complexity in Timed Argumentation Frameworks (abstract) 20 min
Jean-Guy Mailly1, Frédéric Maris2, Johannes P. Wallner3
1 IRIT, Université Toulouse Capitole
2 IRIT, Université de Toulouse
3 TU Graz
11:15-11:40
Splitting Argumentation Frameworks with Collective Attacks and Supports (abstract) 25 min
Giovanni Buraglio1, Lydia Blümel2, Matti Berthold2, Anna Rapberger3
1 TU Wien
2 FernUniversität in Hagen
3 TU Dortmund
11:40-12:05
Elucidating Arguments Maps in Propositional Logic: Addressing Enthymemes and their Relationships (abstract) 25 min
Jonathan Ben-Naim1, Victor David2, Anthony Hunter3
1 IRIT
2 Inria
3 University College London
12:05-12:30
Proof-search for normative and doxastic reasoning and its use in logical argumentation (abstract) 25 min
Kees van Berkel1, Andrea Sabatini2
1 TU Wien
2 Scuola Normale Superiore di Pisa
10:30-12:25 Description logic and learning KR
Session Chair:
Anni-Yasmin Turhan
Location: B2.03
10:30-10:55
Fitting Horn DL Ontologies to ABox and Query Examples: A Tale of Simulation Quantifiers and Finite Models (abstract) 25 min
Marvin Grosser1, Carsten Lutz1
1 Universität Leipzig
10:55-11:15
PAC Learning of Concept Inclusions for Ontology-Mediated Query Answering (abstract) 20 min
Sergei Obiedkov1, Barış Sertkaya2
1 TU Dresden
2 Frankfurt University of Applied Sciences
11:15-11:35
The Correspondence Between Bounded Graph Neural Networks and Fragments of First-Order Logic (Extended Abstract) (abstract) 20 min
Bernardo Cuenca Cuenca Grau1, Eva Feng1, Przemysław Wałęga2
1 University of Oxford
2 Queen Mary University of London
11:35-12:00
DeepEL: Deep Learning and Formal Description Logic Reasoning (abstract) 25 min
Alessandro Longato1, Ignacio ihuitzil@unizar.es, Rafael Peñaloza1
1 University of Milano-Bicocca
12:00-12:25
BoxLitE: A Faithful Knowledge Base Embedding Based on Convex Optimization (abstract) 25 min
Bruno F. Lourenço1, Hesham Morgan2, Ana Ozaki3, Aleksandar Pavlović4, Emanuel Sallinger2
1 The Institute of Statistical Mathematics
2 TU Wien
3 University of Oslo
4 University of Applied Science FH Campus Wien
10:30-12:30 Neural-symbolic learning and logic KR
Session Chair:
Stylianos Vasileiou
Location: Grande Auditório
10:30-10:55
Gradient-Based Optimization on Gödel Logic as Discrete Local Search (abstract) 25 min
Alessandro Daniele1, Emile van Krieken2
1 Fondazione Bruno Kessler, Free University of Bozen-Bolzano
2 Vrije Universiteit Amsterdam
10:55-11:20
Logic of Hypotheses: from Zero to Full Knowledge in Neurosymbolic Integration (abstract) 25 min
Davide Bizzaro1, Alessandro Daniele2
1 University of Padova, Fondazione Bruno Kessler
2 Fondazione Bruno Kessler, Free University of Bozen-Bolzano
11:20-11:45
Constraint-Based Analysis of Reasoning Shortcuts in Neurosymbolic Learning (abstract) 25 min
Akihiro Takemura1, Katsumi Inoue1, Masaaki Nishino2
1 National Institute of Informatics
2 NTT, Inc.
11:45-12:05
Graph-Based Attention for Differentiable MaxSAT Solving (abstract) 20 min
Sota Moriyama1, Katsumi Inoue2
1 The Graduate University of Advanced Studies, SOKENDAI and NII
2 NII
12:05-12:30
SC$^2$: Safe Control via Shielding for CPCTL specifications (abstract) 25 min
Edwin Hamel-De le Court1, Gaspard Ohlmann, Francesco Belardinelli2
1 University of Manchester
2 Imperial College London
10:30-12:30 Block 10 (4 TPLP) ICLP
Location: B2.04
10:30-11:00
ProDebug: An Automated Debugging System for Prolog (abstract) 30 min
Ricardo Brancas1,5, Vasco Manquinho3,4, Ruben Martins2
1 INESC-ID
2 Carnegie Mellon University, USA
3 NESC-ID
4 Instituto Superior Técnico, Universidade de Lisboa, Portugal
5 Instituto Superior Técnico
11:00-11:30
Efficiency of Analysis of Transitive Relations using Query-Driven, Ground-and-Solve, and Fact-Driven Inference (abstract) 30 min
Annie Liu1, John Idogun1, Scott D. Stoller1, Yi Tong1
1 Stony Brook University
11:30-12:00
Diamonds Are Forever: Stabilization Semantics for Unrestricted Aggregation and Recursion in Logica (abstract) 30 min
Evgeny Skvortsov1, Yilin Xia2, Shawn Bowers3, Ojaswa Garg1, Bertram Lud\"{a}scher2
1 Google
2 University of Illinois Urbana-Champaign
3 Gonzaga University
12:00-12:30
A Datalog Framework for Conflict-Free Replicated Data Types (abstract) 30 min
Elena Yanakieva1, Annette Bieniusa1, Stefania Dumbrava2
1 RPTU University Kaiserslautern-Landau
2 ENSIIE, INRIA Paris, SAMOVAR (Télécom SudParis)
10:30-12:00 Proof Assistants FSCD
Session Chair:
Liron Cohen
Location: One03
10:30-11:00
Constructing (Co)inductive Types via Large Sizes (abstract) 30 min
Bastiaan Laarakker1, Daniël Otten2, Benno van den Berg2
1 Leiden University
2 University of Amsterdam
11:00-11:30
Not choosing is still a choice: Constructive mathematics without any choice (abstract) 30 min
Martin Baillon1, Yannick Forster1, Dominik Kirst1, Assia Mahboubi1, Pierre-marie Pédrot1
1 INRIA
11:30-12:00
Divide and Check: Logical Relations, No Algorithms Attached (abstract) 30 min
Josselin Poiret1, Kenji Maillard2, Nicolas Tabareau2
1 Nantes Université
2 Inria
12:00-14:00 Lunch FSCD
Location: One03
12:00-14:00 Lunch CP
Location: One01
12:00-14:00 Lunch CP
Location: One02
12:00-13:30 Lunch SAT
Location: JJ Laginha
12:30-14:00 Lunch LICS
Location: B1.04
12:30-14:00 Lunch LICS
Location: C1.03
12:30-14:00 Lunch KR
Location: Grande Auditório
12:30-14:00 Lunch KR
Location: B1.03
12:30-14:00 Lunch KR
Location: B2.03
12:30-14:00 Lunch ICLP
Location: B2.04
13:30-15:30 Session K SAT
Location: JJ Laginha
14:00-16:00 Session 11B Modal and Guarded Logics LICS
Session Chair:
Christel Baier
Location: C1.03
14:00-14:30
The Size of Interpolants in Modal Logics (abstract) 30 min
Balder ten Cate1, Louwe Kuijer2, Frank Wolter2
1 Universiteit van Amsterdam
2 University of Liverpool
14:30-15:00
Computation and Size of Interpolants for Hybrid Modal Logics (abstract) 30 min
Jean Christoph Jung1, Jędrzej Kołodziejski2, Frank Wolter3
1 TU Dortmund University
2 University of Warsaw
3 University of Liverpool
15:00-15:30
Guarded Negation Transitive Closure Logic (abstract) 30 min
Diego Figueira1, Santiago Figueira2, Yoshiki Nakamura3
1 CNRS & Univ Bordeaux
2 University of Buenos Aires & CONICET
3 Chiba University, Institute of Science Tokyo
15:30-16:00
The Guarded Fragment with Nested Equivalence Relations (abstract) 30 min
Oskar Fiuk1
1 University of Wrocław
14:00-16:00 Session 11A Constructive Mathematics & Type Theory LICS
Session Chair:
Ulrik Buchholtz
Location: B1.04
14:00-14:30
Constructive higher sheaf models of type theory with applications to synthetic mathematics (abstract) 30 min
Thierry Coquand1, Jonas Höfer1, Christian Sattler1
1 University of Gothenburg and Chalmers University of Technology
14:30-15:00
Classifying 2-Groups in Homotopy Type Theory (abstract) 30 min
Perry Hart1, Owen Milner2
1 University of Minnesota, Twin Cities
2 Carnegie Mellon University
15:00-15:30
Cellular Methods in Homotopy Type Theory (abstract) 30 min
Axel Ljungström1, Loïc Pujet2
1 University of Nottingham
2 University of Strasbourg
15:30-16:00
A computer formalisation of the Serre finiteness theorem (abstract) 30 min
Reid Barton1, Axel Ljungström2, Owen Milner1, Anders Mörtberg3
1 Carnegie Mellon University
2 University of Nottingham
3 Stockholm University
14:00-16:00 Answer Set Programming 2 KR
Session Chair:
Matthias Knorr
Location: B1.03
14:00-14:25
Using ASP(Q) to Handle Inconsistent Prioritized Data (abstract) 25 min
Meghyn Bienvenu1, Camille Bourgaux2, Robin Jean1, Giuseppe Mazzotta3
1 CNRS & University of Bordeaux
2 CNRS & DI ENS
3 University of Calabria
14:25-14:50
Counting Complexity of ASP (abstract) 25 min
Max Bannach1, Johannes Fichte2, Johanna Groven2, Markus Hecher3
1 European Space Agency
2 Linköping University
3 CNRS, CRIL Lens
14:50-15:10
2-ASP(Q) Solving Based on CEGAR (abstract) 20 min
Andrea Cuteri1, Giuseppe Mazzotta1, Francesco Ricca1
1 University of Calabria
15:10-15:35
Inferring High-Level Events from Timestamped Data: Complexity and Medical Applications (abstract) 25 min
Yvon K. AWUKLU1, Meghyn Bienvenu2, Katsumi Inoue3, Fleur Mougin4, Vianney Jouhet5
1 CNRS & Université de Bordeaux & CHU de Bordeaux
2 CNRS & Université de Bordeaux
3 NII
4 Université de Bordeaux
5 CHU de Bordeaux & Université de Bordeaux
15:35-16:00
ALM–ASP: A Functional Agentic Architecture for Answer Set Programming (abstract) 25 min
Luis Angel Rodriguez Reiners1, Alice Tarzariol2, Mario Alviano1, Manuel Borroto Santana1, Konstantin Schekotihin2
1 Department of Mathematics and Computer Science - University of Calabria
2 Alpen-Adria Universität Klagenfurt
14:00-15:40 Beyond SAT KR
Session Chair:
Alexis de Colnet
Location: B2.03
14:00-14:25
Efficient Incremental #SAT via Cross-Instance Knowledge Reuse (abstract) 25 min
Uriya Bartal1, Dror Fried1, Jean-Marie Lagniez2
1 The Open University of Israel
2 CRIL
14:25-14:50
Finding Nash Stable Coalitions under Membership Rights in Boolean Hedonic Games (abstract) 25 min
Ari Conati1, Andreas Niskanen1, Ronald de Haan2, Matti Järvisalo1
1 University of Helsinki
2 University of Amsterdam
14:50-15:15
BAss: Symbolic Reasoning in Abstract Dialectical Frameworks (abstract) 25 min
Samuel Pastva1, Van-Giang Trinh2
1 Faculty of Informatics, Masaryk University, Brno, Czechia
2 Faculty of Computer Science and Engineering, Ho Chi Minh City University of Technology (HCMUT), VNU-HCM, Ho Chi Minh City, Vietnam
15:15-15:40
Clausal Deletion Backdoors for QBF: a Parameterized Complexity Approach (abstract) 25 min
Leif Eriksson, Victor Lagerkvist1, Sebastian Ordyniak2, George Osipov1, Fahad Panolan2, Mateusz Rychlicki
1 Linköping university
2 University of Leeds
14:00-16:00 Machine learning and explanation KR
Session Chair:
Nico Potyka
Location: Grande Auditório
14:00-14:25
RegD: Hierarchical Embeddings via Dissimilarity between Arbitrary Euclidean Regions (abstract) 25 min
Hui Yang1, Jiaoyan Chen1
1 University of Manchester
14:25-14:50
A Rectification-Based Approach for Distilling Boosted Trees into Decision Trees (abstract) 25 min
Gilles Audemard1, Sylvie Coste-Marquis2, Pierre Marquis2, Mehdi SABIRI2, Nicolas Szczepanski2
1 Université d'Artois,
2 Université d'Artois
14:50-15:15
Do Transformers Learn What Theory Predicts? Knowledge Representation-Guided Mechanistic Verification via Causal Abstraction (abstract) 25 min
Chang Lu1, Renate A. Schmidt2, Yizheng Zhao3
1 Yale University
2 The University of Manchester
3 Nanjing University
15:15-15:40
Verifying Quantized GNNs With Readout Is Decidable But Highly Intractable (abstract) 25 min
Artem Chernobrovkin1, Marco Sälzer2, François Schwarzentruber3, Nicolas Troquard1
1 Gran Sasso Science Institute
2 RPTU, Technical University of Kaiserslautern
3 École normale supérieure de Lyon
15:40-16:00
Extracting Verified Action Theories from Informal Specifications via Explanation-Guided Refinement (abstract) 20 min
Stylianos Loukas Vasileiou1, Minh Nguyen1, Tran Cao Son1, Huiping Cao1, Enrico Pontelli1
1 New Mexico State University
14:00-15:30 Block 11 (6 TC) ICLP
Location: B2.04
14:00-14:15
Bound-Founded Semantics for Answer Set Programming with Difference Constraints (abstract) 15 min
Pedro Cabalar1, Jorge Fandinno2, Nicolas Ruehling3, Torsten Schaub3, Sebastian Schellhorn3, Philipp Wanko3
1 University of A Coruña
2 University of Nebraska Omaha
3 University of Potsdam
14:15-14:30
hMKNGneg: Hybrid MKNF with Classical Negation (abstract) 15 min
Arun Raveendran Nair Sheela1, Christophe REY2, DE GRANCEY Florence3
1 Université Clermont Auvergne, LIMOS, Thales
2 Université Clermont Auvergne, LIMOS, CNRS, France
3 Thales
14:30-14:45
A New Well-Supported Semantics for Description Logic Programs (abstract) 15 min
Spencer Killen1, Jia-Huai You1
1 University of Alberta
14:45-15:00
chrKanren: Constraint Handling Rules in a Relational Language (abstract) 15 min
Rafaello Sanna1, William E. Byrd2, Nada Amin1
1 Harvard University
2 University of Alabama at Birmingham
15:00-15:15
Delayed Constraints in Narrowing for the Logic-Based Analyses of Real-Time Systems (abstract) 15 min
Santiago Escobar1, Raúl López-Rueda1, Carlos Olarte2
1 Universitat Politècnica de València
2 Université Sorbonne Paris Nord
15:15-15:30
CaVE: A Constraint Storage Approach to Handling Integrity Constraints (abstract) 15 min
Xiangyu Guo1, Ajay Bansal1
1 Arizona State University
14:00-15:30 Quantum Computation FSCD
Session Chair:
Claudia Faggian
Location: One03
14:00-14:30
Denotational semantics for stabiliser quantum programs (abstract) 30 min
Cole Comfort1, Robert Booth2
1 Université Paris-Saclay
2 University of Oxford
14:30-15:00
Simpler Presentations for Many Fragments of Quantum Circuits (abstract) 30 min
Colin BLAKE1
1 INRIA, LORIA, Université de Lorraine
15:00-15:30
Graphical Symplectic Algebra (abstract) 30 min
Robert I. Booth1, Titouan Carette2, Cole Comfort3
1 University of Oxford
2 LIX, CNRS, École polytechnique, Institut Polytechnique de Paris
3 Université Paris-Saclay
15:30-16:00 Coffee Break FSCD
Location: One03
15:30-16:00 Coffee Break ICLP
Location: B2.04
15:30-16:30 Coffee Break CP
Location: One01
15:30-16:30 Coffee Break CP
Location: One02
15:30-16:00 Coffee Break SAT
Location: JJ Laginha
16:00-18:00 Session L SAT
Location: JJ Laginha
16:00-16:30 Coffee Break LICS
Location: B1.04
16:00-16:30 Coffee Break LICS
Location: C1.03
16:00-16:30 Coffee Break KR
Location: Grande Auditório
16:00-16:30 Coffee Break KR
Location: B1.03
16:00-16:30 Coffee Break KR
Location: B2.03
16:00-17:45 Block 12 (1 RPR + 6 TC) ICLP
Location: B2.04
16:00-16:15
Learning from Answer Sets via Single-Shot Disjunctive ASP Encoding (abstract) 15 min
Roberto Borelli1, Agostino Dovier2
1 University of Padova
2 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 (abstract) 15 min
Maxime Mahout1
1 Inria Saclay, EPI Lifeware, 91120, Palaiseau, France
16:30-16:45
How Rules Represent Causal Knowledge: Causal Modeling with Probabilistic Logic Programming (abstract) 15 min
Kilian Rückschloß1, Felix Weitkämper2
1 Universität Tübingen
2 German University of Digital Science
16:45-17:00
Logic programming semantics for causal processes (abstract) 15 min
Felix Weitkämper1
1 German University of Digital Science
17:00-17:15
A Counterfactual Cause in Situation Calculus (abstract) 15 min
Daxin Liu1, Vaishak Belle2
1 Nanjing University
2 The University of Edinburgh
17:15-17:30
Explainability Framework for Policy-Aware Autonomous Agents (abstract) 15 min
Heather Merhout1, Daniela Inclezan1
1 Miami University
17:30-17:45
Explainable Belief Harmonization under Dynamic Epistemic Partitions (abstract) 15 min
Adam Kostka1, Jarosław A. Chudziak1
1 Warsaw University of Technology
16:00-17:30 Categorical Models FSCD
Session Chair:
Takeshi Tsukada
Location: One03
16:00-16:30
Proof Identity and Categorical Models of BV (abstract) 30 min
Matteo Acclavio1, Lutz Strassburger2, Vladimir Zamdzhiev3
1 University of Southern Denmark
2 INRIA Saclay
3 Université Paris-Saclay, CNRS, ENS Paris-Saclay, Inria, Laboratoire Méthodes Formelles
16:30-17:00
Relational Dualities and Bisimulation (abstract) 30 min
Piotr Kozicki1, G. A. Kavvos1
1 University of Bristol
17:00-17:30
The Universal Property of Petri Net Unfoldings (abstract) 30 min
Serge Lechenne1, Hugo Paquet1
1 Inria, École Normale Supérieure
16:30-17:00 KR closing session KR
Location: Grande Auditório
16:30-18:00 Session 12B Proof Theory, Fixed Points, and Meta-Complexity LICS
Session Chair:
Joel Ouaknine
Location: C1.03
16:30-17:00
The Algebra of Iterative Constructions (abstract) 30 min
Kevin Batz1, Benjamin Lucien Kaminski2, Lucas Kehrer3, Gerwin Klein4, Todd Schmid5, Henning Urbat6
1 Cornell University
2 Saarland University and University College London
3 Saarland University
4 Proofcraft & UNSW Sydney
5 Bucknell University
6 Friedrich-Alexander-Universität Erlangen-Nürnberg
17:00-17:30
Meta-mathematics of Algebraic Complexity (abstract) 30 min
Michal Garlik1, Svyatoslav Gryaznov1, Jiaqi Lu1, Rahul Santhanam2, Iddo Tzameret1
1 Imperial College London
2 University of Oxford
17:30-18:00
Axiomatisability of Alexandrov Dynamic Topological Logic (abstract) 30 min
Niels Vooijs1, David Fernández-Duque2
1 Universität Bern
2 University of Barcelona
16:30-18:00 Session 12A Constructive Mathematics & Type Theory LICS
Session Chair:
Rasmus Ejlers Møgelberg
Location: B1.04
16:30-17:00
Definitional Proof Irrelevance Made Accessible (abstract) 30 min
Thiago Felicissimo1, Yann Leray2, Loïc Pujet3, Nicolas Tabareau1, Éric Tanter4, Théo Winterhalter1
1 INRIA
2 Nantes Université
3 Université de Strasbourg
4 University of Chile
17:00-17:30
Problems with Fixpoints of Polynomials of Polynomials (abstract) 30 min
Cécilia Pradic1, Ian Price1
1 Swansea University
17:30-18:00
From Co-Coverages to Radicals in Complete Lattices (abstract) 30 min
Daniel Misselbeck-Wessel1
1 LMU Munich
17:30-18:00 End of Conference FSCD
Location: One03
17:30-17:45 Closing ICLP
Location: B2.04
Friday, 24 July 2026
08:30-10:00 Graphs IWC
Location: C6.02
08:30-09:30
Confluence of Rewrites on Term Graphs and Graphs (abstract) 60 min
Jean-Pierre Jouannaud1
1 ENS Paris-Saclay, France
09:30-10:00
Loop Elimination in Process Graphs is Confluent when Pruning Steps are Added (abstract) 30 min
Clemens Grabmayer1
1 Gran Sasso Science Institute
08:45-09:00 Opening session CMSB
Location: B2.01
08:45-09:00 Welcome SMT
Location: C1.04
08:55-09:00 ARQNL Opening ARQNL
Location: C4.01
08:55-09:00
Opening of the ARQNL Workshop (abstract) 5 min
Jens Otten1
1 .
09:00-09:50 ARQNL Invited Talk ARQNL
Location: C4.01
09:00-09:50
Decidable Non-Classical Analogues of Linear Temporal Logic (abstract) 50 min
David Fernández-Duque1
1 .
09:00-10:30 Invited Talk + Encodings SMT
Location: C1.04
09:00-10:00
SAT-Guided Gröbner Basis Methods for Arithmetic Circuit Verification (abstract) 60 min
Daniela Kaufmann1
1 TU Wien
10:00-10:30
An Eager Encoding of Array Summation Constraints (abstract) 30 min
Patrick Janoschek1, Roland Herrmann1, Philipp Rümmer2
1 University of Regensburg
2 Uppsala University, University of Regensburg
09:00-10:00 Session 1A UNIF
Session Chair:
Silvio Ghilardi
Location: C5.05
09:00-10:00
Specification of languages with binders and structural congruences: matching and unification modulo alpha, A, C (abstract) 60 min
Maribel Fernández1
1 King's College London
09:00-10:00 Invited talk Soft
Session Chair:
Simon de Givry
Location: C3.02
09:00-10:00
Combining Constraint Programming and Machine Learning: From Current Progress to Future Opportunities (abstract) 60 min
Quentin Cappart1
1 UCLouvain and Polytechnique Montréal
09:00-09:10 Welcome XLoKR-ExCoS
Location: C4.08
09:00-10:20 Formal Verification WiL
Location: C5.06
09:00-09:20
Formal verification of security protocols with certification (abstract) 20 min
R Ramanujam1, Vaishnavi Sundararajan2, S P Suresh3
1 Azim Premji University
2 IIT Delhi
3 Chennai Mathematical Institute
09:20-09:40
Verifiable Higher-Order Automated Reasoning (abstract) 20 min
Melanie Taprogge1
1 University of Greifswald, Université Paris-Saclay
09:40-10:00
Growing HOLMS: Grzegorczyk Logic and Experiments with Translations in HOL Light (abstract) 20 min
Antonella Bilotta1, Cosimo Perini Brogi2, Marco Maggesi3
1 Scuola Normale Superiore di Pisa
2 IMT School for Advanced Studies Lucca
3 University of Florence
10:00-10:20
Discourse analysis of mathematical texts (abstract) 20 min
Gwenaelle Leon1
1 Université Paris Cité
09:00-10:30 Equality reasoning(?) Vampire
Location: C4.02
09:00-09:50
Experimental Results for Vampire on the Equational Theories Project (abstract) 50 min
Mikolas Janota1
1 CTU, Prague
09:50-10:10
Some Experiments with Twee-Style Goal-Directedness (abstract) 20 min
Stephan Schulz1
1 DHBW Stuttgart
10:10-10:30
Reset Early, Reset Often, Eliminate Models (abstract) 20 min
Martin Fixman1, Fredrik Rømming1, Sean B. Holden1
1 University of Cambridge
09:00-10:10 Morning 1 RajeevFest
Location: C2.01
09:00-09:10
Welcome and Opening Remarks (abstract) 10 min
Loris DAntoni1
1 UCSD
09:10-09:40
Advising Rajeev (abstract) 30 min
David Dill1
1 Stanford
09:40-10:10
Stateful Thinking (abstract) 30 min
Thomas Henzinger1
1 IST
09:00-10:30 Invited talks + round table discussion SAIV
Session Chair:
Guy Avni
Location: C1.03
09:00-09:30
Neural Stochastic Control and Verification for Safe Autonomy (abstract) 30 min
Djordje Zikelic1
1 Singapore Management University
09:30-10:00
A high-level view on causal representation learning with actions (abstract) 30 min
Sara Magliacane1
1 University of Amsterdam
10:00-10:30
Round-table discussions (abstract) 30 min
Djordje Zikelic1, Sara Magliacane2
1 Singapore Management University
2 University of Amsterdam
09:00-10:00 Invited Talk 1 THEMA
Session Chair:
Zeynep G. Saribatur
Location: C4.05
09:00-10:30 Recording proofs TPTPTP
Session Chair:
Geoff Sutcliffe
Location: C2.05
09:00-09:30
What is an Acceptable Proof? (abstract) 30 min
Geoff Sutcliffe1
1 University of Miami
09:30-10:00
Recording and Verifying Skolemizations (abstract) 30 min
Geoff Sutcliffe1
1 University of Miami
10:00-10:30
Recording and Verifying Interferences (abstract) 30 min
Martin Suda1,3, Michael Rawson2
1 CTU
2 University of Southampton
3 CIIRC
09:00-10:00 Keynote: Anna Niarakis CMSB
Location: B2.01
09:00-09:30 Welcome & Remembering Joseph Y. Halpern (Sander Beckers, Hana Chockler, Moshe Vardi) CREST
Session Chair:
Borzoo Bonakdarpour
Location: C1.01
09:00-10:30 Session 1 CI-BD-SOQE
Location: C5.01
09:00-10:00
Invited Talk: Agent Interpolation in Distributed Systems (abstract) 60 min
Marta Bílková1
1 Czech Academy of Sciences, Czechia
10:00-10:30
Interpolation above S4 (abstract) 30 min
Simon Santschi1, Niels C. Vooijs1
1 Universität Bern
09:00-09:15 opening ACV
Location: C4.07
09:00-10:00 Invited talk 1 LINDA
Location: B2.02
09:00-10:00
Probabilistic Databases for Dealing with Missing Values that are Governed by Missingness Mechanisms (abstract) 60 min
Leopoldo Bertossi1
1 Carleton University and IMFD
09:00-10:00 Invited talk LFMTP
Session Chair:
Olivier Hermant
Location: C5.02
09:00-10:00
It’s the End of the World as We Know It, and I Feel Funny (abstract) 60 min
Alberto Momigliano1
1 University of Milan.
09:00-10:00 Keynote 1 Isabelle
Location: C5.07
09:00-10:00
Isabelle: the last 40 years (and the next) (abstract) 60 min
Lawrence Paulson1
1 FRS
09:10-10:15 Inconsistency & Repair XLoKR-ExCoS
Location: C4.08
09:10-09:35
Towards Explaining Repairs of Inconsistent Qualitative Constraint Networks (abstract) 25 min
Moritz Bayerkuhnlein1, Tobias Schwartz1, Diedrich Wolter1
1 University of Lübeck
09:35-10:00
Towards Visual Decision Support in Interactive Repair (Extended Abstract) (abstract) 25 min
Christian Alrabbaa1, Franz Baader1, Raimund Dachselt1, Pratistha Kansakar1, Julián Méndez1, Afshin Zanganeh1
1 TU Dresden
10:00-10:15
Efficient MUS Extraction with High-Level Model Rotation (abstract) 15 min
Orestis Lomis1, Hendrik Bierlee1, Tias Guns1
1 KU Leuven
09:15-09:30 Welcome PCCR
Session Chair:
Sebastian Ordyniak
Location: C4.06
09:15-10:30 24am1 ACV
Location: C4.07
09:15-10:00
tba (Invited Talk) (abstract) 45 min
Benjamin Kaminski1
1 Saarland University and University College London
10:00-10:30
Certified Harmonic-Mean Abstraction and Refinement for Continuous-Time Markov Chains (abstract) 30 min
Bingqing Hu1, Thomas Nowak2, Jixun Zhan1, Chris J. Myers3, Zhen Zhang1
1 Utah State University
2 ENS Paris-Saclay
3 University of Colorado Boulder
09:30-10:30 Invited Talk by Sander Beckers CREST
Session Chair:
Borzoo Bonakdarpour
Location: C1.01
09:30-10:30
Nondeterministic Causal Models (abstract) 60 min
Sander Beckers1
1 University College London, UK
09:30-10:30 George Osipov PCCR
Session Chair:
Sebastian Ordyniak
Location: C4.06
09:30-10:30
tba (abstract) 60 min
George Osipov1
1 Royal Holloway, University of London
09:50-10:30 ARQNL Session 1: Modal Logics ARQNL
Location: C4.01
09:50-10:10
Algorithmic Properties of First-Order Modal Logics of Some Classes of Trees (abstract) 20 min
Dmitry Shkatov1, Mikhail Rybakov1
1 .
10:10-10:30
Interpolation Calculi for Modal Logics (abstract) 20 min
Jonte Deakin1, Dirk Pattinson1, Cláudia Nalon1
1 .
10:00-10:30 Session 1B UNIF
Session Chair:
Silvio Ghilardi
Location: C5.05
10:00-10:30
An Order-Theoretic View on Optimal Repairs and Complete Sets of Unifiers (Extended Abstract) (abstract) 30 min
Franz Baader1
1 TU Dresden
10:00-11:00 Coffee Break SMT
Location: C1.04
10:00-10:30 Coffee Break Soft
Location: C3.02
10:00-11:00 Coffee Break SD
Location: C5.08
10:00-10:30 Coffee Break THEMA
Location: C4.05
10:00-11:00 Coffee Break PERR
Location: C2.02
10:00-10:30 Coffee Break CMSB
Location: B2.01
10:00-10:30 Papers 1a Isabelle
Location: C5.07
10:00-10:30
A Tale of Two Multiset-like Types in Isabelle/HOL (abstract) 30 min
Mathias Schack Rabing1, Dmitriy Traytel1
1 University of Copenhagen
10:00-11:00 Coffee Break ARQNL
Location: C4.01
10:00-10:30 Coffee Break LFMTP
Location: C5.02
10:00-10:20 Poster announcements 1 LINDA
Location: B2.02
10:00-10:05
Model Repairing And Belief Change Operators (abstract) 5 min
Daniel Grimaldi1,3,4, Edwin Pin Baque2
1 University of Cape Town and CAIR
2 Departamento de Matemática, Facultad de Ciencias Exactas y Naturales, Universidad de Buenos Aires
3 Departamento de Computación, Facultad de Ciencias Exactas y Naturales, Universidad de Buenos Aires
4 Instituto de Investigación en Ciencias de la Computación, UBA-CONICET
10:05-10:10
Approximate Functional Dependencies—Implication Problem Revisited (abstract) 5 min
Nicolas Fröhlich1, Matilda Häggblom2, Åsa Hirvonen2, Minna Hirvonen1
1 Leibniz Universität of Hannover
2 University of Helsinki
10:10-10:15
Bridging Statistical and Logical Perspectives on Inconsistency (abstract) 5 min
Lorenzo Zuccato1, Anne-Marie George1, Valeria Vitelli1, Arnoldo Frigessi1, Martin Giese1, Ida Scheel1
1 University of Oslo
10:15-10:20
A Closure-Based Semantics for Inconsistency Tolerant Agents (abstract) 5 min
Linda Gutsche1
1 Univ. Grenoble Alpes, Inria, CNRS, Grenoble INP, LIG, F-38000 Grenoble, France
10:00-10:30 Coffee Break IWC
Location: C6.02
10:10-10:40 Coffee Break RajeevFest
Location: C2.01
10:15-10:30 Coffee Break XLoKR-ExCoS
Location: C4.08
10:20-10:40 Quantum Logic WiL
Location: C5.06
10:20-10:40
Quantum Coherence Spaces Revisited: A von Neumann (Co)Algebraic Approach (abstract) 20 min
Thea Li1, Vladimir Zamdzhiev1
1 Université Paris-Saclay, CNRS, ENS Paris-Saclay, Inria, Laboratoire Méthodes Formelles
10:20-11:15 Coffee Break and Poster Session 1 LINDA
10:30-12:30 Confluence & Formalization IWC
Location: C6.02
10:30-11:00
Verifying and Generalizing Simultaneous Critical Pairs (abstract) 30 min
Rene Thiemann1
1 University of Innsbruck
11:00-11:30
Confluence of Orthogonal Deterministic Higher-Order Pattern Rewrite Systems (abstract) 30 min
Johannes Niederhauser1, Aart Middeldorp1
1 University of Innsbruck
11:30-12:00
Confluence of bang modulo (abstract) 30 min
Vincent van Oostrom1, Giulio Guerrieri1
1 University of Sussex
12:00-12:30
On Completeness of the Decreasing Diagrams Method for Proving Confluence of Rewriting Systems of Cardinalities Below the First Uncountable Limit Cardinal (abstract) 30 min
Ievgen Ivanov1
1 Taras Shevchenko National University of Kyiv
10:30-12:00 Unification LFMTP
Session Chair:
Sophie Tourret
Location: C5.02
10:30-11:00
Anti-Unification Completeness Analysis in PVS (abstract) 30 min
Mauricio Ayala-Rincon1, Thaynara Arielly de Lima2, Maria Júlia Dias Lima1, Temur Kutsia3,4, Marcos Mercandeli-Rodrigues1
1 Universidade de Brasília
2 Universidade Federal de Goiás
3 RISC
4 Johannes Kepler Universität
11:00-11:30
Formalizing Calculi with Unconventional Substitution (abstract) 30 min
Miguel Alves1, José Espírito Santo2, Luís Pinto2
1 Departamento de Matemática, Universidade do Minho, Portugal
2 Centro de Matemática da Universidade do Minho, Portugal
11:30-12:00
Work-in-Progress: A Tactic for Pattern Matching in Autosubst (abstract) 30 min
Mathews George1, Kathrin Stark1
1 Heriot-Watt University Edinburgh
10:30-11:00 Coffee Break Isabelle
Location: C5.07
10:30-12:30 Boolean and Qualitative Networks CMSB
Location: B2.01
10:30-11:00
Source-Target Control of Boolean Networks with Minimal Edge Perturbations (abstract) 30 min
Gustavo Magaña-López1, Andrzej Mizera2, Jun Pang3
1 Université du Luxembourg,
2 University of Warsaw
3 University of Luxembourg
11:00-11:30
Modulation-Reaction Networks (abstract) 30 min
Leo Lobski1, Yoàv Montacute2
1 University College London
2 National Institute of Informatics
11:30-12:00
Inference of qualitative models from steady-state data via weighted MaxSMT (abstract) 30 min
Ondřej Huvar1, Nikola Beneš1, Martin Jonáš1, David Šafránek1, Samuel Pastva1
1 Masaryk University
12:00-12:30
pyModRev: a Python Tool for Model Revision of Boolean Networks (abstract) 30 min
Pedro T. Monteiro1,4, Filipe Gouveia2,3
1 INESC-ID
2 LASIGE
3 Ciências - Universidade de Lisboa
4 IST - Universidade de Lisboa
10:30-11:00 Coffee Break CREST
Location: C1.01
10:30-11:00 Coffee Break ACV
Location: C4.07
10:30-11:00 Coffee Break CI-BD-SOQE
Location: C5.01
10:30-11:00 Coffee Break Vampire
Location: C4.02
10:30-12:00 Argumentation & Description Logics XLoKR-ExCoS
Location: C4.08
10:30-10:55
Interpretable Automated Essay Scoring via Quantitative Bipolar Argumentation (abstract) 25 min
Xiang Yin1
1 Imperial College London
10:55-11:20
ProofTeller: Exposing Recency Bias in LLM Reasoning and Its Side Effects on Communication (Extended Abstract) (abstract) 25 min
Mayank Jobanputra1, Alisa Kovtunova2, Brisca Balthes3, Fedor Grigoryevich Pogulskiy2, Yifan Wang1, Stefan Borgwardt2, Vera Demberg1
1 Saarland University
2 TU Dresden
3 Saarland University and Zuse School ELIZA
11:20-11:45
In the Heart of the Beholder: User-Tailored Explanations for Description Logics (Extended Abstract) (abstract) 25 min
Stefan Borgwardt1, Anke Hirsch2, Nina Knieriemen2, Alisa Kovtunova1
1 TU Dresden
2 Saarland University and DFKI
11:45-12:00
From User Preferences to Base Score Extraction Functions in Gradual Argumentation - Extended Abstract (abstract) 15 min
Aniol Civit1, Antonio Rago2, Antonio Andriella1, Guillem Alenyà1, Francesca Toni3
1 Institut de Robòtica i Informàtica Industrial, CSIC-UPC
2 King's College London
3 Imperial College London
10:30-12:00 Session 1 Soft
Session Chair:
Simon de Givry
Location: C3.02
10:30-11:00
On the use of ML and LLM for hard scheduling problems (abstract) 30 min
Guillaume Povéda1, Florent Teichteil-Koenigsbuch1
1 Airbus SAS
11:00-11:30
Learning Unified Graph and Language Representations for SMT Algorithm Selection (abstract) 30 min
Zhengyang John Lu1, Paul Sarnighausen-Cahn2, Jiahao Chen3, Arie Gurfinkel1, Florin Manea2, Vijay Ganesh3
1 University of Waterloo
2 University of Göttingen and CIDAS
3 Georgia Institute of Technology
11:30-12:00
Efficiently Solving Constraint Optimization Problems Using Learning-Based Techniques (abstract) 30 min
Romaissa GHLIB1, Abdelkader OUALI1, Jeab-Luc LAMOTTE1, Samir Loudni2
1 GREYC, CNRS, Normandie Univ, ENSICAEN, Universit\'e de Caen Normandie, Caen, France
2 TASC (LS2N-CNRS), IMT Atlantique, 44307, Nantes, France
10:30-11:00 Coffee Break (I) ARQNL
10:30-11:00 Coffee Break SAIV
Location: C1.03
10:30-11:50 Session 1 THEMA
Session Chair:
Zeynep G. Saribatur
Location: C4.05
10:30-11:00 Coffee Break TPTPTP
Location: C2.05
10:30-11:00 Coffee Break PCCR
Location: C4.06
10:30-11:00 Coffee Break UNIF
Location: C5.05
10:40-12:10 Morning 2 RajeevFest
Location: C2.01
10:40-11:10
A Trajectory in Verification: Foundations with Rajeev and the Shift to Practice (abstract) 30 min
Salvatore La Torre1
1 Universita' di Salerno
11:10-11:40
If Practice Won't Come to Theory, Then Theory Must Go to Practice: How to Analyze and Optimize Shell Scripts (abstract) 30 min
Konstantinos Kallas1
1 UCLA
10:40-11:00 Coffee Break WiL
Location: C5.06
11:00-12:00 Invited Talk: Sara Uckelman WiL
Location: C5.06
11:00-12:00 Machine learning Vampire
Location: C4.02
11:00-11:20
Machine-Learned Clause Selection: Intricacies and Surprises (abstract) 20 min
Martin Suda1
1 Czech Institute of Informatics, Robotics, and Cybernetics
11:20-11:40
ProofAtlas: A Saturation Prover with Integrated Neural Clause Selection (abstract) 20 min
Alexander Pluska1, Florian Zuleger1
1 TU Wien
11:40-12:00
Towards Lemma Mining: Concurrent Lemma Exploration via Vampire and Large Language Models (abstract) 20 min
Daragh King1
1 Trinity College Dublin
11:00-12:15 ARQNL Session 2: Definite Descriptions and Free Logics ARQNL
Location: C4.01
11:00-11:20
Sequent Calculus for Negative Free Logic of Classes (abstract) 20 min
Andrzej Indrzejczak1
1 .
11:20-11:40
Second-order Positive Free Logic with Second-order Definite Descriptions (abstract) 20 min
Yaroslav Petrukhin1
1 .
11:40-11:55
Python-Based Reasoner for Description Logic with Definite Descriptions (abstract) 15 min
Michał Sochański1, Przemysław Wałęga1, Michał Zawidzki1
1 .
11:55-12:15
A Paradefinite Version of Russellian Theory of Definite Descriptions (abstract) 20 min
Yaroslav Petrukhin1
1 .
11:00-12:30 MCSat & Nonlinear Arithmetic SMT
Location: C1.04
11:00-12:30 Session 2 UNIF
Location: C5.05
11:00-11:30
Quantitative Generalization for Variadic Nominal Terms (abstract) 30 min
Alexander Baumgartner1, Temur Kutsia2
1 Instituto de Ciencias de la Ingeniería, Universidad de O'Higgins
2 Research Institute for Symbolic Computation, Johannes Kepler University
11:30-12:00
The Unification Type of an Equational Theory May Depend on the Instantiation Preorder (Extended Abstract) (abstract) 30 min
Oliver Fernández Gil1, Franz Baader1
1 TU Dresden
12:00-12:30
On Completeness of Absorptive Anti-Unification (abstract) 30 min
Marcos Mercandeli-Rodrigues1, Andrés Felipe González Barragán1, David M. Cerna2, Temur Kutsia3, Mauricio Ayala-Rincón4
1 Universidade de Brasília
2 Czech Academy of Sciences
3 Research Institute for Symbolic Computation, JKU
4 Universidade de Brasilía
11:00-12:00 Contributed talks and short presentations SAIV
Session Chair:
Guy Avni
Location: C1.03
11:00-11:15
Temporal Guardrails for LLM Conversations: A Runtime Verification Framework (abstract) 15 min
Itay Cohen1, Moran Omer1, Doron Peled1, Klaus Havelund2
1 Bar Ilan University
2 Jet Propulsion Laboratory, California Inst. of Technology
11:15-11:30
MetaMoE: Formal Verification of Compositional Robustness and Scalability of Mixture-of-Experts Architecture (abstract) 15 min
Quang Pham1, Ben Wooding1, Luke Nam1, Samuel Sasaki1, Taylor T. Johnson1
1 Vanderbilt University
11:30-11:37
Solving Probabilistic Verification Problems of Neural Networks using Branch and Bound (abstract) 7 min
David Boetius1, Stefan Leue1, Tobias Sutter2
1 University of Konstanz
2 University of St. Gallen
11:37-11:44
VeRecycle: Reclaiming Guarantees from Probabilistic Certificates for Stochastic Dynamical Systems after Change (abstract) 7 min
Sterre Lutz1, Matthijs T.J. Spaan1, Anna Lukina1
1 Delft University of Technology
11:44-11:51
PICID: Proof-Driven Clause Learning in Neural Network Verification (abstract) 7 min
Omri Isac1, Idan Refaeli1, Haoze Wu2, Clark Barrett3, Guy Katz1
1 The Hebrew University of Jerusalem
2 Amherst College
3 Stanford University
11:51-11:58
Precise Verification of Transformers through ReLU-Catalyzed Abstraction Refinement (abstract) 7 min
Hengjie Liu1, Zhenya Zhang1, Jianjun Zhao1
1 Kyushu University
11:00-12:30 Proof expectations TPTPTP
Session Chair:
Geoff Sutcliffe
Location: C2.05
11:00-11:30
Layers of Proof Expectations for CASC (abstract) 30 min
Geoff Sutcliffe1
1 University of Miami
11:30-12:00
Layers of Proof Expectations for ProoVer (abstract) 30 min
Julie Cailler1, Simon Guilloud2
1 Loria, University of Lorraine & Inria
2 EPFL - Swiss Federal Technology Institute of Lausanne
11:00-12:30 Contributed Talks PCCR
Session Chair:
Sebastian Ordyniak
Location: C4.06
11:00-11:30
Parameterized Hardness of Zonotope Containment and Neural Network Verification (abstract) 30 min
Moritz Stargalla1
1 University of Technology Nuremberg
11:30-12:00
Non-Clashing Teaching in Graphs (abstract) 30 min
Liana Khazaliya1, Fionn Mc Inerney2, Sujoy Bhore3
1 TU Wien
2 Telefonica
3 IIT Bombay
12:00-12:30
An Optimal Algorithm for Fair Gerrymandering (abstract) 30 min
Kevin Kurien Alex1, Rajesh Chitnis1
1 University of Birmingham
11:00-12:30 Session 2 CI-BD-SOQE
Location: C5.01
11:00-11:30
Craig-Lyndon Interpolation for the Logic of Here and There with a Variation of Mints' Sequent System (abstract) 30 min
Christoph Wernhard1
1 University of Potsdam
11:30-12:00
Craig Interpolation Theorem in the Logic of Russellian Definite Descriptions (abstract) 30 min
Andrzej Indrzejczak1
1 University of Lodz
12:00-12:30
Modular Constructive Lyndon Interpolation for Nondistributive Logics (abstract) 30 min
Andrea De Domenico1, Giuseppe Greco2, Alessandra Palmigiano2, Apostolos Tzimoulis3
1 IMDEA Software Institute
2 Vrije Universiteit Amsterdam
3 University of Luxembourg
11:00-12:00 24am2 ACV
Location: C4.07
11:00-11:30
Constrained and Robust Policy Synthesis with Satisfiability-Modulo-Probabilistic-Model-Checking (abstract) 30 min
Linus Heck1, Filip Macák2, Milan Češka2, Sebastian Junges1
1 Radboud University
2 Brno University of Technology
11:30-12:00
Stochastic Processes: Coinduction in Probabilistic Programming (abstract) 30 min
Seo Jin Park1
1 University of Oxford
11:00-12:30 Contributed Presentations 1 CREST
Session Chair:
Norine Coenen
Location: C1.01
11:00-11:18
An Actual Causality Calculus for Process Algebra (abstract) 18 min
Georgiana Caltais1, Nadine Muller1
1 University of Twente
11:18-11:36
Causal Models in LogiKEy (abstract) 18 min
Luca Pasetto1, Apostolos Tzimoulis1, Christoph Benzmüller2
1 University of Luxembourg
2 University of Bamberg & FU Berlin
11:36-11:54
A Concurrency-Theoretic Framework for Actual Causation (abstract) 18 min
Julian Bradfield1, Christian Odenwald1
1 University of Edinburgh
11:54-12:12
Figuring Out The Reasons Behind the Rules we Follow (abstract) 18 min
Houssam Abbas1, Alena Makarova1
1 Oregon State University
12:12-12:30
Unification and Explanation from a Causal Perspective (abstract) 18 min
Christian J. Feldbacher-Escamilla1
1 University of Cologne
11:00-12:20 Papers 1b Isabelle
Location: C5.07
11:00-11:30
IsaSearch: Semantic Natural-Language Search for the Archive of Formal Proofs (abstract) 30 min
Fabian Kadlez1, Balazs Toth1
1 Ludwig-Maximilians-Universität München
11:30-12:00
Isabelle in a Compiler-Construction Class --- Conception, Tooling, and Experiences (abstract) 30 min
Burkhart Wolff1, Achim D. Brucker2
1 Universite Paris-Saclay
2 University of Exeter
12:00-12:20
Teaching AutoCorrode in an Automated Reasoning Course (abstract) 20 min
Örs Nagy1, Jónas Mittún Peltonen1, Jørgen Villadsen1
1 Technical University of Denmark
11:15-12:45 Talk session 1 LINDA
Location: B2.02
11:15-11:45
Range Consistent Query Answering via Rewriting (abstract) 30 min
Jef Wijsen1
1 University of Mons (UMONS)
11:45-12:15
Towards a Thorough Understanding of ABox Abduction Under Repair Semantics (abstract) 30 min
Anselm Haak1, Patrick Koopmann2, Yasir Mahmood1, Anni-Yasmin Turhan1
1 Paderborn University
2 Vrije Universiteit Amsterdam
12:15-12:45
Towards an End-to-End ASP-Based System for Handling Inconsistent Prioritized Data (abstract) 30 min
Meghyn Bienvenu1, Camille Bourgaux2, Katsumi Inoue3, Robin Jean1, Giuseppe Mazzotta4
1 CNRS & University of Bordeaux
2 CNRS & DI ENS
3 National Institute of Informatics, Tokyo
4 University of Calabria
12:00-14:00 Lunch LFMTP
Location: C5.02
12:00-14:00 Lunch ACV
Location: C4.07
12:00-14:00 Lunch THEMA
Location: C4.05
12:00-13:30 Lunch SAIV
Location: C1.03
12:00-14:00 Lunch PERR
Location: C2.02
12:00-14:00 Lunch SMT
Location: C1.04
12:00-13:40 Lunch Vampire
Location: C4.02
12:00-12:40 Semantics WiL
Location: C5.06
12:00-12:20
A Truthmaker Semantics for Positive Free Logic (abstract) 20 min
Ragna Talea Oeynhausen1
1 LMU Munich
12:20-12:40
Reflexivity and the Blocking of Semantic Paradox (abstract) 20 min
Shuwen Wu1
1 Fudan University
12:00-14:00 Lunch Soft
Location: C3.02
12:00-14:00 Lunch SD
Location: C5.08
12:00-13:45 Lunch XLoKR-ExCoS
Location: C4.08
12:10-14:00 Lunch RajeevFest
Location: C2.01
12:15-13:30 Lunch ARQNL
Location: C4.01
12:20-14:00 Lunch Isabelle
Location: C5.07
12:30-14:00 Lunch IWC
Location: C6.02
12:30-14:00 Lunch CI-BD-SOQE
Location: C5.01
12:30-14:00 Lunch CREST
Location: C1.01
12:30-14:00 Lunch CMSB
Location: B2.01
12:30-14:00 Lunch TPTPTP
Location: C2.05
12:30-14:00 Lunch PCCR
Location: C4.06
12:30-14:00 Lunch UNIF
Location: C5.05
12:40-14:00 Lunch WiL
Location: C5.06
12:45-13:45 Lunch LINDA
Location: B2.02
13:30-14:50 ARQNL Session 3: Proof Theory and Substructural Logics ARQNL
Location: C4.01
13:30-14:15 VNN-COMP SAIV
Session Chair:
Taylor T. Johnson
Location: C1.03
13:40-15:00 Proof checking & applications Vampire
Location: C4.02
13:40-14:00
VaLeaDATE: Checking TSTP Proofs for Soundness (abstract) 20 min
Jonas Bodingbauer1
1 TU Wien
14:00-14:20
Lean on Thousands of Problems (abstract) 20 min
Axel Polaczek1, Laura Kovacs1
1 TU Wien
14:20-14:40
Identifying and Explaining (Non-)Equivalence of First-Order Logic Formulas (abstract) 20 min
Fabian Vehlken1, Thomas Zeume1, Emilio Carrasco Bustamante2, Maëlle Cornély3, Lukas Pradel1
1 Ruhr University Bochum
2 TU Dortmund University
3 Université Paris-Saclay, ENS Paris-Saclay
14:40-15:00
SigmaKEE-rs: An Embedded Ontological Reasoning System with Vampire as a Reusable Library Component (abstract) 20 min
Adam Pease1, Theodore Kim1
1 Naval Postgraduate School
13:45-15:00 LLMs and Reasoning XLoKR-ExCoS
Location: C4.08
13:45-14:10
Extracting Verified Action Theories from Informal Specifications via Explanation-Guided Refinement (abstract) 25 min
Stylianos Vasileiou1, Minh Nguyen1, Tran Cao Son1, Huiping Cao1, Enrico Pontelli1
1 New Mexico State University
14:10-14:35
Argumentation for Explainable and Globally Contestable Decision Support with LLMs (abstract) 25 min
Adam Dejl1, Matthew Williams1, Francesca Toni1
1 Imperial College London
14:35-15:00
Latent Debate: A Surrogate Framework for Interpreting LLM Thinking towards Binary Decisions (Extended Abstract) (abstract) 25 min
Lihu Chen1, Xiang Yin1, Francesca Toni1
1 Imperial College London
13:45-14:45 Talk session 2 LINDA
Location: B2.02
13:45-14:15
Optimal Correction Sets for Argumentative Causal Discovery (abstract) 30 min
Fabrizio Russo1, Giuseppe Mazzotta2, Carmine Dodaro2, Francesco Ricca2, Francesca Toni1
1 Imperial College London
2 University of Calabria
14:15-14:45
A local perspective on inconsistency in data-graphs (abstract) 30 min
Nina Pardal1, Maria Vanina Martinez2
1 University of Edinburgh
2 IIIA-CSIC
14:00-15:30 Variants of Term Rewriting Systems IWC
Location: C6.02
14:00-14:30
Disproving Reachability in Probabilistic Term Rewriting (abstract) 30 min
Jan-Christoph Kassing1, Moritz Leven Rosarius1, Henri Nagel1, Jürgen Giesl1
1 RWTH Aachen University
14:30-15:00
Enumerating Ground Canonical Rewrite Systems (abstract) 30 min
Masahiko Sakai1, Aart Middeldorp2, Sarah Winkler3
1 Nagoya University
2 University of Innsbruck
3 Free University of Bozen-Bolzano
15:00-15:30
On Proving Confluence of Generalized Term Rewriting Systems Using CONFident (abstract) 30 min
Raúl Gutiérrez1, Salvador Lucas1
1 Universitat Politècnica de València
14:00-15:00 Calculi LFMTP
Session Chair:
Sophie Tourret
Location: C5.02
14:00-14:30
Barbed Similarity for the π-Calculus in Beluga: A Case Study in Coinductive Reasoning (abstract) 30 min
Lea Trogni1, Gabriele Cecilia2, Alberto Momigliano1
1 Università degli Studi di Milano
2 Augusta University
14:30-15:00
A Strategy Language for Controlled Proof Search (abstract) 30 min
Romain Sidhoum1, Simon Robillard1, David Delahaye1
1 LIRMM, Univ Montpellier, CNRS
14:00-15:00 Tutorial 1 Isabelle
Location: C5.07
14:00-15:00
Isabelle/ML tool development (abstract) 60 min
Jasmin Blanchette1, Dmitriy Traytel2
1 LMU
2 UCPH
14:00-16:00 Rule-Based and Stochastic Modelsule-Based and Stochastic Models CMSB
Location: B2.01
14:00-14:30
Statistical model checking for rule-based models in the Kappa language (abstract) 30 min
Albin Salazar1, Jérôme Feret2, Tatjana Petrov3
1 University of Konstanz, Centre for the Advanced Study of Collective Behaviour
2 DI ENS, École Normale Supérieure, PSL, CNRS, INRIA
3 Università degli Studi di Trieste, Centre for the Advanced Study of Collective Behaviour, Max Planck Institute of Animal Behavior
14:30-15:00
Efficient Stochastic Trace Generation for Transcription (abstract) 30 min
Arman Ferdowsi1, Matthias Függer2, Thomas Nowak2
1 University of Vienna
2 Université Paris-Saclay, CNRS, ENS Paris-Saclay, LMF, Gif-sur-Yvette
15:00-15:30
Mamdani-Driven Fuzzy Reaction Systems (abstract) 30 min
Linda Brodo1, Moreno Falaschi2, Fiamma Romagnoli2, Elisa B.P. Tiezzi2
1 Dipartimento di Scienze Economiche e Aziendali, University of Sassari
2 Department of Information Engineering and Mathematics, Univ. of Siena
15:30-16:00
Incremental Kasa: Static Analysis of Kappa Models at Edit Time (tool paper) (abstract) 30 min
Jérôme FERET1, Rebecca GHIDINI1
1 DI ENS, École Normale Supérieure, PSL, CNRS, INRIA
14:00-15:00 Invited Talk by Christel Baier CREST
Session Chair:
Norine Coenen
Location: C1.01
14:00-15:00
Probabilistic Causality in Markovian Models (abstract) 60 min
Christel Baier1
1 Dresden University of Technology, Germany
14:00-15:30 Session 3 CI-BD-SOQE
Location: C5.01
14:00-15:00
Invited Talk: Craig Interpolation within the Landscape of Decidable Fragments of First-Order Logic (abstract) 60 min
Balder ten Cate1
1 University of Amsterdam, Netherlands
15:00-15:30
Computation and Size of Interpolants for Hybrid Modal Logics (abstract) 30 min
Jean Christoph Jung1, Jędrzej Kołodziejski2, Frank Wolter3
1 TU Dortmund University
2 University of Warsaw
3 University of Liverpool
14:00-15:30 24pm1 ACV
Location: C4.07
14:00-14:30
Robust Probabilistic Bisimilarity (Invited Talk) (abstract) 30 min
Syyeda Zainab Fatmi1
1 University of Oxford
14:30-15:00
SV-LIB 1.0: A Standard Exchange Format for Software-Verification Tasks (abstract) 30 min
Dirk Beyer1, Gidon Ernst1, Martin Jonáš1, Marian Lingsch-Rosenfeld1
1 LMU Munich
15:00-15:30
Imprecise Probabilistic Programming, Precisely (abstract) 30 min
Jack Liell-Cock1, Sam Staton1
1 University of Oxford
14:00-15:30 Session 2 Soft
Session Chair:
Simon de Givry
Location: C3.02
14:00-14:30
Aperture: an Anytime, Complete, and Incremental Solver for MaxSAT and Beyond (Work-in-Progress) (abstract) 30 min
Alexander Nadel1, Yam yamslonimski@campus.technion.ac.il, Ofer ofers@technion.ac.il
1 Technion & NVIDIA
14:30-15:00
Certified Implicit Hitting Set Solving with Local Search for Pseudo-Boolean Optimization (abstract) 30 min
Benjamin Bogø1, Xiamin Chen2, Wietze Koops3, Pinyan Lu4, Jakob Nordström1, Marc Vinyals5, Qingzhao Wu2
1 University of Copenhagen and Lund University
2 Shanghai University of Finance and Economics
3 Lund University and University of Copenhagen
4 Shanghai University of Finance and Economics and Huawei Taylor Lab
5 University of Auckland
15:00-15:30
Enhanced Lower Bound Computation in Branch-and-Bound for MaxSAT (abstract) 30 min
Jialu Zhang1, Chu-Min Li1, Sami Cherif1, Shuolin Li2
1 MIS UR 4290, Université de Picardie Jules Verne, Amiens, France
2 Aix Marseille Univ, Université de Toulon, CNRS, LIS, Marseille, France
14:00-15:00 Invited Talk: Raheleh Jalali WiL
Location: C5.06
14:00-15:30 Decision Procedures & Automation SMT
Location: C1.04
14:00-15:00 Session 3A UNIF
Session Chair:
Mauricio Ayala-Rincón
Location: C5.05
14:00-15:00
TBA (abstract) 60 min
Sandra Alves1
1 University of Porto
14:00-15:00 Afternoon 1 RajeevFest
Location: C2.01
14:00-14:30
ExCAPE and the Coming of Age of Program Synthesis (abstract) 30 min
Armando Solar-Lezama1
1 MIT
14:30-15:00
VPLs and other Research at Rajeev's Group in the Early 2000s (abstract) 30 min
Madhusudan Parthasarathy1
1 UIUC
14:00-15:30 New TPTP Formats TPTPTP
Session Chair:
Geoff Sutcliffe
Location: C2.05
14:00-14:30
The TPTP Format for Clausal Connection Tableaux (abstract) 30 min
Sean Holden1
1 University of Cambridge
14:30-15:00
The TPTP Format for Interpretations (abstract) 30 min
Geoff Sutcliffe1
1 University of Miami
15:00-15:30
Towards a TPTP Format for Answers (abstract) 30 min
Geoff Sutcliffe1, Martin Suda2,3
1 University of Miami
2 CTU
3 CIIRC
14:00-15:00 Invited Talk 2 THEMA
Session Chair:
Zeynep G. Saribatur
Location: C4.05
14:00-15:00 Roohani Sharma PCCR
Session Chair:
Sebastian Ordyniak
Location: C4.06
14:00-15:00
tba (abstract) 60 min
Roohani Sharma1
1 Institute for Basic Science, Daejeon, South Korea
14:15-14:30 Contributed talk SAIV
Session Chair:
Guy Avni
Location: C1.03
14:15-14:30
Neural Network Verification using Partial Multi-Neuron Relaxation (abstract) 15 min
Ido Shmuel1, Guy Katz1
1 Hebrew University of Jeruslaem
14:30-15:00 Coffee Break SAIV
Location: C1.03
14:45-15:05 Poster announcements 2 LINDA
Location: B2.02
14:45-14:50
Preliminary Report on Scalable Optimal-Repair Based Query Answering with Non-Binary Conflicts (abstract) 5 min
Meghyn Bienvenu1, Camille Bourgaux2, Ahmed Laouar1
1 CNRS & University of Bordeaux
2 CNRS & DI ENS
14:50-14:55
Errors Need Not Show Up as Inconsistencies: From Error-tolerant Reasoning to Argumentation Frameworks (abstract) 5 min
Franz Baader1, Oscar Barreca1
1 TU Dresden
14:55-15:00
Towards Computing Pointwise Repairs in a Fragment of DatalogMTL (abstract) 5 min
Atefe atefe@mail.uni-paderborn.de
15:00-15:05
SHACL Validation and Static Analysis in Presence of Ontologies: an Overview (abstract) 5 min
Anouk Michelle Oudshoorn1
1 TU Vienna
14:50-15:10 Coffee Break (II) ARQNL
15:00-15:30 Session 3B UNIF
Session Chair:
Mauricio Ayala-Rincón
Location: C5.05
15:00-15:30
Anti-unification preserving special constants with variants (abstract) 30 min
Joel Nguetoum1, Boutheina Bannour2, Pascale Le Gall3, Erwan Mahe2
1 CEA Paris-Saclay, CentraleSupélec, University of Paris-Saclay
2 CEA Paris-Saclay, University of Paris-Saclay
3 CentraleSupélec, University of Paris-Saclay
15:00-16:00 Answer Set Programming WiL
Location: C5.06
15:00-15:20
Answer Set Programming goes to School (abstract) 20 min
Racquel Dennison1, Emmanuelle Dietz2, Hanna Philipp3
1 University of Cape Town and CAIR, South Africa
2 Airbus Central R&T, Hamburg, Germany
3 Weißeritzgymnasium Freital, Freital, Germany
15:20-15:40
Tackling the Multi-Batching Problem: An Answer Set Programming Approach for Industrial Logistics (abstract) 20 min
Racquel Nina Dennison1, Racquel Nina Dennison2
1 Racquel DENNISON
2 University of Cape Town
15:40-16:00
Recovering Suppressed Entailments in OWL 2 DL via Two-Phase Reasoning (abstract) 20 min
Giulia Biagioni1
1 TNO
15:00-15:30 Coffee Break Vampire
Location: C4.02
15:00-15:15 Coffee Break XLoKR-ExCoS
Location: C4.08
15:00-16:15 Contributed talks SAIV
Session Chair:
Guy Avni
Location: C1.03
15:00-15:15
Verified Tensor Operators for Safety-Critical ML: From Specification to Reference Implementation (abstract) 15 min
João Machado1, Ricardo Silva1, Loïc Correnson2, João Galego3, Eric Jenn4, Hugo Daniel Macedo5,7, Jean Souyris6, Jorge Sousa Pinto5,7
1 Universidade do Minho & Critical Software, Portugal
2 CEA LIST, Saclay, France
3 ISEG Executive Education & Critical Software, Portugal
4 IRT Saint-Exupéry, Toulouse, France
5 HASLab
6 Airbus Commercial, Toulouse, France
7 INESC TEC & Universidade do Minho, Portugal
15:15-15:30
Reachability-Based Formal Verification of Graph Neural Networks with Node and Edge Features (abstract) 15 min
Anne M Tumlin1, Ben Wooding1, Zhenxuan Shao1, Diego Manzanas Lopez1, Tyler Derr1, Taylor T Johnson1
1 Vanderbilt University
15:30-15:45
A Self-Correcting Neuro-Symbolic AI Reasoning Framework (abstract) 15 min
Ben Wooding1, Kiersten Brennan1, Anne M Tumlin1, Hongchao Zhang1, Taylor T Johnson1
1 Vanderbilt University
15:45-16:00
Automated Algorithm Configuration of α,β-CROWN (abstract) 15 min
Konstantin Kaulen1, Holger H. Hoos2
1 RWTH Aachen University
2 RWTH Aachen University, Leiden University
16:00-16:15
Hybrid Robustness Verification for Spatio-Temporal Neural Networks (abstract) 15 min
Sherwin Varghese1, Matthew Wicker1, Alessio Lomuscio1
1 Imperial College London
15:00-15:30 Coffee Break RajeevFest
Location: C2.01
15:00-15:30 Coffee Break THEMA
Location: C4.05
15:00-16:00 Sebastian Siebertz PCCR
Session Chair:
Sebastian Ordyniak
Location: C4.06
15:00-16:00
tba (abstract) 60 min
Sebastian Siebertz1
1 University of Bremen
15:00-15:30 Coffee Break LFMTP
Location: C5.02
15:00-15:30 Papers 1c Isabelle
Location: C5.07
15:00-15:30
Designing a Verification Condition Generator with Eisbach and a bit of Isabelle/ML -- An experience report (abstract) 30 min
Peter LAMMICH1
1 University of Twente
15:00-15:18 Contributed Presentations 2 CREST
Session Chair:
Norine Coenen
Location: C1.01
15:00-15:18
Forward-Responsibility in Petri Nets (abstract) 18 min
Caroline Lemke1, Heike Wehrheim1
1 Carl von Ossietzky Universität Oldenburg
15:05-16:00 Coffee Break and Poster Session 2 LINDA
15:10-16:10 ARQNL Session 4: Tableaux ARQNL
Location: C4.01
15:15-16:20 Constraints XLoKR-ExCoS
Location: C4.08
15:15-15:40
Explainability Results for the Rotating Workforce Scheduling Problem (abstract) 25 min
Esther Mugdan, Lucas Kletzander1, Nysret Musliu1
1 TU Wien, Austria
15:40-16:05
Towards Interactive Sample-Based Formal Explanations via Constraint Reasoning (abstract) 25 min
Jairo Lefebre1, Vanina Martinez1, Joao Marques-Silva2
1 Artificial Intelligence Research Institute (IIIA-CSIC)
2 ICREA and Lleida University
16:05-16:20
Step-Wise Explanations for Sudoku Puzzles Using ASP(Q) (Extended Abstract) (abstract) 15 min
Maximilian Moeller1, Alexander Ek1, Bart Bogaerts2
1 KU Leuven
2 KU Leuven and VU Brussel
15:18-15:30 Open Discussion CREST
Session Chair:
Norine Coenen
Location: C1.01
15:30-16:00 Coffee Break CREST
Location: C1.01
15:30-16:00 Coffee Break ACV
Location: C4.07
15:30-16:00 Coffee Break CI-BD-SOQE
Location: C5.01
15:30-16:00 Coffee Break IWC
Location: C6.02
15:30-16:30 Quantification LFMTP
Session Chair:
Olivier Hermant
Location: C5.02
15:30-16:00
Towards Generic Semantics for Substructural Generic Quantification (abstract) 30 min
Thibaut Antoine1, David Baelde1
1 Univ Rennes, CNRS, IRISA
16:00-16:30
Proof Theory and Dependent Type Theory: Distinct Foundations for Designing Proof Assistants (abstract) 30 min
Dale Miller1
1 Inria Saclay
15:30-16:00 Coffee Break Isabelle
Location: C5.07
15:30-16:30 Coffee Break ARQNL
Location: C4.01
15:30-16:00 Coffee Break Soft
Location: C3.02
15:30-16:30 Coffee Break SD
Location: C5.08
15:30-16:50 Optimizations(?) Vampire
Location: C4.02
15:30-15:50
Integrating Chronological and Graph Backtracking in AVATAR (abstract) 20 min
Robin Coutelier1
1 TU Wien
15:50-16:10
Theorem Proving as Combinatorial Optimization: Toward Operations Research-Guided Strategy Design for Vampire (abstract) 20 min
Karthikhesvaran Sudhakar Sharmila Karthick1
1 Indiana University Bloomington
16:10-16:30
Exploiting Intra-Clausal Literal Sharing in Code Trees (abstract) 20 min
Maximilian Leiwig1
1 University of Bonn
16:30-16:50
Unification as a simple theorem prover (abstract) 20 min
Murat Sinan Aygün1
1 None
15:30-16:30 Coffee Break SMT
Location: C1.04
15:30-16:30 Session 2 THEMA
Session Chair:
Zeynep G. Saribatur
Location: C4.05
15:30-16:00 Coffee Break TPTPTP
Location: C2.05
15:30-17:00 Afternoon 2 RajeevFest
Location: C2.01
15:30-16:00
From Verification to Analysis (abstract) 30 min
Moshe Vardi1
1 Rice
16:00-16:50
Rajeev Alur: Reflections and Conversation (abstract) 50 min
Swarat Chaudhuri1
1 UTAustin+DeepMind
16:50-17:00
Closing Remarks (abstract) 10 min
Loris DAntoni1
1 UCSD
15:30-16:30 Coffee Break PERR
Location: C2.02
15:30-16:00 Coffee Break UNIF
Location: C5.05
16:00-18:00 Action planning TPTPTP
Session Chair:
Geoff Sutcliffe
Location: C2.05
16:00-16:30 Coffee Break PCCR
Location: C4.06
16:00-17:30 Learning, LLMs & Counting SMT
Location: C1.04
16:00-18:00 Session 4 UNIF
Session Chair:
Temur Kutsia
Location: C5.05
16:00-16:30
Dynamic E-unification (abstract) 30 min
Kun Han1, Christopher Lynch1
1 Clarkson University
16:30-17:00
On the Compatible Expansion of Boolean Rings (abstract) 30 min
Joseph Zullo1
1 Purdue University
17:00-17:30
Matching in the Description Logic EL without the Top Concept (abstract) 30 min
Oliver Fernández Gil1, Puneetha Jangir1
1 TU Dresden
17:30-18:00
Proving Equations with Nonterminating Term Rewriting Systems using Context-Sensitive Rewriting (abstract) 30 min
Salvador Lucas1, Julia Pagan1
1 Universitat Politècnica de València
16:00-16:20 Coffee Break WiL
Location: C5.06
16:00-17:30 Session 3 Soft
Session Chair:
Simon de Givry
Location: C3.02
16:00-16:30
Fair Constraint Satisfaction: An Approximate Algorithm and Preliminary Results (abstract) 30 min
Javier Larrosa1, David García-Soriano1, Miguel Escribano1
1 UPC Barcelona
16:30-17:00
Pseudo-Boolean Conflict Analysis (abstract) 30 min
Benjamin Bogø1, Wietze Koops2, Jakob Nordström1, Alexander Tesch3
1 University of Copenhagen and Lund University
2 Lund University and University of Copenhagen
3 Bool AI, Berlin
17:00-17:30
Quadratic Assignment Problems in Cost Function Networks (abstract) 30 min
Guidio Sewa1, Coralie Marchau2, David Allouche1, Simon de Givry1, George Katsirelos3, Thomas Schiex1
1 INRAE Toulouse
2 IMT Atlantique
3 INRAE Paris-Saclay
16:00-17:00 Papers 1d Isabelle
Location: C5.07
16:00-16:30
Mechanising Local Rely-Guarantee Reasoning over the seL4 Trace Monad (abstract) 30 min
Junming Zhao1
1 The University of New South Wales
16:30-16:45
Two interfaces for seL4 kernel verification: Time Protection and the Kernel–Userland Gap (Extended Abstract) (abstract) 15 min
Rob Sison1
1 UNSW Sydney
16:45-17:00
Issues and Solutions in Autoformalization of Munkres’ Topology in Isabelle/HOL (abstract) 15 min
Josef Urban1
1 AI4REASON and University of Gothenburg
16:00-17:00 Completion IWC
Location: C6.02
16:00-16:30
Normalised completion for stratified linear rewriting systems (abstract) 30 min
Philippe Malbos1, Zuan Liu1
1 Université Claude Bernard Lyon 1
16:30-17:00
Completion to Strong Confluence (abstract) 30 min
Salvador Lucas1, Julia Pagan1
1 Universitat Politècnica de València
16:00-17:00 Invited talk 2 LINDA
Location: B2.02
16:00-17:00
The Never-Ending Issue of Inconsistency Handling: Past and Future from a KR Perspective (abstract) 60 min
Thomas Eiter1
1 TU Wien
16:00-17:30 Session 4 CI-BD-SOQE
Location: C5.01
16:00-17:00
Invited Talk: Feasible Interpolation: Power and Limitations (abstract) 60 min
Amir Akbar Tabatabai1
1 University of Groningen, Netherlands
17:00-17:30
Multiple Definitions from a Single Resolution Proof (abstract) 30 min
Friedrich Slivovsky1
1 University of Liverpool
16:00-18:00 24pm2 ACV
Location: C4.07
16:00-16:30
A Lattice-Theoretic Abstraction of PDR via Adjunctions (Invited Talk) (abstract) 30 min
Mayuko Kori1
1 Kyoto University
16:30-17:00
Multiobjective Predicate Transformers: Computing the Pareto Front in Probabilistic Programs (abstract) 30 min
Kevin Batz1, Hannah Mertens2, Sebastian Junges3, Benjamin Lucien Kaminski4, Joost-Pieter Katoen2, Lena Verscht5
1 Cornell University
2 RWTH Aachen University
3 Radboud University
4 Saarland University and University College London
5 Saarland University and RWTH Aachen University
17:00-17:30
Verification of Systems with Unbounded Agents By Exploiting Concurrency (abstract) 30 min
Tephilla Prince1
1 Unaffiliated
17:30-18:00
Scalable Probabilistic Program Verification by Theory-Extended Decision Diagrams (abstract) 30 min
Daniel Basgöze1, Kevin Batz2, Sebastian Junges3, Joost-Pieter Katoen1
1 RWTH Aachen University
2 University of Münster
3 Radboud University
16:00-17:30 Contributed Presentations 3 CREST
Session Chair:
Borzoo Bonakdarpour
Location: C1.01
16:00-16:18
Hybridized Sabotage Logics for Causal Counterfactual Queries (abstract) 18 min
Basak Kocaoglu1
1 King's College London
16:18-16:36
A Generalized Propensity Score Estimation Methodology for Discrete and Continuous Treatments (abstract) 18 min
Felipe Lourenço Angelim Vieira1, Alessandro Leite2
1 Independent Researcher
2 INSA Rouen Normandie
16:36-16:54
Computing Actual Causes for Neural Network Predictions under Structured Causal Inputs (abstract) 18 min
Jannick Strobel1, Muqsit Azeem1, Stefan Leue1
1 University of Konstanz
16:54-17:12
Rethinking Counterfactuals: Hidden Assumptions and Practical Pitfalls (abstract) 18 min
Gerrit Grossmann1, Yahya Aalaila1, David A. Selby1, Sumantrak Mukherjee1, Sebastian Vollmer1, Jonas Wahl1
1 DFKI
17:12-17:30
Has Practice Already Crossed the Causal Barrier? Causality, Formal Models, and Contemporary Machine Learning (abstract) 18 min
Dragan Bosnacki1
1 Eindhoven University of Technology
16:00-16:30 Coffee Break CMSB
Location: B2.01
16:10-16:40 Coffee Break (III) ARQNL
16:10-17:00 Interactive Session THEMA
Session Chair:
Zeynep G. Saribatur
Location: C4.05
16:20-16:30 Break XLoKR-ExCoS
Location: C4.08
16:20-17:00 Computability WiL
Location: C5.06
16:20-16:40
Free sets, thin and Rainbows for Barriers (abstract) 20 min
Lorenzo Carlucci1, Oriola Gjetaj1
1 Sapienza University of Rome
16:40-17:00
A Decision Algorithm for the CL15 Fragment of Computability Logic (abstract) 20 min
Stella Spadoni1
1 IMT School for Advanced Studies Lucca
16:30-17:45 Explaining Machine Learning XLoKR-ExCoS
Location: C4.08
16:30-16:55
Explaining Reinforcement Learning Agents via Inductive Logic Programming (abstract) 25 min
Celeste Veronese1, Edoardo Zorzi1, Daniele Meli1, Alessandro Farinelli1
1 University of Verona
16:55-17:20
Formally Explaining Neural Network Classification (abstract) 25 min
Tomas Kolarik1, Grigory Fedyukovich2, Faezeh Labbaf1, Fabrizio Leopardi1, Natasha Sharygina1, Michael Wand3
1 University of Lugano
2 Florida State University
3 SUPSI, IDSIA, Lugano
17:20-17:45
An Argumentative View of Subliminal Learning (abstract) 25 min
Honglei Gu1
1 Imperial College London
16:30-17:30 Johannes Fichte PCCR
Session Chair:
Sebastian Ordyniak
Location: C4.06
16:30-17:30
tba (abstract) 60 min
Johannes Fichte1
1 Linköping University
16:30-18:30 Poster Session CMSB
Location: B2.01
16:40-17:30 ARQNL Session 5: Embeddings and Benchmarks ARQNL
Location: C4.01
17:00-17:40 Type Theory WiL
Location: C5.06
17:00-17:20
An Intercalation Calculus with Partial Proof Terms (abstract) 20 min
Ana Catarina Sousa1
1 LIACC - Artificial Intelligence and Computer Science Laboratory
17:20-17:40
Paradoxes and Proofs with Programs (abstract) 20 min
Paulette Koronkevich1, William J. Bowman1
1 University of British Columbia
17:00-18:00 CoCo + Business Meeting IWC
Location: C6.02
17:00-18:00 Panel Discussion Isabelle
Location: C5.07
17:00-18:00
The next 3 killer features of proof assistants in the next 10 years (abstract) 60 min
Mohammad Abdulaziz (chair)1, Achim D. Brucker2, Manuel Eberl3, Dominic Mulligan4, Josef Urban5
1 KCL
2 University of Exeter
3 University of Innsbruck
4 Amazon Web Services
5 AI4REASON and University of Gothenburg
17:30-18:00 Book Launch CI-BD-SOQE
Location: C5.01
17:30-18:00
Book Launch: Theory and Applications of Craig Interpolation (abstract) 30 min
Balder ten Cate1, Jean Christoph Jung2, Patrick Koopmann3, Christoph Wernhard4, Frank Wolter5
1 University of Amsterdam, Netherlands
2 TU Dortmund University, Germany
3 Vrije Universiteit Amsterdam, Netherlands
4 University of Potsdam, Germany
5 University of Liverpool, UK
Saturday, 25 July 2026
08:30-08:40 Introduction to workshop FORCE
Location: C2.01
08:40-10:25 Industrial applications FORCE
Location: C2.01
08:40-09:25
Compositional reasoning for defense and aerospace systems (abstract) 45 min
Darren Cofer1
1 Collins Aerospace
09:25-09:45
Formal Specification and Verification for Trustworthy Automotive Embedded Systems: An Experience Report and Outlook (abstract) 20 min
Jesper Amilon1, Gustav Ung2, Merlijn Sevenhuijsen2, Karl Palmskog1, Dilian Gurov1, Mattias Nyberg2
1 KTH Royal Institute of Technology
2 TRATON AB, Sweden
09:45-10:05
Multimode System Design with CoSApp (abstract) 20 min
Etienne Lac1
1 Safran
10:05-10:25
The ∆Q Systems Development Paradigm (abstract) 20 min
Seyed Hossein HAERI1
1 PLWorkz R&D
08:50-10:30 Termination of First-Order Rewriting WST
Location: C4.02
08:50-09:15
Semantic Labelling in Practice (abstract) 25 min
Dieter Hofbauer1, Johannes Waldmann2
1 ASW Saarland
2 HTWK Leipzig
09:15-09:40
Termination of Innermost-Terminating Right-Linear Overlay Term Rewrite Systems (abstract) 25 min
Naoki Nishida1
1 Nagoya University
09:40-10:05
Unifying Semantic Path Order and Weighted Path Order (abstract) 25 min
Teppei Saito1, Nao Hirokawa1
1 JAIST
10:05-10:30
Beyond Absolute Positiveness for Universally Quantified Non-Linear Polynomial Constraints (abstract) 25 min
Carsten Fuhs1
1 Birkbeck, University of London
09:00-10:30 Session 1 VeriProP
Location: B2.02
09:00-09:45
Type Systems for Exchangeability (abstract) 45 min
Justin Hsu1
1 Cornell University
09:45-10:00
SuperDP: Differential Privacy Refutation via Supermartingales (abstract) 15 min
Krishnendu Chatterjee1, Ehsan Kafshdar Goharshady1, Đorđe Žikelić2
1 Institute of Science and Technology Austria
2 Singapore Management University
10:00-10:15
Deciding Termination of Simple Randomized Loops (abstract) 15 min
Éléanore Meyer1, Jürgen Giesl1
1 RWTH Aachen University
10:15-10:30
A First Decision Procedure for Almost-Sure Termination of Probabilistic Term Rewriting (abstract) 15 min
Jan-Christoph Kassing1, Arion Scheid2, Henri Nagel1, Jürgen Giesl1
1 RWTH Aachen University
2 TU Wien
09:00-09:20 Automata WiL
Location: C5.06
09:00-09:20
Fuzzifying Derivatives of Regular Expressions (abstract) 20 min
Mariam Katamashvili1, Davit Maisuradze1
1 Kutaisi International University
09:00-10:10 Invited Talk 1 LOGICNN
Location: C4.08
09:00-10:00
Logic and the Power of Recurrent Graph Neural Networks (abstract) 60 min
Martin Grohe1
1 RWTH Aachen University, Germany
09:00-10:30 Invited Talk + Parallelism SMT
Location: C1.04
09:00-10:00 Session 1 PAAR
Location: C4.01
09:00-09:30
Case Study: Saturations as Explicit Models in Equational Theories (abstract) 30 min
Mikoláš Janota1, Michael Rawson2, Stephan Schulz3
1 Czech Technical University in Prague, CIIRC
2 University of Southampton
3 DHBW Stuttgart
09:30-10:00
Efficient Multi-Scale Indexing with Dynamic IntMaps (abstract) 30 min
Albert Eisfeld1, Stephan Schulz1
1 DHBW Stuttgart
09:00-10:05 Session 1 LPOP
Location: C4.05
09:00-09:05
Opening and welcome (abstract) 5 min
Joost Vennekens1, David S. Warren2
1 Vrije Universiteit Brussel
2 Stonybrook University
09:05-09:50
Invited Talk: Moshe Vardi (abstract) 45 min
Moshe Vardi1
1 Rice University
09:50-10:05
Logic Programming and Coding Agents New Opportunities within a New Paradigm (abstract) 15 min
Theresa Swift
09:00-10:15 Opening and Proof Complexity MC
Session Chair:
Johannes Fichte
Location: C6.02
09:00-09:15
Opening (abstract) 15 min
Johannes Fichte1, Markus Hecher2, Kuldeep Meel3
1 Linköping University
2 CRIL (CNRS UMR 8188)
3 Georgia Tech
09:15-09:45
Tutorial: Proof Complexity and Model Counting (abstract) 30 min
Olaf Beyersdorff1
1 University of Jena
09:45-10:15
Proof Systems That Tightly Characterise Model Counting Algorithms (abstract) 30 min
Olaf Beyersdorff1, Tim Hoffmann1, Kaspar Kasche1
1 University of Jena
09:00-09:30 Informal meet & greet MW2
Location: C6.07
09:00-10:05 Plenary session 1 TEAL
Location: C6.01
09:00-10:30 Invited talks and round-table discussions SAIV
Session Chair:
Christian Schilling
Location: C1.03
09:00-09:30
Latent space navigation – interpretation, probing and steering (abstract) 30 min
Lenka Tetková1
1 Technical University of Denmark
09:30-10:00
When Control Changes the Data: Safety under Interaction-Driven Distribution Shifts (abstract) 30 min
Lars Lindemann1
1 ETH Zurich
10:00-10:30
Round-table discussion (abstract) 30 min
Lenka Tetková1, Lars Lindemann2
1 Technical University of Denmark
2 ETH Zurich
09:00-10:30 Session #1 HCVS
Session Chair:
Fred Mesnard
Location: C5.05
09:00-10:00
Invited Talk: Infinite State Model Checking without Interpolation (abstract) 60 min
Florian Frohn1
1 RWTH Aachen University, Germany
10:00-10:30
SV-LIB 1.0: A Standard Exchange Format for Software-Verification Tasks (abstract) 30 min
Dirk Beyer1, Gidon Ernst1, Martin Jonáš1, Marian Lingsch-Rosenfeld1
1 LMU Munich
09:00-10:00 Keynote 2 Isabelle
Location: C5.07
09:00-10:00
Verifying Sledgehammer backend techniques with Isabelle/HOL (abstract) 60 min
Sophie Tourret1
1 Loria
09:00-10:30 Session 5 CI-BD-SOQE
Location: C5.01
09:00-10:00
Invited Talk: Constrained Horn Clauses for Program Verification and Synthesis (abstract) 60 min
Arie Gurfinkel1
1 University of Waterloo, Canada
10:00-10:30
Computing Witnesses Using the SCAN Algorithm (abstract) 30 min
Fabian Achammer1, Stefan Hetzl1, Renate A. Schmidt2
1 TU Wien
2 The University of Manchester
09:00-10:30 Morning session AIMACS
Session Chair:
Armando Solar-Lezama
Location: C2.05
09:00-10:00
LLM-aided theorem-proving (abstract) 60 min
Kaiyu Yang1
1 Apodex
10:00-10:30
Constrained decoding (abstract) 30 min
Loris D'Antoni1
1 UCSD
09:00-10:30 Session 1 AR4Space
Location: C3.02
09:00-09:30
Verified Explanations of Neural Networks (abstract) 30 min
Caterina Urban1
1 INRIA
09:30-09:50
Formal Verification for Machine Learning-Based Telemetry Anomaly Detection (abstract) 20 min
Krzysztof Kotowski1, Ramez Shendy1, Bartosz Grabowski1, Jakub Nalepa1, Riccardo Gallon2, Edoardo Caroselli2, Dario Guidotti3, Stefano Demarchi4, Luis Mansilla5
1 KP Labs
2 Airbus Defence and Space
3 University of Sassari
4 University of Genoa
5 European Space Agency
09:50-10:10
Locally Pareto-Optimal Interpretations for Black-Box Machine Learning Models (abstract) 20 min
Aniruddha Joshi1, Supratik Chakraborty2, S Akshay2, Shetal Shah2, Hazem Torfah3, Sanjit Seshia1
1 UC Berkeley
2 IIT Bombay
3 Chalmers University of Technology and University of Gothenburg
10:10-10:30
Certifying Guidance & Control Networks: Uncertainty Propagation to an Event Manifold (abstract) 20 min
Sebastien Origer1, Dario Izzo2, Giacomo Acciarini2, Francesco Biscani3, Rita Mastroianni2, Max Bannach2, Harry Holt2
1 Alma Mater Studiorum - Università di Bologna
2 European Space Agency
3 Skylon Dynamics
09:00-09:45 25am1-1 ACV
Location: C4.07
09:00-09:45
Type Systems for Exchangeability (Invited Talk) (abstract) 45 min
Justin Hsu1
1 Cornell University
09:00-10:00 Keynote: Miguel Rocha CMSB
Location: B2.01
09:10-10:00 Keynote talk 1 SYNT
Location: C3.01
09:20-10:00 Graph Theory WiL
Location: C5.06
09:20-09:40
Eternal Relaxed Vertex Cover on Threshold Graphs (abstract) 20 min
Ankita Kumari1
1 Independent Researcher, India
09:40-10:00
Vertex Definability in Counting Logic (abstract) 20 min
Sandra Kiefer1
1 University of Oxford
09:30-09:40 Kickoff MW2
Location: C6.07
09:30-10:30 Daniel Neuen PCCR
Session Chair:
Sebastian Ordyniak
Location: C4.06
09:30-10:30
tba (abstract) 60 min
Daniel Neuen1
1 TU Dresden
09:30-09:35 Opening Remarks FCS
Session Chair:
Jana Hofmann
Location: C5.02
09:35-10:30 Invited Talk FCS
Session Chair:
Jana Hofmann
Location: C5.02
09:40-10:10 Orna Grumberg MW2
Location: C6.07
09:40-10:10
Symbolic Model Checking: From Program Verification to Constrained Horn Clauses (abstract) 30 min
Orna Grumberg1
1 Technion
09:45-10:00 (mini-break for changing rooms) ACV
Location: C4.07
10:00-10:30 25am1-2 ACV
Location: C4.07
10:00-10:30
Coalgebraic Notions of Simulation, Bisimulation and Relators (abstract) 30 min
Pouya Partow1, Sergey Goncharov1
1 University of Birmingham
10:00-10:30 Coffee Break CMSB
Location: B2.01
10:00-10:30 Papers 2a Isabelle
Location: C5.07
10:00-10:30
Earley's Recognizer: Implementation and Complexity Analysis in Isabelle/HOL (abstract) 30 min
Tobias Nipkow1, Alexander Haberl1
1 Technical University of Munich
10:00-10:30 Coffee Break PAAR
Location: C4.01
10:00-10:25 Coffee Break SYNT
Location: C3.01
10:00-11:00 Coffee Break RocqWS
Location: C6.08
10:00-10:40 Algebraic Logic WiL
Location: C5.06
10:00-10:20
When Queries Decompose: A Lattice-Theoretic Perspective on Incomplete Information (abstract) 20 min
Eugenia Ternovska1
1 Simon Fraser University
10:20-10:40
Quad Algebras and a 4-Valued Non-Classical Logic (abstract) 20 min
Arun Kumar1, Bisham Dewan1, Neha Gaur1
1 Banaras Hindu University
10:00-11:00 Coffee Break SD
Location: C5.08
10:00-11:00 Coffee Break SMT
Location: C1.04
10:05-10:20 Coffee Break TEAL
Location: C6.01
10:05-11:00 Coffee Break LPOP
Location: C4.05
10:10-10:30 Coffee Break LOGICNN
Location: C4.08
10:10-10:30 Ice breakers MW2
Location: C6.07
10:15-11:00 Coffee Break MC
Location: C6.02
10:20-11:00 Shared-Time Demos 1 TEAL
Location: C6.01
10:25-11:00 Reactive Synthesis SYNT
Location: C3.01
10:25-10:42
Natural Synthesis: Outperforming Reactive Synthesis Tools with Large Reasoning Models (abstract) 17 min
Frederik Schmitt1, Matthias Cosler1, Niklas Metzger1, Julian Siber1, Vladimir Krsmanović1, Mohamed Ghanem1, Bernd Finkbeiner1
1 CISPA Helmholtz Center for Information Security
10:42-10:59
Optimal LTLf Synthesis (abstract) 17 min
Yujian Cao1, Sven Schewe1, Qiyi Tang1, Shufang Zhu1
1 University of Liverpool
10:25-10:55 Coffee Break FORCE
Location: C2.01
10:30-11:00 Coffee Break HCVS
Location: C5.05
10:30-11:00 Coffee Break FCS
Location: C5.02
10:30-11:00 Coffee Break Isabelle
Location: C5.07
10:30-12:30 Constraint-Based Modeling and Molecular Computation CMSB
Location: B2.01
10:30-11:00
Inferring Minimal Culture Media using Biologically Constrained Combinatorial Optimization (abstract) 30 min
MOANA AULAGNER1, ANNE SIEGEL1, SAMUEL BLANQUART1
1 Univ Rennes, Inria, CNRS, IRISA - UMR 6074, F-35000, Rennes, France
11:00-11:30
On the Design of an Analog-Dyadic Converter CRN (abstract) 30 min
Mathieu Hemery1
1 Inria, Centre de Saclay
11:30-12:00
Analog computation with transcriptional networks (abstract) 30 min
David Doty1, Mina Latifi1, David Soloveichik2
1 University of California Davis
2 The University of Texas at Austin
12:00-12:30
Metabolic Transformation Algorithm: A Systems Biology Approach to Aging and Alzheimer’s Disease (abstract) 30 min
Bruno Sá1, Catarina Gomes1, Miguel Rocha1
1 University of Minho
10:30-11:00 Coffee Break ACV
Location: C4.07
10:30-11:00 Coffee Break AR4Space
Location: C3.02
10:30-11:00 Coffee Break AIMACS
Location: C2.05
10:30-11:00 Coffee Break CI-BD-SOQE
Location: C5.01
10:30-11:00 Coffee Break SAIV
Location: C1.03
10:30-11:00 Coffee Break MW2
Location: C6.07
10:30-12:00 Session 2 PAAR
Location: C4.01
10:30-11:00
The TPTP Format for Interpretations (abstract) 30 min
Geoff Sutcliffe1, Alexander Steen2, Pascal Fontaine3, Lydia Kondylidou4
1 University of Miami
2 University of Greifswald
3 University of Liège
4 Ludwig-Maximilians-Universität
11:00-11:30
The TPTP Format for Clausal Connection Tableaux (abstract) 30 min
Geoff Sutcliffe1, Sean B. Holden2, Mantas Baksys2
1 University of Miami
2 University of Cambridge
11:30-12:00
Elixir meets TPTP: Bringing Automated Reasoning to the BEAM Ecosystem (abstract) 30 min
Johannes Schuster1, David Fuenmayor1, Christoph Benzmüller2
1 Otto-Friedrich-Universität Bamberg
2 Otto-Friedrich-Universität Bamberg and Freie Universität Berlin
10:30-11:00 Coffee Break PCCR
Location: C4.06
10:30-11:00 Coffee Break Lean
Location: C6.10
10:30-11:10 Session 1A: Expressiveness LOGICNN
Location: C4.08
10:30-10:50
Expressive Power of Graph Transformers via Logic (abstract) 20 min
Veeti Ahvonen1, Maurice Funk2, Damian Heiman1, Antti Kuusisto1, Carsten Lutz2
1 Tampere University
2 University of Leipzig
10:50-11:10
Towards Understanding the Expressive Power of GNNs with Global Readout (Extended Summary) (abstract) 20 min
Maurice Funk1, Daumantas Kojelis1
1 Leipzig University
10:30-11:00 Coffee Break VeriProP
Location: B2.02
10:30-11:00 Coffee Break WST
Location: C4.02
10:40-11:00 Coffee Break WiL
Location: C5.06
10:55-12:15 Runtime monitoring FORCE
Location: C2.01
10:55-11:15
Compositional Conformal Certification for Reusable Vision-Based Runtime Monitoring (abstract) 20 min
Bardh Hoxha1, Oliver Schön2, Hideki Okamoto1, Lars Lindemann2, Georgios Fainekos1
1 Toyota Motor North America R&D
2 ETH Zurich
11:15-11:35
A Unified Framework for Runtime Verification and Model-Based Diagnosis in LOLA (abstract) 20 min
Raik Hipler1, Martin Leucker1, Patrick Rodler2
1 University of Luebeck
2 University of Klagenfurt
11:35-11:55
Lifting Pacti Contracts into MLTL and Runtime Monitors (abstract) 20 min
Michael Jacks1, Kristin Yvonne Rozier1
1 Iowa State University
11:55-12:15
Coherence Constraints as Compositional Contracts for Autonomic Systems (abstract) 20 min
Antonio Bucchiarone1, Maurice H. ter Beek2, Alfonso Pierantonio1
1 SWEN, Università degli Studi dell’Aquila, L’Aquila, Italy
2 FMT Lab, CNR–ISTI, Pisa, Italy
11:00-12:00 Session #2 HCVS
Session Chair:
Fred Mesnard
Location: C5.05
11:00-11:30
Why3-Elpi: Logic Programming Transformations for Why3 (abstract) 30 min
Matteo Manighetti1
1 IRIF, Université Paris Cité
11:30-12:00
CHC-based Automated Verification of WebAssembly Programs (abstract) 30 min
Akihisa Yagi1, Ken Sakayori1, Naoki Kobayashi1
1 The University of Tokyo
11:00-12:15 Session 1: Information Flow Security and Secure Attestation FCS
Session Chair:
Anitha Gollamudi
Location: C5.02
11:00-11:25
Type-based information flow analysis for $\pi$-calculus with a dynamically extensible security lattice (abstract) 25 min
Yukihiro Oda1, Eijiro Sumii1
1 Tohoku University
11:25-11:50
Environmental Bisimulation for Type-Based Secure Information Flow in $\lambda$-Calculus with Declassification (abstract) 25 min
Eijiro Sumii1, Lin Oshitani1, Takeshi Egawa1
1 Tohoku University
11:50-12:15
Designing Trustworthy Layered Attestations (abstract) 25 min
Joshua Guttman1, Will Thomas2, Logan Schmalz2, Adam Petz2, Perry Alexander2, Paul D. Rowe3, James Carter4
1 Zeno's Arrow Consulting
2 University of Kansas
3 The MITRE Corporation
4 National Security Agency
11:00-12:20 Papers 2b Isabelle
Location: C5.07
11:00-11:20
Formalizing the Exponential Blowup in the Transformations between CNF and DNF (abstract) 20 min
Leon Raffael Schulz1, Martin Desharnais-Schäfer1, Jan Johannsen1
1 Ludwig-Maximilians-Universität München
11:20-11:40
Cracking egg: Towards Verified Equality Saturation (abstract) 20 min
Alexandra Graß1
1 Ludwig-Maximilians-Universität in Munich
11:40-12:00
Formalizing Paradoxes in Grounded Arithmetic using Isabelle/HOL (abstract) 20 min
Ananthajit Srikanth1, Bryan Ford1
1 EPFL
12:00-12:20
A Generalized Bekic Principle and its Formalization in Isabelle (abstract) 20 min
Jun Xu1
1 The Chinese University of Hong Kong
11:00-12:30 Session 6 CI-BD-SOQE
Location: C5.01
11:00-11:30
Whereof One Cannot Explain, Thereof One Must Invent: Definitorial Abduction in ALCI via Strong Forgetting (abstract) 30 min
Jinghan Wu1, Renate A. Schmidt2, Yizheng Zhao1
1 Nanjing University
2 The University of Manchester
11:30-12:00
Second-Order Quantifier Elimination and Uniform Interpolation for Basic Path Logic and the Ordered Fragment (abstract) 30 min
Renate A. Schmidt1, Hongkai Yin2
1 The University of Manchester
2 Central European University
12:00-12:30
An Algorithm for Existential Boolean Unification with Predicates (abstract) 30 min
Fabian Achammer1, Stefan Hetzl1
1 TU Wien
11:00-12:00 Second morning session AIMACS
Session Chair:
Swarat Chaudhuri
Location: C2.05
11:00-12:00
CSLib: The Lean Computer Science Library (abstract) 60 min
Clark Barrett1, Sorrachai Yingchareonthawornchai2
1 Stanford University
2 ETH Zurich
11:00-12:30 Session 2 AR4Space
Location: C3.02
11:00-11:30
From Requirements to the Verification of Stochastic Systems (abstract) 30 min
Gricel Vázquez1
1 University of York
11:30-11:50
Formalization of a language for autonomous spacecraft operations (abstract) 20 min
Lauren M. White1, César A. Muñoz1, Marco A. Feliu2, Mariano M. Moscato2, Laura Humphrey1
1 National Aeronautics and Space Administration (NASA)
2 Analytical Mechanics Associates
11:50-12:10
Robust Observation Planning via Facet Reasoning (abstract) 20 min
Jennifer Santos1, Damien Van Meerbeeck1, Mika Skjelnes1, Arnaud Lequen1, Daniel Gnad2
1 Linköpings Universitet
2 Linköpings Universitet, Heidelberg University
12:10-12:30
Cislunar Space Situational Awareness Constellation Design and Planning with Facility Location Problem (abstract) 20 min
Yuri Shimane1, Kento Tomita2, Koki Ho3
1 University of California Irvine
2 Mitsubishi Electric Research Laboratories
3 Georgia Institute of Technology
11:00-12:00 25am2 ACV
Location: C4.07
11:00-11:30
Compositional Verification of Higher-Order Effectful Programs via Interactive Semantics (abstract) 30 min
Guilhème Jaber1
1 Nantes Université
11:30-12:00
Why codensity lifting works: A formal perspective (abstract) 30 min
Zev Shirazi1
1 University of Oxford
11:00-12:00 Epistemic Logic WiL
Location: C5.06
11:00-11:20
Social Network Aggregation Beyond Preservation (abstract) 20 min
Yutong Yi1
1 Institute of Logic and Cognition and Department of Philosophy, Sun Yat-sen University, China
11:20-11:40
On the hyperintensionality of ignorance (abstract) 20 min
Ekaterina Kubyshkina1, Mattia Petrolo2
1 University of Milan
2 University of Lisbon
11:40-12:00
Logical Modeling of Belief Polarization (abstract) 20 min
Mina Young Pedersen1, Sonja Smets1
1 Institute for Logic, Language and Computation (ILLC), University of Amsterdam
11:00-12:30 Termination of Loops WST
Location: C4.02
11:00-11:25
PaSTTeL: Parallel analysiS framework for Termination and non-Termination of Lasso programs (abstract) 25 min
Anissa Kheireddine1, Souheib Baarir2, Hugo DE SA PEREIRA PINTO3
1 Sorbonne Université, CNRS, LIP6, F-75005 Paris, France
2 Sorbonne Université, CNRS, LIP6, F-75005 Paris, France Université Paris Lumières, Université Paris Nanterre Nanterre, France
3 Dowsers
11:25-11:50
Loop Termination and Generalized Collatz Sequences (abstract) 25 min
Mishel Carelli1
1 CISPA Helmholtz Center for Information Security
11:50-12:15
On Deciding Constant Runtime of Linear Loops (abstract) 25 min
Florian Frohn1, Jürgen Giesl1, Peter Giesl2, Nils Lommen1
1 RWTH Aachen University
2 University of Sussex
12:15-12:30
termCOMP Part 1 (abstract) 15 min
Florian Frohn1
1 RWTH Aachen University
11:00-12:30 Session 2 VeriProP
Location: B2.02
11:00-11:45
How to Verify Probabilistic Inference — and What That Even Means (abstract) 45 min
Fabian Zaiser1
1 MIT
11:45-12:00
Generating Functions Meet Occupation Measures: Invariant Synthesis for Probabilistic Loops (abstract) 15 min
Darion Haase1, Kevin Batz2, Adrian Gallus, Benjamin Lucien Kaminski3, Joost-Pieter Katoen1, Lutz Klinkenberg1, Tobias Winkler1
1 RWTH Aachen University
2 Cornell University
3 Saarland University and University College London
12:00-12:15
Unbounded Nondeterministic Choice in Weighted Programs (abstract) 15 min
Sebastian Körner1
1 University of Oldenburg
12:15-12:30
Assessing the Quality of Binomial Samplers: A Statistical Distance Framework (abstract) 15 min
Uddalok Sarkar1, Sourav Chakraborty1, Kuldeep S. Meel2
1 Indian Statistical Institute
2 Georgia Institute of Technology
11:00-12:30 Arrays, Datatypes & Relational Reasoning SMT
Location: C1.04
11:00-12:30 Contributed Talks PCCR
Session Chair:
Sebastian Ordyniak
Location: C4.06
11:00-11:30
Eliminating Majority Illusion in Social Networks (abstract) 30 min
Pankaj Kumar1
1 University of Birmingham
11:30-12:00
Gateways to Tractability for Satisfiability in Pearl's Causal Hierarchy (abstract) 30 min
Robert Ganian1, Marlene Gründel1, Simon Wietheger1
1 TU Wien
12:00-12:30
Width Parameters for Flow Decompositions on DAGs (abstract) 30 min
Andreas Grigorjew1
1 University of Warsaw
11:00-11:30 Sebastian Siebertz MW2
Location: C6.07
11:00-11:30
A Day in the Life of a Faculty Diversity Manager (abstract) 30 min
Sebastian Siebertz1
1 Universität Bremen
11:00-12:30 Proof Logging and Knowledge Compilation MC
Location: C6.02
11:00-11:30
Proof Logging for Projected Enumeration (and Counting?) Problems in VeriPB (abstract) 30 min
Tan Yong Kiam1, Ciaran Mccreesh2, Andy Oertel3, Jakob Nordström3
1 NTU Singapore
2 University of Glasgow
3 Lund University and Copenhagen University
11:30-12:00
From Tensor Networks to Tractable Circuits, and back (abstract) 30 min
Alexis de Colnet1
1 Leiden University
12:00-12:30
Knowledge Compilation for Boolean and Presburger Functional Synthesis (abstract) 30 min
S. Akshay1, Supratik Chakraborty1
1 IIT Bombay
11:00-12:00 Session 2 LPOP
Location: C4.05
11:00-11:45
Invited Talk: Anil Nerode (abstract) 45 min
Anil Nerode1
1 Cornell University
11:45-12:00
From Trustworthy to Resilient AI: Formalizing Requirements for Safe Cyber-Physical Systems Control (abstract) 15 min
Pascal Hitzler1, Eugene Y. Vasserman1
1 Kansas State University
11:00-12:00 Contributed talk, short presentations, and case studies SAIV
Session Chair:
Christian Schilling
Location: C1.03
11:00-11:15
Certified Neural Approximations of Nonlinear Dynamics (abstract) 15 min
Frederik Baymler Mathiesen1, Nikolaus Vertovec2, Francesco Fabiano2, Luca Laurenti1, Alessandro Abate2
1 Delft University of Technology
2 University of Oxford
11:15-11:22
Verification of LTL properties on Neural Networks for Chemical Process Monitoring (abstract) 7 min
Julien Girard-Satabin1, Simon Lutz2, Daniel Neider2
1 Université Paris-Saclay, CEA, List, F-91120, Palaiseau, France
2 TU Dortmund University
11:22-11:29
Vancomycert: A Certified Neuro-Symbolic Drug Delivery System (Case Study) (abstract) 7 min
Alistair Sirman1, Fleur Conway2, Jessica Ciupa2, Gusts Gustavs Grīnbergs3, Ekaterina Komendantskaya1, Alessandro Bruni3, Michael John Williams4, Vaishak Belle2, Thai Son Hoang1, Michael Rawson1
1 University of Southampton
2 University of Edinburgh
3 IT University of Copenhagen
4 Schlumberger Cambridge Research
11:29-11:36
veriFIRE: An Industrial Case Study in Verifying Consistency Properties for DNN-Based Wildfire Detection System (abstract) 7 min
Idan Refaeli1, Maya Swisa1, Itay Buchnik2, Alon Zada2, Guy Amir3, Elad Mandelbaum2, Ziv Freund2, Guy Katz1
1 The Hebrew University of Jerusalem
2 Elbit Systems --- EW & SIGINT --- Elisra Ltd.
3 Cornell University
11:36-11:43
ProofBridge: Auto-Formalization of Natural Language Proofs in Lean via Joint Embeddings (abstract) 7 min
Prithwish Jana1, Kaan Kale1, Ahmet Ege Tanriverdi2, Cruise Song1, Sriram Vishwanath1, Vijay Ganesh1
1 Georgia Institute of Technology
2 Bogazici University
11:43-11:50
Of Good Demons and Bad Angels: Guaranteeing Safe Control under Finite Precision (abstract) 7 min
Samuel Teuber1, Debasmita Lohar2, Bernhard Beckert1
1 Karlsruhe Institute of Technology
2 IT University of Copenhagen
11:50-11:57
Optimizing VNN Solver Configuration Selection using Large Language Models (abstract) 7 min
Salil Kamath1, Matthew Davis1, Jonathan Andreason2, Yatis Dodia2, Vijay Ganesh1
1 Georgia Institute of Technology
2 Georgia Tech Research Institute
11:00-12:25 Games and Synthesis - I SYNT
Location: C3.01
11:00-11:17
From Quasipolynomial to Data-Parallel Algorithms for Verification Games Played on Graphs (abstract) 17 min
Vanessa Flugel1, Marcin Jurdzinski2, Guillermo Perez1
1 University of Antwerp
2 Warwick University
11:17-11:34
Lazy and Priority-Guided Product Construction for Non-Integer Discounted-Sum Synthesis (abstract) 17 min
Raj Chandak1, Priyanka Golia1
1 Indian Institute of Technology, Delhi
11:34-11:51
Social Welfare under Heterogeneous Time Preferences (abstract) 17 min
Sarvin Bahmani1, Soumyajit Paul1, Sven Schewe1, Shadi Tasdighi Kalat2, Ashutosh Trivedi2
1 University of Liverpool, UK
2 University of Colorado Boulder, USA
11:51-12:08
Games on Temporal Graphs (abstract) 17 min
Sougata Bose1
1 UMONS – Université de Mons, Belgium
12:08-12:25
Sure-almost-sure and Sure-limit-sure Window Mean Payoff in Markov Decision Processes (abstract) 17 min
Pranshu Gaba1, Shibashis Guha1
1 Tata Institute of Fundamental Research, Mumbai
11:05-11:45 Plenary session 2 TEAL
Location: C6.01
11:20-12:00 Session 1B: Expressiveness LOGICNN
Location: C4.08
11:20-11:40
An Algebraic Characterization of Local Weisfeiler–Leman (abstract) 20 min
Yi Chen1, Eugenia Ternovska1
1 Simon Fraser University
11:40-12:00
Words and Temporal Graphs: Comparing the Expressive Power of State Space Models and Recurrent Neural Networks (Extended Abstract) (abstract) 20 min
Eric Alsmann1, Lowejatan Noori1, Martin Lange1
1 University of Kassel
11:30-12:00 Yannick Forster MW2
Location: C6.07
11:30-12:00
Using proof assistants as more than checkers, and how to write papers about it (abstract) 30 min
Yannick Forster1
1 Inria
12:00-12:30 Claudia Cauli MW2
Location: C6.07
12:00-12:30
Taming State-Space Explosion in Cloud Accounts: Finding Privilege Escalation at Scale (abstract) 30 min
Claudia Cauli1
1 Huawei R&D
12:00-14:00 Lunch LPOP
Location: C4.05
12:00-13:30 Lunch LOGICNN
Location: C4.08
12:00-13:30 Lunch PAAR
Location: C4.01
12:00-13:30 Lunch TEAL
Location: C6.01
12:00-13:30 Lunch SAIV
Location: C1.03
12:00-14:00 Lunch RocqWS
Location: C6.08
12:00-14:00 Lunch SD
Location: C5.08
12:00-12:20 Dynamic Epistemic Logic WiL
Location: C5.06
12:00-12:20
Axiomatising asynchronous announcements in dynamic epistemic logic (abstract) 20 min
Clara Lerouvillois1
1 IRIT, CNRS-INPT-University of Toulouse & IHPST, University Paris 1 Panthéon Sorbonne
12:00-14:00 Lunch SMT
Location: C1.04
12:00-14:00 Lunch ACV
Location: C4.07
12:00-14:00 Lunch AIMACS
Location: C2.05
12:00-14:00 Lunch HCVS
Location: C5.05
12:15-13:30 Lunch FORCE
Location: C2.01
12:15-12:30 Mentoring Lunch Preparation FCS
Session Chair:
Jana Hofmann
Location: C5.02
12:20-14:00 Lunch Isabelle
Location: C5.07
12:20-12:40 Logic and ML WiL
Location: C5.06
12:20-12:40
Toward Provably Defeasible Machine Learning (abstract) 20 min
Ruvarashe Madzime1
1 University of the Western Cape and CAIR
12:25-13:45 Lunch SYNT
Location: C3.01
12:30-14:00 Lunch PCCR
Location: C4.06
12:30-14:00 Lunch MC
Location: C6.02
12:30-14:00 Lunch MW2
Location: C6.07
12:30-14:00 Lunch VeriProP
Location: B2.02
12:30-14:00 Lunch WST
Location: C4.02
12:30-14:00 Lunch Lean
Location: C6.10
12:30-14:00 Mentoring Lunch FCS
12:30-14:00 Lunch AR4Space
Location: C3.02
12:30-14:00 Lunch CI-BD-SOQE
Location: C5.01
12:30-14:00 Lunch CMSB
Location: B2.01
12:40-14:00 Lunch WiL
Location: C5.06
13:30-14:30 Invited Talk 2 LOGICNN
Location: C4.08
13:30-14:30
Verification of DNNs with Marabou (abstract) 60 min
Omri Isac1
1 Hebrew University of Jerusalem, Israël
13:30-15:00 Session 3 PAAR
Location: C4.01
13:30-14:00
A light-weight proof checker for TSTP refutations (abstract) 30 min
Melanie Taprogge1, Happy Sariyanto2, Alexander Steen2
1 Université Paris-Saclay, University of Greifswald
2 University of Greifswald
14:00-14:30
GenZ: A Generic Sequent Calculus Prover using the Zipper (abstract) 30 min
Xiaoshuang Yang1, Malvin Gattinger2, Marianna Girlando2, Patrick Koopmann1
1 Vrije Universiteit Amsterdam
2 University of Amsterdam
14:30-15:00
Satisfiability for Probability Modalities (abstract) 30 min
Marcelo Finger1, Tommaso Flaminio2, Lluís Godo2, Felip Manyà2, Sandro Preto3
1 University of São Paulo
2 Artificial Intelligence Research Institute
3 Federal University of ABC
13:30-14:30 Keynote presentation SAIV
Session Chair:
Christian Schilling
Location: C1.03
13:30-14:30
Reliable AI code generation through sound program analysis (abstract) 60 min
Armando Solar-Lezama1
1 MIT
13:30-14:10 Plenary session 3 TEAL
Location: C6.01
13:30-15:15 Autonomous and learning-enabled systems FORCE
Location: C2.01
13:30-14:15
Safe Autonomous Systems via Shielding (abstract) 45 min
Bettina Könighofer1
1 Graz University of Technology
14:15-14:35
MTL for Compositional Specification of Assume Guarantee Contracts in Autonomous Robotics (abstract) 20 min
Natalia Ślusarz1, Marie Farrell1, Michael Fisher1
1 University of Manchester
14:35-14:55
A Formal Algorithmic Framework for Probabilistic Assurance Cases for Learning-Enabled Systems (abstract) 20 min
Eric Vin1, Kyle A. Miller1, Inigo Incer2, Sanjit A. Seshia3, Daniel J. Fremont1
1 University of California, Santa Cruz
2 University of Michigan
3 University of California, Berkeley
14:55-15:15
Agentic Model Checking of LLM-Generated Systems Code (abstract) 20 min
Youcheng Sun1, Jiawen Liu1, Daniel Kroening2, Jason Xue1
1 MBZUAI
2 Amazon
13:45-14:35 Keynote talk 2 SYNT
Location: C3.01
14:00-15:00 Joao Marques-Silva PCCR
Session Chair:
Sebastian Ordyniak
Location: C4.06
14:00-15:00
Logic-Based Explainable AI (abstract) 60 min
Joao Marques-Silva1
1 ICREA & University of Lleida
14:00-14:30 Loris D'Antoni MW2
Location: C6.07
14:00-14:30
Your Next Big Idea Is Just a Few Small Ideas Away (abstract) 30 min
Loris D’Antoni1
1 UCSD & Code Metal
14:00-15:30 Complexity and Explanations MC
Location: C6.02
14:00-14:30
A Novel Reduction from #SAT to #2SAT Based on Symmetry: Simply Drop the Large Clauses (abstract) 30 min
Markus Hecher1
1 University of Potsdam, Germany & CNRS, University of Artois, France
14:30-15:00
Counting Complexity of ASP (abstract) 30 min
Max Bannach1, Johannes Fichte2, Johanna Groven2, Markus Hecher3
1 European Space Agency
2 Linköping University
3 None
15:00-15:30
Counting for Explanations: Evaluating Domain Theories and Constraint Encodings in Probabilistic Abductive Reasoning (abstract) 30 min
Jean-Marie Lagniez1, Markus Hecher1
1 CRIL (CNRS UMR 8188), Artois University
14:00-16:00 Session 3 LPOP
Location: C4.05
14:00-14:45
Invited Talk: Carla Gomes (abstract) 45 min
Carla Gomes1
1 Cornell University
14:45-15:30
Invited Talk: Fritz Henglein (abstract) 45 min
Fritz Henglein1
1 University of Copenhagen
15:30-15:45
Achieving Trustworthy Legal AI using Human-Verification (abstract) 15 min
Luis Cruz-Filipe1, Jonas Vistrup2
1 IT University of Copenhagen
2 University of Southern Denmark
15:45-16:00
An Overview of the DARPA CODORD Program for Trustworthy AI (abstract) 15 min
Benjamin Grosof1
1 DARPA
14:00-15:00 Invited Talk: Valeria de Paiva WiL
Location: C5.06
14:00-15:30 Beyond Classical Rewriting WST
Location: C4.02
14:00-14:25
Dependency Pairs for Expected Runtime Complexity of Probabilistic Term Rewriting (abstract) 25 min
Jan-Christoph Kassing1, Leon Valentin Spitzer1, Jürgen Giesl1
1 RWTH Aachen University
14:25-14:50
Towards an HRS Category in TermComp (abstract) 25 min
Johannes Niederhauser1, Aart Middeldorp1
1 University of Innsbruck
14:50-15:15
An Infinitary Lambda Calculus with Global Trace Condition (Extended Abstract) (abstract) 25 min
Stefano Berardi1, Ugo de' Liguoro1, Daisuke Kimura2, Daniel Osorio-Valencia1
1 Università di Torino
2 Toho University
15:15-15:30
termCOMP Part 2 (abstract) 15 min
Florian Frohn1
1 RWTH Aachen University
14:00-15:30 Session 3 VeriProP
Location: B2.02
14:00-14:45
Coupling Verification and Learning for Safe and Explainable Decision-Making under Uncertainty (abstract) 45 min
Milan Ceska1
1 Brno University of Technology
14:45-15:00
Value Iteration for Stochastic Parity Games (abstract) 15 min
Kittiphon Phalakarn1, Ichiro Hasuo1
1 National Institute of Informatics
15:00-15:15
Probabilistic Loop Acceleration via a Quantitative Fixpoint Logic (abstract) 15 min
Takuma Monma1, Clovis Eberhart1, Hiroshi Unno1
1 Tohoku University, Japan
15:15-15:30
A Hierarchy of Supermartingales for ω-Regular Verification (abstract) 15 min
Satoshi Kura1, Hiroshi Unno2
1 Waseda University
2 Tohoku University
14:00-14:30 Poster Lightning Session #1 AIMACS
Session Chair:
Swarat Chaudhuri
Location: C2.05
14:00-14:10
Typing Tensor Calculus in 2-Categories (abstract) 10 min
Rita Ahmadi1
1 Oxford University
14:10-14:20
Transformers are Inherently Succinct (abstract) 10 min
Pascal Bergsträßer1
1 RPTU Kaiserslautern-Landau
14:20-14:30
Fast and principled equation discovery from chaos to climate (abstract) 10 min
Rui Carvalho1
1 Durham University
14:00-15:30 Session #3 HCVS
Session Chair:
Zafer Esen
Location: C5.05
14:00-15:00
Invited Talk: CHC-Based Reachability Analysis via Cycle Summarization (abstract) 60 min
Natasha Sharygina1
1 University of Lugano, Switzerland
15:00-15:30
Extended Abstract: Bit-Precise CHC Satisfiability Using Theory-Modular Reasoning (abstract) 30 min
Omer Rappoport1, Orna Grumberg1, Yakir Vizel1
1 Technion - Israel Institute of Technology
14:00-15:30 Session 2: Cryptography FCS
Session Chair:
Anitha Gollamudi
Location: C5.02
14:00-14:25
GCD: Garbled, Corrected, Demonstrandum - Fixing and Proving Go's Extended GCD Implementation (abstract) 25 min
Linard Arquint1
1 National University of Singapore
14:25-14:45
Proof Obligations Induced by Shared Challenges in Hybrid Fiat-Shamir Signatures (abstract) 20 min
Dr. Sara Zain1
1 Barkhausen Institut, Dresden
14:45-15:10
Ladders are Better than Trampolines: Key Exchange Security in EasyCrypt’s Probabilistic Relational Hoare Logic (abstract) 25 min
Manuel Barbosa1, François Dupressoir2, Cameron Low2, Charlotte Mylog3, Sabine Oechsner4, Théo Vignon5
1 Universidade do Porto (FCUP) and INESC TEC, Porto Portugal
2 University of Bristol
3 Norwegian University of Science and Technology (NTNU)
4 Vrije Universiteit Amsterdam
5 Université Paris-Saclay, CNRS, ENS Paris-Saclay, Laboratoire Méthodes Formelles
15:10-15:30
Formal Verification of Assembly Implementations of Cryptographic Functions via Decompilation (abstract) 20 min
Tom Béné1, Manuel Barbosa2, Roberto Blanco1
1 Eindhoven University of Technology
2 University of Porto and INESC TEC
14:00-15:30 Tutorial 2 Isabelle
Location: C5.07
14:00-15:30
Isabelle/Scala systems programming (abstract) 90 min
Fabian Huch1
1 TUM
14:00-15:30 Causal Inference and Multi-Omics Integration 1 CMSB
Location: B2.01
14:00-14:30
Metabolic Flux Inference in a Cheese Microbial Community via comFI: a Biology-informed Approach for Time-resolved Multi-omics Integration (abstract) 30 min
sthyve Tatho1,4, Valentina Baldazzi2,3, Simon Labarthe1,4
1 Univ. Bordeaux, INRAE, BIOGECO, F-33610, Cestas, France
2 Université Côte d’Azur, INRAE, ISA, Sophia-Antipolis, France
3 Inria, Université Côte d’Azur, INRAE, CNRS, MACBES, Sophia-Antipolis, France
4 University of Bordeaux, INRAE, Talence, France
14:30-15:00
GRNgen: a Generator of Gene Regulatory Networks Fitting Graph and Motif Properties (abstract) 30 min
Alexandre Tan-Lhernould1, Thierry Dorval2, François Fages3
1 INRIA Saclay, Institut Servier d'Innovation Thérapeutique
2 Institut Servier d'Innovation Thérapeutique
3 INRIA Saclay
15:00-15:30
Consensus Enhances Individual Causal Models: a Use Case on Lung Cancer Driven by Cellular Pathways (abstract) 30 min
Arnaud Lang1, Rodrigo Henrique Ramos2, Safaa Al-Ali1, Mohammadreza Mousavi3, Anna Calissano4, Irene Balelli1
1 Inria
2 Federal Institute of São Paulo
3 King's College London
4 University College London
14:00-15:30 Session 7 CI-BD-SOQE
Location: C5.01
14:00-15:00
Invited Talk: From Unified Correspondence to Parametric Correspondence (abstract) 60 min
Alessandra Palmigiano1
1 Vrije Universiteit Amsterdam, Netherlands
15:00-15:30
Correspondence Theory for Intuitionistic Lukasiewicz Logic (abstract) 30 min
Andrew Lewis-Smith1, Zhiguang Zhao2
1 Middlesex University
2 Taishan University
14:00-15:30 Session 3 AR4Space
Location: C3.02
14:00-14:30
Global Trajectory Optimization Competition (GTOC): The Case of GTOC12 (abstract) 30 min
Zhong Zhang1
1 Politecnico di Milano
14:30-14:50
A Mixed-Integer Optimization Toolbox for Space Logistics and Mission Planning (abstract) 20 min
Masafumi Isaji1, Koki Ho1
1 Georgia Institute of Technology
14:50-15:10
Towards a Continuous-Time Keplerian Travelling Salesman Problem via Dynamic Programming (abstract) 20 min
Nicholas Gollins1, Adam Abdin1
1 CentraleSupelec
15:10-15:30
Towards Multi-Objective Target Selection for Exoplanet Spectroscopy (abstract) 20 min
Kai Hou Yip1, Luís F. Simões2, Nikki Grens2
1 King´s College London and ML Analytics
2 ML Analytics
14:00-15:30 25pm1 ACV
Location: C4.07
14:00-14:45
tba (Invited Talk) (abstract) 45 min
Caterina Urban1
1 INRIA
14:45-15:30
An equational axiomatization of dynamic threads (Invited Talk) (abstract) 45 min
Cristina Matache1
1 University of Birmingham
14:15-14:55 Shared-Time Demos 2 TEAL
Location: C6.01
14:30-15:00 Coffee Break SAIV
Location: C1.03
14:30-15:30 PhD Student Panel MW2
Location: C6.07
14:30-15:30
PhD Student Panel (abstract) 60 min
Arthur Correnson1, Elisaveta Pertseva2, Sarah Salinger3
1 CISPA
2 Stanford University
3 TU Wien
14:30-15:00 Afternoon session AIMACS
Session Chair:
Swarat Chaudhuri
Location: C2.05
14:30-15:00
TBD (abstract) 30 min
Moa Johansson1
1 Chalmers University
14:35-15:30 Functional & Quantum Synthesis SYNT
Location: C3.01
14:35-14:52
Multiple Definitions from a Single Resolution Proof (abstract) 17 min
Friedrich Slivovsky1
1 University of Liverpool
14:52-15:09
Structure Analysis in Boolean Functional Synthesis (abstract) 17 min
Ziv Avissar1, Dror Fried1
1 Open University of Israel
15:09-15:26
Reducing Quantum Circuit Synthesis to #SAT (abstract) 17 min
Dekel Zak1, Jingyi Mei1, Jean-Marie Lagniez2, Alfons Laarman1
1 Leiden University
2 Artois University, France
14:40-15:20 Session 2: Verification LOGICNN
Location: C4.08
14:40-15:00
Towards Continuous Constraint Programming for Sound Neural Network Verification (abstract) 20 min
Yi-Nung Tsao1, Pierre Talbot1
1 University of Luxembourg
15:00-15:20
IsaGrad: Verified Automatic Differentiation over Computational Graphs in Imperative HOL (abstract) 20 min
Alex Raymond Hyman1, Filip Smola1, Mark Chevallier1, Jacques Fleuriot1
1 University of Edinburgh
15:00-16:00 Proof Theory WiL
Location: C5.06
15:00-15:20
A Proof-Theoretic Treatment of Incorrect/Incomplete Proofs via Hilbert’s Epsilon Calculus (abstract) 20 min
Mariami Gamsakhurdia1
1 TU Wien
15:20-15:40
Double Negation Elimination and the Multiple Succedent Structure of LK (abstract) 20 min
Nox Cowie1
1 University of Sussex
15:40-16:00
Schemata, Cyclic Proofs and Herbrand Systems (abstract) 20 min
Alexander Leitsch1, Anela Lolic1, Stella Mahler1
1 TU Wien
15:00-16:15 Contributed talks SAIV
Session Chair:
Christian Schilling
Location: C1.03
15:00-15:15
Value Functions as Supermartingale Certificates (abstract) 15 min
Alessandro Abate1, Daniel Contro2, Mirco Giacobbe2, Agustín Martínez-Suñé1, Diptarko Roy2
1 University of Oxford
2 University of Birmingham
15:15-15:30
Principled Rewriting of ONNX Operators for Reluctant Solvers (abstract) 15 min
Alban Grastien1, Guilhem Ardouin1, Julien Girard-Satabin1
1 CEA-List
15:30-15:45
Incremental Invariant-based Safety Verification of Neural Controllers (abstract) 15 min
Vladislav Nenchev1
1 University of the Bundeswehr Munich
15:45-16:00
Faster Optimization of Decision Tree Policies for Markov Decision Processes (abstract) 15 min
Daniël Vos1, Anna Lukina1
1 Delft University of Technology
16:00-16:15
Enhancing the Robustness of Counterfactual Explanations via Adversarial Training (abstract) 15 min
Rithik Appachi Senthilkumar1, Francesco Leofante2, Vijay Ganesh1
1 Georgia Institute of Technology
2 Imperial College London
15:00-15:10 Coffee Break TEAL
Location: C6.01
15:00-16:00 Robert Ganian PCCR
Session Chair:
Sebastian Ordyniak
Location: C4.06
15:00-16:00
tba (abstract) 60 min
Robert Ganian1
1 TU Wien
15:00-15:30 Coffee Break PAAR
Location: C4.01
15:00-15:30 Poster Lightning session AIMACS
Session Chair:
Armando Solar-Lezama
Location: C2.05
15:00-15:10
Neurosymbolic Auditing of Natural-Language Software Requirements (abstract) 10 min
Bethel Hall1
1 Stevens Institute of Technology
15:10-15:20
Improved Upper Bounds for Slicing the Hypercube (abstract) 10 min
Nathaniel Itty1
1 TTM Technologies
15:20-15:30
Bisimulation-based reduction of neural network controllers (abstract) 10 min
Pavithra Prabhakar1
1 The University of New Mexico
15:10-15:50 Plenary session 3 TEAL
Location: C6.01
15:15-15:45 Coffee Break FORCE
Location: C2.01
15:20-15:50 Coffee Break LOGICNN
Location: C4.08
15:30-16:00 Coffee Break MC
Location: C6.02
15:30-16:00 Coffee Break MW2
Location: C6.07
15:30-17:00 Session 4 PAAR
Location: C4.01
15:30-16:00
Bridging the gap: A complete axiomatization of Gregorian date arithmetic and scheduling logic for automated theorem provers (abstract) 30 min
Adam Pease1, Pantelimon Stanica1
1 Naval Postgraduate School
16:00-16:30
Agent Hunt: Bounty Based Collaborative Autoformalization With LLM Agents (abstract) 30 min
Chad Brown1, Cezary Kaliszyk2, Josef Urban3
1 AI4REASON
2 University of Melbourne, Australia
3 AI4REASON, University of Gothenburg and Chalmers University of Technology
16:30-17:00
Understandable Autoformalization with Felix (abstract) 30 min
Adrian De Lon1, Atle Hahn2
1 AI4REASON and University of Bonn
2 AI4REASON
15:30-15:55 Coffee Break SYNT
Location: C3.01
15:30-16:30 Coffee Break RocqWS
Location: C6.08
15:30-16:00 Coffee Break VeriProP
Location: B2.02
15:30-16:00 Coffee Break WST
Location: C4.02
15:30-16:30 Coffee Break SD
Location: C5.08
15:30-16:00 Coffee Break Lean
Location: C6.10
15:30-16:30 Coffee Break SMT
Location: C1.04
15:30-16:00 Coffee Break HCVS
Location: C5.05
15:30-16:00 Coffee Break FCS
Location: C5.02
15:30-16:00 Coffee Break Isabelle
Location: C5.07
15:30-16:00 Coffee Break AIMACS
Location: C2.05
15:30-16:00 Coffee Break AR4Space
Location: C3.02
15:30-16:00 Coffee Break CI-BD-SOQE
Location: C5.01
15:30-16:00 Coffee Break ACV
Location: C4.07
15:30-16:00 Coffee Break CMSB
Location: B2.01
15:45-17:25 Theory and logics FORCE
Location: C2.01
15:45-16:05
Contract-Based Architecture Exploration for Efficient Cyber-Physical System Design (abstract) 20 min
Yifeng Xiao1, Pierluigi Nuzzo1
1 UC Berkeley
16:05-16:25
Heterogeneous Dynamic Logic: Provability Modulo Program Theories (abstract) 20 min
Samuel Teuber1, Mattias Ulbrich1, André Platzer1, Bernhard Beckert1
1 Karlsruhe Institute of Technology (KIT)
16:25-16:45
Towards a computable and compositional semantics of hybrid systems (abstract) 20 min
Davide Bresolin1, Pieter Collins2, Luca Geretti3, Roberto Segala3, Tiziano Villa3
1 Università di Padova
2 University of Maastricht
3 Università di Verona
16:45-17:05
Taming Big CATs (abstract) 20 min
Marco Scaletta1
1 TU Darmstadt
17:05-17:25
Compositional Design of Society-Critical Systems (abstract) 20 min
Gioele Zardini1
1 MIT
15:50-16:50 Session 3: From Neural Networks to Logic LOGICNN
Location: C4.08
15:50-16:10
Neural networks as fuzzy logic formulas (abstract) 20 min
Damian Heiman1, Antti Kuusisto1, Esko Turunen1
1 Tampere University
16:10-16:30
Neural Networks into Łukasiewicz Logic, with Applications to Formal Verification (abstract) 20 min
Sandro Preto1, Marcelo Finger2
1 Federal University of ABC
2 University of São Paulo
16:30-16:50
From MLPs to Logic: An End-to-End Neuro-Symbolic Compilation Pipeline for Explainable Safety-Critical Medical AI (abstract) 20 min
Mashael Alsowail1, Hsi-Ming Ho1, Ian Mackie2
1 University of Sussex
2 London South Bank University
15:55-16:45 Keynote talk 3 SYNT
Location: C3.01
15:55-16:35 Shared-Time Demos 3 TEAL
Location: C6.01
16:00-16:30 Coffee Break PCCR
Location: C4.06
16:00-16:30 Caterina Urban MW2
Location: C6.07
16:00-16:30
What I Got Right, What I Got Wrong, and What Happened Anyway: Lessons from My Path (abstract) 30 min
Caterina Urban1
1 Inria & ENS
16:00-18:00 Weighted Counting over Theories and First-Order Structures MC
Location: C6.02
16:00-16:30
What Should #SMT Count? (abstract) 30 min
Giuseppe Spallitta1
1 Rice University
16:30-17:00
LP-Based Weighted Model Integration over Non-Linear Real Arithmetic (abstract) 30 min
S. Akshay1, Supratik Chakraborty1, Soroush Farokhnia2, Amir Goharshady3, Harshit Jitendra Motwani4, Đorđe Žikelić5
1 IIT Bombay
2 HKUST
3 University of Oxford
4 TU Wien
5 Singapore Management University
17:00-17:30
Bridging Weighted First Order Model Counting and Graph Polynomials (abstract) 30 min
Ondrej Kuzelka1
1 Czech Technical University in Prague
17:30-18:00
Quantifying Sensitivity for Tree Ensembles: A symbolic and compositional approach (abstract) 30 min
Ajinkya Naik1, Chaitanya Garg1, S. Akshay1, Ashutosh Gupta1, Kuldeep S. Meel2
1 IIT Bombay
2 University of Toronto
16:00-16:30 Coffee Break LPOP
Location: C4.05
16:00-17:45 Program Analysis WST
Location: C4.02
16:00-16:25
From Expectations to Moments: Improving Inference of Expected Runtimes (abstract) 25 min
Éléanore Meyer1, Jürgen Giesl1
1 RWTH Aachen University
16:25-16:50
Verifying LTL for Infinite State Systems via Termination Analysis (abstract) 25 min
Nils Lommen1, Moritz Leven Rosarius1, Jürgen Giesl1
1 RWTH Aachen University
16:50-17:15
Towards an Automated Reasoning Tool for Complexity Analysis of Automated Reasoners (abstract) 25 min
Louis Rustenholz1, Manuel V. Hermegildo1, Pedro López-García2, Alessio Mansutti3, Félix Ridoux4, Niki Vazou3
1 Universidad Politécnica de Madrid (UPM) and IMDEA Software Institute
2 Spanish Council for Scientific Research (CSIC) and IMDEA Software Institute
3 IMDEA Software Institute
4 Computer Science Laboratory of Sorbonne University (LIP6) and STMicroelectronics
17:15-17:45
WST Business Meeting & termCOMP Community Meeting (abstract) 30 min
Florian Frohn1, Étienne Payet2
1 RWTH Aachen University
2 Université de La Réunion
16:00-17:15 Session 4 VeriProP
Location: B2.02
16:00-16:45
Specification-Guided Reinforcement Learning (abstract) 45 min
Suguman Bansal1
1 Georgia Institute of Technology
16:45-17:00
Verified Inverse Function Search for Normalizing Flows (abstract) 15 min
David Richter1, Timon Böhler1, Benedict Smit1, Pascal Weisenburger2, Mira Mezini1,3,4
1 TU Darmstadt
2 University of St. Gallen
3 hessian.AI
4 National Research Center for Applied Cybersecurity ATHENE
17:00-17:15
Analytical Inference for Business Processes with Uncertainties via Probabilistic Programming (abstract) 15 min
Romina Doz1, Christoph Matheja2, Francesca Meneghello2, Laura Nenzi1, Andrey Rivkin2, Simone Silvetti1
1 Università degli Studi di Trieste
2 Technical University of Denmark
16:00-16:20 Coffee Break WiL
Location: C5.06
16:00-16:30 Afternoon Session #2 AIMACS
Session Chair:
Armando Solar-Lezama
Location: C2.05
16:00-16:30
Advancing Mathematics Research with AI-Powered Formal Proof Search (abstract) 30 min
George Tsoukalas1
1 Google DeepMind
16:00-17:30 Session #4 HCVS
Session Chair:
Zafer Esen
Location: C5.05
16:00-16:30
Presentation Only Paper: Bit-Vector CHC Solving for Binary Analysis and Binary Analysis for Bit-Vector CHC Solving (abstract) 30 min
Aaron Bembenek1, Toby Murray1
1 University of Melbourne
16:30-17:30
Presentation of CHC-COMP Results and Discussion (abstract) 60 min
Konstantin Britkov1, Levente Bajczi2
1 University of Lugano, Switzerland
2 BME-MIT, Hungary
16:00-17:25 Session 3: Smart Contracts and (Cyrptographic) Protocols FCS
Session Chair:
Jana Hofmann
Location: C5.02
16:00-16:20
Combining Program and Protocol Analysis for Frontrunning Resistance in Smart Contracts (abstract) 20 min
Sebastian Holler1, Yan Farba2, Clara Schneidewind1
1 MPI-SP
2 MPI-SP, Ruhr University Bochum
16:20-16:40
Renegade: Blockchain Protocols Simplified (abstract) 20 min
Kartikeya Gaur1, Clara Schneidewind1
1 Max Planck Institute for Security and Privacy (MPI-SP)
16:40-17:05
Robust Logical Foundations for Mechanizing Post-Quantum Cryptography in Squirrel (abstract) 25 min
David Baelde1, Antoine Dallon2, Stéphanie Delaune1, Charlie Jacomme3, Adrien Koutsos4
1 Univ Rennes, IRISA, CNRS
2 AMIAD
3 Inria Nancy Grand-Est, Université de Lorraine, LORIA
4 Inria Paris
17:05-17:25
A Secrecy Logic and the Post-Compromise Security of an Asymmetric Ratchet (abstract) 20 min
Clément Hérouard1, Charlie Jacomme1, Adrien Koutsos2, Joseph Lallemand3
1 Inria Nancy Grand-Est, Université de Lorraine, LORIA
2 Inria
3 Univ. Rennes, CNRS, IRISA
16:00-17:15 Papers 2c Isabelle
Location: C5.07
16:00-16:30
Lemmanaid: Neuro-Symbolic Lemma Conjecturing (abstract) 30 min
Moa Johansson1, Yousef Alhessi2, Sólrún Halla Einarsdóttir1, George Granberry1, Emily First2, Sorin Lerner2, Nicholas Smallbone1
1 Chalmers University of Technology
2 University of California
16:30-17:00
Abduction Prover in Isabelle/HOL (abstract) 30 min
Yutaka Nagashima1, Daniel Sebastian Goc
1 The Institute of Computer Science, the Czech Academy of Sciences
17:00-17:15
Safe Agentic Workflows for Isabelle (abstract) 15 min
Maximilian Schäffeler1, Lukas Stevens2, Kevin Kappelmann3, Mohammad Abdulaziz1, Andrei Popescu3, Dmitriy Traytel2
1 King's College London
2 University of Copenhagen
3 University of Sheffield
16:00-17:00 Causal Inference and Multi-Omics Integration 2 CMSB
Location: B2.01
16:00-16:30
Graph Learning Models for Temporal Gene Expression Prediction and the Role of Interactions Topology (abstract) 30 min
Alessandro Dipalma1, Alessio Micheli1, Paolo Milazzo1, Francesco Simonetti1, Domenico Tortorella1
1 University of Pisa
16:30-17:00
Multi-view clustering of transcriptomics and methylomics data elucidates glioma molecular stratification (abstract) 30 min
Carolina Pé-Curto1, Roberta Coletti2, Marta B. Lopes2
1 NOVA School of Science and Technology, Universidade NOVA de Lisboa
2 Center for Mathematics and Applications (NOVA Math), NOVA School of Science and Technology, Universidade NOVA de Lisboa
16:00-17:45 25pm2 ACV
Location: C4.07
16:00-16:45
Approximative Fixpoint Theory and Applications to Reinforcement Learning (Invited Talk) (abstract) 45 min
Florian Wittbold1
1 University of Duisburg-Essen
16:45-17:15
Semantics and Equational Axiomatisation of Quantum Communication (abstract) 30 min
Theo Wang1
1 University of Oxford
17:15-17:45
Basic Lattice Theory for Basic Model Checking (abstract) 30 min
Ichiro Hasuo1
1 National Institute of Informatics
16:00-17:30 Session 8 CI-BD-SOQE
Location: C5.01
16:00-17:00
Invited Talk: Proof-Relevant Interpolation: Beyond Cut-Free and Sequent Proofs (abstract) 60 min
Alexis Saurin1
1 CNRS, France
17:00-17:30
Using Craig Interpolation for Explanation of Neural Networks (abstract) 30 min
Faezeh Labbaf1, Tomas Kolarik1, Martin Blicha1, Grigory Fedyukovich2, Michael Wand3, Natasha Sharygina1
1 University of Lugano
2 Florida State University
3 SUPSI, IDSIA, Lugano
16:00-17:00 Session 4 AR4Space
Location: C3.02
16:00-16:30
Supply Chain Attacks: If the Weakest Link Breaks the Chain (abstract) 30 min
Sebastian Berndt1
1 TH Lübeck
16:30-17:00
Bridging Optimization and Onboard Decision-Making: Automated Reasoning in Space Systems and Logistics (abstract) 30 min
Chit Hong Yam1
1 Former Jaxa and iSpace
16:20-17:20 Modal Logic WiL
Location: C5.06
16:20-16:40
Improving Model Finding in Quantified Modal Logics (abstract) 20 min
Happy Khairunnisa Sariyanto1
1 University of Greifswald
16:40-17:00
Argumentation Based Dialogue Games for Deontic Explanations with Uncertainty (abstract) 20 min
Isabella Cissell1
1 TU Wien
17:00-17:20
Structural Dynamic Proof Theory for Public Announcement Logic (abstract) 20 min
Clara Lerouvillois1
1 IRIT, University of Toulouse, IHPST, University Paris 1 Panthéon Sorbonne
16:30-17:10 Poster Lightning Session #3 AIMACS
Session Chair:
Armando Solar-Lezama
Location: C2.05
16:30-16:40
A Rust-to-Lean Verification Pipeline with AI Provers: An Experience Report (abstract) 10 min
Natalia Klaus1
1 Runtime Verification
16:40-16:50
CovCal: Risk-Controlled Lean-as-Judge for Natural-Language Mathematical Reasoning (abstract) 10 min
Pauline Bourigault1
1 Imperial College
16:50-17:00
LeanPolish: A Kernel-Verified Dataset and Symbolic Compression Framework for Lean 4 Proofs (abstract) 10 min
Pauline Bourigault1
1 Imperial College
17:00-17:10
ProofBridge: Auto-Formalization of Natural Language Proofs in Lean via Joint Embeddings (abstract) 10 min
Prithwish Jana1
1 Georgia Tech
16:30-17:30 Session 4 LPOP
Location: C4.05
16:30-17:00
Panel discussion (abstract) 30 min
Moshe Vardi1, Anil Nerode2, Carla Gomes2, Fritz Henglein3
1 Rice University
2 Cornell University
3 University of Copenhagen
17:00-17:15
An Overview of the DARPA CLARA Program for Trustworthy AI (abstract) 15 min
Benjamin Grosof1
1 DARPA
17:15-17:20
Closing (abstract) 5 min
Joost Vennekens1, David S. Warren2
1 Vrije Universiteit Brussel
2 Stonybrook University
16:30-17:30 Researchers Panel MW2
Location: C6.07
16:30-17:30
Researchers Panel (abstract) 60 min
Loris D’Antoni1, Claudia Cauli2, Orna Grumberg3, Christine Rizkallah4, Caterina Urban5
1 UCSD and Code Metal
2 Huawei R&D
3 Technion
4 The University of Melbourne
5 Inria & ENS
16:30-17:30 Open Problems and Discussion PCCR
Session Chair:
Sebastian Ordyniak
Location: C4.06
16:35-17:00 Discussion & Conclusion TEAL
Location: C6.01
16:45-17:20 Games and Synthesis - 2 SYNT
Location: C3.01
16:45-17:02
Maximizing Independence in Auction-Based Scheduling via Successive Refinement (abstract) 17 min
Guy Avni1, Kaushik Mallik2, Suman Sadhukhan3, Tomer Yarkoni4
1 Department of Computer Science, University of Haifa
2 IMDEA Software Institute
3 TU Clausthal
4 Technion
17:02-17:19
Resolving Nondeterminism by Chance (abstract) 17 min
Soumyajit Paul1, David Purser1, Sven Schewe1, Qiyi Tang1, Patrick Totzk1, Di-De Yen1
1 University of Liverpool
17:00-17:30 Closing session CMSB
Location: B2.01
17:10-18:00 Panel AIMACS
Session Chair:
Swarat Chaudhuri
Location: C2.05
17:10-18:00
Panel: How should CAV researchers respond to AI progress? (abstract) 50 min
Shriram Krishnamurthi1, Moshe Vardi2, Armando Solar-Lezama3, Swarat Chaudhuri4
1 Brown University
2 Rice University
3 MIT
4 UT Austin
17:15-18:00 Tutorial 3 Isabelle
Location: C5.07
17:15-18:00
Exercises and Questions on Isabelle/ML and Isabelle/Scala programming (abstract) 45 min
Dmitriy Traytel1, Fabian Huch2
1 UCPH
2 TUM
17:20-18:00 Program Synthesis SYNT
Location: C3.01
17:20-17:37
NSynC: Normalised Synthesis of Computation (abstract) 17 min
Zoey Shepherd1, Ohad Kammar1, Elizabeth Polgreen1
1 University of Edinburgh
17:37-17:54
Liquify your Programs (abstract) 17 min
Rajarshi Goswami1, Ashish Mishra1
1 IIT Hyderabad
17:25-17:55 Discussion and conclusion FORCE
Location: C2.01
Sunday, 26 July 2026
09:00-10:00 Keynote: The Lean Theorem Prover: Design, Evolution, and Impact
Location: Grande Auditório
09:00-10:00
The Lean Theorem Prover: Design, Evolution, and Impact (abstract) 60 min
Leonardo de Moura
10:00-11:00 Coffee Break IJCAR
Location: B2.04
10:00-11:00 Coffee Break ITP
Location: B1.04
10:00-10:30 Coffee Break CSF
Location: B2.03
10:00-10:30 Coffee Break CAV
Location: Grande Auditório
10:30-12:35 Verification of Parallel, Concurrent, and Distributed Systems CAV
Session Chair:
Borzoo Bonakdarpour
Location: Grande Auditório
10:30-10:45
On the Complexity of Checking Soundness of Natural Reductions (abstract) 15 min
Constantin Enea1, Azadeh Farzan2, Dominik Klumpp1
1 LIX - CNRS - Ecole Polytechnique
2 University of Toronto
10:45-11:00
Deadlock Verification via Ordering-Constrained Mutex Modeling (abstract) 15 min
Pei Wang1, Zhilei Han1, Zhihang Sun1, Fei He1
1 Tsinghua University
11:00-11:15
Complete Local Reasoning About Parameterized Programs Over Topologies (Distinguished Paper) (abstract) 15 min
Ruotong Cheng1, Azadeh Farzan1
1 University of Toronto
11:15-11:30
Scalable Deductive Verification of Data-Level Parallel Programs (abstract) 15 min
Lars van den Haak1, Marieke Huisman2, Anton Wijs1
1 Eindhoven University of Technology
2 University of Twente
11:30-11:45
On the Verification Problem of Remote Direct Memory Access programs (abstract) 15 min
Parosh Aziz Abdulla1, Mohamed Faouzi Atig1, R Govind2, Stephan Spengler1
1 Uppsala University
2 The Institute of Mathematical Sciences, Chennai
11:45-11:55
Model Checking for Flexible Network Protocols (abstract) 10 min
Andrew Johnson1, Dennis Fetterly2, Jon Zolla2, Sean Song2
1 Princeton University
2 Google, Inc
11:55-12:05
The TLA+ Model Checker Apalache (abstract) 10 min
Rodrigo Otoni1, Shon Feder2, Jure Kukovec3, Andrey Kupriyanov3, Gabriela Moreira4, Philip Offtermatt4, Thomas Pani3, Thanh-Hai Tran5, Igor Konnov3
1 University of Groningen
2 Tarides
3 Independent Researcher
4 Informal Systems
5 Université Paris-Saclay, CEA, List
12:05-12:15
PSF: A Generic and Extensible Framework for Protocol State Fuzzing (abstract) 10 min
Konstantinos Sagonas1, Thanos Typaldos2
1 Uppsala University & National Technical University of Athens
2 Yale University & National Technical University of Athens
12:15-12:25
Kofola 1.0: A Modular Approach to 𝝎-Regular Complementation and Inclusion Checking (abstract) 10 min
Ondrej Alexaj1, Vojtěch Havlena1, Lukáš Holík2, Ondřej Lengál1, Yong Li3, Nicolas Mazzocchi4
1 Brno University of Technology
2 Brno University of Technology and Aalborg University
3 Institute of Software, Chinese Academy of Sciences
4 Slovak University of Technology in Bratislava
12:25-12:35
Octopus: Practical Equivalence Checking of P4 Packet Parsers (abstract) 10 min
Jort van Leenen1, Tobias Kappé1
1 LIACS, Leiden University
10:30-12:30 Differential Privacy CSF
Location: B2.03
10:30-10:54
Optimizing Differential Privacy in Federated Analytics under Known Input Distributions (abstract) 24 min
Ferran Alborch Escobar1, Andreas Athanasiou2, Pascal Reisert3
1 Orange Innovation
2 TU Delft
3 University of Stuttgart
10:54-11:18
Interpreting Differential Privacy in Terms of Disclosure Risk (abstract) 24 min
Zeki Kazan1, Sagar Sharma2, Wanrong Zhang2, Bo Jiang2, Qiang Yan2
1 Duke University
2 TikTok Inc
11:18-11:42
Bayesian Advantage of Re-Identification Attack in the Shuffle Model (abstract) 24 min
Pengcheng Su1, Haibo Cheng1, Ping Wang1
1 Peking University
11:42-12:06
Privacy Mechanism Design based on Empirical Distributions (abstract) 24 min
Leonhard Grosse1, Sara Saeidian2, Mikael Skoglund1, Tobias J. Oechtering1
1 KTH Royal Institute of Technology
2 KTH Royal Institute of Technology and Inria Saclay
12:06-12:30
DPEI: Privacy Budget Savings for Edge Information Protection in Synthetic Graph Publishing (abstract) 24 min
Ruizhong Du1, Zizhan Wei1, Mingyue Li1
1 Hebei University
11:00-12:00 ITP Papers: Formalisation of Mathematics ITP
Location: B1.04
11:00-11:30
Complex Bounded Operators in Isabelle/HOL (abstract) 30 min
Dominique Unruh1
1 RWTH Aachen, University of Tartu
11:30-12:00
Lean Formalization of Generalization Error Bound by Rademacher Complexity and Dudley's Entropy Integral (abstract) 30 min
Sho Sonoda1,5, Kazumi Kasaura2, Yuma Mizuno3, Kei Tsukamoto4, Naoto Onda2
1 RIKEN AIP
2 OMRON SINIC X Corporation
3 University College Cork
4 The University of Tokyo
5 CyberAgent Inc
11:00-12:00 Differential Equations & Hybrid Systems IJCAR
Location: B2.04
11:00-11:20
A Deductive Refinement Calculus for Differential-Algebraic Programs (abstract) 20 min
Jonathan Hellwig1, Long Qian2, André Platzer1
1 Karlsruhe Institute of Technology
2 Carnegie Mellon University
11:20-11:40
Refactoring-as-Propositions: Proved Refactoring of Hybrid Systems via Proved Refinements (abstract) 20 min
Enguerrand Prebet1, André Platzer1
1 Karlsruhe Institute of Technology
11:40-12:00
Complete Robust Hybrid Systems Reachability (abstract) 20 min
Noah Abou El Wafa1, André Platzer1
1 Karlsruhe Institute of Technology
12:00-14:00 Lunch IJCAR
Location: B2.04
12:00-14:00 Lunch ITP
Location: B1.04
12:30-14:00 Lunch CSF
Location: B2.03
12:30-14:00 Lunch CAV
Location: Grande Auditório
14:00-15:30 Synthesis CAV
Session Chair:
Orna Kupferman
Location: Grande Auditório
14:00-14:15
Randomise Alone, Reach Together (abstract) 15 min
Léonard Brice1, Thomas A. Henzinger1, Alipasha Montaseri1, Ali Shafiee1, K. S. Thejaswini1
1 Institute of Science and Technology Austria
14:15-14:30
Decoupled Planning for Multiple Omega-Regular Objectives (abstract) 15 min
Guy Avni1, Thomas A. Henzinger2, Kaushik Mallik3, Suman Sadhukhan4, K.S. Thejaswini2
1 University of Haifa, Israel
2 Institute of Science and Technology, Austria
3 IMDEA Software Institute, Spain
4 TU Clausthal, Germany
14:30-14:45
Repairing Regex-Dependent String-Manipulation Programs (abstract) 15 min
Nariyoshi Chida1, Tachio Terauchi2
1 NTT Social Informatics Laboratories
2 Waseda University
14:45-15:00
Liquid Tree Automata (abstract) 15 min
Ashish Mishra1, Suresh Jagannathan2
1 Indian Institute of Technology Hyderabad
2 Purdue University
15:00-15:10
SemML 2.0: Synthesizing Controllers from LTL (abstract) 10 min
Maximilian Prokop1, Tobias Meggendorfer2, Jan Kretinsky3
1 TU Munich
2 Lancaster University Leipzig
3 Masaryk University Brno
15:10-15:20
Fast Obligation Translation and Synthesis (Distinguished Paper) (abstract) 10 min
Alexandre Duret-Lutz1,7, Giuseppe De Giacomo2, Marcin Jurdzinski3, Nir Piterman4, Moshe Y. Vardi5, Shufang Zhu6
1 LRE
2 University of Oxford
3 DIMAP, University of Warwick
4 University of Gothenburg & Chalmers University of Technology
5 Rice University
6 University of Liverpool
7 EPITA
15:20-15:30
sweap: Reactive Synthesis for Infinite-State Integer Problems (abstract) 10 min
Shaun Azzopardi1, Luca Di Stefano2, Nir Piterman3
1 Dedaub
2 TU Wien
3 University of Gothenburg, Chalmers University of Technology
14:00-15:30 Quantitative Information Flow CSF
Location: B2.03
14:00-14:24
A new measure for dynamic leakage based on quantitative information flow (abstract) 24 min
Luigi D. C. Soares1, Mário S. Alvim2, Natasha Fernandes3
1 UFMG and Macquarie University
2 UFMG
3 Macquarie University
14:24-14:48
Information Leakage Envelopes (abstract) 24 min
Sara Saeidian1, Carlos Pinzón2, Catuscia Palamidessi2
1 KTH Royal Institute of Technology and Inria
2 Inria and École Polytechnique
14:48-15:12
Beyond Epsilon: A Principled QIF Framework for Local Differential Privacy (abstract) 24 min
Ramon G. Gonze1,5, Natasha Fernandes2, Heber H. Arcolezi3, Catuscia Palamidessi4, Nataliia Bielova4
1 Institut Polytechnique de Paris
2 Macquarie University
3 ETS Montréal
4 Inria
5 Universidade Federal de Minas Gerais
14:00-15:30 ITP Papers: Formalisation of Algorithms ITP
Location: B1.04
14:00-14:30
Certified Intersection of Commutative Regular Expressions as Solutions of Systems of Linear Diophantine Equations (abstract) 30 min
Ricardo Almeida1, Blair Archibald1, Basile Pesin2, Michele Sevegnani1
1 School of Computing Science, University of Glasgow, Glasgow, Scotland
2 Fédération ENAC ISAE-SUPAERO ONERA, Université de Toulouse, France
14:30-15:00
Functional correctness of an optimized modular inversion algorithm (abstract) 30 min
Assia Mahboubi1, Guillaume Melquiond1, Pierre-Yves Strub2, Tomás Vallejos Parada1
1 INRIA
2 PQShield
15:00-15:30
Verification of the Garsia–Wachs Algorithm (abstract) 30 min
Makoto Kanazawa1
1 Hosei University
14:00-14:40 Arrays & Interpolation IJCAR
Session Chair:
Carsten Lutz
Location: B2.04
14:00-14:20
Accelerating Loops with Arrays (abstract) 20 min
Florian Frohn1, Jürgen Giesl1
1 RWTH Aachen University
14:20-14:40
Saving Craig in the Fluted Fragment (abstract) 20 min
Hongkai Yin1
1 Central European University
14:40-16:00 Awards IJCAR
Session Chair:
Jürgen Giesl
Location: B2.04
14:40-14:50
Presentation of the Best Paper Award (abstract) 10 min
Carsten Lutz1, Sara Negri2
1 Leipzig University, Germany
2 Università degli Studi di Genova, Italy
14:50-15:00
Presentation of the Best Student Paper Award (abstract) 10 min
Carsten Lutz1, Sara Negri2
1 Leipzig University, Germany
2 Università degli Studi di Genova, Italy
15:00-15:10
Presentation of the Bill McCune PhD Award (abstract) 10 min
Viorica Sofronie-Stokkermans1, Pascal Fontaine2, Carsten Fuhs3, Ullrich Hustadt4, Mikoláš Janota5, Cezary Kaliszyk6, Philipp Rümmer7, Sophie Tourret8
1 University of Koblenz
2 University of Lorraine
3 Birkbeck, University of London
4 University of Liverpool
5 Czech Technical University in Prague
6 University of Melbourne
7 University of Regensburg
8 Max Planck Institute for Informatics
15:10-15:50
Herbrand Award Acceptance Speech (abstract) 40 min
Frank Pfenning1
1 Carnegie Mellon University
15:50-16:00
Presentation of the Herbrand Award (abstract) 10 min
Nikolaj Bjørner1, Amy Felty2, Cynthia Kop3, Cláudia Nalon4, Andrew Reynolds5, Geoff Sutcliffe6
1 Microsoft Research
2 University of Ottawa
3 Radboud University Nijmegen
4 University of Brasília
5 University of Colorado Boulder
6 University of Miami
15:30-16:30 Coffee Break ITP
Location: B1.04
15:30-16:00 Coffee Break CSF
Location: B2.03
15:30-16:00 Coffee Break CAV
Location: Grande Auditório
16:00-17:00 Hardware Verification CAV
Session Chair:
Supratik Chakraborty
Location: Grande Auditório
16:00-16:15
A-IC3: Learning-Guided Adaptive Inductive Generalization for Hardware Model Checking (abstract) 15 min
Xiaofeng Zhou1, Guangyu Hu1, Hongce Zhang2, Wei Zhang1
1 Hong Kong University of Science and Technology
2 Hong Kong University of Science and Technology (Guangzhou)
16:15-16:30
A Multi-Width Parametric Equivalence Solver (abstract) 15 min
Luigi Rinaldi1, John Wickerson2, Samuel Coward1
1 University College London
2 Imperial College London
16:30-16:45
Massively Parallel Mining of Specifications for Hardware Designs (abstract) 15 min
Leiqi Ye1, Guy Frankel1, Jianyi Cheng1, Elizabeth Polgreen1
1 University of Edinburgh
16:45-17:00
A mechanised, bidirectional type system for bit-width determination in SystemVerilog (abstract) 15 min
Gabriel Desfrene1, Quentin Corradi2, Michalis Pardalos2, John Wickerson2
1 École normale supérieure – PSL
2 Imperial College London
16:00-17:00 Side-Channel & Speculative Defenses CSF
Location: B2.03
16:00-16:24
Formal Verification of Probing Security via Conditional Independence (abstract) 24 min
Satoshi Kura1, Katsuyuki Takashima1
1 Waseda University
16:24-16:48
Triosecuris: Formally Verified Protection Against Speculative Control-Flow Hijacking (abstract) 24 min
Jonathan Baumann1, Yonghyun Kim1, Yan Farba2, Catalin Hritcu1, Julay Leatherman-Brooks3
1 MPI-SP
2 MPI-SP and Ruhr University Bochum
3 MPI-SP and Portland State University
16:00-16:30 Coffee Break IJCAR
Location: B2.04
16:30-17:50 ITP Papers: Program Logics ITP
Location: B1.04
16:30-17:00
Title: Fractional Separation Logic in Isabelle/LLVM (abstract) 30 min
Peter LAMMICH1
1 University of Twente
17:00-17:30
Lazy Proof Automation for Separation Logic (abstract) 30 min
Valentin Mikhalchuk1, Vladimir Gladshtein1, Ilya Sergey1
1 National University of Singapore
17:30-18:00
Formalizing a Hoare Calculus for Choreographic Programming (abstract) 30 min
Luís Cruz-Filipe1, Thomas Wulff Heissel2
1 IT University of Copenhagen
2 Independent Researcher
18:00-20:00 Reception
Location: Pátio da Galé
Monday, 27 July 2026
09:00-10:00 ITP Invited Talk: Dominic Mulligan, Amazon Web Services ITP
Location: B1.04
09:00-10:00 Invited Talk IJCAR
Location: B2.04
09:00-10:00
A Type-Theoretic Framework for Meta-Programming: Lessons Learned from Writing Meta-Theoretic Proofs as Programs (abstract) 60 min
Brigitte Pientka1
1 McGill University, Montreal, Canada
09:00-10:00 Invited Talk CSF
Location: B2.03
09:00-10:00
Analyzing the Security of Privacy Preserving Systems Built from Ideal Cryptographic Functionalities (abstract) 60 min
Kenny Paterson1
1 ETH Zurich
09:00-10:00 Invited Talk CAV
Session Chair:
Eva Darulova
Location: Grande Auditório
09:00-10:00
Deriving Test Oracles for Verification Infrastructure (abstract) 60 min
Maria Christakis1
1 TU Wien, Austria
10:00-10:30 Coffee Break CAV
Location: Grande Auditório
10:00-10:30 Coffee Break CSF
Location: B2.03
10:00-11:00 Coffee Break IJCAR
Location: B2.04
10:00-11:00 Coffee Break ITP
Location: B1.04
10:00-11:00 ProoVer Competition Kickoff IJCAR
10:00-11:00
The ProoVer 2026 Competition (abstract) 60 min
Julie Cailler1, Simon Guilloud2
1 University of Lorraine & Inria
2 EPFL
10:00-11:00 CASC Competition Kickoff IJCAR
10:00-11:00
The ProoVer 2026 Competition (abstract) 60 min
Julie Cailler1, Simon Guilloud2
1 University of Lorraine & Inria
2 EPFL
11:00-12:00
The CADE ATP System Competition (abstract) 60 min
Geoff Sutcliffe1
1 University of Miami
10:30-12:30 Symbolic Protocol Verification CSF
Location: B2.03
10:30-10:54
Beyond the Finite Variant Property: Extending Symbolic Diffie-Hellman Group Models (abstract) 24 min
Sofia Giampietro1, Ralf Sasse1, David Basin1
1 ETH Zürich
10:54-11:18
Tamarin Unchained: Handling User-Defined AC Operators (abstract) 24 min
Jannik Dreier1, Elise Klein1, Steve Kremer1
1 Université de Lorraine, CNRS, Inria, LORIA
11:18-11:42
Incremental Fingerprinting in an Open World (abstract) 24 min
Loes Kruger1, Paul Kobialka2, Andrea Pferscher2, Einar Broch Johnsen2, Sebastian Junges1, Jurriaan Rot1
1 Radboud University
2 University of Oslo
11:42-12:06
Mind the Gap -- Connecting Protocol Representations in Squirrel (abstract) 24 min
David Baelde1, Stéphanie Delaune1, Julia Gabet, Clément Hérouard1
1 Univ Rennes, CNRS, IRISA
12:06-12:30
Verifying and Monitoring the Lightweight Directory Access Protocol (LDAP) (abstract) 24 min
Ndzebelai Precious Zemoh1, Robert Künnemann2
1 University of Bamenda
2 CISPA Helmholtz Center for Information Security
10:30-11:20 Security, Privacy and Hyperproperties CAV
Session Chair:
Cesare Tinelli
Location: Grande Auditório
10:30-10:45
Differentially Private Runtime Monitoring (abstract) 15 min
Frederik Scheerer1, Bernd Finkbeiner1
1 CISPA Helmholtz Center for Information Security
10:45-11:00
HyperLasso: Bounded Model Checking of ∀+∃+-Liveness Hyperproperties (abstract) 15 min
Alcino Cunha1, Hugo Pacheco1, Nuno Macedo1
1 Universidade do Minho & INESC TEC
11:00-11:10
The Simulator’s Blueprint: Automata Learning from Cybersecurity Logs (abstract) 10 min
Tudor Braicu1, Benjamin Ylvisaker1, Nico Espinosa Dice1, Yiding Chen1, Yiyi Zhang1, Nate Foster2, Hossein Hojjat3
1 Cornell
2 EPFL
3 Tehran Institute for Advanced Studies, Khatam University
11:10-11:20
HyperQB 2.0: A Bounded Model Checker for Hyperproperties (abstract) 10 min
Tzu-Han Hsu1, Milad Rabizadeh1, Kenneth Rogale1, Fedor Filippov1, Marco A. de Oliveira Batista1, Borzoo Bonakdarpour1
1 Michigan State University
11:00-12:00 ITP Papers: Verification and Model Checking ITP
Location: B1.04
11:00-11:30
Automated Verification of Robot Software Models with Assume-Guarantee Reasoning in Isabelle/HOL (abstract) 30 min
Fang Yan1, Benoît Ballenghien2, Simon Foster1, Ana Cavalcanti1, James Baxter1, Burkhart Wolff2
1 University of York
2 Université Paris-Saclay
11:30-12:00
Securing the Foundations of an Intermediate Language for Probabilistic Program Verification (abstract) 30 min
Oliver Emil Bøving1, Christoph Matheja2
1 Technical University of Denmark
2 University of Oldenburg and Technical University of Denmark
11:00-12:00 Automation & Unification IJCAR
Location: B2.04
11:00-11:20
Unification of Deterministic Higher-Order Patterns (abstract) 20 min
Johannes Niederhauser1, Aart Middeldorp1
1 University of Innsbruck
11:20-11:40
Automating proof search when equality is a logical connective (abstract) 20 min
Kaustuv Chaudhuri1,2, Arunava Gantait1,2, Dale Miller1,2
1 Inria-Saclay & LIX
2 IPP
11:40-11:50
SMT-Based Deontic Reasoning for Aqvist Logics (abstract) 10 min
Christian Köll1, Agata Ciabattoni1, Dmitry Rozplokhas1
1 TU Wien
11:50-12:00
grind: An SMT-Inspired Tactic for Lean 4 (abstract) 10 min
Kim Morrison1, Leonardo de Moura2
1 Lean FRO
2 Amazon Web Services, and Lean FRO
11:20-12:30 SMT, SAT & Decision Procedures CAV
Session Chair:
Cesare Tinelli
Location: Grande Auditório
11:20-11:35
Improving Stability of SMT Solvers via Context-Driven Normalization (abstract) 15 min
Xiang Zhang1, Mengyu Zhao1, Shaohuang Chen1, Jian Zhang1, Shaowei Cai2,1
1 Institute of Software, Chinese Academy of Sciences
2 Beihang University
11:35-11:50
Satisfiability Modulo Extensional Constant Arrays (Distinguished Paper) (abstract) 15 min
Mathias Preiner1, Aina Niemetz1, Clark Barrett1
1 Stanford University
11:50-12:05
String Solving with Stabilization and Transducers (abstract) 15 min
David Chocholatý1, Vojtěch Havlena1, Juraj Síč1, Lukáš Holík2, Michal Šedý2
1 Brno University of Technology
2 Aalborg University
12:05-12:20
Lagrangian-Based Duality for Quantified SMT Algorithms (abstract) 15 min
Ivana Bocevska1, Takeshi Tsukada2, Hiroshi Unno3, Oded Padon4, Sharon Shoham5
1 TU Wien
2 Chiba University
3 Tohoku University
4 Weizmann Institute of Science
5 Tel Aviv University
12:20-12:30
Mallob: Scalable Automated Reasoning On Demand (Distinguished Paper) (abstract) 10 min
Dominik Schreiber1, Niccolò Rigi-Luperti1, Peter Sanders1
1 Karlsruhe Institute of Technology
12:00-14:00 Lunch IJCAR
Location: B2.04
12:00-14:00 Lunch ITP
Location: B1.04
12:30-14:00 Lunch CAV
Location: Grande Auditório
12:30-14:00 Lunch CSF
Location: B2.03
14:00-16:00 Computer-Aided Cryptography CSF
Location: B2.03
14:00-14:24
Are ideal functionalities really ideal? (abstract) 24 min
Myrto Arapinis1, Véronique Cortier2, Hubert de Groote3, Charlie Jacomme4, Steve Kremer4
1 The University of Edinburgh
2 Université de Lorraine, CNRS, Inria, LORIA
3 ENS Paris-Saclay, Université Paris-Saclay
4 Université de Lorraine, Inria, CNRS, LORIA
14:24-14:48
Computationally Sound Symbolic Cryptography in Lean (abstract) 24 min
Stefan Dziembowski1, Grzegorz Fabiański2, Daniele Micciancio3, Rafał Stefański2
1 University of Warsaw and IDEAS Institute
2 University of Warsaw
3 UCSD
14:48-15:12
Mechanizing Nested Hybrid Arguments (abstract) 24 min
Markus Krabbe Larsen1, Carsten Schürmann1
1 IT University of Copenhagen
15:12-15:36
Interactive Proofs in Higher-Order Logic with Errors and Application to Concrete Cryptography (abstract) 24 min
Caroline Fontaine1, Adrien Koutsos2, Guillaume Scerri1, Théo Vignon1
1 Université Paris-Saclay, CNRS, ENS Paris-Saclay, Laboratoire Méthodes Formelles
2 Inria
15:36-16:00
Forking Lemma in EasyCrypt (abstract) 24 min
Jakub Janků1, Denis Firsov2
1 Masaryk University
2 Tallinn University of Technology, Input Output
14:00-15:30 Deductive Verification & Certified Verification CAV
Session Chair:
Marieke Huisman
Location: Grande Auditório
14:00-14:15
Modular Reasoning about Object Relations (Distinguished Paper) (abstract) 15 min
Micha Greutmann1, Marco Eilers1, Peter Müller1
1 ETH Zurich
14:15-14:30
Formally Verified Linear-Time Invertible Lexing (abstract) 15 min
Samuel Chassot1, Viktor Kunčak1
1 EPFL
14:30-14:45
Automating Bitvector and Finite Field Equivalence Proofs in Lean (abstract) 15 min
Elizaveta Pertseva1, Valentin Robert2, Clark Barrett1, James Parker2
1 Stanford University
2 Galois, Inc.
14:45-15:00
The Cooperating Proof Calculus: Comprehensive Proofs for an SMT Solver (abstract) 15 min
Andrew Reynolds1, Hans-Jörg Schurr1, Haniel Barbosa2, Ofec Israel3, Jibiana Zoe Jakpor4, Hanna Lachnitt4, Abdalrhman Mohamed4, Aina Niemetz4, Mathias Preiner4, Yoni Zohar3, Robert Jones5, Clark Barrett4, Cesare Tinelli1
1 The University of Iowa
2 Universidade Federal de Minas Gerais
3 Bar Ilan University
4 Stanford University
5 Amazon Web Services
15:00-15:10
Burrow: A Proof Framework for Weak Memory (abstract) 10 min
Dennis Sprokholt1, Soham Chakraborty2
1 TU Munich
2 TU Delft
15:10-15:20
Velvet: A Foundational Multi-Modal Verifier for Imperative Programs in Lean (Distinguished Paper) (abstract) 10 min
Vladimir Gladshtein1, Vitaly Kurin2, Yueyang Feng1, Dipesh Kafle1, George Pîrlea1, Qiyuan Zhao1, Ilya Sergey1
1 National University of Singapore
2 Neapolis University Pafos
15:20-15:30
Automatic Heap-Memory Diagrams for Separation-Logic Proofs (abstract) 10 min
Yawen Guan1, Shardul Chiplunkar1, Clément Pit-Claudel1
1 EPFL
14:00-15:30 ITP Papers: AI and ITP ITP
Location: B1.04
14:00-14:30
ProofWala: A Framework for Multilingual Proof Data Synthesis and Theorem-Proving (abstract) 30 min
Amitayush Thakur1, George Tsoukalas1, Greg Durrett2, Swarat Chaudhuri1
1 University of Texas at Austin
2 New York University
14:30-15:00
Feedback & Synthesis in LLM-Assisted Termination Proofs (abstract) 30 min
Zeke Medley1, Panagiotis Manolios1
1 Northeastern University
15:00-15:30
LeanArchitect: Automating Blueprint Generation for Humans and AI (abstract) 30 min
Thomas Zhu1, Pietro Monticone2, Jeremy Avigad1, Sean Welleck1
1 Carnegie Mellon University
2 University of Trento
14:00-16:00 Formalization & Interactive Proof IJCAR
Location: B2.04
14:00-14:20
A Unified Formalization of Context-Free Grammar Theory (abstract) 20 min
Tobias Nipkow1, Fabian Lehr1, Moritz Roos1, Akihisa Yamada2
1 Technical University of Munich
2 AIST
14:20-14:40
Towards Term-based Verification of Diagrammatic Equivalence (abstract) 20 min
Julie Cailler1, Noé Delorme2, Simon Perdrix2, Sophie Tourret2
1 University of Lorraine, CNRS, INRIA, LORIA
2 INRIA
14:40-15:00
Pitts and Intuitionistic Multi-Succedent: Uniform Interpolation for KM (abstract) 20 min
Hugo Férée1, Ian Shillito2
1 Université Paris Cité
2 University of Birmingham
15:00-15:20
Formally Verified Graph Generation with SAT modulo Symmetries and Lean (abstract) 20 min
Markus Kirchweger1, Pablo Manrique1, Stefan Szeider1
1 TU Wien
15:20-15:40
Semantics for Dependently-Typed Higher-Order Logic (abstract) 20 min
Florian Rabe1
1 FAU Erlangen-Nürnberg
15:40-16:00
Growing HOLMS: A Verified Automated Prover for Grzegorczyk Logic in HOL Light (abstract) 20 min
Antonella Bilotta1, Marco Maggesi2, Cosimo Perini Brogi3
1 Scuola Normale Superiore di Pisa
2 University of Florence
3 IMT School for Advanced Studies Lucca
15:30-16:30 Coffee Break ITP
Location: B1.04
15:30-16:00 Coffee Break CAV
Location: Grande Auditório
16:00-17:50 Automata CAV
Session Chair:
Ondřej Lengál
Location: Grande Auditório
16:00-16:15
An L# Based Algorithm for Active Learning of Minimal Separating Automata (abstract) 15 min
Jasper Laumen1, Leonne Snel1, Frits Vaandrager1
1 Radboud University
16:15-16:30
Upper Bound for the Determinization of Emerson-Lei Automata: A One-Fin Approach (abstract) 15 min
Runzhe Ma1, Cong Tian1, Wensheng Wang1, Zhenhua Duan1
1 ICTT and ISN Laboratory, Xidian University
16:30-16:45
SMT-Based Active Learning of Weighted Automata (abstract) 15 min
Tiago Ferreira1, Kevin Batz2, Alexandra Silva2
1 University College London
2 Cornell University
16:45-17:00
Compositional Verification of Timed Automata via Violation Assumptions (abstract) 15 min
Mehran Moeini Jam1, Hamed Kalantari2, Ehsan Khamespanah3, Marjan Sirjani4, Ali Movaghar2
1 TU Wien, Austria - Sharif University of Technology, Iran
2 Sharif University of Technology, Iran
3 University of Tehran, Iran
4 Malardalen University, Sweden
17:00-17:15
Weighted soundness for Workflow Nets (abstract) 15 min
Filip Mazowiecki1, Piotr Hofman1, Krzysztof Makuracki1
1 University of Warsaw
17:15-17:30
Synthesizing POMDP Policies: Sampling Meets Model-checking via Learning (abstract) 15 min
Debraj Chakraborty1, Anirban Majumdar2, Prince Mathew3, Sayan Mukherjee4, Jean-François Raskin3
1 Nanyang Technological University
2 Tata Institute of Fundamental Research
3 Université Libre de Bruxelles
4 Univ Rennes, Inria, CNRS, IRISA
17:30-17:40
TACO: A Toolsuite for the Verification of Threshold Automata (abstract) 10 min
Paul Eichler1, Tom Baumeister1, Mouhammad Sakr2, Mahboubeh Kalateh Dowlati3, Marcus Völp3, Swen Jacobs1
1 CISPA Helmholtz Center for Information Security
2 American University of Beirut
3 Luxembourg University
17:40-17:50
Extending QuAK with Nested Quantitative Automata (abstract) 10 min
Thomas A. Henzinger1, Nicolas Mazzocchi2, N. Ege Saraç3, Harun Yılmaz4
1 Institute of Science and Technology Austria (ISTA)
2 Slovak University of Technology in Bratislava
3 CISPA Helmholtz Center for Information Security
4 Sabancı University
16:00-16:30 Coffee Break CSF
Location: B2.03
16:00-16:30 Coffee Break IJCAR
Location: B2.04
16:30-18:30 Rewriting, Automata, Verification & Fuzzy Logic IJCAR
Location: B2.04
16:30-16:50
Disproving (Positive) Almost-Sure Termination of Probabilistic Term Rewriting via Random Walks (abstract) 20 min
Jan-Christoph Kassing1, Henri Nagel1, Alexander Schlecht1, Jürgen Giesl1
1 RWTH Aachen University
16:50-17:10
Complexity and Expressivity of the Uniform Fluted Fragment (abstract) 20 min
Hongkai Yin1
1 Central European University
17:10-17:30
Complexity of reasoning in Kleene algebra with sum-of-letters hypotheses (abstract) 20 min
Stepan Kuznetsov1,2
1 Steklov Mathematical Institute of RAS
2 HSE University
17:30-17:50
Learning Computation Tree Logic with Neural Networks (abstract) 20 min
Benjamin Bordais1, Daniel Neider2, Mustafa Yalciner2
1 Université Libre de Bruxelles
2 TU Dortmund University
17:50-18:10
Toward Fast Automatic Verification of Textbook Proof Steps (abstract) 20 min
Adam Dingle1
1 Charles University
18:10-18:20
Implementing Fuzzy OSF Logic Unification and Normalization (abstract) 10 min
Gian Carlo Milanese1, Gabriella Pasi1
1 University of Milano-Bicocca
18:20-18:30
Presentation of the Termination Competition (termCOMP) Results (abstract) 10 min
Florian Frohn1, Jürgen Giesl1, Georg Moser2, Étienne Payet3, Akihisa Yamada4, Dieter Hofbauer5
1 RWTH Aachen
2 University of Innsbruck
3 Université de La Réunion
4 National Institute of Informatics
5 ASW Saarland
16:30-18:00 ITP Papers: Formalisation of Mathematics & AI ITP
Location: B1.04
16:30-17:00
Formalizing the Bruck-Ryser-Chowla Theorem: Combinatorial Design Theory in Lean (abstract) 30 min
Eric Jonathan Wang1, Elif Uskuplu2
1 Carnegie Mellon University
2 Indiana University Bloomington
17:00-17:20
Three Roads to de Finetti's Theorem in Lean: Short Paper (abstract) 20 min
Cameron Freer1
1 Massachusetts Institute of Technology
17:20-17:40
Formal Primal-Dual Algorithm Analysis (Short Paper) (abstract) 20 min
Thomas Ammer1, Mohammad Abdulaziz1, Christoph Madlener
1 King's College London
17:40-18:00
130k Lines of Formal Topology in Two Weeks: Simple and Cheap Autoformalization for Everyone? (Short Paper) (abstract) 20 min
JOSEF URBAN1
1 AI4REASON and University of Gothenburg
16:30-18:00 Information Flow & Secure Composition CSF
Location: B2.03
16:30-16:54
Dolev-Yao Information Flow (abstract) 24 min
Simon Tobias Lund1, Sebastian Mödersheim2
1 Technical University of Denmark
2 DTU
16:54-17:18
Partial Cast Calculus for Gradual Information Security (abstract) 24 min
Zechi Shen1, Zhiwu Xu1, Shengchao Qin2, Zhong Ming1
1 Shenzhen University
2 Xidian University
17:18-17:42
Cryptographic Choreographies (abstract) 24 min
Sebastian Mödersheim1, Simon Tobias Lund2, Marco Carbone3, Rosario Giustolisi3, Alessandro Bruni3
1 DTU
2 Technical University of Denmark
3 ITU
18:00-19:00 Logic Lounge CAV
Session Chair:
Mirco Giacobbe
Location: Grande Auditório
18:00-19:00
Proof Against Attack: Can AI Help Build Software We Can Trust? (abstract) 60 min
Kathleen Fisher1
1 Advanced Research and Invention Agency
18:00-19:00 Business meeting: AI and ITP conference Series ITP
Location: B1.04
18:00-19:00 Business meeting CSF
Location: B2.03
18:30-20:00 Business Meeting IJCAR
Location: B2.04
19:00-20:00 AI for Math Happy Hour (“Differentiated” Networking) ITP
Location: B1.04
Tuesday, 28 July 2026
09:00-10:00 Keynote: Trustworthy Neuro-Symbolic Programming with Informal Specifications
Location: Grande Auditório
09:00-10:00
Trustworthy Neuro-Symbolic Programming with Informal Specifications (abstract) 60 min
Işıl Dillig
10:00-11:00 Coffee Break ITP
Location: B1.04
10:00-11:00 Coffee Break IJCAR
Location: B2.04
10:00-10:30 Coffee Break CAV
Location: Grande Auditório
10:00-10:30 Coffee Break CSF
Location: B2.03
10:30-12:30 E-Voting & Anonymity CSF
Location: B2.03
10:30-10:54
On the necessity of pre-agreed secrets for thwarting last-minute coercion: vulnerabilities and lessons from the Loki e-voting protocol (abstract) 24 min
Jingxin Qiao1, Myrto Arapinis1, Thomas Zacharias2
1 The University of Edinburgh
2 University of Glasgow
10:54-11:18
Setup Protocols for Sender Anonymity (abstract) 24 min
Tian Huang1, Jiatai Zhang2, Megumi Ando1
1 Tufts University
2 Rensselaer Polytechnic Institute
11:18-11:42
Simultaneously Proving Privacy and Verifiability: A ProVerif Framework for Internet Voting (abstract) 24 min
Vincent Cheval1, Veronique Cortier2, Alexandre Debant3, Florian Moser3
1 University of Oxford
2 CNRS Nancy
3 INRIA Nancy
11:42-12:06
Beyond Blockchain Ballots: UC-Secure Layer-2 Voting and Governance (abstract) 24 min
Raghav Bhaskar1, Pooya Farshim2, Matthias Fitzi2, Aggelos Kiayias3
1 None
2 Input Output
3 University of Edinburgh and Input Output
12:06-12:30
BlindReview: Anonymous and End-to-End Verifiable Peer Review (abstract) 24 min
Xavier Bultel1, Ashley Fraser2, Elizabeth A. Quaglia3
1 INSA Centre Val de Loire, Inria
2 Lancaster University
3 Royal Holloway, University of London
10:30-12:25 Machine Learning, AI and Verification CAV
Session Chair:
Guy Katz
Location: Grande Auditório
10:30-10:45
VNN-LIB 2.0: Rigorous Foundations for Neural Network Verification (abstract) 15 min
Ann Roy1, Allen Antony1, Andrea Gimelli2, Matthew Daggitt1
1 University of Western Australia
2 University of Genova
10:45-11:00
QAV-FT: Quadratic Approximation-based Neural Network Verification via Fourier Series and Taylor Truncation (abstract) 15 min
Han Wang1, Xuyang Ding1, Xie Ying2, Yakun Sheng1
1 School of Computer Science and Engineering, University of Electronic Science and Technology of China
2 College of Computer Science and Artificial Intelligence, Southwest Minzu University
11:00-11:15
The Rocq-NN-Roll Prover: Soundly Verifying Hyperproperties of Neural Networks in Rocq (abstract) 15 min
Andrei Aleksandrov1, Malte Jackisch2, Kim Völlinger2
1 Fraunhofer Institute FOKUS Berlin
2 Technische Universität Berlin
11:15-11:30
ATKVerifier: Adaptive Top-K Constraints for Tighter Verification of Semantic Segmentation Networks (abstract) 15 min
Yuehao Liu1, Cong Tian1, Yansong Dong2, Liang Zhao1, Chao Huang1, Wensheng Wang1
1 ICTT and ISN Laboratory, Xidian University
2 KylinSoft Co., Ltd.
11:30-11:45
Precise Verification of Transformers through ReLU-Catalyzed Abstraction Refinement (abstract) 15 min
Hengjie Liu1, Zhenya Zhang1, Jianjun Zhao1
1 Kyushu University
11:45-12:00
Quantifying Sensitivity for Tree Ensembles : A symbolic and compositional approach (abstract) 15 min
Ajinkya Naik1, Akshay S1, Ashutosh Gupta1, Chaitanya Garg1, Kuldeep S. Meel2
1 IIT Bombay
2 University of Toronto
12:00-12:15
Shields to Guarantee Probabilistic Safety in MDPs (abstract) 15 min
Linus Heck1, Filip Macák2, Roman Andriushchenko2, Milan Ceska2, Sebastian Junges1
1 Radboud University
2 Brno University of Technology
12:15-12:25
A Neurosymbolic Approach to Natural Language Formalization and Verification (abstract) 10 min
Chenyang An1, Sam Bayless1, Stefano Buliani1, Darion Cassel1, Byron Cook2, Duncan Clough1, Rémi Delmas1, Nafi Diallo1, Ferhat Erata1, Nick Feng1, Dimitra Giannakopoulou1, Aman Goel1, Aditya Gokhale1, Joe Hendrix1, Victor Heorhiadi1, Marc Hudak1, Dejan Jovanović1, Andrew M. Kent1, Benjamin Kiesl-Reiter1, Jeffrey J. Kuna1, Nadia Labai1, Joseph Lilien1, Divya Raghunathan1, Zvonimir Rakamarić1, Niloofar Razavi1, Michael Tautschnig1, Ali Torkamani1, Nathaniel Weir1, Michael W. Whalen1, Jianan Yao3
1 Amazon Web Services
2 Amazon Web Services, University College London
3 University of Toronto
11:00-12:00 Model Finding, Certification & Synthesis IJCAR
Location: B2.04
11:00-11:20
Finite Model Finding in First-order Modal Logics (abstract) 20 min
Happy Khairunnisa Sariyanto1, Alexander Steen1, Geoff Sutcliffe2
1 University of Greifswald
2 University of Miami
11:20-11:40
Completeness of Synthesis under Realizability Assumptions using Superposition (abstract) 20 min
Márton Hajdu1, Petra Hozzová1, Laura Kovács1, Eva Wagner1
1 TU Wien
11:40-11:50
Hardware Model Checking Certification with Certifaiger and Cerbtora (abstract) 10 min
Nils Froleyks1, Emily Yu2
1 KU Leuven
2 Leiden University
11:50-12:00
Pgeon: Generating Tableau-Based Provers from Declarative Specifications of Logical Calculi (abstract) 10 min
Romain Sidhoum1, Simon Robillard1, David Delahaye1
1 LIRMM, Univ Montpellier, CNRS, Montpellier, France
11:00-12:00 ITP Papers: Proof Theory and Types ITP
Location: B1.04
11:00-11:30
Don't Sweat Interaction Trees: Proof-Guided Local Variable Lifting for Interaction Trees (abstract) 30 min
Yiming Lin1, Ian Kariniemi1, Yao Li1
1 Portland State University
11:30-12:00
Bidirectional Interpolation for the Lambda-Calculus – Revisiting and Formalising Craig-Čubrić Interpolation (abstract) 30 min
Meven Lennon-Bertrand1, Alexis Saurin2
1 Université Paris Cité, INRIA, CNRS, IRIF
2 Université Paris Cité, CNRS, INRIA, IRIF
12:00-14:00 Lunch ITP
Location: B1.04
12:00-14:00 Lunch IJCAR
Location: B2.04
12:25-13:45 Lunch CAV
Location: Grande Auditório
12:30-14:00 Lunch CSF
Location: B2.03
13:45-14:45 CAV Award CAV
Session Chair:
Isil Dillig
Location: Grande Auditório
13:45-14:45
Invited talk by CAV Award awardees (abstract) 60 min
TBA na1
1 na
14:00-16:00 Cryptographic Primitives & Protocols CSF
Location: B2.03
14:00-14:24
A Composable Game-Theoretic Framework for Blockchains (abstract) 24 min
Pim Keer1, Fabian Regen1, Georg Fuchsbauer1, Matteo Maffei1, Zeta Avarikioti2
1 TU Wien
2 TU Wien & Common Prefix
14:24-14:48
NTRU with Hints: Secret Key Recovery under Partial Leakage on NTRU-based Signatures (abstract) 24 min
Honglin Shao1, Yuejun Liu1, Mingyao Shao2,3,6, Wei Cheng1,4, Yongbin Zhou1,5
1 School of Cyber Science and Engineering, Nanjing University of Science and Technology, Nanjing 210094, China
2 Institute of Information Engineering, Chinese Academy of Sciences
3 the State Key Laboratory of Cyberspace Security Defense
4 and also with LTCI, Télécom Paris, Institut Polytechnique de Paris, Palaiseau 91120, France
5 the Institute of Information Engineering, Chinese Academy of Sciences, Beijing 100085, China
6 and the School of Cyber Security, University of Chinese Academy of Sciences, Beijing, China
14:48-15:12
Self-Guarding Arbitrary Cryptographic Primitives and 2PC Protocols (abstract) 24 min
Daniele Friolo1, Andrea Reale1, Daniele Venturi1
1 Sapienza University of Rome
15:12-15:36
Revisiting Beimel-Weinreb Weighted Threshold Secret Sharing Schemes (abstract) 24 min
Oriol Farràs1, Miquel Guiot1
1 Universitat Rovira i Virgili
15:36-16:00
Time-Lock Puzzles with Preprocessing: an Instantiation from Average-Case Hardness Assumptions on Graphs and Lattices (abstract) 24 min
Raz Rosie1
1 Lombard International (part of Utmost Group)
14:00-16:00 Superposition, Saturation, Equations & Constraints IJCAR
Location: B2.04
14:00-14:20
Tao’s Equational Proof Challenge Accepted (abstract) 20 min
Lydia Kondylidou1, Jasmin Blanchette1, Marijn Heule2
1 Ludwig-Maximilians-Universität München
2 Carnegie Mellon University
14:20-14:40
Generating Theorems by Generating Proof Structures (abstract) 20 min
Christoph Wernhard1
1 University of Potsdam
14:40-15:00
Beyond Eager Encodings: A Theory-Agnostic Approach to Theory-Lemma Enumeration in SMT (abstract) 20 min
Emanuele Civini1, Gabriele Masina1, Giuseppe Spallitta2, Roberto Sebastiani1
1 University of Trento
2 Rice University
15:00-15:20
A Superposition Calculus for Separation Logic (abstract) 20 min
Tanguy Bozec1, Nicolas Peltier2
1 LMU Munich
2 CNRS LIG
15:20-15:40
Twitch: Learning Abstractions for Equational Theorem Proving (abstract) 20 min
Guy Axelrod1, Moa Johansson1, Nicholas Smallbone1
1 Chalmers University of Technology
15:40-16:00
On Constructing Most General Solutions for Parametric Constraints (abstract) 20 min
Viorica Sofronie-Stokkermans1
1 University of Koblenz
14:00-15:30 ITP Papers: User Interfaces and Compilers ITP
Location: B1.04
14:00-14:30
Enhancing Interactive Theorem Prover Error Messages with Hints (abstract) 30 min
Maria Khakimova1, Sára Juhošová1, Jaro Reinders1, Jesper Cockx1
1 Delft University of Technology
14:30-15:00
Formalization of a Realistic Verification-Condition Generator for an Intermediate Verification Language (abstract) 30 min
Vladimir Gladshtein1, K. Rustan M. Leino2
1 National University of Singapore
2 Amazon Web Services
15:00-15:30
Panbench: A Comparative Benchmarking Tool for Dependently-Typed Languages (abstract) 30 min
Reed Mullanix1, Jacques Carette1
1 McMaster University
14:50-15:30 Liveness/Termination CAV
Session Chair:
Orna Grumberg
Location: Grande Auditório
14:50-15:05
Liveness Proofs for Hardware Model Checking (Distinguished Paper) (abstract) 15 min
Nils Froleyks1, Emily Yu2, Bart Bogaerts1, Armin Biere3, Keijo Heljanko4
1 KU Leuven
2 Leiden University
3 University of Freiburg
4 University of Helsinki
15:05-15:20
Transition Invariants Revisited: Termination Witnesses and Their Validation (abstract) 15 min
Dirk Beyer1, Marek Jankola1, Marian Lingsch-Rosenfeld1
1 LMU Munich
15:20-15:30
KoAT: Automatic Complexity and Termination Analysis of Integer Programs (abstract) 10 min
Nils Lommen1, Jürgen Giesl1, Eleanore Meyer1
1 RWTH Aachen University
15:30-16:00 Coffee Break CAV
Location: Grande Auditório
15:30-16:30 Coffee Break ITP
Location: B1.04
16:00-16:30 Coffee Break IJCAR
Location: B2.04
16:00-17:25 Program Analysis Session CAV
Session Chair:
Youcheng Sun
Location: Grande Auditório
16:00-16:15
Sound and Precise Symbolic Automata Model for Stateful Software Systems (abstract) 15 min
Xinlong Wu1, Ruiyu Zhou1, Peisen Yao2, Qingkai Shi1
1 Nanjing University
2 Zhejiang University
16:15-16:30
Automated Amortised Analysis of Skew Heaps and Leftist Heaps (abstract) 15 min
Armin Walch1, Georg Moser1, Berry Schoenmakers2, Florian Zuleger3
1 University of Innsbruck
2 TU Eindhoven, Netherlands
3 Vienna University of Technology
16:30-16:45
Polynomial Invariant Generation for Floating-Point Programs (abstract) 15 min
Xuran Cai1, Liqian Chen2, Hongfei Fu3
1 University of Oxford
2 National University of Defense Technology
3 Shanghai University of Finance and Economics
16:45-17:00
Parallel Abstract Interpretation for Polynomial Programs with Range Bound Assertions (abstract) 15 min
S. Akshay1, Supratik Chakraborty2, Soroush Farokhnia3, Amir Goharshady4, Harshit Jitendra Motwani5, Đorđe Žikelić6
1 Indian Institute of Technology Bombay
2 IIT Bombay
3 HKUST
4 University of Oxford
5 TU Wien
6 Singapore Management University
17:00-17:15
Incremental Inference for Probabilistic Datalog (abstract) 15 min
Xuyang Li1, Weiyi Chen1, Isil Dillig2, Jingbo Wang1
1 Purdue University
2 UT Austin
17:15-17:25
Automatic Detection of Reference Counting Bugs in Linux Kernel Drivers (Distinguished Paper) (abstract) 10 min
Joe Hattori1, Naoki Kobayashi1, Ken Sakayori1
1 The University of Tokyo
16:00-16:30 Coffee Break CSF
Location: B2.03
16:30-18:00 Machine Learning Security & Privacy CSF
Location: B2.03
16:30-16:54
Efficient Homomorphic Encryption-Based CNN Batch Inference Using Channel-Interleaved Packing with Small Rotation Key Set (abstract) 24 min
Haun-Chih Wang1, Ja-Ling Wu1
1 National Taiwan University
16:54-17:18
Towards Strong Certified Defense with Universal Asymmetric Randomization (abstract) 24 min
Hanbin Hong1, Ali Payani2, Ashish Kundu2, Binghui Wang3, Yuan Hong1
1 University of Connecticut
2 Cisco
3 Illinois Institute of Technology
17:18-17:42
LAP$_2$: Revisiting Laplace DP-SGD for High Dimensions via Majorization Theory (abstract) 24 min
Meisam Mohammady1, Qin Yang2, Nicholas Stout1, Ayesha Samreen1, Han Wang3, Christopher J Quinn1, Yuan Hong2
1 Iowa State University
2 University of Connecticut
3 University of Kansas
16:30-17:00 Confluence Analysis & Rewriting IJCAR
Location: B2.04
16:30-16:50
An Applicative Multiset Path Order (abstract) 20 min
Nao Hirokawa1, Teppei Saito1, Teppei Tanaka1, Wataru Yachi1
1 JAIST
16:50-17:00
The ARI Infrastructure for Automated Confluence Analysis (abstract) 10 min
Nao Hirokawa1, Aart Middeldorp2, Teppei Saito1, René Thiemann2
1 JAIST
2 University of Innsbruck
16:30-18:00 ITP Papers: Automation and Tactics ITP
Location: B1.04
16:30-16:50
A Lean Tactic for Normalizing Expressions in an Algebra over a Ring (Short Paper) (abstract) 20 min
Arend Mellendijk1
1 University of Bonn
16:50-17:10
Lean on Vampire Proofs (Short Paper) (abstract) 20 min
Jonas Bodingbauer1, Marton Hajdu1, Laura Kovacs1, Axel Polaczek1, Michael Rawson2
1 TU Wien
2 University of Southampton
17:10-17:40
TableauxRocq: A Deep Embedding of Free-Variable Tableaux in Rocq (abstract) 30 min
Johann Rosain1, Julie Cailler2
1 ENS de Lyon
2 University of Lorraine, CNRS, Inria, LORIA, Nancy, France
17:40-18:00
Faster Verified Real Root Isolation with Descartes' Rule of Signs (Short Paper) (abstract) 20 min
Aeacus Sheng1, Wenda Li1, Paul Jackson1
1 University of Edinburgh
17:00-17:30 Deepak Kapur Memorial Session IJCAR
Session Chair:
Jürgen Giesl
Location: B2.04
17:30-18:00 CAV Business meeting CAV
Location: Grande Auditório
19:00-23:00 Banquet
Location: Pavilhão Carlos Lopes
Wednesday, 29 July 2026
09:00-10:00 Invited Talk CAV
Session Chair:
Philipp Rümmer
Location: Grande Auditório
09:00-10:00
Formally Explaining Neural Networks (abstract) 60 min
Guy Katz1
1 Hebrew University of Jerusalem
09:00-10:30 Authenticity & Identity CSF
Location: B2.03
09:00-09:24
On the design of Survivable Distributed Passwordless Authentication and Single Sign-On (abstract) 24 min
Luca Ferretti1, Federico Magnanini1, Mauro Andreolini1, Mattia Trabucco1, Michele Colajanni2
1 University of Modena and Reggio Emilia
2 University of Bologna
09:24-09:48
Formalizing Privacy in Decentralized Identity: A Provably Secure Framework with Minimal Disclosure (abstract) 24 min
Yu Zhang1, Zongbin Wang2
1 Northwestern Polytechnical University
2 Beijing Infosec Technologies Co., Ltd.
09:48-10:12
Zero-Knowledge Proof of Progress: Secure Multi-Phase Capture-the-Flag Competitions (abstract) 24 min
Salam Khanji1, Behzad Abdolmaleki1, John Clark1, Aryan Pasikhani1
1 University of Sheffield
09:00-10:00 Invited Talk IJCAR
Location: B2.04
09:00-10:00
Polynomial-time Deduction with Orthologic (abstract) 60 min
Viktor Kunčak1
1 EPFL, Lausanne, Switzerland
09:00-10:00 ITP Invited Talk: Dominique Unruh, RWTH Aachen and University of Tartu ITP
Location: B1.04
10:00-11:00 Coffee Break ITP
Location: B1.04
10:00-11:00 Coffee Break IJCAR
Location: B2.04
10:00-10:30 Coffee Break CAV
Location: Grande Auditório
10:30-11:15 Software: Tools, Verification and Synthesis CAV
Session Chair:
Alessandro Cimatti
Location: Grande Auditório
10:30-10:45
Consistency-Based Software Diagnosis: Accuracy, Scalability, and Limitations (abstract) 15 min
Sarah Sallinger1, Lukas Graussam1, Georg Weissenbacher1, Florian Zuleger1, Alexey Ignatiev2
1 TU Wien
2 Monash University
10:45-10:55
Show Me The Money: An Exercise in Proof-Driven Software Understanding (abstract) 10 min
Joseph Tafese1, Karthik Nukala2, Hassen Saidi3, Natarajan Shankar2, Arie Gurfinkel1, Giuliano Losa4
1 University of Waterloo
2 SRI
3 Entalus
4 Stellar Development Foundation
10:55-11:05
SvLibChecker: A Light-Weight Tool for Software Model Checking (abstract) 10 min
Dirk Beyer1, Marian Lingsch-Rosenfeld1
1 LMU Munich
11:05-11:15
PyCHC: a Framework for Certified Horn Solving and CHC-based Design (abstract) 10 min
Anna Becchi1, Martin Blicha2, Rodrigo Otoni3, Natasha Sharygina1
1 University of Lugano
2 Argot Collective
3 University of Groningen
10:30-11:00 Coffee Break CSF
Location: B2.03
11:00-12:30 Attack Trees & Risk Analysis CSF
Location: B2.03
11:00-11:24
A unified compositional view of attack tree metrics (abstract) 24 min
Benedikt Peterseim1, Milan Lopuhaä-Zwakenberg1
1 University of Twente
11:24-11:48
Active Cyber Defense Strategy through Multi-Agent Systems Verification (abstract) 24 min
Gabriel Ballot1, Etienne Borde2, Vadim Malvone3, Jean Leneutre3
1 SEIDO Lab, EDF R&D and LTCI, Télécom Paris, Institut Polytechnique de Paris, Palaiseau, France
2 University of Canterbury
3 LTCI, Télécom Paris, Institut Polytechnique de Paris, Palaiseau, France
11:48-12:12
Which attacks are most critical? Risk prioritization via attack tree importance measures (abstract) 24 min
Reza Soltani1, Milan Lopuhaä-Zwakenberg1, Mariëlle Stoelinga1
1 University of Twente
11:00-12:00 SMT Proof Production & Checking IJCAR
Location: B2.04
11:00-11:20
A General Approach for SMT Proof Skeletons (abstract) 20 min
Joseph E. Reeves1, Haniel Barbosa2, Andrew Reynolds3, Marijn J. H. Heule1
1 Carnegie Mellon University
2 Universidade Federal de Minas Gerais
3 The University of Iowa
11:20-11:40
Automatically Translating Proof Systems for SMT Solvers to the λΠ-calculus (abstract) 20 min
Ciarán Dunne1, Guillaume Burel2
1 Télécom SudParis
2 ensIIE
11:40-11:50
Checking Regular Expressions in cvc5 Proofs (abstract) 10 min
Ofec Israel1, Yoni Zohar1, Hitarth Singh2, Bruno Dutertre3, Andrew Reynolds4, Clark Barrett5, Cesare Tinelli4
1 Bar-Ilan University
2 The Hong Kong University Of Science And Technology
3 Amazon Web Services
4 University of Iowa
5 Stanford University
11:50-12:00
Ethos: A Fast Proof Checker for the Eunoia Logical Framework (abstract) 10 min
Andrew Reynolds1, Hans-Jörg Schurr1, Mallku Soldevila2, Haniel Barbosa2, Cesare Tinelli1, Clark Barrett3
1 University of Iowa
2 Universidade Federal de Minas Gerais
3 Stanford University
11:00-12:00 ITP Paper: Automata and Coinduction ITP
Location: B1.04
11:00-11:30
Completing Almost Fair Simulations (abstract) 30 min
Arthur Correnson1, Iona Kuhn1, Bernd Finkbeiner1
1 CISPA Helmholtz Center for Information Security
11:30-12:00
Certified Infinite Descent Criteria in Isabelle/HOL (abstract) 30 min
Jamie Wright1, Liron Cohen2, Reuben N. S. Rowe3, Andrei Popescu1
1 University of Sheffield
2 Ben-Gurion University of the Negev
3 Royal Holloway University of London
11:15-12:35 Quantum CAV
Session Chair:
Alessandro Cimatti
Location: Grande Auditório
11:15-11:30
How Many Circuit Identities Are Needed to Generate All Others? (abstract) 15 min
Yuantian Ding1, Nengkun Yu2, Xiaokang Qiu1
1 Purdue University
2 Stony Brook University
11:30-11:45
A Practical Specification Language for Automatic Quantum Program Verification (abstract) 15 min
Wei-Lun Tsai1, Yu-Fang Chen2, Ondřej Lengál3
1 National Taiwan University
2 Academia Sinica
3 Brno University of Technology
11:45-12:00
Formal Verification of Quantum Ancilla Safety (abstract) 15 min
Jiqi Li1, Jingyi Mei2, Wang Fang3, Ji Guan4
1 Key Laboratory of System Software (Chinese Academy of Sciences), Institute of Software Chinese Academy of Sciences, University of Chinese Academy of Sciences
2 Leiden University
3 University of Edinburgh
4 Key Laboratory of System Software (Chinese Academy of Sciences), Institute of Software Chinese Academy of Sciences
12:00-12:15
Model Checking Matrix Product States Against Linear Chain Logic (abstract) 15 min
Ming Xu1, Yihao Chen1, Ji Guan2
1 East China Normal University
2 Chinese Academy of Sciences
12:15-12:25
Analysis and Verification of Quantum Communication Protocols in UPPAAL (abstract) 10 min
René Bødker Christensen1, Nikolaj Rossander Kristensen1, Kim Guldstrand Larsen1, Marius Mikučionis1, Jiří Srba1, Loke Walsted1
1 Aalborg University
12:25-12:35
Quokka#: Quantum Computing with #SAT (abstract) 10 min
Jingyi Mei1, Dekel Zak2, Muhammad Osama1, Tim Coopmans3, Alfons Laarman1
1 Leiden University
2 Delft University of Technology, Leiden University
3 Delft University of Technology
12:00-14:00 Lunch ITP
Location: B1.04
12:00-13:30 Lunch IJCAR
Location: B2.04
12:30-14:00 Lunch CSF
Location: B2.03
12:35-14:00 Lunch CAV
Location: Grande Auditório
13:30-15:30 Theory Combination, Arithmetic Circuits & Embedded Systems IJCAR
Location: B2.04
13:30-13:50
The termination of Nielsen transformations applied to word equations with length constraints (abstract) 20 min
Benjamin Przybocki1, Clark Barrett2
1 Carnegie Mellon University
2 Stanford University
13:50-14:10
Bringing closure to theory combination properties (abstract) 20 min
Guilherme Vicentin de Toledo1, Benjamin Przybocki2, Yoni Zohar3
1 Bar Ilan University
2 Carnegie Mellon University
3 Bar-Ilan University
14:10-14:30
Free Set Theory -- Cut Elimination and Consistency (abstract) 20 min
Andrzej Indrzejczak1
1 University of Lodz
14:30-14:50
Avoiding Big Integers: Parallel Multimodular Algebraic Verification of Arithmetic Circuits (abstract) 20 min
Clemens Hofstadler1, Daniela Kaufmann2, Chen Chen3
1 JKU Linz
2 TU Wien
3 Hong Kong University of Science and Technology (Guangzhou)
14:50-15:10
A Two-Watched Literal Scheme for First-Order Logic (abstract) 20 min
Yasmine Briefs1, Martin Bromberger1, Tobias Gehl1, Lorenz Leutgeb1, Simon Schwarz1, Christoph Weidenbach1
1 Max Planck Institute for Informatics
15:10-15:30
Verification of Configurable SRA Systems (abstract) 20 min
Alessandro Cimatti1, Alberto Griggio1, Christian Lidström1, Gianluca Redondi1, Dylan Trenti1
1 Fondazione Bruno Kessler
14:00-15:30 ITP Papers: Formalisation of Mathematics-3 ITP
Location: B1.04
14:00-14:30
Formalizing Abstract Simplicial Complexes & Stellar Subdivisions in Lean (abstract) 30 min
Garett Cunningham1, Daniel Zach2, Stefan Friedl2
1 University of Connecticut
2 Universität Regensburg
14:30-15:00
From Weierstraß to Dedekind: Formalising Foundations of Modular Forms (abstract) 30 min
Manuel Eberl1, Wenda Li2, Lawrence C. Paulson3
1 University of Innsbruck
2 University of Edinburgh
3 University of Cambridge
15:00-15:30
An End-to-End Verification of Keller's Conjecture (abstract) 30 min
James Gallicchio1, Cayden Codel1, Jeremy Avigad1, Marijn J. H. Heule1
1 Carnegie Mellon University
14:00-16:00 Hybrids, Controls and Probabilistic Systems CAV
Session Chair:
Pavithra Prabhakar
Location: Grande Auditório
14:00-14:15
Over-approximation of weakly-hard constraints for control systems verification (abstract) 15 min
Rieke de Maeyer1, Holger Hermanns1, Martina Maggio1
1 Saarland University
14:15-14:30
Spatiotemporal Robustness of Temporal Logic Tasks using Multi-Objective Reasoning (abstract) 15 min
Oliver Schön1, Lars Lindemann1
1 ETH Zürich
14:30-14:45
Best-Effort Safety Control of Multi-Mode Systems (abstract) 15 min
Massimo Benerecetti1, Marco Faella1, Fabio Mogavero1
1 University of Naples, Italy
14:45-15:00
Perception with Guarantees: Certified Pose Estimation via Reachability Analysis (abstract) 15 min
Tobias Ladner1, Yasser Shoukry2, Matthias Althoff1
1 Technical University of Munich
2 University of California, Irvine
15:00-15:15
Tensor Probabilistic Model Checking of Finite-Horizon Markov Chains (abstract) 15 min
JIANLIN LI1, Nick Guo1, Peter Ye1, Yizhou Zhang1
1 University of Waterloo
15:15-15:30
Fast Computation of Conditional Probabilities in MDPs and Markov Chain Families (abstract) 15 min
Milan Ceska1, Sebastian Junges2, Luko van der Maas2, Filip Macák1, Tim Quatmann3
1 Brno University of Technology
2 Radboud University
3 RWTH Aachen University
15:30-15:40
Ensuring Safety in Automotive Machine Learning Inference: From Pre-validated Static Kernels to Machine Learning Graph Compilation (abstract) 10 min
Jelena Frtunikj1, Alex Latz1, Ajit Mistry1, Matthew Propp1, Vasu Singh1, Suresh Talapaneni1, Amanda Tang1, Damien Zufferey1
1 NVIDIA
15:40-15:50
Caesar: A Deductive Verifier for Probabilistic Programs (abstract) 10 min
Philipp Schröer1, Kevin Batz2, Umut Yiğit Dural1, Darion Haase1, Benjamin Lucien Kaminski3, Joost-Pieter Katoen1, Christoph Matheja4
1 RWTH Aachen University
2 Cornell University
3 Saarland University and University College London
4 DTU Compute and University of Oldenburg
15:50-16:00
ULTIMATE: A Tool for the Verification and Synthesis of Stochastic World Models (abstract) 10 min
Radu Calinescu1, Micah Bassett1, Brendan Devlin-Hill1, Simos Gerasimou1, Sinem Getir Yaman1, Kavan Fatehi1, Gricel Vázquez1
1 University of York
15:30-16:30 Coffee Break CSF
Location: B2.03
15:30-16:30 Coffee Break ITP
Location: B1.04
15:30-16:00 Coffee Break IJCAR
Location: B2.04
16:00-18:00 Refined Logics & Proofs, Hyperproperties & Synthesis IJCAR
Location: B2.04
16:00-16:20
Proof Nets for PiL (abstract) 20 min
Matteo Acclavio1, Giulia Manara1
1 University of Southern Denmark
16:20-16:40
Ordered Adjoint Logic (abstract) 20 min
Sophia Roshal1, Frank Pfenning1
1 Carnegie Mellon University
16:40-17:00
A Complete Proof System for HyperLTL (abstract) 20 min
Naijun Zhan1, Wen Tang2, Dimitar Guelev3
1 School of Computer Science, Peking University
2 Department of Philosophy, Peking University, Beijing, China
3 Institute of Mathematics and Informatics, Bulgarian Academy of Sciences, Sofia, Bulgaria
17:00-17:20
Automatic Abstraction Refinement for Hyperproperties Verification (abstract) 20 min
Malak Marrid1, Shachar Itzhaky1, Sharon Shoham2, Yakir Vizel1
1 The Technion
2 Tel Aviv University
17:20-17:40
Uniform interpolation with constructive diamond (abstract) 20 min
Iris van der Giessen1, Ian Shillito2
1 University of Amsterdam
2 University of Birmingham
17:40-18:00
Program Synthesis for Non-Linear Real Arithmetic: Beyond Realizable Specifications (abstract) 20 min
S. Akshay1, Supratik Chakraborty1, Aniruddha Joshi2, R. Govind3
1 IIT Bombay
2 University of California Berkeley
3 The Institute of Mathematical Sciences
16:00-16:30 Coffee Break CAV
Location: Grande Auditório
16:30-18:00 ITP Papers ITP
Location: B1.04
16:30-17:00
Formally Verified Liveness with Multiparty Session Types in Rocq (abstract) 30 min
Omer Keskin1, Nobuko Yoshida2, Rob van Glabbeek1
1 University of Edinburgh
2 University of Oxford
17:00-17:30
Apply2Isar: Automatically Converting Isabelle/HOL Apply-Style Proofs to Structured Isar (abstract) 30 min
Sage Binder1, Hanna Lachnitt2, Katherine Kosaian1
1 University of Iowa
2 Stanford University
17:30-18:00
String diagrams for monoidal categories, in Rocq (abstract) 30 min
Damien Pous1
1 ENS de Lyon
Designed and Developed by EventKey | Copyright 2026 EventKey Last updated:
🔍 ↑