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
Session Chair:
Location:
B1.03
| 09:05-10:00 |
Computing Interpolants in Description Logics (abstract) 55 min
1 TU Dortmund University
|
Session Chair:
Location:
B1.03
| 10:30-10:36 |
Introducing DeepEL (Extended Abstract) (abstract) 6 min
1 University of Milano-Bicocca
2 University of Zaragoza
|
| 10:36-10:42 |
Towards Visual Decision Support in Interactive Repair (abstract) 6 min
1 TU Dresden
|
| 10:42-10:48 |
Optimization and Empirical Evaluation of the CATS ABox Abduction Solver (Extended Abstract) (abstract) 6 min
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
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
1 L3S Research Center, Leibniz University Hannover
|
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
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
1 Leipzig University, Scads.AI Dresden
2 Leipzig
|
| 12:00-12:30 |
Tenability: Non-Uniform Defense in Abstract Argumentation (abstract) 30 min
1 University of Wisconsin - Madison
2 University of Bari
|
Session Chair:
Location:
B1.03
| 11:20-11:40 |
QBF Reasoning for Concept Satisfiability via an Optimised Reduction From K (abstract) 20 min
1 University of Manchester
|
| 11:40-12:00 |
ontopEO: VKGs over Earth Observation Data (Extended Abstract) (abstract) 20 min
1 Free University of Bozen-Bolzano
2 Eurac Research
3 ISTC Laboratory for Applied Ontology, National Research Council (CNR
|
Session Chair:
Location:
B1.03
| 13:30-13:50 |
Revisiting Conjunctive Query Entailment for S (Extended Abstract) (abstract) 20 min
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
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
1 University of Opole
2 University of Warsaw
|
| 14:30-14:50 |
Tree Description Dependencies (abstract) 20 min
1 University of Waterloo
|
Session Chair:
Location:
B1.04
| 14:00-14:30 |
Understanding Zhang's Partial Expansion (abstract) 30 min
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
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
1 Technical University of Denmark
2 University of Luxembourg
|
Session Chair:
Location:
B1.03
| 15:00-15:03 |
Formal Reasoning with Learned Predicates (Extended Abstract) (abstract) 3 min
1 Sapienza University of Rome
|
| 15:03-15:06 |
Preferential Temporal Description Logics with Typicality, Weighted KBs and Preference Combination (abstract) 3 min
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
1 University of Oslo
|
| 15:09-15:12 |
BoxLitE: A Faithful Knowledge Base Embedding Based on Convex Optimization (Extended Abstract) (abstract) 3 min
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
1 University of Lisbon
2 University of Milan
|
Session Chair:
Location:
B1.03
| 15:20-15:40 |
Reaching for the stars in EL concept learning (abstract) 20 min
1 TU Vienna
2 Paderborn University
|
| 15:40-16:00 |
Finite Characterizations of ℰℒ Ontologies and Concept Inclusions (abstract) 20 min
1 Leipzig University
|
Session Chair:
Location:
B1.04
| 16:00-16:30 |
Toward Defeasible Machine Learning: When Learned Rule Sets Become Defeasible Theories (abstract) 30 min
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
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
1 TU Wien
2 University of Verona
|
Saturday, 18 July 2026
Session Chair:
Location:
B2.02
| 08:20-08:30 |
Opening (abstract) 10 min
1 University of Klagenfurt
|
| 08:30-08:50 |
Enhancing the Extensibility of Answer Set Programming via Meta-Programming (abstract) 20 min
1 University of Potsdam
|
| 08:50-09:10 |
Advancing Knowledge-Based Reasoning for Automated Workflow Composition (abstract) 20 min
1 University of Potsdam
|
| 09:10-09:30 |
Formal Methods for Answer Set Programming (abstract) 20 min
1 University of Potsdam
|
| 09:30-09:50 |
Defeasible Normative Reasoning: a Deontic Equilibrium Logic approach (abstract) 20 min
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
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
1 The Graduate University of Advanced Studies, SOKENDAI and NII
|
Session Chair:
Location:
C2.01
| 08:45-08:50 |
Opening (abstract) 5 min
1 University of Coruña
|
| 08:50-09:15 |
Neural Decision-Propagation for Answer Set Programming (Extended Abstract) (abstract) 25 min
1 TU Wien
2 NII
3 The Graduate University of Advanced Studies, SOKENDAI and NII
|
| 09:15-09:40 |
Implementing Operator-Based Semantics for Normal Logic Programs using Meta-Programming in ASP (abstract) 25 min
1 Open Universiteit
2 University of Alberta
|
| 09:40-10:05 |
aspen-tree: A system for non-ground meta-programming in ASP (Preliminary Report) (abstract) 25 min
1 University of Potsdam, Germany
|
| 10:05-10:30 |
Instance-Aware AMOSUM Propagator Selection in ASP (abstract) 25 min
1 University of Calabria
2 TU Wien
|
Session Chair:
Location:
C5.05
| 09:00-10:00 |
Is ontology-mediated graph querying finally within reach? (abstract) 60 min
1 Freie Universitä Wien
|
Session Chair:
Location:
C5.07
| 09:00-10:30 |
Quantitative Typing Across Effects, Machines, and Notions of Cost (abstract) 90 min
1 Università di Bologna
|
Session Chair:
Location:
C4.07
| 09:00-10:00 |
Linearisation of the Lambda-Calculus: A Road Trip (abstract) 60 min
1 Universidade do Porto
|
| 10:00-10:30 |
A Typing System for the Linear Lambda-Calculus in de Bruijn Notation (abstract) 30 min
1 Inria
2 Université de Lorraine
|
Session Chair:
Location:
C1.04
| 09:00-09:30 |
Proper Open World Automated Planning (abstract) 30 min
1 Toronto Metropolitan University
|
| 09:30-10:00 |
A Practical and Didactic Epistemic Planning Toolkit (abstract) 30 min
1 Free University of Bozen-Bolzano
|
Location:
C5.01
| 09:00-10:00 |
Equational theories for scoped effects (abstract) 60 min
1 University of Birmingham
|
Location:
C5.06
| 09:00-10:00 |
From Traces to Strategies, via Coalgebra (abstract) 60 min
1 University of Southampton
|
Location:
C2.02
| 09:00-09:10 |
Opening (abstract) 10 min
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
1 Potassco Solutions
|
| 09:40-10:10 |
Defining Routines in DaaS: Visual Logic Programming for Mesh Network Policies - Preliminary Report (abstract) 30 min
1 University of Calabria
|
Session Chair:
Location:
C5.08
| 09:00-10:00 |
From quantum in pictures to interpretable and scalable quantum AI (abstract) 60 min
1 Oxford University
|
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
1 Gran Sasso Science Institute
|
Location:
C3.01
| 09:00-09:15 |
Introduction to Domain Independent Dynamic Programming Algorithms (abstract) 15 min
1 University of Toronto
|
| 09:15-09:30 |
Decision Diagram-Based Branch-and-Bound Solvers (abstract) 15 min
1 University of Toronto
|
Session Chair:
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
1 Lisbon
|
| 10:00-10:40 |
Recurrent Arithmetic Circuits (abstract) 40 min
1 Leibniz Universität Hannover
|
Session Chair:
Location:
B1.03
| 09:00-10:00 |
Defeasible Reasoning (Joint with NMR) (abstract) 60 min
1 University of Cape Town and CAIR
|
Session Chair:
Location:
C2.05
Location:
C5.02
| 09:30-10:30 |
Category Theory for Fast Model Checking Algorithms (abstract) 60 min
1 National Institute of Informatics
|
Location:
C4.02
| 09:30-09:50 |
Symmetry Breaking Constraints for SAT Solving (abstract) 20 min
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
1 University College Cork
|
| 10:10-10:30 |
Neural Network Based Analysis of Amenability of CSPs to Different Heuristic Actions (abstract) 20 min
1 University College Cork
|
09:30-10:00
Modeling and Proof Methods in Set Theory using Deduction Modulo Theory, Catherine Dubois and David Delahaye
TGD
Location:
C6.08
Location:
C4.08
| 09:30-10:30 |
Machine Learning Across the Solver Stack (abstract) 60 min
1 University of Waterloo
|
Location:
C4.05
Location:
B2.01
Session Chair:
Location:
C2.05
Session Chair:
Location:
B1.03
| 10:30-10:50 |
Deontic Defeasible Description Logic (abstract) 20 min
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
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
1 Inria
2 TU Dresden
|
| 11:30-11:50 |
Using ASP(Q) to Handle Inconsistent Prioritized Data (Extended Abstract) (abstract) 20 min
1 CNRS & University of Bordeaux
2 CNRS & DI ENS
3 University of Calabria
|
Session Chair:
Location:
C5.08
| 10:30-11:00 |
Minimal-size decision diagrams for quantum-circuit simulation (abstract) 30 min
1 Delft University
|
| 11:00-11:20 |
From Tensor Networks to Tractable Circuits, and Back (abstract) 20 min
1 Leiden University
2 University of Amsterdam
|
| 11:20-11:40 |
Optimal Clifford-Circuit Synthesis as SAT and Planning (abstract) 20 min
1 Aarhus University
|
| 11:40-12:00 |
A Complete Equational Presentation of Qudit Circuits via Polycontrolled PROPs (abstract) 20 min
1 INRIA, LORIA, Université de Lorraine
|
Location:
B2.02
Location:
C1.01
| 10:30-11:30 |
All-Path Reachability Analysis for Runtime-Error Verification (abstract) 60 min
1 Nagoya University
|
| 11:30-12:15 |
Closures versus Freeness (abstract) 45 min
1 University of Sussex
|
Session Chair:
Location:
C1.04
| 10:30-11:00 |
A Formal Framework for Strategic Reasoning in Agentic Business Process Management (abstract) 30 min
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
1 University of Naples "Federico II"
|
| 11:30-12:00 |
A Formal Argumentation Protocol in the Event Calculus (abstract) 30 min
1 Örebro University, Sweden
2 University of Piraeus & NCSR Demokritos, Greece
|
Session Chair:
Location:
B1.04
| 10:30-11:00 |
On Combining Abstract Argumentation Frameworks with Knowledge Bases (abstract) 30 min
1 University of Calabria
|
| 11:00-11:30 |
Semantics for Description Logics via Assumption-Based Argumentation: Preliminary Results (abstract) 30 min
1 TU Wien
|
| 11:30-12:00 |
Postulates here, postulates everywhere: a discussion of contraction postulates (abstract) 30 min
1 University of São Paulo
2 University of Sao Paulo
|
Session Chair:
Location:
B2.01
| 10:30-10:50 |
A Semantic Knowledge Graph Construction Pipeline for Vehicle Intention Prediction in nuScenes (abstract) 20 min
1 German University in Cairo
2 Computer Engineering Department, University of Alcalá, Madrid, Spain
|
| 10:50-11:10 |
Automatic Chain of Concepts: Conceptual Prompting for LLMs by Constructing Concept Trees (abstract) 20 min
1 Technical University of Munich, Siemens AG, Munich, Germany
2 Siemens AG, Munich, Germany
|
| 11:10-11:30 |
Identifying Semantic Gaps between Legal Case Descriptions and Logical Fact Formulas Using LLMs: Definition and Preliminary Evaluation (abstract) 20 min
1 Center for Juris-Informatics, ROIS-DS, Tokyo, Japan
|
| 11:30-11:50 |
When AI Should Refuse to Decide: Formal Irresolution and the Ethics of Legal Indeterminacy in LLM-Based Reasoning for Biodiversity Law (abstract) 20 min
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:50-12:10 |
On the Reliability of LLM Orchestration Under Horizontal Knowledge Partitioning (abstract) 20 min
1 German University in Cairo
|
| 12:10-12:30 |
KGP-QG: Multi-hop Reasoning with Knowledge Graphs in LLMs (abstract) 20 min
1 University of Lethbridge
|
| 12:30-12:50 |
Enhancing Retrieval-Augmented Generators with Symbolic Query Definitions (abstract) 20 min
1 Sapienza University of Rome
|
Session Chair:
Location:
C5.05
| 10:30-11:00 |
Towards Monitoring of Patients with Bipolar Disorder (abstract) 30 min
1 Technical University of Denmark
2 Free University of Bozen-Bolzano
3 Birbeck University of London, UK
4 Free Unviersity of Bozen-Bolzano
|
| 11:00-11:30 |
Temporal Path Queries: Challenges and Open Questions (abstract) 30 min
1 Free University of Bozen-Bolzano
|
| 11:30-12:00 |
AgenticVKG : Towards Memory-Driven Agentic AI for VKG Mapping Construction (abstract) 30 min
1 Free University of Bozen-Bolzano
|
Location:
C5.06
| 10:40-11:15 |
Contextual MetaML: Syntax and Full Abstraction (abstract) 35 min
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
1 ENS de Lyon, University of Bologna
|
| 11:50-12:20 |
The Game Semantics of Reachability Types (abstract) 30 min
1 Corpus Christi College, Cambridge
2 University of Oxford
|
Location:
C5.01
| 10:45-11:10 |
Effects with Variable Binding (abstract) 25 min
1 Delft University of Technology
2 University of Southern Denmark
3 Imperial College London
|
| 11:10-11:35 |
Free Semiarrows (abstract) 25 min
1 Fatec Rubens Lara
2 Obsidian Systems
|
| 11:35-12:00 |
A Type Theory for Comprehension Categories (abstract) 25 min
1 École Polytechnique
2 Radboud University
3 Delft University of Technology
4 Utrecht University
|
Session Chair:
Location:
C5.09
| 11:00-11:40 |
Limits of Lifting (abstract) 40 min
1 University of Oxford
|
Session Chair:
Location:
B2.02
| 11:00-12:00 |
EZSMT Version 3, Matured or SMT made easy via Constraint Answer Set Solving (abstract) 60 min
1 University of Nebraska at Omaha
|
Location:
C2.02
| 11:00-12:00 |
One more step towards Easy Answer Set Programming (abstract) 60 min
1 University of Potsdam
|
| 11:00-11:30 |
(Re)Painting (and Polarizing) Arrow Types (abstract) 30 min
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
1 TU Dortmund University
2 University of Warsaw
|
Location:
C3.01
| 11:00-11:25 |
Neural Self-Improvement Learning for Domain-Independent Dynamic Programming (abstract) 25 min
1 University of Toronto
|
| 11:25-11:50 |
Domain-Independent Dynamic Programming with Constraint Propagation (abstract) 25 min
1 Delft
2 University of Toronto
3 Unkown
|
| 11:50-12:15 |
Search Strategies for CODD (abstract) 25 min
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
1 Delft University
|
Location:
C4.08
| 11:00-11:20 |
An LLM-based Recommendation System for PVS (abstract) 20 min
1 Universidade de Brasília
2 Analytical Mechanics Associates Inc.
|
| 11:20-11:40 |
Neural Local Search Enhanced with Knowledge Compilation (abstract) 20 min
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
1 TU Wien
|
| 12:00-12:20 |
Do LLMs Scale on Inductive Proofs? A Controlled Study of Elementary Arithmetical Proofs (abstract) 20 min
1 Keio University
|
| 12:20-12:40 |
Learning Better Representations From Less Data For Propositional Satisfiability (abstract) 20 min
1 CISPA Helmholtz Center for Information Security
|
Session Chair:
Location:
C4.07
| 11:00-11:30 |
Linearising Explicit Substitutions using Intersection Types (abstract) 30 min
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
1 Hokkaido University
2 University of Sheffield
|
| 12:00-12:30 |
A Logical 3-valued Semantics for Non-Deterministic Choice (abstract) 30 min
1 University of Urbino Carlo Bo
|
Session Chair:
Location:
C5.07
| 11:00-11:25 |
Classical Linear Logic is not Conservative over System F (abstract) 25 min
1 CNRS - ENS Lyon
|
| 11:25-11:50 |
Confluence Modulo and Undecidability of Cut-Elimination (abstract) 25 min
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
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
1 CNRS, Université Paris Cité, INRIA
|
Location:
C6.08
Location:
C4.02
| 11:00-11:20 |
Efficient Interpretability Reasoning for Decision Trees (abstract) 20 min
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
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
1 Univaq
|
Session Chair:
Location:
C2.01
| 11:00-11:25 |
Towards ASP-based Composition of Scientific Workflows (abstract) 25 min
1 University of Potsdam
|
| 11:25-11:50 |
Declarative Spatial Reasoning in Temporal Here-and-There with Constraints (abstract) 25 min
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
1 University of Potsdam, Germany
|
| 12:15-12:40 |
Dynamic Equilibrium Logic for Action and Change: Abridged report (abstract) 25 min
1 University of Potsdam, Germany
2 University of Angers, France
|
Location:
C5.02
| 11:00-11:30 |
Game Comonads and Coalgebras (abstract) 30 min
1 National Institute of Informatics
|
| 11:30-12:00 |
Monads Distributive Law and Markov Decision Processes (abstract) 30 min
1 National Institute of Informatics
|
| 12:00-12:30 |
A Categorical Perspective on Kripke Models and Dynamic Epistemic Logic (abstract) 30 min
1 ILLC
|
Session Chair:
Location:
C4.06
| 11:10-11:50 |
On the Expressive Power of Modification Problems (abstract) 40 min
1 Universität zu Lübeck
|
| 11:50-12:30 |
Quantum Programming in Polylogarithmic Time (abstract) 40 min
1 ENS Lyon, France
2 Université de Lorraine, CNRS, Inria, LORIA, F-54000 Nancy, France
3 Laboratoire Méthodes Formelles, Université Paris-Saclay, Inria
|
Session Chair:
Location:
C2.05
11:30-11:45
Connecting Higher-Order Logics using Kolmogorov's Translation à la Dowek-Werner, Thomas Traversié
TGD
Location:
C6.08
Session Chair:
Location:
C5.09
| 11:40-12:00 |
Size-degree inequalities in Sherali-Adams and Sum-of-Squares made simple (abstract) 20 min
1 Universitat Politecnica de Catalunya
|
Location:
C6.08
12:00-12:30
Theoretical and Practical Advances of Polarized Deduction Modulo Theory, Guillaume Burel
TGD
Location:
C6.08
Location:
C4.05
Location:
B2.02
Session Chair:
Location:
B1.03
| 12:00-12:20 |
Two-Variable Logic for Hierarchically Partitioned and Ordered Data (Extended Abstract) (abstract) 20 min
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
1 École Normale Supérieure - PSL
2 Inria, LIRMM
|
Location:
B2.01
Location:
C5.01
| 13:15-14:15 |
Structural Functoriality in Dependent Type Theory (abstract) 60 min
1 Inria
|
Session Chair:
Location:
C5.08
| 13:20-13:50 |
Model Counting: Solving, Complexity, and Applications (abstract) 30 min
1 Linköping University
|
| 13:50-14:20 |
New Insights into Counting Complexity and Quantitative Reasoning with Complex Numbers (abstract) 30 min
1 University of Potsdam + Artois University
|
| 14:20-14:40 |
Quantum Physics using Weighted Model Counting (abstract) 20 min
1 Leiden University
|
| 14:40-15:00 |
Noisy Quantum Circuit Simulation Via Automated Reasoning (abstract) 20 min
1 European Space Agency
|
| 13:30-14:00 |
Autoformalizing Intersection Type Systems (abstract) 30 min
1 Université Paris Cité
|
| 14:00-14:30 |
Relational semantics: from simple to non-idempotent intersection types and back (abstract) 30 min
1 University of Sussex
|
Session Chair:
Location:
B1.04
| 13:30-14:00 |
Standpoint Logics with Defeasible Beliefs (abstract) 30 min
1 University of Cape Town and CAIR
2 TU Dresden
|
| 14:00-14:30 |
Towards Non-Monotonic Entailment in Propositional Defeasible Standpoint Logic (abstract) 30 min
1 University of Cape Town and CAIR
2 Université Sorbonne Paris Nord
|
| 14:30-15:00 |
Probabilistic epistemic spaces, Lockean beliefs, Stable beliefs and change (abstract) 30 min
1 IIIA - CSIC
2 Universidad de Los Andes
3 Universidad de Buenos Aires
4 Universitat de Barcelona
|
13:30-14:30
Session 2: Semantic Technologies for Data-centric AI and Knowledge Graph Construction
ST4DM
Session Chair:
Location:
C5.05
| 13:30-14:00 |
FORGE: Framework for Ontology-grounded Retrieval and Graph Extraction (abstract) 30 min
1 University of São Paulo
|
| 14:00-14:30 |
Using Knowledge Graphs to Restrict the Context of LLM Analysis: A GraphRAG Approach for Personnel Management (abstract) 30 min
1 Professor of Computer Science, Aeronautics Institute of Technology
|
Session Chair:
Location:
C2.01
| 13:40-14:39 |
ASPECT: Answer Set rePresentation as vEctorgraphiCs in laTex (abstract) 59 min
1 Department of Engineering, University of Ferrara
|
Location:
C1.01
| 13:45-14:45 |
Clause orderings: What's in between weight-based orderings and multiset extensions? (abstract) 60 min
1 Max Planck Institute Germany
|
| 14:45-15:15 |
the International School on Rewriting (abstract) 30 min
1 Radboud University Nijmegen
2 Universidad Complutense de Madrid
|
Location:
C3.01
| 14:00-14:25 |
GPU-Accelerated State Expansion for Anytime Exact Decision-Diagram Search (abstract) 25 min
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
1 UCLouvain
|
| 14:50-15:15 |
Decision Diagram-Based Exact Optimization for Assembly Line Balancing with Human-Robot Collaboration (abstract) 25 min
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
1 Hexaly
|
Session Chair:
Location:
C4.06
| 14:00-14:40 |
Complexity of Entailment for Cumulative Propositional Dependence Logics (abstract) 40 min
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
1 Leibniz Universität Hannover
|
Location:
C2.02
| 14:00-14:30 |
LLMASP-LGX: A Lightweight Gateway to Logic-Guided Reasoning with LLMs and ASP (abstract) 30 min
1 University of Calabria
|
| 14:30-15:00 |
Generating RTEC Programs with LLMs (abstract) 30 min
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
1 University of Calabria
|
Session Chair:
Location:
B2.02
| 14:00-15:00 |
Meta-Programming in Answer Set Programming: From Flexible Prototyping to Temporal Reasoning (abstract) 60 min
1 University of Potsdam
|
Session Chair:
Location:
C2.05
| 14:00-14:30 |
Variable Elimination for Forgetting in Probabilistic Graphical Models - A Work in Progress (abstract) 30 min
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
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
1 Unaffiliated
|
Session Chair:
Location:
C1.04
| 14:00-14:30 |
Reasoning About Intuitionistic Alternating-Time Temporal Logic (abstract) 30 min
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
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
1 University of Udine
2 University of Napoli "Federico II"
|
Session Chair:
Location:
C5.09
| 14:00-14:40 |
Lower Bounds via Friedman-Pippenger Technique (abstract) 40 min
1 EPFL, Lausanne
|
Session Chair:
Location:
C5.07
| 14:00-15:00 |
Mechanizing Substructural Systems: Challenges and Lessons Learned (abstract) 60 min
1 McGill University
|
Session Chair:
Location:
B2.01
| 14:00-14:20 |
Neurosymbolic Clinical Reasoning: From Evidence Extraction to Reason-Based Decision (abstract) 20 min
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
1 IGDORE
2 York University
|
| 14:40-15:00 |
Epistemically-Constrained Belief Harmonization: Integrating Symbolic Structure with Probabilistic Consensus (abstract) 20 min
1 Warsaw University of Technology
|
| 15:00-15:20 |
A Parametric Model of Cognitive Complexity for Symbolic Knowledge-Based Decision Systems (abstract) 20 min
1 University of Bologna
|
| 15:20-15:40 |
PrologMCP: A Standardized Prolog Tool Interface for LLM Agents (abstract) 20 min
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
1 University of Luxembourg
|
Location:
C4.08
| 14:00-15:00 |
Human-Aware Technology for Combinatorial Optimisation (abstract) 60 min
1 KU Leuven
|
Location:
C4.05
Session Chair:
Location:
C4.07
| 14:00-15:00 |
Not Your Average Session Types (abstract) 60 min
1 Universidade de Lisboa
|
| 15:00-15:30 |
Colimit-Based Composition of High-Level Computing Devices (abstract) 30 min
1 Lancaster University
|
| 15:30-16:00 |
MaudeTypedLog: A Typed Interpreter for Prolog in Maude (abstract) 30 min
1 VRAIN, Universitat Politècnica de València
2 Faculty of Science, University of Porto
|
Location:
C5.02
| 14:00-15:00 |
Stone Duality Proofs for Distributed Computability Theorems (abstract) 60 min
1 Laboratoire d’Informatique et Systèmes
|
Location:
C5.01
| 14:15-14:40 |
Mathematical foundations for symmetric programming (abstract) 25 min
1 University of Edinburgh
2 University of Ljubljana
|
| 14:40-15:05 |
Towards Minimal Axioms for Probabilistic Programming (abstract) 25 min
1 Tallinn University of Technology
|
| 15:05-15:30 |
Categorical E-Graphs for Lambda Calculi (abstract) 25 min
1 University of Birmingham
2 Kyoto University
|
Location:
C5.06
| 14:30-15:30 |
Thin spans and their associated rigid intersection type system (abstract) 60 min
1 Loria & University of Lorraine
|
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
Session Chair:
Location:
C4.01
| 14:30-14:40 |
Opening (abstract) 10 min
1 University of Calabria, Italy
|
| 14:40-14:55 |
A Neuro-Symbolic Agent for Video Anomaly Detection (abstract) 15 min
1 University of Calabria
|
| 14:55-15:10 |
CoSP-TL: Common Sense enhanced Planning under Temporal Logics constraints with LLMs (abstract) 15 min
1 Sapienza University of Rome
|
| 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
1 Univaq
|
Session Chair:
Location:
C2.01
| 14:40-15:05 |
Modeling the Resource-Constrained Project Scheduling Problem with Answer Set Programming (abstract) 25 min
1 Cairo University
2 University of Klagenfurt
|
| 15:05-15:30 |
Solving configuration problems with unbounded cardinalities in COOM: Preliminary report (abstract) 25 min
1 University of Würzburg
2 denkbares
3 UP Transfer
4 Potassco Solutions
5 University of Potsdam
|
Session Chair:
Location:
C5.09
| 14:40-15:00 |
Lower Bounds against the Ideal Proof System in Finite Fields (abstract) 20 min
1 Imperial College London
|
| 15:00-15:20 |
Symmetric Proofs in the Ideal Proof System (abstract) 20 min
1 University of Cambridge
|
Location:
C4.05
Location:
C4.08
| 15:00-15:20 |
Predicting Assignments of MaxSAT Variables with Graph Neural Networks (abstract) 20 min
1 University of York
|
| 15:20-15:40 |
Caching and Batching for Neural Clause Selection in Saturation-Based Theorem Proving (abstract) 20 min
1 TU Wien
|
Session Chair:
Location:
C5.07
| 15:00-15:25 |
From linear types to relational higher-order logic for analyzing program sensitivity (abstract) 25 min
1 Cristal, INRIA LIlle, Université de Lille
2 CNRS, Université de Lille
|
Session Chair:
Location:
B2.02
| 15:00-15:20 |
Integrating Description Logics and Answer Set Programming for Explainable Decision-Making in Digital Health (abstract) 20 min
1 University Of Pisa, University of L'Aquila
|
| 15:20-15:40 |
Computational methods for Dynamic Answer Set Programming (abstract) 20 min
1 University of Potsdam
|
| 15:40-16:00 |
Logical Foundations of Dynamical Answer Set Programming (abstract) 20 min
1 University of Potsdam
|
Location:
C4.05
Session Chair:
Location:
C5.08
| 15:30-16:00 |
Automata-Based Verification of Size-Parameterized Quantum Circuits (abstract) 30 min
1 Academia Sinica, Taiwan
|
| 16:00-16:20 |
Synthesizing Quantum Circuits using SMT and MILP (abstract) 20 min
1 Brno University of Technology
|
| 16:20-16:40 |
Static Resource Analysis of Hybrid Programs with Unbounded Loops (abstract) 20 min
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
|
Location:
B1.04
| 15:30-16:00 |
An Infinitary and a Cyclic Sequent Calculus for Non-Monotone Inductive Definitions (abstract) 30 min
1 KU Leuven, Vrije Universiteit Brussel
|
| 16:00-16:30 |
Categorical independence in nonmonotonic reasoning (abstract) 30 min
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
1 University of Luxembourg
|
Location:
C5.02
| 15:30-16:00 |
Arboreal Adjunctions from Shapes (abstract) 30 min
1 Universidad de Buenos Aires & CONICET
|
| 16:00-16:30 |
Comonadic Approach to Hypertree Parameters and Loosely-Guarded Logics (abstract) 30 min
1 University of Cambridge
|
| 16:30-17:00 |
NP-completeness, and coherence for associativity (abstract) 30 min
1 University of York
|
Location:
C1.01
| 15:45-16:15 |
update on the rewriting.inria.fr Website Project (abstract) 30 min
1 Inria
|
| 16:15-17:15 |
Business Meeting (members-only) (abstract) 60 min
1 Radboud University Nijmegen
2 Birkbeck, University of London
|
Session Chair:
Location:
C4.06
| 15:50-16:30 |
The CNF Encoding Complexity of Boolean Functions and Non-Uniform Computation (abstract) 40 min
1 Carnegie Mellon University
|
| 16:30-17:10 |
Approximating the Values of Boolean Formulae in TC0 (abstract) 40 min
1 Universität Tübingen
|
Location:
C5.06
| 16:00-16:35 |
Tensorial logic with global stores (abstract) 35 min
1 CNRS
|
| 16:35-17:10 |
Infinitary Proof systems and Concurrent game semantics (abstract) 35 min
1 Aix Marseille Université
|
| 17:10-17:40 |
Sequential algorithms as a Dialectica interpretation (abstract) 30 min
1 INRIA - Nantes Université
|
Location:
B2.02
Session Chair:
Location:
C2.05
| 16:00-16:30 |
Computation of Conditional Syntax Splittings for Inductive Inference from Belief Bases (abstract) 30 min
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
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
1 Cardiff University
2 Université Sorbonne Paris Nord
|
Session Chair:
Location:
C1.04
| 16:00-16:30 |
Strategy Logic: Where are we? (abstract) 30 min
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
1 University of Toronto
|
Location:
B2.01
Location:
C6.08
Session Chair:
Location:
C5.07
| 16:00-16:25 |
A Linear Logic for Fixpoints and Deadlock Freedom in the Pi-Calculus (abstract) 25 min
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
1 University College London
|
| 16:50-17:15 |
Adapted Pairs and Logical Relations in Linear Logic (abstract) 25 min
1 Università Roma Tre
|
Session Chair:
Location:
C2.01
| 16:00-16:25 |
Between Two Worlds: Logica Intertwines ASP and SQL (abstract) 25 min
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
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
1 Potassco Solutions GmbH, Germany
2 University of Coruña, Spain
|
| 17:15-17:19 |
Closing (abstract) 4 min
1 University of Klagenfurt
|
Location:
C4.08
| 16:10-16:30 |
A priori knowledge for learning combinations of heuristics for CSPs (abstract) 20 min
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
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
1 LaBRI
2 Bordeaux INP
3 Univ Bordeaux
4 CNRS
|
Location:
C5.01
| 16:10-16:35 |
Symmetric List Objects (abstract) 25 min
1 University of Strathclyde
|
| 16:35-17:00 |
Concurrent monads as monads in a 2-category (abstract) 25 min
1 University of Iceland
2 Tallinn University of Technology
3 Reykjavik University and Tallinn University of Technology
|
Session Chair:
Location:
B2.02
| 16:30-16:50 |
Hybrid Answer Set Programming: Foundations and Applications (abstract) 20 min
1 University of Potsdam
|
| 16:50-17:10 |
Modeling Railway Systems in Answer Set Programming (abstract) 20 min
1 University of Potsdam
|
| 17:10-17:15 |
Closing (abstract) 5 min
1 University of Klagenfurt
|
Session Chair:
Location:
C5.09
| 16:30-16:50 |
Cardinality Constraints are Hard for Resolution (abstract) 20 min
1 Universitat Politecnica de Catalunya
2 IIIA-CSIC
|
| 16:50-17:10 |
Cutting Planes with Cover Cuts (abstract) 20 min
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
1 University of Auckland
2 Sapienza Università di Roma
3 Lund University & University of Copenhagen
|
Location:
C4.05
Session Chair:
Location:
C4.07
| 16:30-17:00 |
Collusion Relations and their Applications to Balance Theory (abstract) 30 min
1 Université Jean Moulin Lyon 3
2 Université Sorbonne Paris Nord
|
| 17:00-17:30 |
From Dag-Like Proofs to Boolean Circuits in Lean (abstract) 30 min
1 Pontifícia Universidade Católica do Rio de Janeiro
2 Pontifícia Universidade Católica do Rio de Janeiro (PUC-Rio)
|
Session Chair:
Location:
B2.01
| 16:30-16:50 |
First Steps Towards Human-AI Ranking Aggregation (abstract) 20 min
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
1 Sapienza University of Rome
|
| 17:10-17:30 |
Deep Weighted Finite Automata (abstract) 20 min
1 University of Milano-Bicocca
|
Session Chair:
Location:
C4.01
| 16:30-16:45 |
ASPembly: Neuro-Symbolic Knowledge Extraction of Assembly Instructions into ASP (abstract) 15 min
1 University of Calabria
|
| 16:45-17:00 |
Collaborating with Ad Hoc Agents through Reasoning and Learning (abstract) 15 min
1 University of Edinburgh
|
| 17:00-17:30 |
Overview on LLMs for Reasoning and Reasoning for LLMs (abstract) 30 min
1 Cardiff University
|
| 17:30-17:35 |
Closing (abstract) 5 min
1 University of Calabria, Italy
|
17:00-17:30
Explainability and the related issues in the digital-AI environments, Mitsuhiro Okada
TGD
Location:
C6.08
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
Sunday, 19 July 2026
Session Chair:
Location:
C2.01
| 08:30-09:00 |
Complete, Transparent & Interactive Systems for Highschool Mathematics (abstract) 30 min
1 JKU University Linz
|
| 09:00-09:30 |
MiniHOL: A minimal object logic for teaching Isabelle/HOL’s foundations (abstract) 30 min
1 Karlsruhe Institute of Technology
|
| 09:30-10:00 |
CoreCalc: A Core Sequent Calculus Tool (abstract) 30 min
1 Technical University of Denmark
|
Location:
C4.08
| 08:45-09:00 |
Opening (abstract) 15 min
1 KU Leuven
2 Karlsruhe Institute of Technology
|
Session Chair:
Location:
C4.08
| 09:00-09:20 |
Proof-Guided SAT Encoding Selection for Bit-Vector Multiplication (abstract) 20 min
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
1 Carnegie Mellon University
|
| 09:40-10:00 |
Trimming Pseudo-Boolean Proofs (abstract) 20 min
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
1 TIUWien
|
| 10:20-10:30 |
Scaling Zero Knowledge UNSAT Verification via Normalized Chaining (abstract) 10 min
1 University of Toronto
2 Independent
3 Georgia Institute of Technology, University of Toronto
|
Session Chair:
Location:
C1.04
| 09:00-09:30 |
Learning Formal Models of Parametrized Systems (abstract) 30 min
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
1 University of Verona, University College London
2 University of Milan
|
Session Chair:
Location:
C3.02
| 09:00-09:10 |
Welcome and Introduction (abstract) 10 min
1 Universitat de Girona
|
Location:
C5.06
| 09:00-10:00 |
Concurrency in linear and non-linear game semantics (abstract) 60 min
1 Inria & École Normale Supérieure
|
Session Chair:
Location:
C4.01
| 09:00-09:10 |
Introduction (abstract) 10 min
1 University College London
|
| 09:10-09:30 |
Operationalising Relative Causal Knowledge: Backbone Identifiability from Private Reports (abstract) 20 min
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
1 University of Oxford
2 Bar-Ilan University
|
| 09:50-10:10 |
Lessons from the Past for the Future of Robotics (abstract) 20 min
1 University of Edinburgh
|
Session Chair:
Location:
C4.06
| 09:00-10:00 |
On the Complexity of Confluence and Church-Rosser Proofs, with Applications to Bounded Arithmetic (abstract) 60 min
1 Swansea
|
| 10:00-10:40 |
Towards Higher-Order Logarithmic Space (abstract) 40 min
1 Università di Milano
2 Université Paris Cité
|
Session Chair:
Location:
C5.07
| 09:00-10:00 |
Concurrency in linear and non-linear game semantics (abstract) 60 min
1 INRIA Paris
|
Location:
C1.01
| 09:00-09:10 |
Opening Remarks (abstract) 10 min
1 University of Glasgow
|
| 09:10-09:30 |
Efficient and Reliable Hitting-Set Computations for the Implicit Hitting Set Approach (abstract) 20 min
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
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
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
1 JKU Linz
2 TU Wien, JKU Linz
|
Session Chair:
Location:
C4.07
| 09:00-10:00 |
A General Approach for SMT Proof Skeletons (abstract) 60 min
1 Universidade Federal de Minas Gerais
|
| 10:00-10:30 |
Efficient Decision Procedures for RNMatrix Semantics (abstract) 30 min
1 UNICAMP
2 Université Sorbonne Paris Nord
3 University College London
|
09:00-10:30
Arguing in dynamic and uncertain situations: From theoretical insights to application (tutorial)
ADU
Session Chair:
Location:
C2.05
| 09:00-10:30 |
Part 1 (abstract) 90 min
1 IRIT, Université Toulouse Capitole
|
Location:
C6.02
| 09:00-10:00 |
Syntactic trinitarianism: terms, graphs, diagrams (joint keynote with DIALOCO, Room C4.02) (abstract) 60 min
1 Huawei Central Software Institute & University of Birmingham
|
Location:
C5.05
| 09:00-10:00 |
Staging for Synthesis and Analysis (abstract) 60 min
1 Harvard University
|
Session Chair:
Location:
C5.02
| 09:00-09:40 |
Invited Talk - Dependency Schemes from Antiquity to Modernity (abstract) 40 min
1 TU Wien
|
| 09:40-10:00 |
Certification of True QBF Formulas in Expansion-Based Solving (abstract) 20 min
1 Johannes Kepler University - Linz
|
| 10:00-10:20 |
Solving Connect Four with QBF: The Progress So Far (abstract) 20 min
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
1 Sapienza University of Rome
|
Location:
C4.02
| 09:00-10:00 |
Syntactic trinitarianism: terms, graphs, diagrams (abstract) 60 min
1 University of Birmingham, Huawei Central Software Institute
|
Session Chair:
Location:
C3.01
| 09:05-09:10 |
Workshop Opening & Welcome (abstract) 5 min
1 The University of Texas at Dallas, USA
2 University of L'Aquila, Italy
|
| 09:10-10:05 |
Teaching Logical Thinking through Logic Programming using Logical English, Argumentation Games and Animations (abstract) 55 min
1 Imperial College, UK
2 Logical Contracts, UK
|
Location:
C3.02
| 09:10-09:30 |
Defining Propagators in MiniZinc (abstract) 20 min
1 Monash University
|
| 09:30-09:50 |
Propagation Algorithms for the Minimum-Distance Constraint over Selected Points (abstract) 20 min
1 Independent researcher, Sambanova
|
| 09:50-10:10 |
Machine Learning-Based Generalization Queries for Constraint Acquisition (abstract) 20 min
1 University of Western Macedonia
2 KU Leuven
|
| 10:10-10:30 |
Paramita: An Extensible Framework for SATisfiability Solving (abstract) 20 min
1 Universitat de Lleida
2 Universitat Politècnica Catalunya
|
Session Chair:
Location:
B1.03
| 09:15-10:10 |
Explaining Description Logic Reasoning (abstract) 55 min
1 TU Dresden
|
Session Chair:
Location:
C5.09
| 09:20-09:40 |
Toward a Characterization of Simulation Between Arithmetic Theories (abstract) 20 min
1 International Monetary Fund (retired)
|
| 09:40-10:00 |
Towards a positive version of Cook’s PV (abstract) 20 min
1 University of Birmingham
|
Session Chair:
Location:
C5.01
| 09:40-10:10 |
Finding Mathematical Problems in the Jungle of Automated Driving (abstract) 30 min
1 National Institute for Informatics
|
Location:
C5.08
| 09:50-10:10 |
Towards Human Readable Explanations (abstract) 20 min
1 UCLouvain
|
| 10:10-10:30 |
Large Language Models for Explaining Unsatisfiable Constraint Satisfaction Problems (abstract) 20 min
1 KU Leuven
|
Session Chair:
Location:
C3.01
| 10:00-10:20 |
Connecting artistic and logical reasoning: The Bento Box as a Conceptual Tool in the Education of Logic Programming for Art and Design Students. (abstract) 20 min
1 University of Applied Sciences Duesseldorf
|
| 10:20-10:40 |
Symbolic Artificial Intelligence for Preserving Linguistic and Cultural Diversity (abstract) 20 min
1 Paisii Hilendarski University of Plovdiv, Plovdiv, Bulgaria
2 Paisii Hilendarski’ University of Plovdiv, Plovdiv, Bulgaria
3 Institute of Information and Communication Technologies, Bulgarian Academy of Sciences
|
Location:
B2.01
| 10:00-10:15 |
Temporal Self-Reference Paradox in Finite-Horizon Agents: Semantic and Proof-Theoretic Treatment (abstract) 15 min
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
1 University of Edinburgh & Heriot-Watt University
2 Heriot-Watt University
|
| 10:30-10:45 |
Multi-Property Synthesis (abstract) 15 min
1 University of Oxford
2 Rice University
|
| 10:45-11:00 |
Symbolic Synthesis for LTLf+ Obligations (abstract) 15 min
1 University of Oxford, UK
2 University of Liverpool, UK
3 University of Gothenburg and Chalmers University of Technology, Sweden
|
Location:
C4.02
| 10:00-10:30 |
Monoidal substitution diagrams (abstract) 30 min
1 Tallinn University of Technology
2 University of Calgary
|
Session Chair:
Location:
C5.07
| 10:30-10:55 |
Internal Models of Linear Type Theories (abstract) 25 min
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
1 University of Pennsylvania
2 Macquarie University
|
Location:
C5.05
| 10:30-11:00 |
An Interactive Proof Mode for Dafny Based on Back Translation of Verification Obligations (abstract) 30 min
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
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
1 Nagoya University
|
Session Chair:
Location:
C6.02
| 10:30-11:30 |
Graph Neural Networks, Their Logics, and Formal Verification (invited talk) (abstract) 60 min
1 Gran Sasso Science Institute
|
| 11:30-12:00 |
A Programming Language for Interaction Nets (abstract) 30 min
1 University of Sussex
|
| 12:00-12:30 |
Labels, paths, and linearization of the lambda-calculus (abstract) 30 min
1 Faculdade de Ciências da Universidade do Porto
|
Session Chair:
Location:
C1.04
| 10:30-11:00 |
Progress-Aware Runtime Monitoring of Abstract Scenario Specifications (abstract) 30 min
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
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
1 National Institute of Informatics
|
Session Chair:
Location:
B1.03
| 10:40-11:00 |
In the Heart of the Beholder: User-Tailored Explanations for Description Logics (abstract) 20 min
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
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
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
1 Dipartimento di Informatica, Università di Bari
|
| 12:00-12:20 |
Introducing Prism Embeddings: A New Family of Geometric Ontology Embeddings (abstract) 20 min
1 Free university of Bozen-Bolzano -Sony AI, Barcellona
2 Institute for Symbolic AI, Johannes Kepler University, Linz
3 Free university of Bozen-Bolzano
|
Session Chair:
Location:
C4.01
| 10:40-11:00 |
Proof-theoretic approach to representable qualitative probabilities (abstract) 20 min
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
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
1 TU Wien
|
| 11:40-12:00 |
Causality, Harm, and Elections (abstract) 20 min
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
1 University of Konstanz
2 University of Kosntanz
|
Location:
C5.06
| 10:40-11:15 |
Seeking the primitive categorical structure of concurrent game semantics (abstract) 35 min
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
1 The University of Tokyo, Graduate School of Mathematical Sciences
|
| 11:50-12:20 |
Finitely partitioned forests (work in progress) (abstract) 30 min
1 University of Birmingham, UK
|
Session Chair:
Location:
C5.02
| 10:50-11:10 |
Strengthening the Implication-Free DQBF Dependency Scheme (abstract) 20 min
1 Altair Engineering GmbH
2 University of Freiburg
|
| 11:10-11:30 |
Symmetry Breaking in Dependency Quantified Boolean Formulas (abstract) 20 min
1 JKU Linz
|
| 11:30-11:50 |
On the Practicality of DQBF Solving for Succinctly Represented Graph Problems (abstract) 20 min
1 National Taiwan University
2 University of Liverpool
|
| 11:50-12:10 |
QBF Gallery (abstract) 20 min
1 JKU
2 University of Sassari
|
11:00-12:30
Arguing in dynamic and uncertain situations: From theoretical insights to application (tutorial)
ADU
Session Chair:
Location:
C2.05
| 11:00-12:30 |
Part 2 (abstract) 90 min
1 IRIT, Université Toulouse Capitole
|
Session Chair:
Location:
C4.07
| 11:00-11:30 |
A Machine-checked Proof of Consistency for Impredicative Pure Type Systems (abstract) 30 min
1 Universidad ORT Uruguay
|
| 11:30-12:00 |
Templates in Rewriting Induction (abstract) 30 min
1 Radboud University
|
| 12:00-12:30 |
Computer Science as Infrastructure: the Spine of the Lean Computer Science Library (CSLib) (abstract) 30 min
1 Drexel University
2 University of Southern Denmark
|
Session Chair:
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
1 Universidad Nebrija
|
| 11:30-12:00 |
Teaching Isabelle to Secondary-School Students: A Case Study (abstract) 30 min
1 None
2 Gymnasium Mariano-Josephinum
|
Location:
C5.08
| 11:00-11:20 |
Learn2Zinc: Fine-tuning Small Language Models for Text-to-Model Translation in MiniZinc (abstract) 20 min
1 Fidelity Investments
|
| 11:20-11:40 |
CP-SynC: Multi-Agent Zero-Shot Constraint Modeling in MiniZinc with Synthesized Checkers (abstract) 20 min
1 University of Toronto
|
| 11:40-12:00 |
Using LLMs to Generate CoPTIC Constraint Models (abstract) 20 min
1 University of Reading
|
| 12:00-12:20 |
Solving MaxSAT Problems from Natural Language Descriptions with LLMs and PySAT (abstract) 20 min
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
1 Ensimag
2 Université Côte d'Azur
|
Session Chair:
Location:
C4.08
| 11:00-11:20 |
Revising the Implicit Hitting Set Solver MaxHS (abstract) 20 min
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
1 Faculty of Data and Decision Sciences, Technion
|
| 11:40-11:50 |
Smallest MUS Extraction via Branch-and-Cut (abstract) 10 min
1 Delft University of Technology
|
Location:
C3.02
| 11:00-11:20 |
An Interactive Application to Solve Sudoku Variant Puzzles (abstract) 20 min
1 Insight Centre, University College Cork
|
| 11:20-11:40 |
Scaling Sudoku as a Constraint Problem (abstract) 20 min
1 Independent researcher, Sambanova
|
Session Chair:
Location:
B1.04
| 11:00-11:30 |
Knowledge Engineering and Reasoning with Answer Set Programs and Conditional Belief Bases (abstract) 30 min
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
1 University of Calabria
|
| 12:00-12:30 |
A Definitional Fragment of Temporal Equilibrium Logic: from Temporal Programs to Compact Automata (abstract) 30 min
1 TU Wien, Austria
|
Session Chair:
Location:
C5.01
| 11:00-11:30 |
How to Present Your Work Without Losing the Audience (abstract) 30 min
1 Masaryk University
|
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
1 INRIA, LIX, Ecole Polytechnique
2 LIX, Ecole Polytechnique
|
| 11:30-12:00 |
Towards a Combinatorial Representation of First-Order Bicategories (abstract) 30 min
1 University College London
2 Hellas AI
|
Session Chair:
Location:
C4.06
| 11:10-11:50 |
Characterizing levels of computational complexity by restrictions on hypothetical reasoning (abstract) 40 min
1 Universität Tübingen
2 NOVA University of Lisbon
|
| 11:50-12:30 |
Notes on Sequential Theories (abstract) 40 min
1 None
|
Session Chair:
Location:
C3.01
| 11:10-11:30 |
Logical Minecraft: Teaching Logical Thinking through Games (abstract) 20 min
1 KU Leuven
|
| 11:30-11:50 |
IMPLY - a Logic Learning Game for Pre-literate Children (abstract) 20 min
1 Martin-Luther-University Halle-Wittenberg
|
| 11:50-12:10 |
Cracking Messages: Logic Programming to Secret Communication (abstract) 20 min
1 University of Plovdiv “Paisii Hilendarski”
2 Universidad Nacional del Comahue
|
| 12:10-12:30 |
Web Platform for Symbolic AI and Knowledge (abstract) 20 min
1 Plovdiv University "Paisiy Hilendarski"
2 Simon Fraser University
3 Burgas State University "Prof. Dr. Assen Zlatarov", Burgas, Bulgaria
|
Session Chair:
Location:
C5.07
| 11:25-11:50 |
An Algebraic View on the Linear Lambda Calculus (abstract) 25 min
1 Université Paris Cité, CNRS, IRIF
|
| 11:50-12:15 |
The lambda calculus as a 2-dimensional operad (abstract) 25 min
1 Aix-Marseille Université
|
| 12:15-12:40 |
Multicategories and representability for substructural intuitionistic modal logics (abstract) 25 min
1 Tallinn University of Technology
2 Reykjavik University and Tallinn University of Technology
|
Location:
B2.01
| 11:30-11:45 |
A Probabilistic Package for L-DINF: Reasoning, Resources and Action Selection in Cooperative Agents (abstract) 15 min
1 Università di L'Aquila
|
| 11:45-12:00 |
Strategy Repair for Probabilistic Games (abstract) 15 min
1 Sapienza University of Rome
2 LaBRI, University of Bordeaux
|
| 12:00-12:15 |
Indistinguishable Agents in Decentralised POMDPs (abstract) 15 min
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
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
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
|
Session Chair:
Location:
C5.01
| 11:30-12:00 |
Rethinking Soundness: From Local Rules to Global Correctness (abstract) 30 min
1 TU Wien
|
Location:
C3.02
| 11:40-12:20 |
Reformulation in MaxSAT: Resolution Rules and Gadgets (abstract) 40 min
1 Lleida
|
Session Chair:
Location:
C5.09
| 11:40-12:00 |
Proof Systems Based on Structured Circuits (abstract) 20 min
1 Technical University of Ilmenau
|
Session Chair:
Location:
C4.08
| 11:50-12:10 |
Extending CDCL-based Model Enumeration with Weights (abstract) 20 min
1 Rice University
|
| 12:10-12:20 |
Formalization of Component-Based Projected Model Counting (abstract) 10 min
1 University of Yamanashi
2 Kagawa University
3 Nagoya University
|
Session Chair:
Location:
C5.01
| 12:00-12:30 |
How to Manage Your Supervisor (abstract) 30 min
1 University of Cape Town
|
Session Chair:
Location:
C4.01
| 13:50-14:05 |
Invited Talk (abstract) 15 min
1 King’s College London
|
| 14:05-14:20 |
Invited Talk (abstract) 15 min
1 Rice University
|
| 14:20-14:35 |
Invited Talk (abstract) 15 min
1 University of New South Wales
|
| 14:35-14:50 |
Invited Talk (abstract) 15 min
1 Tel Aviv University
|
| 14:50-15:00 |
Invited Talk (abstract) 10 min
1 RWTH Aachen University
|
| 15:00-15:05 |
Invited Talk (abstract) 5 min
1 RWTH Aachen University
|
Location:
C3.02
| 13:50-14:10 |
Computing Gadgets (abstract) 20 min
1 Universitat de Lleida
2 IIT Bombay
|
| 14:10-14:30 |
Towards Automated Generation of Benchmark Instances with Diverse Solver Performance (abstract) 20 min
1 University of St Andrews
|
Location:
B1.04
| 14:00-14:30 |
Ranking-based Semantics for Incomplete Argumentation Frameworks (abstract) 30 min
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
1 University of Hagen
|
| 15:00-15:30 |
On Algorithmic Shortcuts for Skeptical Preferred Reasoning in Abstract Argumentation (abstract) 30 min
1 Artificial Intelligence Group, University of Hagen
|
Session Chair:
Location:
C5.01
| 14:00-14:30 |
On the Relativity of Expertise (abstract) 30 min
1 Oxford University
|
Session Chair:
Location:
C4.08
| 14:00-14:20 |
SAT-IT: an Online Interactive SAT Tracer (abstract) 20 min
1 Universitat de Girona
|
| 14:20-14:40 |
Exploring 3-CNF Formulas Generated From Partial Steiner Triple Systems (abstract) 20 min
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
1 Universitat de Girona
|
| 15:00-15:10 |
Orthologic for SAT Solving (abstract) 10 min
1 EPFL
2 ENS Paris-Saclay
|
Session Chair:
Location:
C1.04
| 14:00-15:00 |
Preservation Theorems: From Tarski to Graph Neural Networks (abstract) 60 min
1 University of Oxford
|
Session Chair:
Location:
C5.09
| 14:00-14:40 |
The Complexity of Quantified CDCL (abstract) 40 min
1 Friedrich Schiller University Jena
|
Session Chair:
Location:
C4.06
| 14:00-14:40 |
On the Expressive Power of Ontology-Mediated Queries: Capturing coNP (abstract) 40 min
1 TU Wien
|
| 14:40-15:20 |
Counting Complexity of ASP (abstract) 40 min
1 European Space Agency
2 Linköping University
3 CNRS, CRIL
|
Session Chair:
Location:
C5.07
| 14:00-15:00 |
Game Semantics of Extensional Taylor Expansion (abstract) 60 min
1 ENS Lyon
|
Session Chair:
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
1 Utrecht University
2 Eindhoven University Of Technology
|
| 14:30-15:00 |
Waterproof River: An AI Tutor for Waterproof (abstract) 30 min
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
1 IRIF
|
Location:
B2.01
| 14:00-15:00 |
Strategic Reasoning Under Limited Resource Production (abstract) 60 min
1 CNRS, ENS Paris-Saclay
|
Session Chair:
Location:
C5.02
| 14:00-14:40 |
Invited Talk - The Complexity of Quantified CDCL (abstract) 40 min
1 University of Jena
|
| 14:40-15:00 |
Quantified CDCL and Dependency Schemes: A proof-theoretic study (abstract) 20 min
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
1 LMU
2 University of Auckland
|
| 15:20-15:40 |
A QBF-like Fragment of EPR (abstract) 20 min
1 Czech Institute of Informatics Robotics and Cybernetics
|
Session Chair:
Location:
C4.07
| 14:00-15:00 |
NuITP: An Inductive Theorem Prover for Maude (abstract) 60 min
1 Universidad Politécnica de Valencia
|
| 15:00-15:30 |
Multiparty Session Types for GDPR Purpose Compliance (abstract) 30 min
1 University of Cyprus
|
| 15:30-16:00 |
Basic Model Theory for Path Predicate Modal Logic (abstract) 30 min
1 CONICET and Universidad Nacional de Córdoba, Argentina
2 CONICET and Universidad de Buenos Aires, Argentina
3 IMDEA Software Institute, Spain
|
Session Chair:
Location:
C6.02
| 14:00-15:00 |
Term graph rewriting for implementing the λ-calculus refactored (invited talk) (abstract) 60 min
1 University of Sussex, UK
|
| 15:00-15:30 |
Hypergraphs with Binding (abstract) 30 min
1 Johns Hopkins University
2 Ochanomizu University
|
Session Chair:
Location:
C3.01
| 14:00-14:20 |
Solving P-99 at the age of LLM – Examples and pedagogical considerations (abstract) 20 min
1 Universite de La Reunion
2 Universite de Namur
|
| 14:20-14:40 |
Embodied Declarative Logic: Learning Logica via Orchestrating Robot Behavior (abstract) 20 min
1 Google
2 University of Illinois Urbana-Champaign
3 Gonzaga University
|
| 14:40-15:00 |
Logical English 2: A Reimplementation (abstract) 20 min
1 LogicalContracts.com
2 Universidad de Los Andes, CESIMO, Mérida, Venezuela
|
| 15:00-15:20 |
Are we intelligent enough to judge intelligence? Proposal for a New PEG Task Force to Develop AI Tests (abstract) 20 min
1 Plovdiv University "Paisiy Hilendarski"
2 University of Applied Sciences Duesseldorf
3 Universidad de Los Andes, CESIMO, Mérida, Venezuela
4 Simon Fraser University
5 Universidad Nacional del Comahue
|
Session Chair:
Location:
B1.03
| 14:00-14:20 |
Temporal EL and Equations over Sets of Integers (abstract) 20 min
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
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
1 TU Dresden
|
Location:
C4.02
| 14:00-15:00 |
Proof Nets and Combinatorial Proofs — Hilbert's 24th Problem in the 21st Century (abstract) 60 min
1 Inria & LIX
|
Location:
C2.02
| 14:00-14:10 |
Welcome; PIP overview and progress report (abstract) 10 min
1 UPM and IMDEA Software Institute
2 Coheret Knowledge
|
Location:
C2.02
| 14:10-14:30 |
PIPs 0110 Formatted output / 0109 Syntax for labeled subterms. (abstract) 20 min
1 Coninfer
|
| 14:30-14:50 |
PIP-0112: Unicode (abstract) 20 min
1 SWI
2 UPM and IMDEA Software Institute
|
| 14:50-15:10 |
DDB (abstract) 20 min
1 Stony Brook U.
|
Location:
C5.05
| 14:30-15:30 |
Fully Abstract Normal Form Bisimulation for Call-by-Value PCF (abstract) 60 min
1 Queen Mary University of London
|
Location:
C1.01
| 14:30-14:50 |
Proof Logging for Nonlinear Boundary-Value Solvers: A Falkner-Skan Case Study (abstract) 20 min
1 Indiana University Bloomington
|
| 14:50-15:10 |
Certifying Algorithms for Nonlinear Real Arithmetic (abstract) 20 min
1 Universidade Federal de Minas Gerais
|
| 15:10-15:30 |
Pseudo-Boolean Blasting for the SMT Theory of Bit-Vectors (abstract) 20 min
1 Universidade Federal de Minas Gerais
2 Universidade Federal de MInas Ferais
|
Location:
C5.06
| 14:30-15:30 |
Fully Abstract Normal Form Bisimulation for Call-by-Value PCF (abstract) 60 min
1 Queen Mary University of London
|
Session Chair:
Location:
C5.01
| 14:30-15:30 |
PhD Students Panel (abstract) 60 min
1 University of Warwick
2 Tallinn University of Technology
3 NII Tokyo
|
Session Chair:
Location:
C3.02
| 14:30-15:20 |
25th Anniversary Event: Retrospective and Quiz (abstract) 50 min
1 Universitat de Girona
2 University of York
|
Session Chair:
Location:
C5.09
| 14:40-15:00 |
Quantified CDCL and Dependency Schemes: A proof-theoretic study (abstract) 20 min
1 IMSc Chennai
|
| 15:00-15:20 |
A Boolean static proof system for Quantified Boolean Formulas (abstract) 20 min
1 Ludwig-Maximilians-Universität München
2 University of Auckland
|
| 15:20-15:40 |
A QBF-like Fragment of EPR (abstract) 20 min
1 TU Wien
2 CIIRC, Prague
3 Charles University, Prague
|
Location:
C5.08
| 14:50-15:10 |
Escaping Local Optima in Prompt Optimisation via Failure-Driven Refinement and History-Guided Restarting (abstract) 20 min
1 ITMO University
|
| 15:10-15:30 |
Controlling Agent Behavior with Policy-as-Code via Autoformalization (abstract) 20 min
1 Sondera
|
Session Chair:
Location:
C5.07
| 15:00-15:25 |
Generating Functions for Probabilistic Programs via the Weighted Relational Model of Linear Logic (abstract) 25 min
1 University of Bologna and INRIA Sophia Antipolis
2 Université Claude Bernard Lyon 1
|
Location:
C4.02
| 15:00-15:30 |
Function-Constructor Nets and their Semantics (abstract) 30 min
1 University of Sussex
|
Session Chair:
Location:
B1.03
| 15:10-15:30 |
Coherence Update Semantics for Horn DL-Lite through Stratified Datalog¬ Rewriting (abstract) 20 min
1 TU Dresden
|
| 15:30-15:50 |
A Horn Extension of DL-Lite with NL data complexity (abstract) 20 min
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
1 CNRS & University of Bordeaux
|
Location:
B2.01
| 15:15-15:30 |
Rational Capability in Concurrent Games (abstract) 15 min
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
1 Université Libre de Bruxelles
2 Rice University
|
| 15:45-16:00 |
Towards Alternating-time Temporal Logic with Uncertainty and Fuzziness (abstract) 15 min
1 Academia Sinica
|
| 16:00-16:15 |
Strategies in Sabotage Games: Temporal and Epistemic Perspectives (abstract) 15 min
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
1 Stockholm University
2 Tsinghua University
|
Session Chair:
Location:
C1.04
| 15:30-16:00 |
AIRD: Auditable Composite Distillation on a Sparse Tactical Frontier (abstract) 30 min
1 IRIT - Université Toulouse Capitole, France
|
| 16:00-16:30 |
Explaining Visual Models with Logic and Concept-Part Networks (abstract) 30 min
1 Ecole Polytechnique
|
Session Chair:
Location:
C3.01
| 15:50-16:10 |
Using Logica to Teach About Parallel Complexity (abstract) 20 min
1 Google
2 SUNY at Stony Brook
3 University of Illinois Urbana-Champaign
4 Gonzaga University
|
| 16:10-16:30 |
Using Prolog for a Compilers Course (abstract) 20 min
1 University of Evora
2 NOVA LINCS
|
| 16:30-16:50 |
Prolog–Blockly Playgrounds for Logical Reasoning through Natural Deduction (abstract) 20 min
1 Universidad Rey Juan Carlos
2 Università Politecnica delle Marche
|
| 16:50-17:10 |
ProverSLD: An Interactive Visualizer for Teaching SLD Resolution in Prolog and First-Order Logic (abstract) 20 min
1 Technical University of Košice
|
Session Chair:
Location:
C4.08
| 15:50-16:10 |
Improving Local Search and adding DDFW to Kissat and CaDiCaL (abstract) 20 min
1 University of Freiburg
|
| 16:10-16:30 |
NobleCount: Revisiting a Forgotten Data Structure for Local Search in SAT (abstract) 20 min
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
1 Georgia Institute of Technology
|
| 16:40-16:50 |
MIGSat: A Majority Inverter Graph SAT Solver (abstract) 10 min
1 Georgia Institute of Technology
|
Location:
C3.02
| 15:50-16:00 |
Novel Pair- and Topic-Swapping (abstract) 10 min
1 Uppsala University
|
| 16:00-16:20 |
No More Awkward Silences with Table Talk Tuning (abstract) 20 min
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
1 Universitat de Girona
2 Universitat de Vic - Universitat Central de Catalunya
|
| 16:40-17:00 |
Solution checking with CPMpy (abstract) 20 min
1 KU Leuven
|
Session Chair:
Location:
C4.06
| 15:50-16:50 |
Proof complexity of QBF: relations to circuits and computationally hard problems (abstract) 60 min
1 Jena
|
| 16:50-17:00 |
Closing (abstract) 10 min
1 Lisbon
2 Hannover
|
Location:
C2.02
| 15:50-16:10 |
The Joys and (Mostly!) Frustrations of Relational Programming in Prolog: A miniKanren Perspective. (abstract) 20 min
1 U. of Alabama at Birmingham
|
| 16:10-16:30 |
The mmin/mmax Table Modes in Picat (abstract) 20 min
1 Boorklyn College, CUNY
|
Location:
C5.08
| 16:00-16:20 |
Improving Constraint Models with LLM Agents (abstract) 20 min
1 TU Wien
|
| 16:20-16:40 |
LLM-Guided Constraint Model Reformulation for Solving Efficiency (abstract) 20 min
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
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
1 Carnegie Mellon University
|
Location:
C5.06
| 16:00-16:35 |
Takahashi's Gambit: Avoiding Context Lemmas in Operational Game Semantics (abstract) 35 min
1 University of Bologna
|
| 16:35-17:10 |
Unbounded data nesting for loops in higher-order programs (abstract) 35 min
1 University of Birmingham
2 University of Oxford
|
| 17:10-17:40 |
Energy Games for Generalized Equivalence Checking (abstract) 30 min
1 Télécom SudParis, Institut Polytechnique de Paris
|
Location:
B1.04
| 16:00-16:30 |
Towards Defeasible Reasoning about Actions and their Effects (abstract) 30 min
1 University of Cape Town and CAIR
2 TU Wien
|
| 16:30-17:00 |
On Action Reversibility in Lifted Planning (abstract) 30 min
1 University of Klagenfurt
2 Czech Technical University in Prague
|
Session Chair:
Location:
C6.02
| 16:00-16:30 |
Relating ordered hypergraph rewriting and proof theory: Work in progress (abstract) 30 min
1 Inria Saclay
|
| 16:30-17:00 |
Reducible Graphs and Bisimilarity of 1-free Star Expressions (abstract) 30 min
1 Leiden University
|
| 17:00-17:30 |
Towards a Characterisation of the Graph Structure of Process Interpretations of Regular Expressions (abstract) 30 min
1 Gran Sasso Science Institute
|
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
1 Nagoya University
|
| 16:30-17:00 |
Tactic-driven code fusion (abstract) 30 min
1 EPFL
|
| 17:00-17:30 |
Business meeting (abstract) 30 min
1 Nagoya University
|
Location:
C1.01
| 16:00-16:20 |
Proof Logging for (Re)Encoding (abstract) 20 min
1 Carnegie Mellon University
|
| 16:20-16:40 |
End-to-End Verification for Constraint Programming: Closing the Encodings Gap (abstract) 20 min
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
1 Delft University of Technology
|
| 17:00-17:20 |
Generalised Clause Learning for Constraint Programming (abstract) 20 min
1 Uppsala universitet
|
| 17:20-17:40 |
How can hard can multiplication be? (abstract) 20 min
1 University of Glasgow
|
| 17:40-18:00 |
Discussion and Closing (abstract) 20 min
1 University of Glasgow
|
Session Chair:
Location:
C5.07
| 16:00-16:25 |
Semi-quantitative semantics (abstract) 25 min
1 Tallinn University of Technology
2 CNRS
3 Aix-Marseille Univ.
|
| 16:25-16:50 |
The Reasonable Effectiveness of Linear Logic in Quantitative Methods (abstract) 25 min
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
1 Université de Lorraine, Inria
2 Universidad de Buenos Aires, DC
3 Universidad de la República, FIng, Uruguay
4 ICC, Argentina & Universidad de la República, FIng, Uruguay
5 LORIA, France & Universidad de la República, FIng, Uruguay
|
Location:
C4.02
| 16:00-16:30 |
Remarks on proof nets as combinatorial maps (abstract) 30 min
1 CNRS
2 Aix-Marseille Univ.
|
| 16:30-17:00 |
On the role of connectivity in Linear Logic proofs (abstract) 30 min
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
1 Univ. Paris Cité, CNRS, INRIA
2 CNRS, Univ. Paris Cité, INRIA
3 INRIA, LS2N CNRS
|
Session Chair:
Location:
C5.02
| 16:10-16:30 |
On Knowledge Compilation Languages for QBFs (abstract) 20 min
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
1 Johannes Kepler University Linz
|
| 16:50-17:10 |
Exploring Toda's Theorem as a QBF Solver (abstract) 20 min
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
1 National Taiwan University
2 University of Liverpool
|
Session Chair:
Location:
C4.07
| 16:30-17:00 |
Robust Classification in ML: A Topological Semantics Approach (abstract) 30 min
1 TU Wien
|
| 17:00-17:30 |
Business Meeting (abstract) 30 min
1 Universidade Federal de Goiás
|
Session Chair:
Location:
C2.01
| 16:30-17:00 |
Isabelle/jEdit — a Generic Frontend for Formal Mathematics (abstract) 30 min
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
1 Technical University of Košice
|
Session Chair:
Location:
C5.01
| 16:30-17:30 |
Researchers Panel (abstract) 60 min
1 Harvard University
2 National Institute for Informatics
3 Oxford University
4 University of Cape Town
|
Location:
C2.02
| 16:30-17:10 |
Using coding agents to help bring Prologs together (abstract) 40 min
1 Coheret Knowledge
2 UPM and IMDEA Software Institute
3 SWI
4 Carl Andersen
|
Session Chair:
Location:
C4.08
| 17:00-17:20 |
Reverse-Engineering Constraint Models from CNFs: An Agentic Approach (abstract) 20 min
1 Linköping University
2 TU Wien
|
| 17:20-17:40 |
Coloring Queens with Thousands of Encodings (abstract) 20 min
1 Carnegie Mellon University
|
| 17:40-17:50 |
Power Term Polynomial Algebra for Boolean Logic (abstract) 10 min
1 KU Leuven
2 MIT
|
Location:
B2.01
| 17:00-17:15 |
Logic for local strategic reasoning with dynamic action contexts (abstract) 15 min
1 Stockholm University
2 Beijing Normal University
|
| 17:15-17:30 |
Nested conditional local strategic reasoning in Basic Strategy Logic (abstract) 15 min
1 ILLC, University of Amsterdam
2 Stockholm University
|
| 17:30-17:45 |
Subjective Reasoning About Ability Under Cooperativeness Assumptions (abstract) 15 min
1 York University
|
| 17:45-18:00 |
Choosing the Lens: Strategic Perspective Activation in Context-Dependent Argumentation (abstract) 15 min
1 Warsaw University of Technology
|
Location:
C4.08
| 17:50-18:00 |
Closing Remarks (abstract) 10 min
1 KU Leuven
2 Karlsruhe Institute of Technology
|
Monday, 20 July 2026
08:45-10:00
Keynote: Symbolic Coding Agents: Temporal Synthesis as a Foundation for Strategic Reasoning in Artificial Intelligence
FLoC
Location:
Grande Auditório
| 08:45-10:00 |
Symbolic Coding Agents: Temporal Synthesis as a Foundation for Strategic Reasoning in Artificial Intelligence (abstract) 75 min
|
08:45-10:00
Keynote: Symbolic Coding Agents: Temporal Synthesis as a Foundation for Strategic Reasoning in Artificial Intelligence
CP
Location:
Grande Auditório
| 08:45-10:00 |
Symbolic Coding Agents: Temporal Synthesis as a Foundation for Strategic Reasoning in Artificial Intelligence (abstract) 75 min
|
08:45-10:00
Keynote: Symbolic Coding Agents: Temporal Synthesis as a Foundation for Strategic Reasoning in Artificial Intelligence
FSCD
Location:
Grande Auditório
| 08:45-10:00 |
Symbolic Coding Agents: Temporal Synthesis as a Foundation for Strategic Reasoning in Artificial Intelligence (abstract) 75 min
|
08:45-10:00
Keynote: Symbolic Coding Agents: Temporal Synthesis as a Foundation for Strategic Reasoning in Artificial Intelligence
ICLP
Location:
Grande Auditório
| 08:45-10:00 |
Symbolic Coding Agents: Temporal Synthesis as a Foundation for Strategic Reasoning in Artificial Intelligence (abstract) 75 min
|
08:45-10:00
Keynote: Symbolic Coding Agents: Temporal Synthesis as a Foundation for Strategic Reasoning in Artificial Intelligence
KR
Location:
Grande Auditório
| 08:45-10:00 |
Symbolic Coding Agents: Temporal Synthesis as a Foundation for Strategic Reasoning in Artificial Intelligence (abstract) 75 min
|
08:45-10:00
Keynote: Symbolic Coding Agents: Temporal Synthesis as a Foundation for Strategic Reasoning in Artificial Intelligence
LICS
Location:
Grande Auditório
| 08:45-10:00 |
Symbolic Coding Agents: Temporal Synthesis as a Foundation for Strategic Reasoning in Artificial Intelligence (abstract) 75 min
|
08:45-10:00
Keynote: Symbolic Coding Agents: Temporal Synthesis as a Foundation for Strategic Reasoning in Artificial Intelligence
SAT
Location:
Grande Auditório
| 08:45-10:00 |
Symbolic Coding Agents: Temporal Synthesis as a Foundation for Strategic Reasoning in Artificial Intelligence (abstract) 75 min
|
Location:
Grande Auditório
Location:
JJ Laginha
Session Chair:
Location:
C1.03
| 10:30-11:00 |
A Naturally-Colored Translation from LTL to Parity and COCOA (abstract) 30 min
1 TU Clausthal
|
| 11:00-11:30 |
Layered automata: A canonical model for automata over infinite words (abstract) 30 min
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
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
1 MIMUW, University of Warsaw
2 University of Kaiserslautern-Landau
3 University of Bonn
|
Session Chair:
Location:
B1.04
| 10:30-11:00 |
A Machine-Independent, Log-Sensitive Space-Cost Measure for the Weak Lambda-Calculus (abstract) 30 min
1 Université Paris-Saclay, LMF
|
| 11:00-11:30 |
A Pointfree Algebraic Metatheory of Syntax-Based Systems (online talk) (abstract) 30 min
1 University of Padova
|
| 11:30-12:00 |
Oracles Just for Fan: A Robust Computational Interpretation of the Fan Theorem (abstract) 30 min
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
1 FAU Erlangen-Nürnberg
|
Session Chair:
Location:
One03
| 10:30-11:00 |
Approximation theory for distant Bang calculus (abstract) 30 min
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
1 Université Paris Cité, CNRS, IRIF
|
| 11:30-12:00 |
Non-Wellfounded Derivations for Intersection Subtyping with Fixpoints (abstract) 30 min
1 ENS Lyon
|
Location:
Grande Auditório
Session Chair:
Location:
JJ Laginha
| 10:30-11:00 |
Backtrackable Inprocessing (abstract) 30 min
1 Technion, NVIDIA
|
| 11:00-11:30 |
Near-Optimal Encodings of Cardinality Constraints (abstract) 30 min
1 Carnegie Mellon University
|
| 11:30-12:00 |
Automated Reencoding Meets Graph Theory (abstract) 30 min
1 Carnegie Mellon University
|
Session Chair:
Location:
B2.04
| 10:30-10:45 |
CP Opening (abstract) 15 min
1 IMT Atlantique
2 Universidade de Lisboa
|
Session Chair:
Location:
One02
| 10:50-11:10 |
On Inferring Cumulative Constraints (abstract) 20 min
1 Delft University of Technology
|
| 11:10-11:30 |
Augmenting the Cumulative Overload Check with Integral Resource Usage Reasoning (abstract) 20 min
1 Université Laval
|
| 11:30-11:50 |
Revisiting Optional Variables in Lazy Clause Generation Solvers for Flexible Scheduling (abstract) 20 min
1 LAAS-CNRS
|
| 11:50-12:10 |
Instance Space Analysis and Complexity Estimation for Scheduling Problem (abstract) 20 min
1 Universitat Politècnica de València (UPV)
|
| 12:10-12:30 |
Accelerating Constraint Programming Solver with Parallel External Heuristics: Experiments on Scheduling and Routing Problems (abstract) 20 min
1 Czech Technical University in Prague
2 ScheduleOpt, Novy Knin
|
Session Chair:
Location:
One01
| 10:50-11:10 |
Not All Restarts are Equal: MAB-Learning at the Right Time Scale for SAT (abstract) 20 min
1 Laboratoire MIS UR 4290, Université de Picardie Jules Verne, Amiens, France
|
| 11:10-11:30 |
Efficient Explanations for Rule Ensembles (abstract) 20 min
1 University of Lleida
2 Monash University
3 ICREA, University of Lleida
|
| 11:30-11:50 |
Enhanced Lower Bound Computation in Branch-and-Bound for MaxSAT (abstract) 20 min
1 Laboratoire MIS UR 4290, Université de Picardie Jules Verne, Amiens, France
2 University of Picardie Jules Verne
3 Aix Marseille Univ, Université de Toulon, CNRS, LIS, Marseille, France
|
| 11:50-12:10 |
From Literals to Atomic Constraints: Generalising Conflict-Driven Clause Learning for Constraint Programming (abstract) 20 min
1 Delft University of Technology
|
| 12:10-12:30 |
Satisfiability for Large Weight Syndrome Decoding (abstract) 20 min
1 Laboratoire MIS UR 4290, Université de Picardie Jules Verne, Amiens, France
|
Session Chair:
Location:
C1.04
| 11:00-11:30 |
2-ASP(Q) programs with weak constraints: Complexity and efficient implementation (abstract) 30 min
1 University of Calabria
|
| 11:30-12:00 |
Parametric Modular Answer Set Programs Made Declarative (abstract) 30 min
1 University of Nebraska Omaha
2 University of Postdam
|
| 12:00-12:30 |
flingo - Instilling ASP Expressiveness into Linear Integer Constraints (abstract) 30 min
1 University of Nebraska Omaha
2 University of A Coruña
3 University of Potsdam
|
Session Chair:
Location:
B2.03
| 11:00-11:25 |
Reasoning About Probabilities, Actions, and Knowledge in Fuzzy Modal Logic (abstract) 25 min
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
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
1 Monash University
2 University of Melbourne
|
| 12:15-12:40 |
Large Language Models as Nondeterministic Causal Models (abstract) 25 min
1 University College London
|
Session Chair:
Location:
B1.03
| 11:00-11:25 |
A Distributed Framework for Compiling and Reasoning with d-DNNF (abstract) 25 min
1 Northeast Normal University
2 CRIL
|
| 11:25-11:50 |
From Tensor Networks to Tractable Circuits, and back (abstract) 25 min
1 Leiden University
2 University of Amsterdam
|
| 11:50-12:15 |
Compiling Defeasible Inference: A Dynamic Approach To System Z (abstract) 25 min
1 University of Cape Town
2 Open University, Heerlen
|
| 12:15-12:40 |
Knowledge Compilation for Quantification in Alternating Automata (abstract) 25 min
1 CISPA Helmholtz Center for Information Security
2 Indian Institute of Technology Bombay
|
Session Chair:
Location:
Grande Auditório
| 11:00-11:25 |
Computing Extensions of Abstact Argumentation Frameworks by Enumerating Closed Sets (abstract) 25 min
1 TU Dresden
2 Frankfurt University of Applied Sciences
|
| 11:25-11:50 |
Tenability and Weak Semantics: Modeling Non-uniform Defense (abstract) 25 min
1 University of Wisconsin -- Madison
2 University of Bari
|
| 11:50-12:15 |
Belief Function Propagation in Quantitative Bipolar Argumentation Frameworks (abstract) 25 min
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
1 Imperial College London
2 Cardiff University
3 King's College London
4 Umeå University
|
Location:
JJ Laginha
Location:
Grande Auditório
Session Chair:
Location:
B1.04
| 13:30-14:00 |
(Distinguished paper). The logic of bunched implications is undecidable (abstract) 30 min
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
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
1 ENS de Lyon
|
Session Chair:
Location:
C1.03
| 13:30-14:00 |
Checking History-Determinism for Parity Automata is in NP (abstract) 30 min
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
1 University of Warsaw
|
| 14:30-15:00 |
Minimization of streaming transducers (abstract) 30 min
1 Udine University
|
Session Chair:
Location:
JJ Laginha
| 13:30-14:00 |
Factoring Learned Clauses (abstract) 30 min
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
1 Georgia Institute of Technology
2 University of Auckland
|
| 14:30-15:00 |
Conditional Autarkies: Hard Formulas Made Easy (abstract) 30 min
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
1 Technical University Ilmenau
|
Session Chair:
Location:
C1.04
| 14:00-14:15 |
Representative Sets in Propositional Abduction (abstract) 15 min
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
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
1 National Institute of Informatics
|
| 14:45-15:00 |
On the (Intuitionistic) Logic of Next-Token Prediction (abstract) 15 min
1 University of North Texas
|
| 15:00-15:15 |
Case study: proving sqrt(2) irrational with LPTP and an LLM (abstract) 15 min
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
1 City University of New York
|
Session Chair:
Location:
B2.04
| 14:00-15:00 |
From CP Fundamentals with MiniCP to Solving Routing and Scheduling Applications with MaxiCP (abstract) 60 min
1 KU Leuven
2 UCLouvain
|
| 15:00-16:00 |
Despicable Cores: Thousands of GPU Minions for Constraint Propagation (abstract) 60 min
1 University of Connecticut
|
Session Chair:
Location:
One03
| 14:00-14:30 |
How Term Rewriting Structures Shape the Decidability of Knowledge Problems (abstract) 30 min
1 The Australian National University
|
| 14:30-15:00 |
Undecidability for semirings with fixed points (abstract) 30 min
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
1 University of Innsbruck
2 ASW Saarland
3 -
4 HTWK Leipzig
|
Session Chair:
Location:
B2.03
| 14:00-14:25 |
I Would If I Could: Reasoning about Dynamics of Actions in Multi-Agent Systems (abstract) 25 min
1 University of Bergen
2 Örebro University
3 LIPN, CNRS
|
| 14:25-14:50 |
Specifying Agent Strategy Spaces via LTL Synthesis (abstract) 25 min
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
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
1 Örebro University
2 NCSR “Demokritos”
3 NCSR “Demokritos” & University of Piraeus
|
Session Chair:
Location:
B1.03
| 14:00-14:25 |
ABD: Default–Exception Abduction in Finite First-Order Worlds (abstract) 25 min
1 Seer
|
| 14:25-14:50 |
But Not Because You Said So! Implicitly Accepting Information with Abductive Belief-Base Change (abstract) 25 min
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
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
1 Helmut-Schmidt-University
|
Session Chair:
Location:
Grande Auditório
| 14:00-14:25 |
Revealed Epistemic Trust (abstract) 25 min
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
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
1 University of New South Wales
2 New Mexico State University
|
| 15:15-15:35 |
Model Change for Description Logic Concepts (abstract) 20 min
1 University of Oslo
2 Cardiff University
|
Session Chair:
Location:
C1.03
| 15:30-16:00 |
(Distinguished paper). A Complexity Bound for Determinisation of Min-Plus Weighted Automata (abstract) 30 min
1 Technion
|
| 16:00-16:30 |
Differential Tree Automata (abstract) 30 min
1 IRIF, CNRS
2 University of Oxford
|
Session Chair:
Location:
B1.04
| 15:30-16:00 |
LFPL: Revisited and Mechanized (abstract) 30 min
1 Carnegie Mellon University
|
| 16:00-16:30 |
Layered Modal ML: Syntax and Full Abstraction (abstract) 30 min
1 University of Oxford
2 Nanyang Technological University
|
Location:
JJ Laginha
Location:
Grande Auditório
Session Chair:
Location:
Grande Auditório
| 16:00-17:00 |
It's all Connected: Knowledge Representation for Graph Data (abstract) 60 min
1 TU Wien (Vienna University of Technology)
|
Session Chair:
Location:
One03
| 16:00-16:30 |
Investigations on Higher-Order Infinitary Logic (abstract) 30 min
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
1 University of Innsbruck
2 University of Erlangen-Nuremberg
3 University of Melbourne
|
Session Chair:
Location:
JJ Laginha
| 16:00-16:15 |
WhyUnsat: a practical explanation tool (abstract) 15 min
1 Technical University Catalonia (BarcelonaTech)
|
| 16:15-16:30 |
Shapley-Shubik Attribution from Minimal Subsets (abstract) 15 min
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
1 KU Leuven
|
| 16:45-17:00 |
Sustainable Benchmarking Tool (abstract) 15 min
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
1 CRIL
|
Session Chair:
Location:
C1.04
| 16:00-16:15 |
Best DC contribution (abstract) 15 min
1 The Graduate University of Advanced Studies, SOKENDAI and NII
|
| 16:15-16:30 |
New Encodings of the (Euclidean) Traveling Salesperson Problem in Constraint Answer Set Programming on Difference Logic (abstract) 15 min
1 University of Ferrara
|
| 16:30-16:45 |
Relational Programming in Rel (abstract) 15 min
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
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
1 Technical University of Vienna
|
Location:
Pala do Pavilhão de Portugal
Location:
Pala do Pavilhão de Portugal
Location:
Pala do Pavilhão de Portugal
Location:
Pala do Pavilhão de Portugal
Location:
Pala do Pavilhão de Portugal
Location:
Pala do Pavilhão de Portugal
Location:
Pala do Pavilhão de Portugal
Tuesday, 21 July 2026
Session Chair:
Location:
B2.04
| 09:00-10:00 |
Decision Diagrams for Constraint Reasoning and Optimization (abstract) 60 min
1 CMU
|
Session Chair:
Location:
C1.04
| 09:00-10:00 |
ASP in the Loop: From Structured Prompting to Agentic Logic Programming (abstract) 60 min
1 University of Calabria, Italy
|
Session Chair:
Location:
JJ Laginha
| 09:00-10:00 |
Trustable Explainable AI: SAT to the Rescue (abstract) 60 min
1 ICREA & University of Lleida
|
Session Chair:
Location:
One03
| 09:00-10:00 |
Saturation-Guided Inductive Synthesis (abstract) 60 min
1 TU Wien
|
Session Chair:
Location:
B1.04
| 09:00-10:00 |
A Rational Defense of Reasonable Reflection (abstract) 60 min
1 Harvard
|
Session Chair:
Location:
Grande Auditório
| 09:00-10:00 |
The Logical Expressive Power of Graph Neural Networks (abstract) 60 min
1 Leipzig University
|
Location:
JJ Laginha
Session Chair:
Location:
B2.04
| 10:30-10:35 |
Distinguished service award (abstract) 5 min
1 Surprise
|
| 10:35-11:05 |
Early career award (abstract) 30 min
1 Surprise
|
| 11:05-11:35 |
Doctoral research award (abstract) 30 min
1 Surprise
|
| 11:35-11:45 |
Presentation of next CP & CPAIOR conferences (abstract) 10 min
1 The Chinese University of Hong Kong
2 Affiliation
3 CMU
|
Session Chair:
Location:
C1.04
| 10:30-11:00 |
Answer-Set-Programming-based Abstractions for Reinforcement Learning (abstract) 30 min
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
1 University of Calabria
|
| 11:30-12:00 |
Accelerating NeurASP with vectorization and caching (abstract) 30 min
1 Imperial College London
2 Imperial College, London
|
| 12:00-12:30 |
From Reasoning to Code: GRPO Optimization for Underrepresented Languages (abstract) 30 min
1 Università di Bologna
|
Session Chair:
Location:
JJ Laginha
| 10:30-11:00 |
Beyond Core-Guided MaxSAT (abstract) 30 min
1 UPC
2 IIIA-CSIC
|
| 11:00-11:15 |
Scuttle: A System for Multi-Objective MaxSAT (abstract) 15 min
1 University of Helsinki
|
| 11:15-11:30 |
Hermax: A Unified MaxSAT library (abstract) 15 min
1 University of Lleida
|
| 11:30-11:45 |
HitPBO: An Implicit Hitting Set Solver for Pseudo-Boolean Optimization (abstract) 15 min
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
1 Yunnan University
2 Gaoling School of AI, Renmin University of China
3 Laboratoire MIS UR 4290, Université de Picardie Jules Verne, Amiens, France
|
Session Chair:
Location:
One03
| 10:30-11:00 |
A Bounded Parallel Intersection Type System (abstract) 30 min
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
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
1 Chiba University
|
Session Chair:
Location:
B1.04
| 10:30-11:00 |
Verifying Exact Samplers for Continuous Distributions with a Discrete Program Logic (abstract) 30 min
1 New York University
2 NYU Shanghai
3 Aarhus University
|
| 11:00-11:30 |
Complete Supermartingale Certificates for ω-Regular Properties (abstract) 30 min
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
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
1 Aalborg University
2 IT University of Copenhagen
|
Session Chair:
Location:
C1.03
| 10:30-11:00 |
(Distinguished paper). Existential Positive Transductions of Sparse Graphs (abstract) 30 min
1 University of Warsaw
2 University of Bremen
|
| 11:00-11:30 |
Low Rank MSO (abstract) 30 min
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
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
1 INP Bordeaux, LaBRI, CNRS
2 University of Warsaw
|
Location:
Grande Auditório
Session Chair:
Location:
Grande Auditório
| 11:00-11:25 |
Beyond Consistency: A Closer Look at Free Formulas (abstract) 25 min
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
1 TU Wien
|
| 11:50-12:15 |
Safely Decomposing Conditional Belief Bases Into c-LEG Networks (abstract) 25 min
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
1 University of Helsinki
2 Leibniz University Hannover
3 FernUniversität in Hagen
|
Session Chair:
Location:
B1.03
| 11:00-11:25 |
Common Foundations for Recursive Shape Languages (abstract) 25 min
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
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
1 Simon Fraser University
2 RelationalAI & University of Edinburgh
|
| 12:15-12:35 |
A Simple Baseline for Inductive Knowledge Base Completion (abstract) 20 min
1 University of Mannheim
|
Location:
B2.03
| 11:00-11:09 |
Introduction (abstract) 9 min
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
1 University Of Cape Town
2 Open Universiteit - the Netherlands
|
| 11:12-11:15 |
Knowledge-Based Stable Roommates Problems (abstract) 3 min
1 Sabanci University
|
| 11:15-11:18 |
How Can Inconsistent Agents Become Consistent? (abstract) 3 min
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
1 University of Cape Town
|
| 11:21-11:24 |
KLM-Style Defeasibility in Modal and Description Logics (abstract) 3 min
1 University of Cape Town and CAIR
|
| 11:24-11:27 |
Towards Defeasible Semantics for Symbolic Classifiers (abstract) 3 min
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
1 Sapienza University of Rome
|
| 11:30-11:33 |
Defining Goals using Knowledge Representation for Aligned Reinforcement Learning (abstract) 3 min
1 TU Wien
|
| 11:33-11:36 |
Predictive Control of BDD Growth: Reinforcement Learning for Dynamic Variable Reordering (abstract) 3 min
1 University of Cape Town
|
| 11:36-11:39 |
Generalization in Reinforcement Learning from Logical Specifications (abstract) 3 min
1 Georgia Institute of Technology
|
| 11:39-11:42 |
A framework for Counterfactual Explainability in Graph Neural Networks (abstract) 3 min
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
1 Vrije Universiteit Amsterdam
|
Session Chair:
Location:
One01
| 11:50-12:10 |
Paratransit Optimization with Constraint Programming: A Case Study in Savannah, Georgia (abstract) 20 min
1 Georgia Institute of Technology
|
| 12:10-12:30 |
Configuration of Heterogeneous Agent Fleets for Cognitively Demanding Missions (abstract) 20 min
1 ONERA
2 IMT Mines Albi
|
Session Chair:
Location:
One02
| 11:50-12:10 |
Table Constraints for Integer Programming (abstract) 20 min
1 KU Leuven
2 Monash University
|
| 12:10-12:30 |
The Voice of the Flow: A Graph-based Approach for Step-Wise Explanations of Constraint Satisfaction Problems (abstract) 20 min
1 School of Computing and Information Systems, Singapore Management University
|
Location:
JJ Laginha
Location:
Grande Auditório
Session Chair:
Location:
JJ Laginha
| 13:30-14:00 |
Simplify, Order, Break, Repeat (abstract) 30 min
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
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
|
Session Chair:
Location:
C1.04
| 14:00-14:15 |
Coinductive Logic Programming (abstract) 15 min
1 Unknown
2 ASU
3 UT Dallas
|
| 14:15-14:30 |
Justifications for Logic Programs Under Answer Set Semantics (abstract) 15 min
1 New Mexico State University
|
Session Chair:
Location:
One01
| 14:00-14:20 |
A Scheduling-Based Approach to Railway Capacity Estimation for Industrial Freight Junctions (abstract) 20 min
1 DPIA – Università degli Studi di Udine
2 DEAMS – Università degli Studi di Trieste
|
| 14:20-14:40 |
An iterative Constraint Programming approach to integrate maximum workload constraints in preemptive jobshop scheduling (abstract) 20 min
1 LAAS-CNRS
|
| 14:40-15:00 |
Constraint Programming for Mixed-model Assembly Line Scheduling with Complex Industrial Constraints (abstract) 20 min
1 Airbus SAS, Toulouse, France
2 Airbus DS, Getafe, Spain
|
| 15:00-15:20 |
The CP Shortcut: Solving the High-Power Pump Activation Problem without the Overkill (abstract) 20 min
1 UCLouvain
2 Technord
|
| 15:20-15:40 |
Approximating Time-Dependent Transition Times in Constraint Programming for an Earth Observation Mission (abstract) 20 min
1 DTIS, ONERA, Université de Toulouse
2 CNES, Université de Toulouse
|
| 15:40-16:00 |
Constraint Programming for Curriculum-based High School Timetabling with Half-Blocks (abstract) 20 min
1 Polytechnique Montréal
2 UCLouvain & Polytechnique Montréal
3 Dash Computer Solutions
|
Session Chair:
Location:
One02
| 14:00-14:20 |
From LLM Suggestions to Lean Proofs: Verified Redundant Constraints for MiniZinc (abstract) 20 min
1 TU Wien
|
| 14:20-14:40 |
Formally Verified Certification of Constraint Programming Proofs (abstract) 20 min
1 Delft University of Technology
2 EPFL
|
| 14:40-15:00 |
Proof Logging for Projected Enumeration (and Counting?) Problems in VeriPB (abstract) 20 min
1 University of Glasgow
2 University of Copenhagen and Lund University
3 Lund University
4 A*STAR and Nanyang Technological University
|
| 15:00-15:20 |
VIPR Certificate Construction from Black-Box ILP Solvers (abstract) 20 min
1 TU Wien
|
| 15:20-15:40 |
End-to-end Certified Graph Colouring (abstract) 20 min
1 University of Basel
2 Université Paris-Saclay
3 Lund University and University of Copenhagen
4 Chalmers University of Technology and University of Gothenburg
5 University of Copenhagen and Lund University
6 A*STAR and Nanyang Technological University
|
| 15:40-16:00 |
On the Self-Stabilization of Dijkstra's Asynchronous Token Circulation (abstract) 20 min
1 MIS UR 4290, Université de Picardie Jules Verne, Amiens, France
|
Session Chair:
Location:
Grande Auditório
| 14:00-14:25 |
Beyond Uniform: To Boldly Abstract What Has Not Been Abstracted Before (abstract) 25 min
1 Universidade NOVA de Lisboa
2 TU Wien
|
| 14:25-14:50 |
A Normal Form for Rules Containing Arithmetic Operations (abstract) 25 min
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
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
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
1 TU Wien
|
Session Chair:
Location:
B1.03
| 14:00-14:25 |
Partially Finite Model Reasoning in Description Logics (abstract) 25 min
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
1 CNRS & University of Bordeaux
|
| 14:50-15:15 |
Complexity of Logics with Semiring Semantics (abstract) 25 min
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
1 CNRS & University of Bordeaux
2 Inria
|
| 15:35-15:55 |
Inclusion with Repetitions and Boolean Constants — Implication Problems Revisited (abstract) 20 min
1 University of Helsinki
|
Session Chair:
Location:
B2.03
| 14:00-14:25 |
Precise and Efficient Model-Agnostic Explanations (abstract) 25 min
1 Artificial Intelligence Research Institute - IIIA - CSIC
2 ICREA & Univ. Lleida
|
| 14:25-14:50 |
Model-Agnostic Explanations by Consensus (abstract) 25 min
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
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
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
1 Ruhr University Bochum
2 TU Dortmund University
3 Université Paris-Saclay, ENS Paris-Saclay
|
Session Chair:
Location:
B1.04
| 14:00-14:30 |
Graphical Algebraic Geometry: From Ideals and Varieties to Quantum Calculi (abstract) 30 min
1 University of Oxford
|
| 14:30-15:00 |
A Complete Equational Theory for Real-Clifford+CH Quantum Circuits (abstract) 30 min
1 Université Paris-Saclay, LMF
|
| 15:00-15:30 |
Complete Relational Logic for Infinite-Dimensional Quantum Programs with Unbounded Assertions (abstract) 30 min
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
1 University of Cambridge
|
Session Chair:
Location:
C1.03
| 14:00-14:30 |
(Distinguished paper). PVASS Reachability is Decidable (abstract) 30 min
1 University of Warsaw
2 TU Braunschweig
|
| 14:30-15:00 |
Reachability in VASS Extended with Integer Counters (abstract) 30 min
1 University of Bordeaux
2 University of Warsaw
|
| 15:00-15:30 |
The Complexity of Nested Reset Counter Systems (abstract) 30 min
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
1 Max Planck Institute for Software Systems
|
Session Chair:
Location:
One03
| 14:00-14:30 |
Ground Stratified Inductive Definitions (abstract) 30 min
1 University of Minnesota Twin-Cities
|
| 14:30-15:00 |
Treating congruences as equalities within proofs (abstract) 30 min
1 Inria Saclay & LIX, IPP
|
| 15:00-15:30 |
Equational Reasoning in Languages with Binders via Permutation Fixed-Points (abstract) 30 min
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
|
Session Chair:
Location:
C1.04
| 14:30-15:00 |
Equilibrium Semantics and Strong Equivalence for Higher-Order Logic Programs (abstract) 30 min
1 Harokopio University of Athens
2 National and Kapodistrian University of Athens
|
| 15:00-15:30 |
Event Calculus Meets Hybrid ASP (abstract) 30 min
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
|
Session Chair:
Location:
JJ Laginha
| 14:30-15:00 |
The Compilability Thresholds of 2-CNF to OBDD (abstract) 30 min
1 Leiden University
|
| 15:00-15:30 |
A canonical generalization of OBDD (abstract) 30 min
1 Université d'Artois, CRIL
2 Arizona State University
3 CNRS, CRIL
4 University of California
|
Location:
JJ Laginha
Session Chair:
Location:
One03
| 16:00-16:30 |
Evidence-Tracked Tape Semantics for Probabilistic Computation (abstract) 30 min
1 Ben-Gurion University
|
| 16:30-17:00 |
Stable Profunctors and Matrix Representation (abstract) 30 min
1 Chiba University
2 Tohoku University
3 University of Edinburgh, Kyoto University
|
| 17:00-17:30 |
Type Theory with Erasure (abstract) 30 min
1 University of St Andrews
|
Location:
Grande Auditório
Session Chair:
Location:
C1.04
| 16:00-16:15 |
GLP: A Grassroots, Multiagent, Concurrent, Logic Programming Language (abstract) 15 min
1 London School of Economics
|
| 16:15-16:30 |
Animation, Verification and Visualisation of Prolog Transition Systems with ProB (abstract) 15 min
1 University of Düsseldorf
|
| 16:30-16:45 |
Encoding Event-B Proof Rules in Prolog: An Interactive Sequent Prover for ProB (abstract) 15 min
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
1 Artificial Intelligence Research Institute, Consejo Superior de Investigaciones Científicas
2 Carnegie Mellon University
3 INESC-ID
4 Instituto Superior Técnico
|
| 17:00-17:15 |
Can Automated Feedback Turn Students into Happy Prologians? (abstract) 15 min
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
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
1 Université de La Réunion
2 Université de Namur
|
| 17:45-18:00 |
Towards Relating Ciao Assertions and LPTP Theorems (abstract) 15 min
1 UPM, IMDEA
2 CSIC, IMDEA
3 Université de La Réunion
|
Session Chair:
Location:
JJ Laginha
| 16:00-16:30 |
PASSAT: Deep Cooperation of Unit Propagation and Local Search in Incomplete SAT Solving (abstract) 30 min
1 Huazhong University of Science and Technology
2 Huawei OptVerse Solver,China
|
| 16:30-17:00 |
Generalizing CDCL with Graph Backtracking (abstract) 30 min
1 TU Wien
|
| 17:00-17:30 |
A Natively Parallel Proof Framework for Clause-Sharing SAT Solving (abstract) 30 min
1 Karlsruhe Institute of Technology (KIT)
|
| 17:30-17:45 |
CaDiCaL 3.0 (abstract) 15 min
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
1 KIT
|
Session Chair:
Location:
B2.04
| 16:30-16:50 |
DEI event (abstract) 20 min
1 LAAS CNRS & INSA Toulouse
2 IMT Atlantique
|
| 16:50-18:00 |
General assembly (abstract) 70 min
1 Polytechnique Montréal
|
Session Chair:
Location:
B2.03
| 16:30-16:55 |
Why(-Not)-Provenance for Datalog with Negation (abstract) 25 min
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
1 Örebro University
|
| 17:20-17:45 |
Efficient Temporal Reasoning with Non-Temporal Engines: Embedding DatalogMTL into Datalog (abstract) 25 min
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
1 TU Dresden
|
| 18:10-18:35 |
VADAOrchestra: Neurosymbolic Orchestration of Adaptive Reasoning Workflows (abstract) 25 min
1 TU Wien
2 Banca d’Italia
3 University of Warwick
|
Session Chair:
Location:
B1.03
| 16:30-16:55 |
Over All, PDDL Semantics is Simultaneously Simple and Hard to Get Right (abstract) 25 min
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
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
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
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
1 Università degli Studi di Genova
2 Hitachi Rail STS
|
Session Chair:
Location:
Grande Auditório
| 16:30-16:55 |
Semantic Foundations of Neuro-Symbolic Multi-Agent Systems (abstract) 25 min
1 University of Sussex
|
| 16:55-17:20 |
Hybrid Models for Natural Language Reasoning: The Case of Syllogistic Logic (abstract) 25 min
1 University of Warsaw
2 University of Trento
|
| 17:20-17:45 |
Symbolic Knowledge Transfer for Sample-Efficient Deep Reinforcement Learning (abstract) 25 min
1 University of Verona
|
| 17:45-18:10 |
SafeTap: Neurosymbolic Language to Quadrupedal Locomotion via Reactive Synthesis Modulo Bitvectors (abstract) 25 min
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
1 Mashang Consumer Finance Co., Ltd.
2 School of Artificial Intelligence, Jilin University
|
Session Chair:
Location:
B1.04
| 16:30-17:00 |
(Distinguished paper). Quantum Control and General Recursion beyond the Unitary Case (abstract) 30 min
1 LORIA, CNRS, INRIA, Université de Lorraine, France
|
| 17:00-17:30 |
Causality in Pure Quantum Computation with Quantum Control (abstract) 30 min
1 University of Edinburgh, Kyoto University
2 Chiba University
|
| 17:30-18:00 |
One rig to control them all (abstract) 30 min
1 University of Edinburgh
2 University of Southern Denmark
|
Session Chair:
Location:
C1.03
| 16:30-17:00 |
Randomness Extraction Fails for Finite-State Dimension (abstract) 30 min
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
1 University of Birmingham
2 University of Oxford
|
| 17:30-18:00 |
(Kleene Award). Star Complexity of Parikh Images of Languages over Infinite Alphabets (abstract) 30 min
1 Technion -- Israel Institute of Technology, Haifa, Israel
|
Session Chair:
Location:
JJ Laginha
Wednesday, 22 July 2026
Location:
Grande Auditório
| 08:45-10:00 |
Learning with Logic: Neuro-Symbolic Methods for Grounded and Robust AI (abstract) 75 min
|
Location:
Grande Auditório
| 08:45-10:00 |
Learning with Logic: Neuro-Symbolic Methods for Grounded and Robust AI (abstract) 75 min
|
Location:
Grande Auditório
| 08:45-10:00 |
Learning with Logic: Neuro-Symbolic Methods for Grounded and Robust AI (abstract) 75 min
|
Location:
Grande Auditório
| 08:45-10:00 |
Learning with Logic: Neuro-Symbolic Methods for Grounded and Robust AI (abstract) 75 min
|
Location:
Grande Auditório
| 08:45-10:00 |
Learning with Logic: Neuro-Symbolic Methods for Grounded and Robust AI (abstract) 75 min
|
Location:
Grande Auditório
| 08:45-10:00 |
Learning with Logic: Neuro-Symbolic Methods for Grounded and Robust AI (abstract) 75 min
|
Location:
Grande Auditório
| 08:45-10:00 |
Learning with Logic: Neuro-Symbolic Methods for Grounded and Robust AI (abstract) 75 min
|
Location:
JJ Laginha
Location:
Grande Auditório
Location:
Grande Auditório
| 10:30-11:30 |
What Would You Do? Dilemmas from Academic Life (abstract) 60 min
1 Inria
2 TU Wien
3 IIIA - CSIC
|
Session Chair:
Location:
B1.04
| 10:30-11:00 |
A categorical perspective on constraint satisfaction: The wonderland of adjunctions (abstract) 30 min
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
1 Norwegian University of Science and Technology (NTNU)
|
| 11:30-12:00 |
A cartesian closed fibration of regular languages (abstract) 30 min
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
1 National Institute of Informatics
2 National Institute of Informatics and SOKENDAI
3 National Institute of Informatics, SOKENDAI, and Imiron
|
Session Chair:
Location:
C1.03
| 10:30-11:00 |
Constructing Small Monadic Decompositions in Presburger Arithmetic (abstract) 30 min
1 RPTU Kaiserslautern-Landau
|
| 11:00-11:30 |
On Variable-Bounded Non-Linear Expansions of Presburger Arithmetic (abstract) 30 min
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
1 Tel Aviv University
|
| 12:00-12:30 |
On the Subspace Orbit Problem and the Simultaneous Skolem Problem (abstract) 30 min
1 University of Oxford
2 TU Wien
3 Max Planck Institute for Software Systems, Saarland Informatics Campus
|
Session Chair:
Location:
One03
| 10:30-11:00 |
Absolute convergence and Taylor expansion in web based models of linear logic (abstract) 30 min
1 ISAE-SUPAERO
|
| 11:00-11:30 |
Quantum Bayesian Networks: Compositionality and Typing via Linear Logic (abstract) 30 min
1 IRIF
|
| 11:30-12:00 |
On the consistency of naive set theories over substructural and fuzzy logics (abstract) 30 min
1 Kyoto University
|
Session Chair:
Location:
C1.04
| 10:30-11:00 |
Reducing Arbitrary Metric Temporal Formulas into Logic Programs under Answer Set Semantics (abstract) 30 min
1 University of Angers
2 University of Potsdam
|
| 11:00-11:30 |
Meta Programming for Linear-time Temporal Answer Set Programming (abstract) 30 min
1 University of Potsdam
|
| 11:30-12:00 |
Long-term Power Grid Planning via Answer Set Programming (abstract) 30 min
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
1 Harokopio University of Athens
2 National and Kapodistrian University of Athens
|
Session Chair:
Location:
JJ Laginha
| 10:30-11:00 |
Bilateral Treewidth for QBF: Where Strategies and Resolution Meet (abstract) 30 min
1 TU Wien
|
| 11:00-11:30 |
CAQE: Strong as Solver, Weak as Proof System (abstract) 30 min
1 Friedrich Schiller University Jena
|
| 11:30-12:00 |
d-QBF with Few Existential Variables Revisited (abstract) 30 min
1 LAMSADE, Université Paris Dauphine-PSL
|
Session Chair:
Location:
B2.04
| 10:30-11:30 |
Exploiting Combinatorial Structure in Constraint Programming: Going Beyond Domain Filtering to Model Counting and Marginal Distributions over Domains (abstract) 60 min
1 Polytechnique Montréal
|
| 11:30-12:30 |
Hexaly, a Global Hybrid Optimization Solver (abstract) 60 min
1 Hexaly
|
Session Chair:
Location:
B2.03
| 11:40-12:05 |
A Logic of Limited Belief with Introspection Based on Possible Worlds (abstract) 25 min
1 RWTH Aachen University
2 University of Toronto
|
| 12:05-12:30 |
Cops only need factual knowledge to catch robbers (abstract) 25 min
1 University of Chinese Academy of Sciences
2 Indian Statistical Institute
|
Session Chair:
Location:
B1.03
| 11:40-12:05 |
SRIP: A SAT-based System for Independent Set Reconfiguration (abstract) 25 min
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
1 University of Helsinki
|
Session Chair:
Location:
Grande Auditório
| 11:40-12:05 |
Scalable Learning of Challenging Normative Behaviours with Deep RL (abstract) 25 min
1 TU Wien
|
| 12:05-12:25 |
Normative Narrator: Guiding and Explaining Reinforcement Learning Agents (abstract) 20 min
1 TU Wien
|
Location:
JJ Laginha
Location:
JJ Laginha
Location:
Grande Auditório
Session Chair:
Location:
JJ Laginha
| 13:30-14:00 |
Definition-based dependency schemes (abstract) 30 min
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
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
1 IIT Bombay
2 Friedrich Schiller University Jena
3 IMSc Chennai
|
| 15:00-15:15 |
On Proof Systems for #QBF (abstract) 15 min
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
1 Institute of Mathematical Sciences, HBNI, Chennai
2 University of Liverpool, UK
|
Session Chair:
Location:
B2.04
| 13:55-14:35 |
Thirtieth Anniversary of the Constraints Journal Panel & Constraints journal awards (abstract) 40 min
1 Harvard & UCC
|
Session Chair:
Location:
Grande Auditório
| 14:00-14:20 |
AGM Belief Revision, Semantically (Extended Abstract) (abstract) 20 min
1 TU Dresden
2 University of Hagen
|
| 14:20-14:45 |
Expressiveness of Epistemic Spaces for Iterated Belief Change Operators (abstract) 25 min
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
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
1 Cardiff University
2 Université Sorbonne Paris Nord
|
Session Chair:
Location:
B1.03
| 14:00-14:25 |
Learning Numeric Planning Domain Models From Positive Observations (abstract) 25 min
1 Ben Gurion University of the Negev
|
| 14:25-14:50 |
From Next Token Prediction to (STRIPS) World Models (abstract) 25 min
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
1 RWTH Aachen University
|
| 15:15-15:35 |
Learning Broadcast Protocols (abstract) 20 min
1 Ben-Gurion University of the Negev
2 CISPA Helmholtz Center for Information Security
|
Session Chair:
Location:
B2.03
| 14:00-14:25 |
On Sufficient Conditions for Consistency Checking in CP-theory Preferences (abstract) 25 min
1 Iowa State University
|
| 14:25-14:50 |
Voting Compilation Revisited (abstract) 25 min
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
1 IRIT
2 IRIT-CNRS
|
Session Chair:
Location:
B1.04
| 14:00-14:30 |
Fixed-parameter tractable inference for discrete probabilistic programs, via string diagram algebraisation (abstract) 30 min
1 University of Twente
|
| 14:30-15:00 |
A synthetic account of Metropolis--Hastings via categorical probability (abstract) 30 min
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
1 LIS, Aix-Marseille Université
|
| 15:30-16:00 |
A convenient fibration for dependently-typed probability theory (abstract) 30 min
1 University of Tartu
2 University of Edinburgh
3 IT University of Copenhagen
|
Session Chair:
Location:
C1.03
| 14:00-14:30 |
(Distinguished paper). Dynamic Planar Graph Isomorphism is in DynFO (abstract) 30 min
1 Chennai Mathematical Institute, India
2 Ruhr University Bochum, Germany
|
| 14:30-15:00 |
The Finite Length Property of the Rado graph and Friends (abstract) 30 min
1 University of Oxford
2 University of Warsaw
|
| 15:00-15:30 |
Distinguishing Graphs by Counting Homomorphisms from Sparse Graphs (abstract) 30 min
1 Max Planck Institute for Informatics
2 IT-University of Copenhagen
|
| 15:30-16:00 |
Local combinatorial analogues for bounded VC dimension (online talk) (abstract) 30 min
1 The University of Chicago
|
Session Chair:
Location:
One03
| 14:00-14:30 |
Strong Normalisation for Asynchronous Effects (abstract) 30 min
1 University of Tartu
|
| 14:30-15:00 |
Abstract Framework for All-Path Reachability Analysis toward Safety and Liveness Verification (abstract) 30 min
1 Nagoya University
|
| 15:00-15:30 |
A Complete Finitary Refinement Type System for Scott-Open Properties (abstract) 30 min
1 LIP - ENS de Lyon
2 ENS de Lyon
|
Session Chair:
Location:
C1.04
| 14:30-15:00 |
Experimental evaluation of optimal abstract operators for sharing and linearity analysis (abstract) 30 min
1 University of Chieti-Pescara
|
| 15:00-15:30 |
Exploiting Multiple Abstract Call Patterns for Optimizing Run-Time Checks (abstract) 30 min
1 Instituto IMDEA Software & UPM
2 Instituto IMDEA Software & CSIC
|
Session Chair:
Location:
One02
| 14:40-15:00 |
The Distance Constraint on Sequence Variables (abstract) 20 min
1 Université Côte d'Azur, France
2 KU Leuven, Belgium
3 UCLouvain, Belgique
|
| 15:00-15:20 |
Modeling the p-dispersion problem with distance constraints (abstract) 20 min
1 University of Western Macedonia
|
| 15:20-15:40 |
Lightweight Look-Ahead-Based Value Heuristics for Constraint Optimization Problems (abstract) 20 min
1 Shanghai University of Finance and Economics
|
| 15:40-16:00 |
An Automata-Based Constraint Programming Framework for Optimal Classical Planning (abstract) 20 min
1 Linköping University
2 Polytechnique Montreal
|
Session Chair:
Location:
One01
| 14:40-15:00 |
Scaling Industrial Logistics: Tackling Multi-Batching Problems via Sequential Solving (abstract) 20 min
1 Airbus Central R&T, Toulouse, France
2 Airbus Central R&T, Hamburg, Germany
3 Airbus, Hamburg, Germany
|
| 15:00-15:20 |
Optimizing a Multi-Commodity Home-Delivery and Pickup Service in Depopulated Rural Areas with Constraint Programming (abstract) 20 min
1 National Institute of Informatics
2 Future Technology Laboratories INC.
3 Toyota Motor Corporation
|
| 15:20-15:40 |
Modelling and Optimizing HVAC Systems for Early-Stage Building Design (abstract) 20 min
1 Monash University
|
| 15:40-16:00 |
A constraint programming approach for n-day lookahead playoff clinching in the NHL (abstract) 20 min
1 Amazon
|
Location:
JJ Laginha
Location:
Grande Auditório
Session Chair:
Location:
B2.03
| 16:00-16:25 |
Causal Discovery as Dialectical Aggregation: A Quantitative Argumentation Framework (abstract) 25 min
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
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
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
1 Imperial College London
|
| 17:35-18:00 |
X-ABALearn: Argumentative Learning with Semantics `a la Carte (abstract) 25 min
1 CNR-IASI
2 Imperial
|
Session Chair:
Location:
B1.03
| 16:00-16:25 |
Generating Explainable Counterfactual Policies through Temporal Logic Queries (abstract) 25 min
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
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
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
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
1 IMDEA Software Institute and Universidad Politécnica de Madrid
2 IMDEA Software Institute
3 Luxembourg Institute of Science and Technology
|
Session Chair:
Location:
Grande Auditório
| 16:00-16:25 |
Unifying approach to uniform expressivity of graph neural networks (abstract) 25 min
1 University of Glasgow
|
| 16:25-16:50 |
Recurrent Graph Neural Networks and Arithmetic Circuits (abstract) 25 min
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
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
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
1 King’s College London
2 Queen Mary University of London
|
Session Chair:
Location:
One03
| 16:00-17:00 |
FSCD Business Meeting (abstract) 60 min
1 Université de Lille
|
Session Chair:
Location:
JJ Laginha
| 16:00-16:30 |
On Knowledge Compilation For Two-Variable First-Order Logic (abstract) 30 min
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
1 TU Wien
|
| 17:00-17:30 |
Dsat: A Native SAT Solver for Discrete Logic (abstract) 30 min
1 University of California, Los Angeles
|
| 17:30-18:00 |
Extending CDCL to disjunctions of parity equations (abstract) 30 min
1 University of Washington
|
Session Chair:
Location:
C1.04
| 16:00-16:15 |
Streamliners for Answer Set Programming (abstract) 15 min
1 Technical University of Vienna
2 University of Klagenfurt
|
| 16:15-16:30 |
Declarative Problem Solving in UAM Strategic Deconfliction (abstract) 15 min
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
1 Fraunhofer
2 University of Bucharest
|
| 16:45-17:00 |
EZASP - Facilitating the usage of ASP (abstract) 15 min
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
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
1 KU Leuven
|
| 17:30-17:45 |
Modeling Deontic Modal Logic in ASP (abstract) 15 min
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
1 Instituto IMDEA Software & UPM
2 Universidad Rey Juan Carlos
3 University of Texas at Dallas
4 Instituto IMDEA Software & CSIC
|
Session Chair:
Location:
One01
| 16:30-16:50 |
Identifying Multi-Hit Cancer Drivers Without Massive Parallelization: A CP, MIP, and Column Generation Framework (abstract) 20 min
1 Singapore University of Technology and Design, Singapore
2 RIKEN Center for Computational Science, Japan
3 Virginia Tech, Edward Via College of Osteopathic Medicine, USA
|
| 16:50-17:10 |
Revisiting Integer Programming Encodings of Acyclicity (abstract) 20 min
1 University of Helsinki
|
| 17:10-17:30 |
Constraint-Aware Self-Supervised Learning for Edge Selection (abstract) 20 min
1 Monash University
|
| 17:30-17:50 |
Combining an ε-constraint method with the Pareto global constraint (abstract) 20 min
1 University of Luxembourg
|
Session Chair:
Location:
One02
| 16:30-16:50 |
Constraint Solving and Particle Swarm Optimization for Fixture Layout Optimization (abstract) 20 min
1 University of Bologna
|
| 16:50-17:10 |
Neurosymbolic Large Neighbourhood Search (abstract) 20 min
1 Polytechnique Montreal
|
| 17:10-17:30 |
Automatic Relaxation and Multi-Armed Bandit Learning for Large Neighbourhood Search (abstract) 20 min
1 Uppsala University
2 Monash University
|
| 17:30-17:50 |
On the Effect of Training Data Selection in Automated Algorithm Selection (abstract) 20 min
1 University of St Andrews
|
Session Chair:
Location:
B1.04
| 16:30-17:00 |
Lazy Intermediate Representations for Algebraic Effects (abstract) 30 min
1 Inria, IRISA, Univ. Rennes
2 Inria, École Normale Supérieure
|
| 17:00-17:30 |
(Distinguished paper). Wiring the Pi-calculus to Denotational Semantics (abstract) 30 min
1 The University of Tokyo
2 Bologna University, Inria
3 Inria
4 CNRS, Aix-Marseille Université
|
Session Chair:
Location:
C1.03
| 16:30-17:00 |
Dicey Games: Shared Sources of Randomness in Distributed Systems (abstract) 30 min
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
1 University of Oxford
2 F.R.S.-FNRS & UMONS - Université de Mons
|
Location:
Praça de Touros do Campo Pequeno
Location:
Praça de Touros do Campo Pequeno
Location:
Praça de Touros do Campo Pequeno
Location:
Praça de Touros do Campo Pequeno
Location:
Praça de Touros do Campo Pequeno
Location:
Praça de Touros do Campo Pequeno
Location:
Praça de Touros do Campo Pequeno
Thursday, 23 July 2026
Session Chair:
Location:
B2.04
| 09:00-10:00 |
Bridging the Gap: Foundedness, Defaults, and Expressivity in Constraint Answer Set Programming (abstract) 60 min
1 University of Potsdam
|
Session Chair:
Location:
C1.04
| 09:00-10:00 |
From CLP(R) to MiniZinc: There and Back Again (abstract) 60 min
1 Monash University, Australia
|
Session Chair:
Location:
JJ Laginha
| 09:00-10:00 |
SAT in Saturation: A Satisfied Match (abstract) 60 min
1 TU Wien
|
Session Chair:
Location:
One03
| 09:00-10:00 |
Sheaves as Oracle Computations (abstract) 60 min
1 Institute of Computer Science, University of Tartu
2 University of Ljubljana
|
Session Chair:
Location:
B1.04
| 09:00-10:00 |
Formal Verification of Security Protocols: 25 Years of ProVerif (abstract) 60 min
1 CNRS
|
Session Chair:
Location:
Grande Auditório
| 09:00-10:00 |
Rigorous Explainability by Feature Attribution: From SHAP to nuSHAP (abstract) 60 min
1 ICREA (Catalan Institution for Research and Advanced Studies)
|
Location:
Grande Auditório
Location:
JJ Laginha
Session Chair:
Location:
B2.04
| 10:30-10:50 |
GPU-Accelerated Relaxed Decision Diagrams for Branch-and-Bound Optimization (abstract) 20 min
1 University of Connecticut
2 Carnegie Mellon University
|
| 10:50-11:10 |
Solving the Multiple Constant Multiplication Problem with Constraint Programming (abstract) 20 min
1 CITI, INSA Lyon
2 LAAS, Université de Toulouse
3 CNRS
4 INRIA
|
| 11:10-11:30 |
CrewAId: Interactive optimisation for human-in-the-loop crew rostering and rerostering (abstract) 20 min
1 Monash University
2 Woodside Energy Ltd.
|
| 11:30-12:00 |
Solvers competition results (abstract) 30 min
1 University of Artois
2 Monash University
|
Session Chair:
Location:
C1.04
| 10:30-11:00 |
ProDebug: An Automated Debugging System for Prolog (abstract) 30 min
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
1 Stony Brook University
|
| 11:30-12:00 |
Diamonds Are Forever: Stabilization Semantics for Unrestricted Aggregation and Recursion in Logica (abstract) 30 min
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
1 RPTU University Kaiserslautern-Landau
2 ENSIIE, INRIA Paris, SAMOVAR (Télécom SudParis)
|
Session Chair:
Location:
JJ Laginha
| 10:30-11:00 |
Exact Symbolic Reasoning for Nonlinear Stochastic SMT via Cylindrical Algebraic Decomposition (abstract) 30 min
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
1 University of Trento
2 Rice University
|
| 11:30-12:00 |
SMT with Uninterpreted Functions and Monotonicity Constraints in Systems Biology (abstract) 30 min
1 Masaryk University
|
Session Chair:
Location:
One03
| 10:30-11:00 |
Constructing (Co)inductive Types via Large Sizes (abstract) 30 min
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
1 INRIA
|
| 11:30-12:00 |
Divide and Check: Logical Relations, No Algorithms Attached (abstract) 30 min
1 Nantes Université
2 Inria
|
Session Chair:
Location:
C1.03
| 10:30-11:00 |
On the Computational Power of Extensional ESO (abstract) 30 min
1 Institut für Algebra, TU Dresden
|
| 11:00-11:30 |
Towards infinite PCSP: a dichotomy for monochromatic cliques (abstract) 30 min
1 Jagiellonian University
2 Charles University
3 Philipps-University Marburg
|
| 11:30-12:00 |
Decidability of Interpretability (abstract) 30 min
1 TU Wien
|
| 12:00-12:30 |
Complexity Classes Arising from Circuits over Finite Algebraic Structures (abstract) 30 min
1 TU Wien
2 Maria Curie-Sklodowska University, Lublin
|
Session Chair:
Location:
B1.04
| 10:30-11:00 |
(Distinguished paper). The infinity category of infinity categories in simplicial type theory (abstract) 30 min
1 Aarhus University
2 Chapman University
3 University of Nottingham
|
| 11:00-11:30 |
Generalized Decidability via Brouwer Trees (abstract) 30 min
1 University of Nottingham
2 University of Strathclyde
|
| 11:30-12:00 |
Eliminating reversals from cubical type theories (abstract) 30 min
1 University of Gothenburg and Chalmers University of Technology
|
| 12:00-12:30 |
Fat cell structures and generalized algebraic theories (abstract) 30 min
1 Indiana University
|
Session Chair:
Location:
B1.03
| 10:30-10:55 |
Splitting Assumption-Based Argumentation Frameworks (abstract) 25 min
1 TU Wien
|
| 10:55-11:15 |
Computational Complexity in Timed Argumentation Frameworks (abstract) 20 min
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
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
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
1 TU Wien
2 Scuola Normale Superiore di Pisa
|
Session Chair:
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
1 Universität Leipzig
|
| 10:55-11:15 |
PAC Learning of Concept Inclusions for Ontology-Mediated Query Answering (abstract) 20 min
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
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
1 University of Milano-Bicocca
|
| 12:00-12:25 |
BoxLitE: A Faithful Knowledge Base Embedding Based on Convex Optimization (abstract) 25 min
1 The Institute of Statistical Mathematics
2 TU Wien
3 University of Oslo
4 University of Applied Science FH Campus Wien
|
Session Chair:
Location:
Grande Auditório
| 10:30-10:55 |
Gradient-Based Optimization on Gödel Logic as Discrete Local Search (abstract) 25 min
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
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
1 National Institute of Informatics
2 NTT, Inc.
|
| 11:45-12:05 |
Graph-Based Attention for Differentiable MaxSAT Solving (abstract) 20 min
1 The Graduate University of Advanced Studies, SOKENDAI and NII
2 NII
|
| 12:05-12:30 |
SC²: Safe Control via Shielding for CPCTL specifications (abstract) 25 min
1 University of Manchester
2 Imperial College London
|
Location:
JJ Laginha
Session Chair:
Location:
One02
| 12:05-12:25 |
Towards Step-Wise Explanations of Large Search Trees (abstract) 20 min
1 KU Leuven
2 Monash University
|
Session Chair:
Location:
One01
| 12:05-12:25 |
Learning Unified Graph and Language Representations for SMT Algorithm Selection (abstract) 20 min
1 University of Waterloo
2 University of Göttingen and CIDAS
3 Georgia Institute of Technology
|
Location:
Grande Auditório
Session Chair:
Location:
JJ Laginha
| 13:30-13:54 |
SAT Competition (abstract) 24 min
1 Technical University of Vienna, Austria
2 Carnegie Mellon University at Pittsburgh, USA
3 Karlsruhe Institute of Technology, Germany
|
| 13:54-14:18 |
MaxSAT Evaluation (abstract) 24 min
1 University Helsinki, Finland
2 University of Lindköping, Sweden
3 INRAE, France
4 Carnegie Mellon University, USA
5 University of Freiburg, Germany
6 Karlsruhe Institute of Technology, Germany
7 Vrije Universiteit Brussel and KU Leuven, Belgium
|
| 14:18-14:42 |
Pseudo-Boolean Competition (abstract) 24 min
1 CRIL, Université d'Artois, France
|
| 14:42-15:06 |
Model Counting Competition (abstract) 24 min
1 Chennai Mathematical Institute, India
2 CNRS, Artois University (CRIL), France
3 Linköping University, Sweden
|
| 15:06-15:30 |
QBF Gallery (abstract) 24 min
1 Johannes Kepler University, Linz, Austria
2 University of Sassari, Italy
|
Session Chair:
Location:
B2.04
| 13:55-14:35 |
Thirty Years of Progress Towards the Holy Grail Panel (abstract) 40 min
1 Harvard & UCC
|
Session Chair:
Location:
C1.04
| 14:00-14:15 |
Bound-Founded Semantics for Answer Set Programming with Difference Constraints (abstract) 15 min
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
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
1 University of Alberta
|
| 14:45-15:00 |
chrKanren: Constraint Handling Rules in a Relational Language (abstract) 15 min
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
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
1 Arizona State University
|
Session Chair:
Location:
B1.03
| 14:00-14:25 |
Using ASP(Q) to Handle Inconsistent Prioritized Data (abstract) 25 min
1 CNRS & University of Bordeaux
2 CNRS & DI ENS
3 University of Calabria
|
| 14:25-14:50 |
Counting Complexity of ASP (abstract) 25 min
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
1 University of Calabria
|
| 15:10-15:35 |
Inferring High-Level Events from Timestamped Data: Complexity and Medical Applications (abstract) 25 min
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
1 Department of Mathematics and Computer Science - University of Calabria
2 Alpen-Adria Universität Klagenfurt
|
Session Chair:
Location:
B2.03
| 14:00-14:25 |
Efficient Incremental #SAT via Cross-Instance Knowledge Reuse (abstract) 25 min
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
1 University of Helsinki
2 University of Amsterdam
|
| 14:50-15:15 |
BAss: Symbolic Reasoning in Abstract Dialectical Frameworks (abstract) 25 min
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
1 Linköping university
2 University of Leeds
|
Session Chair:
Location:
Grande Auditório
| 14:00-14:25 |
RegD: Hierarchical Embeddings via Dissimilarity between Arbitrary Euclidean Regions (abstract) 25 min
1 University of Manchester
|
| 14:25-14:50 |
A Rectification-Based Approach for Distilling Boosted Trees into Decision Trees (abstract) 25 min
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
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
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
1 New Mexico State University
|
Session Chair:
Location:
C1.03
| 14:00-14:30 |
The Size of Interpolants in Modal Logics (abstract) 30 min
1 Universiteit van Amsterdam
2 University of Liverpool
|
| 14:30-15:00 |
Computation and Size of Interpolants for Hybrid Modal Logics (abstract) 30 min
1 TU Dortmund University
2 University of Warsaw
3 University of Liverpool
|
| 15:00-15:30 |
Guarded Negation Transitive Closure Logic (abstract) 30 min
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
1 University of Wrocław
|
Session Chair:
Location:
B1.04
| 14:00-14:30 |
Constructive higher sheaf models of type theory with applications to synthetic mathematics (abstract) 30 min
1 University of Gothenburg and Chalmers University of Technology
|
| 14:30-15:00 |
Classifying 2-Groups in Homotopy Type Theory (abstract) 30 min
1 University of Minnesota, Twin Cities
2 Carnegie Mellon University
|
| 15:00-15:30 |
Cellular Methods in Homotopy Type Theory (abstract) 30 min
1 University of Nottingham
2 University of Strasbourg
|
| 15:30-16:00 |
A computer formalisation of the Serre finiteness theorem (abstract) 30 min
1 Carnegie Mellon University
2 University of Nottingham
3 Stockholm University
|
Session Chair:
Location:
One03
| 14:00-14:30 |
Denotational semantics for stabiliser quantum programs (abstract) 30 min
1 Université Paris-Saclay
2 University of Oxford
|
| 14:30-15:00 |
Simpler Presentations for Many Fragments of Quantum Circuits (abstract) 30 min
1 INRIA, LORIA, Université de Lorraine
|
| 15:00-15:30 |
Graphical Symplectic Algebra (abstract) 30 min
1 University of Oxford
2 LIX, CNRS, École polytechnique, Institut Polytechnique de Paris
3 Université Paris-Saclay
|
Session Chair:
Location:
One02
| 14:40-15:00 |
Linear-Memory Beam Search Algorithms in Domain-Independent Dynamic Programming (abstract) 20 min
1 University of Toronto
|
| 15:00-15:20 |
Column Generation with Domain-Independent Dynamic Programming (abstract) 20 min
1 National Institute of Informatics
2 Monash University
|
| 15:20-15:40 |
GRID: Graph-based Modelling Interface for Domain-Independent Dynamic Programming (abstract) 20 min
1 University of Bologna, Bologna, Italy
2 National Institute of Informatics, Tokyo, Japan
|
| 15:40-16:00 |
Assembly Line Balancing with Parallel Stations and Shared Resources: A Cycle-Relative Constraint Programming Approach (abstract) 20 min
1 OptalCP
2 UCLouvain
|
Session Chair:
Location:
One01
| 14:40-15:00 |
From CP Modeling to Preference Elicitation in HMLV Assembly Problems (abstract) 20 min
1 KU Leuven
2 Flanders Make
3 TU Wien
|
| 15:00-15:20 |
Equal-sized Partition Problem: Application in Spinning and Yarn Production (abstract) 20 min
1 Hanoi University of Science and Technology
|
| 15:20-15:40 |
A Two-Stage Constraint Programming Approach for Artificial Teeth Scheduling (abstract) 20 min
1 Vienna University of Technology
|
| 15:40-16:00 |
ScenaGen: A CP Model for Grounding Qualitative Driving Scenarios (abstract) 20 min
1 Simula Research Laboratory
2 University of Paris-Saclay
|
Location:
JJ Laginha
Session Chair:
Location:
One03
| 16:00-16:30 |
Proof Identity and Categorical Models of BV (abstract) 30 min
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
1 University of Bristol
|
| 17:00-17:30 |
The Universal Property of Petri Net Unfoldings (abstract) 30 min
1 Inria, École Normale Supérieure
|
Location:
Grande Auditório
Session Chair:
Location:
C1.04
| 16:00-16:15 |
Learning from Answer Sets via Single-Shot Disjunctive ASP Encoding (abstract) 15 min
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
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
1 Universität Tübingen
2 German University of Digital Science
|
| 16:45-17:00 |
Logic programming semantics for causal processes (abstract) 15 min
1 German University of Digital Science
|
| 17:00-17:15 |
A Counterfactual Cause in Situation Calculus (abstract) 15 min
1 Nanjing University
2 The University of Edinburgh
|
| 17:15-17:30 |
Explainability Framework for Policy-Aware Autonomous Agents (abstract) 15 min
1 Miami University
|
| 17:30-17:45 |
Explainable Belief Harmonization under Dynamic Epistemic Partitions (abstract) 15 min
1 Warsaw University of Technology
|
Session Chair:
Location:
One02
| 16:30-16:50 |
Fairness of Classifiers in the Presence of Constraints between Features (abstract) 20 min
1 University of Toulouse, IRIT
2 Toulouse INP, IRIT
|
| 16:50-17:10 |
Utility-Peak Itemset Mining with Constraint Programming (abstract) 20 min
1 University of Paris-Saclay
2 Simula Research Laboratory
3 University of Artois
|
| 17:10-17:30 |
An Offline Neuro-Symbolic Soccer Pattern Retrieval Approach Using Constraint Programming (abstract) 20 min
1 Catholic University of Louvain
|
Session Chair:
Location:
One01
| 16:30-16:50 |
Computing Short SAT Implicants via Ising/QUBO Encodings (abstract) 20 min
1 Rice University
|
| 16:50-17:10 |
Smart Cubing for Graph Search: A Comparative Study (abstract) 20 min
1 TU Wien
|
| 17:10-17:30 |
On Symmetries and Transformations (abstract) 20 min
1 KU Leuven
2 RPTU Kaiserslautern-Landau
3 Vrije Universiteit Brussel
|
Location:
Grande Auditório
Session Chair:
Location:
C1.03
| 16:30-17:00 |
The Algebra of Iterative Constructions (abstract) 30 min
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
1 Imperial College London
2 University of Oxford
|
| 17:30-18:00 |
Axiomatisability of Alexandrov Dynamic Topological Logic (abstract) 30 min
1 Universität Bern
2 University of Barcelona
|
Session Chair:
Location:
B1.04
| 16:30-17:00 |
Definitional Proof Irrelevance Made Accessible (abstract) 30 min
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
1 Swansea University
|
| 17:30-18:00 |
From Co-Coverages to Radicals in Complete Lattices (online talk) (abstract) 30 min
1 LMU Munich
|
Session Chair:
Location:
B2.04
| 17:35-17:55 |
Classification of Non-redundancy of Boolean Predicates of Arity 4 (abstract) 20 min
1 UC Berkeley
2 Harvard University
|
| 17:55-18:00 |
CP Closing (abstract) 5 min
1 IMT Atlantique
|
Friday, 24 July 2026
Session Chair:
Location:
C6.02
| 08:30-09:30 |
Confluence of Rewrites on Term Graphs and Graphs (abstract) 60 min
1 ENS Paris-Saclay, France
|
| 09:30-10:00 |
Loop Elimination in Process Graphs is Confluent when Pruning Steps are Added (abstract) 30 min
1 Gran Sasso Science Institute
|
Location:
C4.01
| 08:55-09:00 |
Opening of the ARQNL Workshop (abstract) 5 min
1 University of Bamberg
2 University of Pernambuco
3 University of Groningen
|
Location:
C3.01
| 09:00-09:45 |
When Runs Align: Reductions for Concurrency and Recursion (abstract) 45 min
1 University of Toronto
|
Session Chair:
Location:
C1.03
| 09:00-09:30 |
Neural Stochastic Control and Verification for Safe Autonomy (abstract) 30 min
1 Singapore Management University
|
| 09:30-10:00 |
A high-level view on causal representation learning with actions (abstract) 30 min
1 University of Amsterdam
|
| 10:00-10:30 |
Round-table discussions (abstract) 30 min
1 Singapore Management University
2 University of Amsterdam
|
Location:
C4.01
| 09:00-09:50 |
Decidable Non-Classical Analogues of Linear Temporal Logic (abstract) 50 min
1 University of Barcelona
|
Location:
C4.08
Session Chair:
Location:
C3.02
| 09:00-10:00 |
Combining Constraint Programming and Machine Learning: From Current Progress to Future Opportunities (abstract) 60 min
1 UCLouvain and Polytechnique Montréal
|
Session Chair:
Location:
C1.04
| 09:00-10:00 |
SAT-Guided Gröbner Basis Methods for Arithmetic Circuit Verification (abstract) 60 min
1 TU Wien
|
| 10:00-10:30 |
Automated Reasoning with Nested Datatypes (abstract) 30 min
1 Bar-Ilan University
2 University of Iowa, Amazon
3 Stanford University
4 The University of Iowa
|
Session Chair:
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
1 King's College London
|
Location:
C5.08
| 09:00-10:15 |
The Functional Machine Calculus: an Introduction (abstract) 75 min
1 University of Bath
|
Location:
C2.01
| 09:00-09:10 |
Welcome and Opening Remarks (abstract) 10 min
1 UCSD
|
| 09:10-09:40 |
Advising Rajeev (abstract) 30 min
1 Stanford
|
| 09:40-10:10 |
Stateful Thinking (abstract) 30 min
1 IST
|
Session Chair:
Location:
C2.05
| 09:00-09:30 |
What is an Acceptable Proof? (abstract) 30 min
1 University of Miami
|
| 09:30-10:00 |
Recording and Verifying Skolemizations (abstract) 30 min
1 University of Miami
|
| 10:00-10:30 |
Recording and Verifying Interferences (abstract) 30 min
1 CTU
2 University of Southampton
3 CIIRC
|
Location:
C5.06
| 09:00-09:20 |
Formal verification of security protocols with certification (abstract) 20 min
1 Azim Premji University
2 IIT Delhi
3 Chennai Mathematical Institute
|
| 09:20-09:40 |
Verifiable Higher-Order Automated Reasoning (abstract) 20 min
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
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
1 Université Paris Cité
|
Location:
C4.02
| 09:00-09:50 |
Vampire in Universal Algebra: Missing Tools [Invited talk] (abstract) 50 min
1 CTU, Prague
|
| 09:50-10:10 |
Some Experiments with Twee-Style Goal-Directedness (abstract) 20 min
1 DHBW Stuttgart
|
| 10:10-10:30 |
Reset Early, Reset Often, Eliminate Models (abstract) 20 min
1 University of Cambridge
|
Session Chair:
Location:
C5.07
| 09:00-10:00 |
Isabelle: the last 40 years (and the next) (abstract) 60 min
1 FRS
|
Location:
B2.02
| 09:00-10:00 |
Probabilistic Databases for Dealing with Missing Values that are Governed by Missingness Mechanisms (abstract) 60 min
1 Carleton University and IMFD
|
Session Chair:
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
1 University of Milan.
|
09:00-09:30
Welcome & Remembering Joseph Y. Halpern (Sander Beckers, Hana Chockler, Moshe Vardi)
CREST
Session Chair:
Location:
C1.01
Session Chair:
Location:
C5.01
| 09:00-10:00 |
Invited Talk: Agent Interpolation in Distributed Systems (abstract) 60 min
1 Czech Academy of Sciences, Czechia
|
| 10:00-10:30 |
Interpolation above S4 (abstract) 30 min
1 Universität Bern
|
Session Chair:
Location:
C4.05
| 09:05-09:55 |
Language as a signal-symbol nexus for human-compatible sequential decision making (abstract) 50 min
1 University of Toronto, Canada
|
Location:
C4.08
| 09:10-09:35 |
Towards Explaining Repairs of Inconsistent Qualitative Constraint Networks (abstract) 25 min
1 University of Lübeck
|
| 09:35-10:00 |
Towards Visual Decision Support in Interactive Repair (Extended Abstract) (abstract) 25 min
1 TU Dresden
|
| 10:00-10:15 |
Efficient MUS Extraction with High-Level Model Rotation (abstract) 15 min
1 KU Leuven
|
Location:
C2.02
| 09:10-10:10 |
Program Equivalence Through Higher-Order Constrained Rewriting Induction (abstract) 60 min
1 Radboud University Nijmegen
|
| 10:10-10:30 |
Interaction Equivalence (abstract) 20 min
1 INRIA & LIX, Ecole Polytechnique
2 University of Bologna
3 Université Paris Cité
|
| 09:15-10:15 |
Controlling Computational Effects with Modalities (abstract) 60 min
1 Ben-Gurion Unversity
|
Location:
C4.07
| 09:15-10:00 |
Fixed Points in Probabilistic Program Reasoning (Invited Talk) (abstract) 45 min
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
1 Utah State University
2 ENS Paris-Saclay
3 University of Colorado Boulder
|
Session Chair:
Location:
C4.06
| 09:30-10:30 |
Parameterized Complexity of Almost-Satisfiable Constraint Systems (abstract) 60 min
1 Royal Holloway, University of London
|
Session Chair:
Location:
C1.01
| 09:30-10:30 |
Nondeterministic Causal Models (abstract) 60 min
1 University College London, UK
|
Location:
C3.01
| 09:45-10:00 |
Hyper Separation Logic (abstract) 15 min
1 INSAIT, Sofia University “St. Kliment Ohridski”
2 ETH Zurich
3 EPFL
|
| 10:00-10:15 |
Heisenbugs and their causes as hyperproperties (abstract) 15 min
1 TU Wien
|
Session Chair:
Location:
C4.01
| 09:50-10:10 |
Algorithmic Properties of First-Order Modal Logics of Some Classes of Trees (abstract) 20 min
1 Higher School of Modern Mathematics
2 University of the Witwatersrand, Johannesburg
3 HSE University, Moscow
|
| 10:10-10:30 |
Interpolation Calculi for Modal Logics (abstract) 20 min
1 The Australian National University
2 University of Brasília
|
Session Chair:
Location:
C4.05
| 09:55-10:15 |
Abstraction via Skolemization for Generalized Planning (and Beyond) (abstract) 20 min
1 RWTH Aachen University, Germany
2 LAAS-CNRS, University of Toulouse, France
3 University of Toronto, Canada
|
Session Chair:
Location:
C5.05
| 10:00-10:30 |
An Order-Theoretic View on Optimal Repairs and Complete Sets of Unifiers (Extended Abstract) (abstract) 30 min
1 TU Dresden
|
Location:
B2.02
| 10:00-10:05 |
Model Repairing And Belief Change Operators (abstract) 5 min
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
1 Leibniz Universität of Hannover
2 University of Helsinki
|
| 10:10-10:15 |
Bridging Statistical and Logical Perspectives on Inconsistency (abstract) 5 min
1 University of Oslo
|
| 10:15-10:20 |
A Closure-Based Semantics for Inconsistency Tolerant Agents (abstract) 5 min
1 Univ. Grenoble Alpes, Inria, CNRS, Grenoble INP, LIG, F-38000 Grenoble, France
|
Session Chair:
Location:
C5.07
| 10:00-10:30 |
A Tale of Two Multiset-like Types in Isabelle/HOL (abstract) 30 min
1 University of Copenhagen
|
Location:
C2.01
Location:
C4.08
Location:
C5.06
| 10:20-10:40 |
Quantum Coherence Spaces Revisited: A von Neumann (Co)Algebraic Approach (abstract) 20 min
1 Université Paris-Saclay, CNRS, ENS Paris-Saclay, Inria, Laboratoire Méthodes Formelles
|
Session Chair:
Location:
C5.02
| 10:30-11:00 |
Anti-Unification Completeness Analysis in PVS (abstract) 30 min
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
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
1 Heriot-Watt University Edinburgh
|
Session Chair:
Location:
C6.02
| 10:30-11:00 |
Verifying and Generalizing Simultaneous Critical Pairs (abstract) 30 min
1 University of Innsbruck
|
| 11:00-11:30 |
Confluence of Orthogonal Deterministic Higher-Order Pattern Rewrite Systems (abstract) 30 min
1 University of Innsbruck
|
| 11:30-12:00 |
Confluence of bang modulo (abstract) 30 min
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
1 Taras Shevchenko National University of Kyiv
|
Location:
C4.08
| 10:30-10:55 |
Interpretable Automated Essay Scoring via Quantitative Bipolar Argumentation (abstract) 25 min
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
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
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
1 Institut de Robòtica i Informàtica Industrial, CSIC-UPC
2 King's College London
3 Imperial College London
|
Session Chair:
Location:
C3.02
| 10:30-11:00 |
On the use of ML and LLM for hard scheduling problems (abstract) 30 min
1 Airbus SAS
|
| 11:00-11:30 |
Learning Unified Graph and Language Representations for SMT Algorithm Selection (abstract) 30 min
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
1 GREYC, CNRS, Normandie Univ, ENSICAEN, Universit\'e de Caen Normandie, Caen, France
2 TASC (LS2N-CNRS), IMT Atlantique, 44307, Nantes, France
|
Location:
B2.01
| 10:30-11:00 |
Source-Target Control of Boolean Networks with Minimal Edge Perturbations (abstract) 30 min
1 Université du Luxembourg,
2 University of Warsaw
3 University of Luxembourg
|
| 11:00-11:30 |
Modulation-Reaction Networks (abstract) 30 min
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
1 Masaryk University
|
| 12:00-12:30 |
pyModRev: a Python Tool for Model Revision of Boolean Networks (abstract) 30 min
1 INESC-ID
2 LASIGE
3 Ciências - Universidade de Lisboa
4 IST - Universidade de Lisboa
|
Location:
C5.01
Location:
C2.01
| 10:40-11:10 |
Alurtarnation in Temporal Logic (abstract) 30 min
1 Hebrew University
|
| 11:10-11:40 |
A Trajectory in Verification: Foundations with Rajeev and the Shift to Practice (abstract) 30 min
1 Universita' di Salerno
|
| 11:40-12:10 |
If Practice Won't Come to Theory, Then Theory Must Go to Practice: How to Analyze and Optimize Shell Scripts (abstract) 30 min
1 UCLA
|
Session Chair:
Location:
C4.05
| 10:45-11:05 |
An Incremental Method for Synthesizing Action Theory Abstractions (abstract) 20 min
1 IGDORE
2 York University
3 University of Rome La Sapienza
|
| 11:05-11:25 |
An Abstraction Approach for Formal Argumentation (abstract) 20 min
1 TU Graz
|
| 11:25-11:45 |
Using association and containment relationships to express dependency parse trees for knowledge representation and reasoning (abstract) 20 min
1 City St George's
2 Independent
|
| 11:45-12:05 |
Trustworthy Knowledge Base Embeddings: A Foundational Study of Box Semantics (Extended Abstract) (abstract) 20 min
1 Johannes Kepler University Linz
2 Free University of Bozen-Bolzano
|
Location:
C5.08
| 10:45-11:45 |
Computational Identity of Proofs: Rule Permutations Strike Back (abstract) 60 min
1 CNRS and ENS Lyon
|
Location:
C5.09
| 10:45-11:05 |
On the Proof Theory of the Constructive µ-Calculus (abstract) 20 min
1 University of Gothenburg
|
| 11:05-11:25 |
Proof-relevant Kripke semantics of µML via fixpoints of containers (abstract) 20 min
1 University of Strathclyde
2 Coherence Research Ltd
|
Location:
C3.01
| 11:00-11:45 |
The Many Facets of Temporal Hyperlogics (abstract) 45 min
1 IMDEA Software Institute
|
Location:
C2.02
| 11:00-11:20 |
Semantically Descriptive Similarity (abstract) 20 min
1 DTU (Technical University of Denmark)
|
| 11:20-11:40 |
Semantic Foundations for the Static Analysis of Program Revisions (abstract) 20 min
1 University of Colorado Boulder
2 University of Colorado Boulder & Amazon
|
| 11:40-12:00 |
Process Equivalence Checking as Abstract Interpretation (abstract) 20 min
1 Télécom SudParis, Institut Polytechnique de Paris
|
Session Chair:
Location:
C1.03
| 11:00-11:15 |
Temporal Guardrails for LLM Conversations: A Runtime Verification Framework (abstract) 15 min
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
1 Vanderbilt University
|
| 11:30-11:37 |
Solving Probabilistic Verification Problems of Neural Networks using Branch and Bound (abstract) 7 min
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
1 Delft University of Technology
|
| 11:44-11:51 |
PICID: Proof-Driven Clause Learning in Neural Network Verification (abstract) 7 min
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
1 Kyushu University
|
Session Chair:
Location:
C1.04
| 11:00-11:30 |
A Modern View on MCSat (abstract) 30 min
1 TU Wien
|
| 11:30-12:00 |
MCSAT Modulo Transcendental Arithmetics (abstract) 30 min
1 IMDEA Software
2 University of Cagliari
|
| 12:00-12:30 |
Exploration Heuristics for the NuCAD and CAlC Algorithms (abstract) 30 min
1 RWTH Aachen University
|
Session Chair:
Location:
C5.05
| 11:00-11:30 |
Quantitative Generalization for Variadic Nominal Terms (abstract) 30 min
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
1 TU Dresden
|
| 12:00-12:30 |
On Completeness of Absorptive Anti-Unification (abstract) 30 min
1 Universidade de Brasília
2 Czech Academy of Sciences
3 Research Institute for Symbolic Computation, JKU
4 Universidade de Brasilía
|
Session Chair:
Location:
C4.01
| 11:00-11:20 |
The Logic of Bunched Implications is Undecidable, Mechanized in Rocq (abstract) 20 min
1 Université de Lorraine, CNRS, LORIA
|
| 11:20-11:40 |
Beth Semantics and Tableaux for Bi-Intuitionistic Bunched Implications (abstract) 20 min
1 Université de Lorraine, CNRS, LORIA
|
| 11:40-12:00 |
Number Systems and Hilbert Calculi for Atomic Logics (abstract) 20 min
1 University of Rennes
|
Location:
C4.02
| 11:00-11:20 |
Machine-Learned Clause Selection: Intricacies and Surprises (abstract) 20 min
1 Czech Institute of Informatics, Robotics, and Cybernetics
|
| 11:20-11:40 |
ProofAtlas: A Saturation Prover with Integrated Neural Clause Selection (abstract) 20 min
1 TU Wien
|
| 11:40-12:00 |
Integrating Chronological and Graph Backtracking in AVATAR (abstract) 20 min
1 TU Wien
|
Session Chair:
Location:
C2.05
| 11:00-11:30 |
Layers of Proof Expectations for CASC (abstract) 30 min
1 University of Miami
|
| 11:30-12:00 |
Layers of Proof Expectations for ProoVer (abstract) 30 min
1 Loria, University of Lorraine & Inria
2 EPFL - Swiss Federal Technology Institute of Lausanne
|
Session Chair:
Location:
C4.06
| 11:00-11:30 |
Parameterized Hardness of Zonotope Containment and Neural Network Verification (abstract) 30 min
1 University of Technology Nuremberg
|
| 11:30-12:00 |
Non-Clashing Teaching in Graphs (abstract) 30 min
1 TU Wien
2 Telefonica
3 IIT Bombay
|
| 12:00-12:30 |
An Optimal Algorithm for Fair Gerrymandering (abstract) 30 min
1 University of Birmingham
|
Session Chair:
Location:
C1.01
| 11:00-11:18 |
An Actual Causality Calculus for Process Algebra (abstract) 18 min
1 University of Twente
|
| 11:18-11:36 |
Causal Models in LogiKEy (abstract) 18 min
1 University of Luxembourg
2 University of Bamberg & FU Berlin
|
| 11:36-11:54 |
A Concurrency-Theoretic Framework for Actual Causation (abstract) 18 min
1 University of Edinburgh
|
| 11:54-12:12 |
Figuring Out The Reasons Behind the Rules we Follow (abstract) 18 min
1 Oregon State University
|
| 12:12-12:30 |
Unification and Explanation from a Causal Perspective (abstract) 18 min
1 University of Cologne
|
Session Chair:
Location:
C5.07
| 11:00-11:30 |
IsaSearch: Semantic Natural-Language Search for the Archive of Formal Proofs (abstract) 30 min
1 Ludwig-Maximilians-Universität München
|
| 11:30-12:00 |
Isabelle in a Compiler-Construction Class --- Conception, Tooling, and Experiences (abstract) 30 min
1 Universite Paris-Saclay
2 University of Exeter
|
| 12:00-12:20 |
Teaching AutoCorrode in an Automated Reasoning Course (abstract) 20 min
1 Technical University of Denmark
|
Session Chair:
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
1 University of Potsdam
|
| 11:30-12:00 |
Craig Interpolation Theorem in the Logic of Russellian Definite Descriptions (abstract) 30 min
1 University of Lodz
|
| 12:00-12:30 |
Modular Constructive Lyndon Interpolation for Nondistributive Logics (abstract) 30 min
1 IMDEA Software Institute
2 Vrije Universiteit Amsterdam
3 University of Luxembourg
|
Location:
C4.07
| 11:00-11:30 |
Constrained and Robust Policy Synthesis with Satisfiability-Modulo-Probabilistic-Model-Checking (abstract) 30 min
1 Radboud University
2 Brno University of Technology
|
| 11:30-12:00 |
Stochastic Processes: Coinduction in Probabilistic Programming (abstract) 30 min
1 University of Oxford
|
| 12:00-12:30 |
Multiobjective Predicate Transformers: Computing the Pareto Front in Probabilistic Programs (abstract) 30 min
1 Cornell University
2 RWTH Aachen University
3 Radboud University
4 Saarland University and University College London
5 Saarland University and RWTH Aachen University
|
Location:
B2.02
| 11:15-11:45 |
Range Consistent Query Answering via Rewriting (abstract) 30 min
1 University of Mons (UMONS)
|
| 11:45-12:15 |
Towards a Thorough Understanding of ABox Abduction Under Repair Semantics (abstract) 30 min
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
1 CNRS & University of Bordeaux
2 CNRS & DI ENS
3 National Institute of Informatics, Tokyo
4 University of Calabria
|
Location:
C5.09
| 11:35-11:55 |
Cut-free Proof Theory for Intuitionistic PDL (abstract) 20 min
1 University of Gothenburg
2 University of Birmingham
|
| 11:55-12:15 |
The Complexity of the Constructive Master Modality (abstract) 20 min
1 Universitat de Barcelona
|
Location:
C3.01
| 11:45-12:00 |
On the Expressive Power of HyperLTL Compared to the Polyadic μ-Calculus (abstract) 15 min
1 University of Kassel
|
| 12:00-12:10 |
HyperQB 2.0: A Bounded Model Checker for Hyperproperties (abstract) 10 min
1 de Oliveira Batista
|
| 12:10-12:20 |
HyPOLE: Hyperproperty-Guided Multi-Agent Reinforcement Learning under Partial Observation (abstract) 10 min
1 Michigan State University
|
Location:
C5.08
| 11:50-12:10 |
Deep Inference Proof Systems for Monotone Quantifiers (abstract) 20 min
1 LIRMM - University of Montpellier
|
| 12:10-12:30 |
A Systematic Approach to Deep Inference for Modal Logic (abstract) 20 min
1 University of Birmingham
|
Location:
C4.08
Location:
C5.06
| 12:00-12:20 |
A Truthmaker Semantics for Positive Free Logic (abstract) 20 min
1 LMU Munich
|
| 12:20-12:40 |
Reflexivity and the Blocking of Semantic Paradox (abstract) 20 min
1 Fudan University
|
Location:
C2.01
Location:
C5.01
Session Chair:
Location:
C4.01
| 13:30-13:50 |
Second-order Positive Free Logic with Second-order Definite Descriptions (abstract) 20 min
1 University of Lodz
|
| 13:50-14:10 |
Sequent Calculus for Negative Free Logic of Classes (abstract) 20 min
1 University of Lodz
|
| 14:10-14:30 |
A Paradefinite Version of Russellian Theory of Definite Descriptions (abstract) 20 min
1 University of Lodz
|
| 14:30-14:45 |
Python-Based Reasoner for Description Logic with Definite Descriptions (abstract) 15 min
1 University of Lodz
2 Queen Mary University of London
|
Location:
C5.09
| 13:40-14:00 |
Contextual Modal MetaML: Syntax and Full Abstraction (abstract) 20 min
1 University of Oxford
2 Nanyang Technological University
|
| 14:00-14:20 |
Towards a logical characterization of Effectful Contextual Modal Type Theory (abstract) 20 min
1 IMDEA Software Institute, Madrid
|
Location:
C4.02
| 13:40-14:00 |
VaLeaDATE: Checking TSTP Proofs for Soundness (abstract) 20 min
1 TU Wien
|
| 14:00-14:20 |
Lean on Thousands of Problems (abstract) 20 min
1 TU Wien
|
| 14:20-14:40 |
Identifying and Explaining (Non-)Equivalence of First-Order Logic Formulas (abstract) 20 min
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
1 Naval Postgraduate School
|
Location:
C4.08
| 13:45-14:10 |
Extracting Verified Action Theories from Informal Specifications via Explanation-Guided Refinement (abstract) 25 min
1 New Mexico State University
|
| 14:10-14:35 |
Argumentation for Explainable and Globally Contestable Decision Support with LLMs (abstract) 25 min
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
1 Imperial College London
|
Location:
B2.02
| 13:45-14:15 |
Optimal Correction Sets for Argumentative Causal Discovery (abstract) 30 min
1 Imperial College London
2 University of Calabria
|
| 14:15-14:45 |
A local perspective on inconsistency in data-graphs (abstract) 30 min
1 University of Edinburgh
2 IIIA-CSIC
|
Session Chair:
Location:
C5.02
| 14:00-14:30 |
Barbed Similarity for the π-Calculus in Beluga: A Case Study in Coinductive Reasoning (abstract) 30 min
1 Università degli Studi di Milano
2 Augusta University
|
| 14:30-15:00 |
A Strategy Language for Controlled Proof Search (abstract) 30 min
1 LIRMM, Univ Montpellier, CNRS
|
Session Chair:
Location:
C6.02
| 14:00-14:30 |
Disproving Reachability in Probabilistic Term Rewriting (abstract) 30 min
1 RWTH Aachen University
|
| 14:30-15:00 |
Enumerating Ground Canonical Rewrite Systems (abstract) 30 min
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
1 Universitat Politècnica de València
|
Session Chair:
Location:
C5.07
| 14:00-15:00 |
Isabelle/ML tool development (abstract) 60 min
1 LMU
2 UCPH
|
Session Chair:
Location:
C1.01
| 14:00-15:00 |
Probabilistic Causality in Markovian Models (abstract) 60 min
1 Dresden University of Technology, Germany
|
Session Chair:
Location:
C4.06
| 14:00-15:00 |
Using Twin-width (with Flow Augmentation) for (Min)CSPs: Through the Lens of Directed Multicut with Three Terminal Pairs (abstract) 60 min
1 Institute for Basic Science, Daejeon, South Korea
|
Session Chair:
Location:
C3.02
| 14:00-14:30 |
Aperture: an Anytime, Complete, and Incremental Solver for MaxSAT and Beyond (Work-in-Progress) (abstract) 30 min
1 Technion & NVIDIA
|
| 14:30-15:00 |
Certified Implicit Hitting Set Solving with Local Search for Pseudo-Boolean Optimization (abstract) 30 min
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
1 MIS UR 4290, Université de Picardie Jules Verne, Amiens, France
2 Aix Marseille Univ, Université de Toulon, CNRS, LIS, Marseille, France
|
Session Chair:
Location:
C1.04
| 14:00-14:30 |
Incremental Linearization for Quantified Nonlinear Integer Arithmetic (abstract) 30 min
1 Czech Institute of of Informatics, Robotics and Cybernetics (CIIRC)
|
| 14:30-15:00 |
SMT-based Automation for Overwhelming Truth: A Polymorphic and Higher-Order Extension (abstract) 30 min
1 Univ Rennes, CNRS, IRISA
|
| 15:00-15:30 |
Floating‑Point Arithmetic of Symbolic Size in SMT‑LIB 3 (abstract) 30 min
1 Uppsala University
|
Session Chair:
Location:
C5.05
| 14:00-15:00 |
Quantitative types for pattern matching (abstract) 60 min
1 University of Porto
|
| 14:00-15:00 |
The Cost of Restricting Structural Rules (abstract) 60 min
1 University of Bath
|
Session Chair:
Location:
C2.05
| 14:00-14:30 |
The TPTP Format for Clausal Connection Tableaux (abstract) 30 min
1 University of Cambridge
|
| 14:30-15:00 |
The TPTP Format for Interpretations (abstract) 30 min
1 University of Miami
|
| 15:00-15:30 |
Towards a TPTP Format for Answers (abstract) 30 min
1 University of Miami
2 CTU
3 CIIRC
|
Location:
C2.01
| 14:00-14:30 |
ExCAPE and the Coming of Age of Program Synthesis (abstract) 30 min
1 MIT
|
| 14:30-15:00 |
VPLs and other Research at Rajeev's Group in the Early 2000s (abstract) 30 min
1 UIUC
|
Session Chair:
Location:
C4.05
| 14:00-14:50 |
The Abstract, the Explanatory, and the Logical (abstract) 50 min
1 Free University of Bozen-Bolzano, Italy
|
Location:
B2.01
| 14:00-14:30 |
Statistical model checking for rule-based models in the Kappa language (abstract) 30 min
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
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
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
1 DI ENS, École Normale Supérieure, PSL, CNRS, INRIA
|
Location:
C4.07
| 14:00-14:30 |
Robust Probabilistic Bisimilarity (Invited Talk) (abstract) 30 min
1 University of Oxford
|
| 14:30-15:00 |
SV-LIB 1.0: A Standard Exchange Format for Software-Verification Tasks (abstract) 30 min
1 LMU Munich
|
| 15:00-15:30 |
Imprecise Probabilistic Programming, Precisely (abstract) 30 min
1 University of Oxford
|
Session Chair:
Location:
C5.01
| 14:00-15:00 |
Invited Talk: Craig Interpolation within the Landscape of Decidable Fragments of First-Order Logic (abstract) 60 min
1 University of Amsterdam, Netherlands
|
| 15:00-15:30 |
Computation and Size of Interpolants for Hybrid Modal Logics (abstract) 30 min
1 TU Dortmund University
2 University of Warsaw
3 University of Liverpool
|
Location:
C3.01
| 14:00-14:45 |
Specifying and Preserving Security Hyperproperties with Real–Ideal Simulation (abstract) 45 min
1 Cornell University
|
Location:
C2.02
| 14:00-15:00 |
Hyper Hoare Logic: Deductive Verification of Complex Hyperproperties (abstract) 60 min
1 EPFL
|
| 15:00-15:20 |
Proving Program Equivalence in Dafny (abstract) 20 min
1 Imperial College London
|
Session Chair:
Location:
C1.03
| 14:15-14:30 |
Neural Network Verification using Partial Multi-Neuron Relaxation (abstract) 15 min
1 Hebrew University of Jeruslaem
|
Location:
C5.09
| 14:30-15:30 |
Temporal resource management via graded effects and graded modal types (abstract) 60 min
1 University of Tartu
|
Location:
C3.01
| 14:45-15:00 |
A Deductive System for Fair Simulation Proofs (abstract) 15 min
1 CISPA Helmholtz Center for Information Security
|
| 15:00-15:15 |
Coinductive Proofs for Temporal \forall\exists-Hyperproperties (abstract) 15 min
1 CISPA Helmholtz Center for Information Security
|
| 15:15-15:30 |
Information Flow Security for Concurrent Programs: Commutativity and Beyond (abstract) 15 min
1 ETH Zurich
|
Location:
B2.02
| 14:45-14:50 |
Preliminary Report on Scalable Optimal-Repair Based Query Answering with Non-Binary Conflicts (abstract) 5 min
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
1 TU Dresden
|
| 14:55-15:00 |
Towards Computing Pointwise Repairs in a Fragment of DatalogMTL (abstract) 5 min
|
| 15:00-15:05 |
SHACL Validation and Static Analysis in Presence of Ontologies: an Overview (abstract) 5 min
1 TU Vienna
|
Session Chair:
Location:
C4.05
| 14:50-15:10 |
From Generic Reasoning to Arbitrary Abstract Objects (abstract) 20 min
1 University of Vienna
2 University of Konstanz
|
| 15:10-15:30 |
Concepts as variable embodiments (abstract) 20 min
1 University of Oslo
|
Location:
C4.08
Session Chair:
Location:
C5.05
| 15:00-15:30 |
Anti-unification preserving special constants with variants (abstract) 30 min
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
|
Location:
C2.01
Location:
C5.06
| 15:00-15:20 |
Answer Set Programming goes to School (abstract) 20 min
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
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
1 TNO
|
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
1 University of Twente
|
Session Chair:
Location:
C1.01
| 15:00-15:18 |
Forward-Responsibility in Petri Nets (abstract) 18 min
1 Carl von Ossietzky Universität Oldenburg
|
Session Chair:
Location:
C4.06
| 15:00-16:00 |
Advances in Algorithmic Meta-Theorems with Applications to Solution Discovery (abstract) 60 min
1 University of Bremen
|
Session Chair:
Location:
C1.03
| 15:00-15:15 |
Verified Tensor Operators for Safety-Critical ML: From Specification to Reference Implementation (abstract) 15 min
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
1 Vanderbilt University
|
| 15:30-15:45 |
A Self-Correcting Neuro-Symbolic AI Reasoning Framework (abstract) 15 min
1 Vanderbilt University
|
| 15:45-16:00 |
Automated Algorithm Configuration of α,β-CROWN (abstract) 15 min
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
1 Imperial College London
|
Location:
C5.08
| 15:10-15:30 |
How to deal with Henkin Quantifiers in First-Order Logic (abstract) 20 min
1 TU Wien
|
Session Chair:
Location:
C4.01
| 15:10-15:30 |
A Sound and Weakly Complete Tableau System for Social Announcement Logic (abstract) 20 min
1 University of Auckland
|
| 15:30-15:50 |
A Tableau System for First-Order Epistemic Logic with Standard Names (abstract) 20 min
1 Roskilde University
|
| 15:50-16:10 |
Towards Quantified Dependent Assertion Logic (abstract) 20 min
1 Technical University Darmstadt
|
Location:
C4.08
| 15:15-15:40 |
Explainability Results for the Rotating Workforce Scheduling Problem (abstract) 25 min
1 TU Wien, Austria
|
| 15:40-16:05 |
Towards Interactive Sample-Based Formal Explanations via Constraint Reasoning (abstract) 25 min
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
1 KU Leuven
2 KU Leuven and VU Brussel
|
Session Chair:
Location:
C5.02
| 15:30-16:00 |
Towards Generic Semantics for Substructural Generic Quantification (abstract) 30 min
1 Univ Rennes, CNRS, IRISA
|
| 16:00-16:30 |
Proof Theory and Dependent Type Theory: Distinct Foundations for Designing Proof Assistants (abstract) 30 min
1 Inria Saclay
|
Location:
C4.02
| 15:30-15:50 |
Theorem Proving as Combinatorial Optimization: Toward Operations Research-Guided Strategy Design for Vampire (abstract) 20 min
1 Indiana University Bloomington
|
| 15:50-16:10 |
Exploiting Intra-Clausal Literal Sharing in Code Trees (abstract) 20 min
1 University of Bonn
|
| 16:10-16:30 |
Unification as a simple theorem prover (abstract) 20 min
1 None
|
Location:
C2.01
| 15:30-16:00 |
From Verification to Analysis (abstract) 30 min
1 Rice
|
| 16:00-16:50 |
Rajeev Alur: Reflections and Conversation (abstract) 50 min
1 UTAustin+DeepMind
|
| 16:50-17:00 |
Closing Remarks (abstract) 10 min
1 UCSD
|
Location:
C5.01
Location:
C3.01
| 16:00-16:45 |
Verification of Equivalence Properties in Cryptographic Protocols (abstract) 45 min
1 Inria Centre at Université de Lorraine
|
Location:
C2.02
| 16:00-16:20 |
Refuting Equivalence in Probabilistic Programs with Conditioning (abstract) 20 min
1 Institute of Science and Technology Austria
2 Masaryk University
3 Singapore Management University
|
| 16:20-16:40 |
Differential Verification of Neural Networks: Theory and Applications (abstract) 20 min
1 Karlsruhe Institute of Technology (KIT)
|
| 16:40-17:00 |
Discussion and Closing (abstract) 20 min
1 Karlsruhe Institute of Technology
2 Imperial College London
|
Location:
C5.09
| 16:00-16:20 |
A Value Trick for Modal Type Systems (abstract) 20 min
1 University of Edinburgh
|
| 16:20-16:40 |
Cover Semantics for Fitch-Style Modal Natural Deduction (abstract) 20 min
1 University of Birmingham
2 University of Edinburgh
|
| 16:40-17:00 |
Towards a labelled natural deduction for Constructive Modal Logics (abstract) 20 min
1 University College London
|
Location:
C4.07
| 16:00-16:30 |
A Lattice-Theoretic Abstraction of PDR via Adjunctions (Invited Talk) (abstract) 30 min
1 Kyoto University
|
| 16:30-17:00 |
Verification of Systems with Unbounded Agents By Exploiting Concurrency (abstract) 30 min
1 Unaffiliated
|
| 17:00-17:30 |
Scalable Probabilistic Program Verification by Theory-Extended Decision Diagrams (abstract) 30 min
1 RWTH Aachen University
2 University of Münster
3 Radboud University
|
Session Chair:
Location:
C5.01
| 16:00-17:00 |
Invited Talk: Feasible Interpolation: Power and Limitations (abstract) 60 min
1 University of Groningen, Netherlands
|
| 17:00-17:30 |
Multiple Definitions from a Single Resolution Proof (abstract) 30 min
1 University of Liverpool
|
Session Chair:
Location:
C1.04
| 16:00-16:30 |
LLM2SMT: Building an SMT Solver with Zero Human-Written Code (abstract) 30 min
1 Czech Institute of of Informatics, Robotics and Cybernetics (CIIRC)
|
| 16:30-17:00 |
Learning Unified Graph and Language Representations for SMT Algorithm Selection (abstract) 30 min
1 University of Waterloo
2 University of Göttingen and CIDAS
3 Georgia Institute of Technology
|
| 17:00-17:30 |
Efficient Volume Computation for SMT Formulas (abstract) 30 min
1 Chennai Mathematical Institute
2 Indian Statistical Institute
3 Georgia Institute of Technology
|
Session Chair:
Location:
C5.05
| 16:00-16:30 |
Dynamic E-unification (abstract) 30 min
1 Clarkson University
|
| 16:30-17:00 |
On the Compatible Expansion of Boolean Rings (abstract) 30 min
1 Purdue University
|
| 17:00-17:30 |
Matching in the Description Logic EL without the Top Concept (abstract) 30 min
1 TU Dresden
|
| 17:30-18:00 |
Proving Equations with Nonterminating Term Rewriting Systems using Context-Sensitive Rewriting (abstract) 30 min
1 Universitat Politècnica de València
|
Location:
C5.08
| 16:00-17:00 |
The Falsifier Calculus: A Novel Approach to Hilbert's Epsilon-Calculus in Deep Inference (abstract) 60 min
1 University of Bath
|
Session Chair:
Location:
C3.02
| 16:00-16:30 |
Fair Constraint Satisfaction: An Approximate Algorithm and Preliminary Results (abstract) 30 min
1 UPC Barcelona
|
| 16:30-17:00 |
Pseudo-Boolean Conflict Analysis (abstract) 30 min
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
1 INRAE Toulouse
2 IMT Atlantique
3 INRAE Paris-Saclay
|
Session Chair:
Location:
C4.05
Session Chair:
Location:
C6.02
| 16:00-16:30 |
Normalised completion for stratified linear rewriting systems (abstract) 30 min
1 Université Claude Bernard Lyon 1
|
| 16:30-17:00 |
Completion to Strong Confluence (abstract) 30 min
1 Universitat Politècnica de València
|
Session Chair:
Location:
C5.07
| 16:00-16:30 |
Lemmanaid: Neuro-Symbolic Lemma Conjecturing (abstract) 30 min
1 Chalmers University of Technology
2 University of California
|
| 16:30-16:45 |
Two interfaces for seL4 kernel verification: Time Protection and the Kernel–Userland Gap (Extended Abstract) (abstract) 15 min
1 UNSW Sydney
|
| 16:45-17:00 |
Issues and Solutions in Autoformalization of Munkres’ Topology in Isabelle/HOL (abstract) 15 min
1 AI4REASON and University of Gothenburg
|
Location:
B2.02
| 16:00-17:00 |
The Never-Ending Issue of Inconsistency Handling: Past and Future from a KR Perspective (abstract) 60 min
1 TU Wien
|
Session Chair:
Location:
C1.01
| 16:00-16:18 |
Hybridized Sabotage Logics for Causal Counterfactual Queries (abstract) 18 min
1 King's College London
|
| 16:18-16:36 |
A Generalized Propensity Score Estimation Methodology for Discrete and Continuous Treatments (abstract) 18 min
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
1 University of Konstanz
|
| 16:54-17:12 |
Rethinking Counterfactuals: Hidden Assumptions and Practical Pitfalls (abstract) 18 min
1 DFKI
|
| 17:12-17:30 |
Has Practice Already Crossed the Causal Barrier? Causality, Formal Models, and Contemporary Machine Learning (abstract) 18 min
1 Eindhoven University of Technology
|
Location:
C4.08
Location:
C5.06
| 16:20-16:40 |
Free sets, thin and Rainbows for Barriers (abstract) 20 min
1 Sapienza University of Rome
|
| 16:40-17:00 |
A Decision Algorithm for the CL15 Fragment of Computability Logic (abstract) 20 min
1 IMT School for Advanced Studies Lucca
|
Location:
C4.08
| 16:30-16:55 |
Explaining Reinforcement Learning Agents via Inductive Logic Programming (abstract) 25 min
1 University of Verona
|
| 16:55-17:20 |
Formally Explaining Neural Network Classification (abstract) 25 min
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
1 Imperial College London
|
Session Chair:
Location:
C4.06
| 16:30-17:30 |
Model Counting: Parameterized Solving, Complexity, and Applications (abstract) 60 min
1 Linköping University
|
Session Chair:
Location:
C4.01
| 16:40-16:55 |
Embedding Deontic Logic Operators from a Large Ontology in Higher-order Logic (abstract) 15 min
1 Naval Postgraduate School
|
| 16:55-17:15 |
First-Order Modal Logic in HOL: Deep and Shallow Embeddings with Automated Faithfulness (abstract) 20 min
1 University of Bamberg
2 Freie Universität Berlin
|
| 17:15-17:30 |
Generating Random Benchmark Problems for the First-Order Logic of Here-and-There (abstract) 15 min
1 University of Pernambuco
|
Location:
C3.01
| 16:45-17:00 |
Disintegration Temporal Logic for Probabilistic Hyperproperties (abstract) 15 min
1 CISPA Helmholtz Center for Information Security
2 CISPA Helmholtz Center for Information Security & Technical University of Munich
|
| 17:00-17:15 |
Affine Segment Decomposition for Verifying Neural Network Hyperproperties in Rocq-NN-Roll (abstract) 15 min
1 Fraunhofer FOKUS
2 TU Berlin
|
| 17:15-17:25 |
Symbolic Bounded Model Checking of ∀+∃+-Liveness Hyperproperties (abstract) 10 min
1 Universidade do Minho & INESC TEC
|
Location:
C5.06
| 17:00-17:20 |
An Intercalation Calculus with Partial Proof Terms (abstract) 20 min
1 LIACC - Artificial Intelligence and Computer Science Laboratory
|
| 17:20-17:40 |
Paradoxes and Proofs with Programs (abstract) 20 min
1 University of British Columbia
|
Location:
C5.07
| 17:00-18:00 |
The next 3 killer features of proof assistants in the next 10 years (abstract) 60 min
1 KCL
2 University of Exeter
3 University of Innsbruck
4 Amazon Web Services
5 AI4REASON and University of Gothenburg
|
Location:
C5.01
| 17:30-18:00 |
Book Launch: Theory and Applications of Craig Interpolation (abstract) 30 min
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
Location:
C2.01
| 08:40-09:25 |
Compositional reasoning for defense and aerospace systems (abstract) 45 min
1 Collins Aerospace
|
| 09:25-09:45 |
Formal Specification and Verification for Trustworthy Automotive Embedded Systems: An Experience Report and Outlook (abstract) 20 min
1 KTH Royal Institute of Technology
2 TRATON AB, Sweden
|
| 09:45-10:05 |
Multimode System Design with CoSApp (abstract) 20 min
1 Safran
|
| 10:05-10:25 |
The ∆Q Systems Development Paradigm (abstract) 20 min
1 PLWorkz R&D
|
Session Chair:
Location:
C4.02
| 08:50-09:15 |
Semantic Labelling in Practice (abstract) 25 min
1 ASW Saarland
2 HTWK Leipzig
|
| 09:15-09:40 |
Termination of Innermost-Terminating Right-Linear Overlay Term Rewrite Systems (abstract) 25 min
1 Nagoya University
|
| 09:40-10:05 |
Unifying Semantic Path Order and Weighted Path Order (abstract) 25 min
1 JAIST
|
| 10:05-10:30 |
Beyond Absolute Positiveness for Universally Quantified Non-Linear Polynomial Constraints (abstract) 25 min
1 Birkbeck, University of London
|
Location:
C4.08
| 09:00-10:00 |
Logic and the Power of Recurrent Graph Neural Networks (abstract) 60 min
1 RWTH Aachen University, Germany
|
Location:
C5.08
| 09:00-10:15 |
A Guided Tour of Sequent Formalisms for Modal Logics (abstract) 75 min
1 TU Dresden
|
Session Chair:
Location:
C2.02
| 09:00-09:15 |
Opening Remarks (abstract) 15 min
1 University of Glasgow
2 University of Oxford
|
| 09:15-09:45 |
Model Checking the Race Against Time (abstract) 30 min
1 RWTH Aachen University
|
| 09:45-10:15 |
It's all about Probabilities (abstract) 30 min
1 Technische Universität Dresden
|
Session Chair:
Location:
C1.01
| 09:00-09:45 |
Benchmarking for and with Language Models (abstract) 45 min
1 TU Vienna
|
| 09:45-10:15 |
Coloring Queens with Thousands of Encodings (abstract) 30 min
1 Carnegie Mellon University
|
Session Chair:
Location:
C1.04
| 09:00-10:00 |
From Distributed SAT to Distributed SMT? Successes and Challenges (abstract) 60 min
1 Karlsruhe Institute of Technology
|
| 10:00-10:30 |
Accelerating Parallel SMT Solving with Fixed First Decisions (abstract) 30 min
1 Stanford University
2 The University of Iowa
3 AWS
|
Location:
C5.06
| 09:00-09:20 |
Fuzzifying Derivatives of Regular Expressions (abstract) 20 min
1 Kutaisi International University
|
Location:
B2.02
| 09:00-09:45 |
Type Systems for Exchangeability (abstract) 45 min
1 Cornell University
|
| 09:45-10:00 |
SuperDP: Differential Privacy Refutation via Supermartingales (abstract) 15 min
1 Institute of Science and Technology Austria
2 Singapore Management University
|
| 10:00-10:15 |
Deciding Termination of Simple Randomized Loops (abstract) 15 min
1 RWTH Aachen University
|
| 10:15-10:30 |
A First Decision Procedure for Almost-Sure Termination of Probabilistic Term Rewriting (abstract) 15 min
1 RWTH Aachen University
2 TU Wien
|
Location:
C6.01
| 09:00-09:05 |
Welcome (abstract) 5 min
1 Brown University
2 Ruhr University Bochum
|
| 09:05-09:25 |
SAT-IT: an Online Interactive SAT Tracer (abstract) 20 min
1 University of Girona
|
| 09:25-09:45 |
Logic for Fun: demonstration (abstract) 20 min
1 Australian National University
|
| 09:45-10:05 |
LogicProof: An Interactive Web-Based Educational Theorem Prover for Natural Deduction and Sequent Calculus across Classical and Constructive Logics (abstract) 20 min
1 Technical University of Košice
|
Session Chair:
Location:
C5.05
| 09:00-10:00 |
Invited Talk: Infinite State Model Checking without Interpolation (abstract) 60 min
1 RWTH Aachen University, Germany
|
| 10:00-10:30 |
SV-LIB 1.0: A Standard Exchange Format for Software-Verification Tasks (abstract) 30 min
1 LMU Munich
|
Session Chair:
Location:
C5.07
| 09:00-10:00 |
Verifying Sledgehammer backend techniques with Isabelle/HOL (abstract) 60 min
1 Loria
|
Session Chair:
Location:
C4.05
| 09:00-09:05 |
Opening and Introduction (abstract) 5 min
1 Vrije Universiteit Brussel
2 Stonybrook University
|
| 09:05-09:50 |
Invited Talk: Moshe Vardi -- A New Paradigm – A New Computer Science? (abstract) 45 min
1 Rice University
|
| 09:50-10:05 |
Logic Programming and Coding Agents New Opportunities within a New Paradigm (abstract) 15 min
|
Location:
C4.01
| 09:00-09:30 |
Case Study: Saturations as Explicit Models in Equational Theories (abstract) 30 min
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
1 DHBW Stuttgart
|
Session Chair:
Location:
C6.02
| 09:00-09:15 |
Opening (abstract) 15 min
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
1 University of Jena
|
| 09:45-10:15 |
Proof Systems That Tightly Characterise Model Counting Algorithms (abstract) 30 min
1 University of Jena
|
Session Chair:
Location:
C5.01
| 09:00-10:00 |
Invited Talk: Constrained Horn Clauses for Program Verification and Synthesis (abstract) 60 min
1 University of Waterloo, Canada
|
| 10:00-10:30 |
Computing Witnesses Using the SCAN Algorithm (abstract) 30 min
1 TU Wien
2 The University of Manchester
|
Location:
C3.02
| 09:00-09:30 |
Verified Explanations of Neural Networks (abstract) 30 min
1 INRIA
|
| 09:30-09:50 |
Formal Verification for Machine Learning-Based Telemetry Anomaly Detection (abstract) 20 min
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
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
1 Alma Mater Studiorum - Università di Bologna
2 European Space Agency
3 Skylon Dynamics
|
Location:
C4.07
| 09:00-09:45 |
**At Room B2.02** Type Systems for Exchangeability (Joint Keynote with VeriProP) (abstract) 45 min
1 Cornell University
|
Session Chair:
Location:
C2.05
| 09:00-10:00 |
LLM-aided theorem-proving (abstract) 60 min
1 Apodex
|
| 10:00-10:30 |
Constrained decoding (abstract) 30 min
1 UCSD
|
Location:
C6.10
| 09:00-09:30 |
Lean Project Update (abstract) 30 min
1 Lean FRO
|
Session Chair:
Location:
C1.03
| 09:00-09:30 |
Latent space navigation – interpretation, probing and steering (abstract) 30 min
1 Technical University of Denmark
|
| 09:30-10:00 |
When Control Changes the Data: Safety under Interaction-Driven Distribution Shifts (abstract) 30 min
1 ETH Zurich
|
| 10:00-10:30 |
Round-table discussion (abstract) 30 min
1 Technical University of Denmark
2 ETH Zurich
|
Location:
C6.08
| 09:00-10:00 |
Improving the Ring and Field tactics to ease mathematical learning (abstract) 60 min
1 Inria
|
Location:
C5.09
| 09:15-10:15 |
Semantics for Intuitionistic Modal Logics: Up From Constructive K (abstract) 60 min
1 Australian National University
|
Location:
C5.06
| 09:20-09:40 |
Eternal Relaxed Vertex Cover on Threshold Graphs (abstract) 20 min
1 Independent Researcher, India
|
| 09:40-10:00 |
Vertex Definability in Counting Logic (abstract) 20 min
1 University of Oxford
|
Session Chair:
Location:
C4.06
| 09:30-10:30 |
Graph Isomorphism and Beyond (abstract) 60 min
1 TU Dresden
|
Location:
C6.10
| 09:30-10:00 |
lean4-skills: Workflows for AI-Assisted Lean Development (abstract) 30 min
1 MIT
|
Session Chair:
Location:
C6.07
| 09:40-10:10 |
Symbolic Model Checking: From Program Verification to Constrained Horn Clauses (abstract) 30 min
1 Technion
|
Location:
C4.07
| 10:00-10:30 |
Coalgebraic Notions of Simulation, Bisimulation and Relators (abstract) 30 min
1 University of Birmingham
|
Session Chair:
Location:
C5.07
| 10:00-10:30 |
Earley's Recognizer: Implementation and Complexity Analysis in Isabelle/HOL (abstract) 30 min
1 Technical University of Munich
|
Location:
C5.06
| 10:00-10:20 |
When Queries Decompose: A Lattice-Theoretic Perspective on Incomplete Information (abstract) 20 min
1 Simon Fraser University
|
| 10:20-10:40 |
Quad Algebras and a 4-Valued Non-Classical Logic (abstract) 20 min
1 Banaras Hindu University
|
Location:
C6.08
| 10:00-10:30 |
Towards Quantitative Logics in Rocq (abstract) 30 min
1 Heriot-Watt University
2 National Institute of Advanced Industrial Science and Technology (AIST)
3 IT-University of Copenhagen
4 University of Southampton and Heriot-Watt University
|
Session Chair:
Location:
C3.01
| 10:25-10:42 |
Natural Synthesis: Outperforming Reactive Synthesis Tools with Large Reasoning Models (abstract) 17 min
1 CISPA Helmholtz Center for Information Security
|
| 10:42-10:59 |
Optimal LTLf Synthesis (abstract) 17 min
1 University of Liverpool
|
Location:
C4.01
| 10:30-11:00 |
The TPTP Format for Interpretations (abstract) 30 min
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
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
1 Otto-Friedrich-Universität Bamberg
2 Otto-Friedrich-Universität Bamberg and Freie Universität Berlin
|
Location:
C4.08
| 10:30-10:50 |
Expressive Power of Graph Transformers via Logic (abstract) 20 min
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
1 Leipzig University
|
Location:
B2.01
| 10:30-11:00 |
Inferring Minimal Culture Media using Biologically Constrained Combinatorial Optimization (abstract) 30 min
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
1 Inria, Centre de Saclay
|
| 11:30-12:00 |
Analog computation with transcriptional networks (abstract) 30 min
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
1 University of Minho
|
Location:
C5.01
Session Chair:
Location:
C2.02
| 10:45-11:15 |
Formal Specifications in Generative AI (abstract) 30 min
1 University of Pennsylvania
|
| 11:15-11:45 |
Industrial-Scale Quantitative Program Optimisation for AI Workloads (abstract) 30 min
1 Amazon
|
| 11:45-12:15 |
Verifying Equilibria in Finite-Horizon Probabilistic Concurrent Game Systems (abstract) 30 min
1 Rice University
|
Location:
C5.08
| 10:45-11:45 |
Nomalization by inductive definitions: an overview (abstract) 60 min
1 RIMS, Kyoto University
|
Location:
C5.09
| 10:45-11:05 |
Higher-order Kripke models for intuitionistic and other non-classical modal logics (abstract) 20 min
1 University College London
|
| 11:05-11:25 |
Coderivative intuitionistic logics of topological and bimetric spaces (abstract) 20 min
1 National Institute of Informatics
2 Institute of Science Tokyo
|
Location:
C2.01
| 10:55-11:15 |
Compositional Conformal Certification for Reusable Vision-Based Runtime Monitoring (abstract) 20 min
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
1 University of Luebeck
2 University of Klagenfurt
|
| 11:35-11:55 |
Lifting Pacti Contracts into MLTL and Runtime Monitors (abstract) 20 min
1 Iowa State University
|
| 11:55-12:15 |
Coherence Constraints as Compositional Contracts for Autonomic Systems (abstract) 20 min
1 SWEN, Università degli Studi dell’Aquila, L’Aquila, Italy
2 FMT Lab, CNR–ISTI, Pisa, Italy
|
Session Chair:
Location:
C5.02
| 11:00-11:25 |
Type-based information flow analysis for π-calculus with a dynamically extensible security lattice (abstract) 25 min
1 Tohoku University
|
| 11:25-11:50 |
Environmental Bisimulation for Type-Based Secure Information Flow in λ-Calculus with Declassification (abstract) 25 min
1 Tohoku University
|
| 11:50-12:15 |
Designing Trustworthy Layered Attestations (abstract) 25 min
1 Zeno's Arrow Consulting
2 University of Kansas
3 The MITRE Corporation
4 National Security Agency
|
Session Chair:
Location:
C5.05
| 11:00-11:30 |
Why3-Elpi: Logic Programming Transformations for Why3 (abstract) 30 min
1 IRIF, Université Paris Cité
|
| 11:30-12:00 |
CHC-based Automated Verification of WebAssembly Programs (abstract) 30 min
1 The University of Tokyo
|
Session Chair:
Location:
C5.07
| 11:00-11:20 |
Formalizing the Exponential Blowup in the Transformations between CNF and DNF (abstract) 20 min
1 Ludwig-Maximilians-Universität München
|
| 11:20-11:40 |
Cracking egg: Towards Verified Equality Saturation (abstract) 20 min
1 Ludwig-Maximilians-Universität in Munich
|
| 11:40-12:00 |
Formalizing Paradoxes in Grounded Arithmetic using Isabelle/HOL (abstract) 20 min
1 EPFL
|
| 12:00-12:20 |
A Generalized Bekic Principle and its Formalization in Isabelle (abstract) 20 min
1 The Chinese University of Hong Kong
|
Session Chair:
Location:
C4.06
| 11:00-11:30 |
Eliminating Majority Illusion in Social Networks (abstract) 30 min
1 University of Birmingham
|
| 11:30-12:00 |
Gateways to Tractability for Satisfiability in Pearl's Causal Hierarchy (abstract) 30 min
1 TU Wien
|
| 12:00-12:30 |
Width Parameters for Flow Decompositions on DAGs (abstract) 30 min
1 University of Warsaw
|
Session Chair:
Location:
C4.05
| 11:00-11:45 |
Invited Talk: Anil Nerode -- How Should Logic Programming Evolve in an Age of Distributed Computation, or (Herbrand) is to (sequential computation) is to (logic programming) as (Gentzen) is to (distributed computation) is to (???) and why (abstract) 45 min
1 Cornell University
|
| 11:45-12:00 |
From Trustworthy to Resilient AI: Formalizing Requirements for Safe Cyber-Physical Systems Control (abstract) 15 min
1 Kansas State University
|
Session Chair:
Location:
C6.07
| 11:00-11:30 |
A Day in the Life of a Faculty Diversity Manager (abstract) 30 min
1 Universität Bremen
|
Session Chair:
Location:
C6.02
| 11:00-11:30 |
Proof Logging for Projected Enumeration (and Counting?) Problems in VeriPB (abstract) 30 min
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
1 Leiden University
|
| 12:00-12:30 |
Knowledge Compilation for Boolean and Presburger Functional Synthesis (abstract) 30 min
1 IIT Bombay
|
Session Chair:
Location:
C1.01
| 11:00-11:30 |
Global Benchmark Database (abstract) 30 min
1 Karlsruhe Institute of Technology
|
| 11:30-12:00 |
Sustainable Benchmarking Tool (abstract) 30 min
1 Karlsruhe Institute of Technology
2 RWTH Aachen University, Leiden University
3 Univ. Rennes, Inria, CNRS, IRISA
4 Univ. Bordeaux, CNRS, Bordeaux INP
|
| 12:00-12:30 |
Reliable Benchmarking: Requirements and Solutions (abstract) 30 min
1 LMU Munich
|
Session Chair:
Location:
C1.04
| 11:00-11:30 |
An Eager Encoding of Array Summation Constraints (abstract) 30 min
1 University of Regensburg
2 Uppsala University, University of Regensburg
|
| 11:30-12:00 |
Local Reasoning with Expressive Array Specifications (abstract) 30 min
1 Technical University of Madrid, Spain
2 Université de Lorraine, CNRS, Inria, LORIA, 54000 Nancy, France
|
| 12:00-12:30 |
Extending the cvc5 Relational Solver with Cyclicity Reasoning (abstract) 30 min
1 Stanford University
2 The University of Iowa
|
Session Chair:
Location:
C4.02
| 11:00-11:25 |
PaSTTeL: Parallel analysiS framework for Termination and non-Termination of Lasso programs (abstract) 25 min
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
1 CISPA Helmholtz Center for Information Security
|
| 11:50-12:15 |
On Deciding Constant Runtime of Linear Loops (abstract) 25 min
1 RWTH Aachen University
2 University of Sussex
|
| 12:15-12:30 |
termCOMP Part 1 (abstract) 15 min
1 RWTH Aachen University
|
Location:
C5.06
| 11:00-11:20 |
Social Network Aggregation Beyond Preservation (abstract) 20 min
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
1 University of Milan
2 University of Lisbon
|
| 11:40-12:00 |
Logical Modeling of Belief Polarization (abstract) 20 min
1 Institute for Logic, Language and Computation (ILLC), University of Amsterdam
|
Location:
B2.02
| 11:00-11:45 |
How to Verify Probabilistic Inference — and What That Even Means (abstract) 45 min
1 MIT
|
| 11:45-12:00 |
Generating Functions Meet Occupation Measures: Invariant Synthesis for Probabilistic Loops (abstract) 15 min
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
1 University of Oldenburg
|
| 12:15-12:30 |
Assessing the Quality of Binomial Samplers: A Statistical Distance Framework (abstract) 15 min
1 Indian Statistical Institute
2 Georgia Institute of Technology
|
Session Chair:
Location:
C3.01
| 11:00-11:17 |
From Quasipolynomial to Data-Parallel Algorithms for Verification Games Played on Graphs (abstract) 17 min
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
1 Indian Institute of Technology, Delhi
|
| 11:34-11:51 |
Social Welfare under Heterogeneous Time Preferences (abstract) 17 min
1 University of Liverpool, UK
2 University of Colorado Boulder, USA
|
| 11:51-12:08 |
Games on Temporal Graphs (abstract) 17 min
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
1 Tata Institute of Fundamental Research, Mumbai
|
Session Chair:
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
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
1 The University of Manchester
2 Central European University
|
| 12:00-12:30 |
An Algorithm for Existential Boolean Unification with Predicates (abstract) 30 min
1 TU Wien
|
Location:
C3.02
| 11:00-11:30 |
From Requirements to the Verification of Stochastic Systems (abstract) 30 min
1 University of York
|
| 11:30-11:50 |
Formalization of a language for autonomous spacecraft operations (abstract) 20 min
1 National Aeronautics and Space Administration (NASA)
2 Analytical Mechanics Associates
|
| 11:50-12:10 |
Robust Observation Planning via Facet Reasoning (abstract) 20 min
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
1 University of California Irvine
2 Mitsubishi Electric Research Laboratories
3 Georgia Institute of Technology
|
Session Chair:
Location:
C2.05
| 11:00-12:00 |
CSLib: The Lean Computer Science Library (abstract) 60 min
1 Stanford University
2 ETH Zurich
|
Location:
C4.07
| 11:00-11:30 |
Compositional Verification of Higher-Order Effectful Programs via Interactive Semantics (abstract) 30 min
1 Nantes Université
|
| 11:30-12:00 |
Why codensity lifting works: A formal perspective (abstract) 30 min
1 University of Oxford
|
| 12:00-12:30 |
Semantics and Equational Axiomatisation of Quantum Communication (abstract) 30 min
1 University of Oxford
|
Session Chair:
Location:
C1.03
| 11:00-11:15 |
Certified Neural Approximations of Nonlinear Dynamics (abstract) 15 min
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
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
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
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
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
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
1 Georgia Institute of Technology
2 Georgia Tech Research Institute
|
Location:
C6.10
| 11:00-11:30 |
Implementing Canonical in 185 lines of Lean (abstract) 30 min
1 Carnegie Mellon University
|
| 11:30-12:00 |
Metaprogramming for Formal Semantics: A Lean-Based Specification Tool (abstract) 30 min
1 University of Toronto
|
| 12:00-12:30 |
Reconstructing Proofs from Univariate Cylindrical Algebraic Decomposition in Lean (abstract) 30 min
1 Universidade Federal de Minas Gerais
|
Location:
C6.08
| 11:00-11:30 |
Phantom Names: a Named Interface for de Bruijn Syntax (abstract) 30 min
1 Inria Paris
|
| 11:30-12:00 |
Sulfur: Automating Substitution-preserving Syntaxes and Judgments in Rocq (abstract) 30 min
1 ENS de Lyon
2 INRIA Paris, ENS Paris
3 INRIA Rennes
4 Université Paris-Saclay, INRIA, CNRS, ENS Paris-Saclay, LMF
|
| 12:00-12:30 |
A Category of Finite Ordinals and Functions with Computable Pullbacks and Pushouts in Rocq (abstract) 30 min
1 ENS de Lyon
|
Location:
C6.01
| 11:05-11:25 |
Teaching LTL and ω-Automata with Spot (abstract) 20 min
1 LRE
2 EPITA
|
| 11:25-11:45 |
Tempus fugit: Anyone can understand temporal logic if they have to save the realm (abstract) 20 min
1 Télécom SudParis, Institut Polytechnique de Paris
2 Technische Universität Berlin
|
Location:
C4.08
| 11:20-11:40 |
An Algebraic Characterization of Local Weisfeiler–Leman (abstract) 20 min
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
1 University of Kassel
|
Session Chair:
Location:
C6.07
| 11:30-12:00 |
Using proof assistants as more than checkers, and how to write papers about it (abstract) 30 min
1 Inria
|
Location:
C5.09
| 11:35-11:55 |
Polytopological Semantics for Intuitionistic Modal Logics (abstract) 20 min
1 TU Wien
2 Universitat de Barcelona
3 Institute of Science Tokyo
|
| 11:55-12:15 |
Gödel coding on fibrations and geminal categories (abstract) 20 min
1 The University of Tokyo
|
Location:
C5.08
| 11:50-12:10 |
Constructive Reverse Mathematics of Cyclic Proof Theory (abstract) 20 min
1 Würzburg University, Germany
2 INRIA
|
| 12:10-12:30 |
Choreographies as Proofs of Deadlock Freedom (abstract) 20 min
1 University of Southern Denmark SDU
|
Location:
C5.06
| 12:00-12:20 |
Axiomatising asynchronous announcements in dynamic epistemic logic (abstract) 20 min
1 IRIT, CNRS-INPT-University of Toulouse & IHPST, University Paris 1 Panthéon Sorbonne
|
Session Chair:
Location:
C6.07
| 12:00-12:30 |
Taming State-Space Explosion in Cloud Accounts: Finding Privilege Escalation at Scale (abstract) 30 min
1 Huawei R&D
|
Location:
C5.06
| 12:20-12:40 |
Toward Provably Defeasible Machine Learning (abstract) 20 min
1 University of the Western Cape and CAIR
|
Location:
C5.01
Location:
C6.01
| 13:30-13:50 |
A Lean-based Language for Teaching Proof in High School (abstract) 20 min
1 LCIS, Grenoble INP - UGA
2 IRIF, Université Paris Cité
|
| 13:50-14:10 |
Waterproof Editor: an educational environment for proof assistants and programming languages (abstract) 20 min
1 Utrecht University
2 Radboud University Nijmegen
3 Eindhoven University of Technology
|
Location:
C4.08
| 13:30-14:30 |
Verification of DNNs with Marabou (abstract) 60 min
1 Hebrew University of Jerusalem, Israël
|
Location:
C4.01
| 13:30-14:00 |
A light-weight proof checker for TSTP refutations (abstract) 30 min
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
1 Vrije Universiteit Amsterdam
2 University of Amsterdam
|
| 14:30-15:00 |
Satisfiability for Probability Modalities (abstract) 30 min
1 University of São Paulo
2 Artificial Intelligence Research Institute
3 Federal University of ABC
|
Location:
C2.01
| 13:30-14:15 |
Safe Autonomous Systems via Shielding (abstract) 45 min
1 Graz University of Technology
|
| 14:15-14:35 |
MTL for Compositional Specification of Assume Guarantee Contracts in Autonomous Robotics (abstract) 20 min
1 University of Manchester
|
| 14:35-14:55 |
A Formal Algorithmic Framework for Probabilistic Assurance Cases for Learning-Enabled Systems (abstract) 20 min
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
1 MBZUAI
2 Amazon
|
Session Chair:
Location:
C1.03
| 13:30-14:30 |
Reliable AI code generation through sound program analysis (abstract) 60 min
1 MIT
|
Location:
C5.09
| 13:40-14:00 |
An Unfinished Story: Decidability of IS4 (abstract) 20 min
1 University of Amsterdam, University of Southern Denmark
2 Czech Academy of Sciences
3 University of Birmingham
4 INIRIA, LIX Ecole Polytechnique
|
| 14:00-14:20 |
Second-order Intuitionistic Tense Logic (abstract) 20 min
1 University of Birmingham
|
Location:
B2.02
| 14:00-14:45 |
Coupling Verification and Learning for Safe and Explainable Decision-Making under Uncertainty (abstract) 45 min
1 Brno University of Technology
|
| 14:45-15:00 |
Value Iteration for Stochastic Parity Games (abstract) 15 min
1 National Institute of Informatics
|
| 15:00-15:15 |
Probabilistic Loop Acceleration via a Quantitative Fixpoint Logic (abstract) 15 min
1 Tohoku University, Japan
|
| 15:15-15:30 |
A Hierarchy of Supermartingales for ω-Regular Verification (abstract) 15 min
1 Waseda University
2 Tohoku University
|
Session Chair:
Location:
C4.02
| 14:00-14:25 |
Dependency Pairs for Expected Runtime Complexity of Probabilistic Term Rewriting (abstract) 25 min
1 RWTH Aachen University
|
| 14:25-14:50 |
Towards an HRS Category in TermComp (abstract) 25 min
1 University of Innsbruck
|
| 14:50-15:15 |
An Infinitary Lambda Calculus with Global Trace Condition (Extended Abstract) (abstract) 25 min
1 Università di Torino
2 Toho University
|
| 15:15-15:30 |
termCOMP Part 2 (abstract) 15 min
1 RWTH Aachen University
|
Session Chair:
Location:
C2.02
| 14:00-14:30 |
Advances in Extending the Applicability of Probabilistic Model Checking (abstract) 30 min
1 University of York
|
| 14:30-15:00 |
Synthesis and Verification of Transformer Programs (abstract) 30 min
1 University of Kaiserslautern-Landau and MPI-SWS
|
| 15:00-15:30 |
Probabilistic Timed Automata: Combining Markov Decision Processes and Timed Automata (abstract) 30 min
1 University of Turin
|
Session Chair:
Location:
C1.01
| 14:00-14:30 |
Unsung Heroes -- Assessing Shapley Values of Submissions to FLoC Competitions (abstract) 30 min
1 University of St Andrews
|
| 14:30-15:00 |
Benchmarking behavioural equivalence between Harmony Search and basic Evolution Strategies (abstract) 30 min
1 LIACS, Leiden University
|
| 15:00-15:30 |
SV-LIB 1.0: A Standard Exchange Format for Software-Verification Tasks (abstract) 30 min
1 LMU Munich
|
Session Chair:
Location:
C2.05
| 14:00-14:10 |
Typing Tensor Calculus in 2-Categories (abstract) 10 min
1 Oxford University
|
| 14:10-14:20 |
Transformers are Inherently Succinct (abstract) 10 min
1 RPTU Kaiserslautern-Landau
|
| 14:20-14:30 |
Fast and principled equation discovery from chaos to climate (abstract) 10 min
1 Durham University
|
Session Chair:
Location:
C5.02
| 14:00-14:25 |
GCD: Garbled, Corrected, Demonstrandum - Fixing and Proving Go's Extended GCD Implementation (abstract) 25 min
1 National University of Singapore
|
| 14:25-14:45 |
Proof Obligations Induced by Shared Challenges in Hybrid Fiat-Shamir Signatures (abstract) 20 min
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
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
1 Eindhoven University of Technology
2 University of Porto and INESC TEC
|
Session Chair:
Location:
C5.05
| 14:00-15:00 |
Invited Talk: CHC-Based Reachability Analysis via Cycle Summarization (abstract) 60 min
1 University of Lugano, Switzerland
|
| 15:00-15:30 |
Extended Abstract: Bit-Precise CHC Satisfiability Using Theory-Modular Reasoning (abstract) 30 min
1 Technion - Israel Institute of Technology
|
Session Chair:
Location:
C5.07
| 14:00-15:30 |
Isabelle/Scala systems programming (abstract) 90 min
1 TUM
|
Session Chair:
Location:
C4.05
| 14:00-14:45 |
Invited Talk: Carla Gomes -- Knowledge‑Centric AI for Scientific Discovery (abstract) 45 min
1 Cornell University
|
| 14:45-15:30 |
Invited Talk: Fritz Henglein -- Mining Algebra for Power and Performance (abstract) 45 min
1 University of Copenhagen
|
| 15:30-15:45 |
Achieving Trustworthy Legal AI using Human-Verification (abstract) 15 min
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
1 DARPA
|
Session Chair:
Location:
C4.06
| 14:00-15:00 |
Logic-Based Explainable AI (abstract) 60 min
1 ICREA & University of Lleida
|
Session Chair:
Location:
C6.02
| 14:00-14:30 |
Counting Modulo Theories: Towards a Unified #SMT Toolbox (abstract) 30 min
1 Chennai Mathematical Institute
2 Georgia Institute of Technology
3 Washington University in St. Louis
4 Indian Statistical Institute
|
| 14:30-15:00 |
Counting Complexity of ASP (abstract) 30 min
1 European Space Agency
2 Linköping University
3 None
|
| 15:00-15:30 |
Surveying the Model Counting Competition 2026 (abstract) 30 min
1 Chennai Mathematical Institute
2 Linköping University
3 CNRS
|
Location:
C6.07
| 14:00-14:30 |
Your Next Big Idea Is Just a Few Small Ideas Away (abstract) 30 min
1 UCSD & Code Metal
|
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
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
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
1 Inria
2 Federal Institute of São Paulo
3 King's College London
4 University College London
|
Session Chair:
Location:
C5.01
| 14:00-15:00 |
Invited Talk: From Unified Correspondence to Parametric Correspondence (abstract) 60 min
1 Vrije Universiteit Amsterdam, Netherlands
|
| 15:00-15:30 |
Correspondence Theory for Intuitionistic Lukasiewicz Logic (abstract) 30 min
1 Middlesex University
2 Taishan University
|
Location:
C3.02
| 14:00-14:30 |
Global Trajectory Optimization Competition (GTOC): The Case of GTOC12 (abstract) 30 min
1 Politecnico di Milano
|
| 14:30-14:50 |
A Mixed-Integer Optimization Toolbox for Space Logistics and Mission Planning (abstract) 20 min
1 Georgia Institute of Technology
|
| 14:50-15:10 |
Towards a Continuous-Time Keplerian Travelling Salesman Problem via Dynamic Programming (abstract) 20 min
1 CentraleSupelec
|
| 15:10-15:30 |
Towards Multi-Objective Target Selection for Exoplanet Spectroscopy (abstract) 20 min
1 King´s College London and ML Analytics
2 ML Analytics
|
Location:
C4.07
| 14:00-14:45 |
Termination Resilience Static Analysis (Invited Talk) (abstract) 45 min
1 INRIA
|
| 14:45-15:30 |
An equational axiomatization of dynamic threads (Invited Talk) (abstract) 45 min
1 University of Birmingham
|
Location:
C6.10
| 14:00-14:30 |
The Mathlib Initiative: past, present, and future (abstract) 30 min
1 Mathlib Initiative
|
Session Chair:
Location:
C1.04
| 14:00-14:30 |
Characterizing Sets of Theories That Can Be Disjointly Combined (abstract) 30 min
1 Carnegie Mellon University
2 Bar-Ilan University
|
| 14:30-15:30 |
SMT-LIB Discussion (abstract) 60 min
1 The University of Iowa
|
Location:
C6.08
| 14:00-14:30 |
40 years of Guard Conditions (abstract) 30 min
1 Nantes Université, Inria
2 Inria
3 KU Leuven
|
| 14:30-15:00 |
Camltac: OCaml as a Tactic Language (abstract) 30 min
1 EPFL
|
| 15:00-15:30 |
Towards Robust Programming Interfaces in Rocq (abstract) 30 min
1 ENS de Lyon & Eötvös Loránd University
|
Location:
C5.08
| 14:05-14:25 |
Approaches to Sequent Formalisation of the Logic of Classes (abstract) 20 min
1 University of Lodz
|
Location:
C5.08
| 14:30-15:30 |
Semantic Cut Elimination Proofs for BV and extensions (abstract) 60 min
1 University of Strathclyde
|
Session Chair:
Location:
C6.07
| 14:30-15:30 |
PhD Student Panel (abstract) 60 min
1 CISPA
2 Stanford University
3 TU Wien
|
Location:
C6.10
| 14:30-15:00 |
Formalizing Drinfeld Modules in Lean (abstract) 30 min
1 LMU München
2 Universität Bonn
|
| 15:00-15:20 |
Automated Root Certification in Lean for Transversal Polynomial Systems (abstract) 20 min
1 Indian Institute of Science, Bengaluru
|
Location:
C5.09
| 14:30-15:30 |
A Type-Theoretic Framework For Meta-programming (abstract) 60 min
1 McGill University
|
Session Chair:
Location:
C3.01
| 14:35-14:52 |
Multiple Definitions from a Single Resolution Proof (abstract) 17 min
1 University of Liverpool
|
| 14:52-15:09 |
Structure Analysis in Boolean Functional Synthesis (abstract) 17 min
1 Open University of Israel
|
| 15:09-15:26 |
Reducing Quantum Circuit Synthesis to #SAT (abstract) 17 min
1 Leiden University
2 Artois University, France
|
Location:
C4.08
| 14:40-15:00 |
Towards Continuous Constraint Programming for Sound Neural Network Verification (abstract) 20 min
1 University of Luxembourg
|
| 15:00-15:20 |
IsaGrad: Verified Automatic Differentiation over Computational Graphs in Imperative HOL (abstract) 20 min
1 University of Edinburgh
|
Location:
C5.06
| 15:00-15:20 |
A Proof-Theoretic Treatment of Incorrect/Incomplete Proofs via Hilbert’s Epsilon Calculus (abstract) 20 min
1 TU Wien
|
| 15:20-15:40 |
Double Negation Elimination and the Multiple Succedent Structure of LK (abstract) 20 min
1 University of Sussex
|
| 15:40-16:00 |
Schemata, Cyclic Proofs and Herbrand Systems (abstract) 20 min
1 TU Wien
|
Session Chair:
Location:
C4.06
| 15:00-16:00 |
The (Parameterized) Complexity of Neural Network Trainining (abstract) 60 min
1 TU Wien
|
Session Chair:
Location:
C2.05
| 15:00-15:10 |
Neurosymbolic Auditing of Natural-Language Software Requirements (abstract) 10 min
1 Stevens Institute of Technology
|
| 15:10-15:20 |
Improved Upper Bounds for Slicing the Hypercube (abstract) 10 min
1 TTM Technologies
|
| 15:20-15:30 |
Bisimulation-based reduction of neural network controllers (abstract) 10 min
1 The University of New Mexico
|
Session Chair:
Location:
C1.03
| 15:00-15:15 |
Value Functions as Supermartingale Certificates (abstract) 15 min
1 University of Oxford
2 University of Birmingham
|
| 15:15-15:30 |
Principled Rewriting of ONNX Operators for Reluctant Solvers (abstract) 15 min
1 CEA-List
|
| 15:30-15:45 |
Incremental Invariant-based Safety Verification of Neural Controllers (abstract) 15 min
1 University of the Bundeswehr Munich
|
| 15:45-16:00 |
Faster Optimization of Decision Tree Policies for Markov Decision Processes (abstract) 15 min
1 Delft University of Technology
|
| 16:00-16:15 |
Enhancing the Robustness of Counterfactual Explanations via Adversarial Training (abstract) 15 min
1 Georgia Institute of Technology
2 Imperial College London
|
Location:
C6.01
| 15:10-15:30 |
Carnap Ten Years Later: Lessons Learned and Next Steps (abstract) 20 min
1 Draper Laboratory
|
| 15:30-15:40 |
Learning Formal Foundations of Computer Science with Iltis (abstract) 10 min
1 Ruhr University Bochum
|
| 15:40-15:50 |
A Tutor for Linear Temporal Logic (abstract) 10 min
1 Brown University
2 University of Utah
|
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
1 Naval Postgraduate School
|
| 16:00-16:30 |
Agent Hunt: Bounty Based Collaborative Autoformalization With LLM Agents (abstract) 30 min
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
1 AI4REASON and University of Bonn
2 AI4REASON
|
Location:
C5.01
Location:
C2.01
| 15:45-16:05 |
Contract-Based Architecture Exploration for Efficient Cyber-Physical System Design (abstract) 20 min
1 UC Berkeley
|
| 16:05-16:25 |
Heterogeneous Dynamic Logic: Provability Modulo Program Theories (abstract) 20 min
1 Karlsruhe Institute of Technology (KIT)
|
| 16:25-16:45 |
Towards a computable and compositional semantics of hybrid systems (abstract) 20 min
1 Università di Padova
2 University of Maastricht
3 Università di Verona
|
| 16:45-17:05 |
Taming Big CATs (abstract) 20 min
1 TU Darmstadt
|
| 17:05-17:25 |
Compositional Design of Society-Critical Systems (abstract) 20 min
1 MIT
|
Location:
C4.08
| 15:50-16:10 |
Neural networks as fuzzy logic formulas (abstract) 20 min
1 Tampere University
|
| 16:10-16:30 |
Neural Networks into Łukasiewicz Logic, with Applications to Formal Verification (abstract) 20 min
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
1 University of Sussex
2 London South Bank University
|
Location:
B2.02
| 16:00-16:45 |
Specification-Guided Reinforcement Learning (abstract) 45 min
1 Georgia Institute of Technology
|
| 16:45-17:00 |
Verified Inverse Function Search for Normalizing Flows (abstract) 15 min
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
1 Università degli Studi di Trieste
2 Technical University of Denmark
|
Session Chair:
Location:
C4.02
| 16:00-16:25 |
From Expectations to Moments: Improving Inference of Expected Runtimes (abstract) 25 min
1 RWTH Aachen University
|
| 16:25-16:50 |
Verifying LTL for Infinite State Systems via Termination Analysis (abstract) 25 min
1 RWTH Aachen University
|
| 16:50-17:15 |
Towards an Automated Reasoning Tool for Complexity Analysis of Automated Reasoners (abstract) 25 min
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
1 RWTH Aachen University
2 Université de La Réunion
|
Session Chair:
Location:
C1.01
| 16:00-16:30 |
Benchmarking Crimes I've Witnessed While Writing Subgraph-Finding Algorithms (abstract) 30 min
1 University of Glasgow
|
| 16:30-17:00 |
Leveraging Anytime Analysis for Better MaxSAT Solvers and Beyond (abstract) 30 min
1 LIACS, Leiden University
|
| 17:00-17:30 |
ArchSAT: Enabling SAT Solver Performance Improvement Through Hardware Metric Analysis (abstract) 30 min
1 University of Michigan
2 Ambarella Inc.
|
| 17:30-18:00 |
Analyzing Benchmark Selection Methods (abstract) 30 min
1 Lund University and University of Copenhagen
|
Session Chair:
Location:
C2.05
| 16:00-16:30 |
Advancing Mathematics Research with AI-Powered Formal Proof Search (abstract) 30 min
1 Google DeepMind
|
Session Chair:
Location:
C2.02
| 16:00-16:20 |
Video Tributes (abstract) 20 min
1 University of Virginia
|
| 16:20-17:00 |
Reflection and Closing Remarks (abstract) 40 min
1 University of Oxford
|
Location:
C5.08
| 16:00-16:20 |
Scroll nets: Towards a structural proof theory of Peirce’s existential graphs (abstract) 20 min
1 Charles University
|
| 16:20-16:40 |
Syntax and semantics of focalisation with relative monads and comonads (abstract) 20 min
1 IRIF, INRIA
2 IRIF, INRIA, CNRS
3 INRIA, LS2N CNRS
|
| 16:40-17:00 |
Capturing single conclusions with a subexponential (abstract) 20 min
1 Inria Saclay
|
Session Chair:
Location:
C5.02
| 16:00-16:20 |
Combining Program and Protocol Analysis for Frontrunning Resistance in Smart Contracts (abstract) 20 min
1 MPI-SP
2 MPI-SP, Ruhr University Bochum
|
| 16:20-16:40 |
Renegade: Blockchain Protocols Simplified (abstract) 20 min
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
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
1 Inria Nancy Grand-Est, Université de Lorraine, LORIA
2 Inria
3 Univ. Rennes, CNRS, IRISA
|
Session Chair:
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
1 University of Melbourne
|
| 16:30-17:30 |
Presentation of CHC-COMP Results and Discussion (abstract) 60 min
1 University of Lugano, Switzerland
2 BME-MIT, Hungary
|
Session Chair:
Location:
C5.07
| 16:00-16:30 |
Mechanising Local Rely-Guarantee Reasoning over the seL4 Trace Monad (abstract) 30 min
1 The University of New South Wales
|
| 16:30-17:00 |
Abduction Prover in Isabelle/HOL (abstract) 30 min
1 The Institute of Computer Science, the Czech Academy of Sciences
|
| 17:00-17:15 |
Safe Agentic Workflows for Isabelle (abstract) 15 min
1 King's College London
2 University of Copenhagen
3 University of Sheffield
|
Session Chair:
Location:
C6.02
| 16:00-16:30 |
What Should #SMT Count? (abstract) 30 min
1 Rice University
|
| 16:30-17:00 |
LP-Based Weighted Model Integration over Non-Linear Real Arithmetic (abstract) 30 min
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
1 Czech Technical University in Prague
|
| 17:30-18:00 |
Quantifying Sensitivity for Tree Ensembles: A symbolic and compositional approach (abstract) 30 min
1 IIT Bombay
2 University of Toronto
|
Session Chair:
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
1 Inria & ENS
|
Location:
B2.01
| 16:00-16:30 |
Graph Learning Models for Temporal Gene Expression Prediction and the Role of Interactions Topology (abstract) 30 min
1 University of Pisa
|
| 16:30-17:00 |
Multi-view clustering of transcriptomics and methylomics data elucidates glioma molecular stratification (abstract) 30 min
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
|
Session Chair:
Location:
C5.01
| 16:00-17:00 |
Invited Talk: Proof-Relevant Interpolation: Beyond Cut-Free and Sequent Proofs (abstract) 60 min
1 CNRS, France
|
| 17:00-17:30 |
Using Craig Interpolation for Explanation of Neural Networks (abstract) 30 min
1 University of Lugano
2 Florida State University
3 SUPSI, IDSIA, Lugano
|
Location:
C3.02
| 16:00-16:30 |
Supply Chain Attacks: If the Weakest Link Breaks the Chain (abstract) 30 min
1 TH Lübeck
|
| 16:30-17:00 |
Bridging Optimization and Onboard Decision-Making: Automated Reasoning in Space Systems and Logistics (abstract) 30 min
1 Former Jaxa and iSpace
|
Location:
C4.07
| 16:00-16:45 |
Approximative Fixpoint Theory and Applications to Reinforcement Learning (Invited Talk) (abstract) 45 min
1 University of Duisburg-Essen
|
| 16:45-17:15 |
Basic Lattice Theory for Basic Model Checking (abstract) 30 min
1 National Institute of Informatics
|
Location:
C5.09
| 16:00-16:20 |
Equality of proofs in substructural intuitionistic modal logics (abstract) 20 min
1 Tallinn University of Technology
2 Reykjavik University and Tallinn University of Technology
|
| 16:20-16:40 |
Weak constructive modal logics systematised (abstract) 20 min
1 Free University of Bozen-Bolzano
|
| 16:40-17:00 |
KE-style tableaux for a family of intuitionistic modal logics (abstract) 20 min
1 Instituto de Ciencias de la Computación, CONICET-UBA
2 Licenciatura en Ciencias de la Computación, UBA
3 Departamento de Ciencias de la Computación, UBA
|
Location:
C6.10
| 16:00-16:30 |
The Curious Case of Sphere Packing in Lean (abstract) 30 min
1 Carnegie Mellon University
|
Session Chair:
Location:
C1.04
| 16:00-17:00 |
SMT-COMP Presentation (abstract) 60 min
1 University of Manchester
|
| 17:00-17:30 |
Business Meeting (abstract) 30 min
1 Universidade Federal de Minas Gerais
|
Location:
C6.08
| 16:00-16:30 |
An Attempt at Necromancy – Experience Report on Modernising a Domain Theory Library (abstract) 30 min
1 INRIA
|
| 16:30-17:00 |
Certified JSON Derivers with ELPI (abstract) 30 min
1 University of Kansas
|
Location:
C5.06
| 16:20-16:40 |
Improving Model Finding in Quantified Modal Logics (abstract) 20 min
1 University of Greifswald
|
| 16:40-17:00 |
Argumentation Based Dialogue Games for Deontic Explanations with Uncertainty (abstract) 20 min
1 TU Wien
|
| 17:00-17:20 |
Structural Dynamic Proof Theory for Public Announcement Logic (abstract) 20 min
1 IRIT, University of Toulouse, IHPST, University Paris 1 Panthéon Sorbonne
|
Session Chair:
Location:
C2.05
| 16:30-16:40 |
A Rust-to-Lean Verification Pipeline with AI Provers: An Experience Report (abstract) 10 min
1 Runtime Verification
|
| 16:40-16:50 |
CovCal: Risk-Controlled Lean-as-Judge for Natural-Language Mathematical Reasoning (abstract) 10 min
1 Imperial College
|
| 16:50-17:00 |
LeanPolish: A Kernel-Verified Dataset and Symbolic Compression Framework for Lean 4 Proofs (abstract) 10 min
1 Imperial College
|
| 17:00-17:10 |
ProofBridge: Auto-Formalization of Natural Language Proofs in Lean via Joint Embeddings (abstract) 10 min
1 Georgia Tech
|
Session Chair:
Location:
C4.05
| 16:30-17:00 |
Panel discussion: Relationships between Formal Models and Data-Centric Computing (abstract) 30 min
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
1 DARPA
|
| 17:15-17:20 |
Closing (abstract) 5 min
1 Vrije Universiteit Brussel
2 Stonybrook University
|
Session Chair:
Location:
C6.07
| 16:30-17:30 |
Researchers Panel (abstract) 60 min
1 UCSD and Code Metal
2 Huawei R&D
3 Technion
4 The University of Melbourne
5 Inria & ENS
6 Universität Bremen
|
Location:
C6.10
| 16:30-17:00 |
Formalizing Wu-Ritt Method in Lean 4 (abstract) 30 min
1 Shandong University
2 Academy of Mathematics and Systems Science
3 Sun Yat-sen University
|
Session Chair:
Location:
C3.01
| 16:45-17:02 |
Maximizing Independence in Auction-Based Scheduling via Successive Refinement (abstract) 17 min
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
1 University of Liverpool
|
Session Chair:
Location:
C2.05
| 17:10-18:00 |
Panel: How should CAV researchers respond to AI progress? (abstract) 50 min
1 Brown University
2 Rice University
3 MIT
4 UT Austin
|
Location:
C5.07
| 17:15-18:00 |
Exercises and Questions on Isabelle/ML and Isabelle/Scala programming (abstract) 45 min
1 UCPH
2 TUM
|
Session Chair:
Location:
C3.01
| 17:20-17:37 |
NSynC: Normalised Synthesis of Computation (abstract) 17 min
1 University of Edinburgh
|
| 17:37-17:54 |
Liquify your Programs (abstract) 17 min
1 IIT Hyderabad
|
Sunday, 26 July 2026
Location:
Grande Auditório
| 08:45-10:00 |
The Lean Theorem Prover: Design, Evolution, and Impact (abstract) 75 min
|
Location:
Grande Auditório
| 08:45-10:00 |
The Lean Theorem Prover: Design, Evolution, and Impact (abstract) 75 min
|
Location:
Grande Auditório
| 08:45-10:00 |
The Lean Theorem Prover: Design, Evolution, and Impact (abstract) 75 min
|
Location:
Grande Auditório
| 08:45-10:00 |
The Lean Theorem Prover: Design, Evolution, and Impact (abstract) 75 min
|
Location:
Grande Auditório
| 08:45-10:00 |
The Lean Theorem Prover: Design, Evolution, and Impact (abstract) 75 min
|
Location:
Grande Auditório
Session Chair:
Location:
B2.03
| 10:30-10:54 |
Optimizing Differential Privacy in Federated Analytics under Known Input Distributions (abstract) 24 min
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
1 Duke University
2 TikTok Inc
|
| 11:18-11:42 |
Bayesian Advantage of Re-Identification Attack in the Shuffle Model (abstract) 24 min
1 Peking University
|
| 11:42-12:06 |
Privacy Mechanism Design based on Empirical Distributions (abstract) 24 min
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
1 Hebei University
|
Session Chair:
Location:
Grande Auditório
| 10:30-10:45 |
On the Complexity of Checking Soundness of Natural Reductions (abstract) 15 min
1 LIX - CNRS - Ecole Polytechnique
2 University of Toronto
|
| 10:45-11:00 |
Deadlock Verification via Ordering-Constrained Mutex Modeling (abstract) 15 min
1 Tsinghua University
|
| 11:00-11:15 |
Complete Local Reasoning About Parameterized Programs Over Topologies (Distinguished Paper) (abstract) 15 min
1 University of Toronto
|
| 11:15-11:30 |
Scalable Deductive Verification of Data-Level Parallel Programs (abstract) 15 min
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
1 Uppsala University
2 The Institute of Mathematical Sciences, Chennai
|
| 11:45-11:55 |
Model Checking for Flexible Network Protocols (abstract) 10 min
1 Princeton University
2 Google, Inc
|
| 11:55-12:05 |
The TLA+ Model Checker Apalache (abstract) 10 min
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
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
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
1 LIACS, Leiden University
|
Session Chair:
Location:
B1.04
| 11:00-11:30 |
Complex Bounded Operators in Isabelle/HOL (abstract) 30 min
1 RWTH Aachen, University of Tartu
2 Mathématiques et statistique – Faculté des sciences et de génie – Université Laval
|
| 11:30-12:00 |
Lean Formalization of Generalization Error Bound by Rademacher Complexity and Dudley's Entropy Integral (abstract) 30 min
1 RIKEN AIP
2 OMRON SINIC X Corporation
3 University College Cork
4 The University of Tokyo
5 CyberAgent Inc
|
Session Chair:
Location:
B2.04
| 11:00-11:20 |
A Deductive Refinement Calculus for Differential-Algebraic Programs (abstract) 20 min
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
1 Karlsruhe Institute of Technology
|
| 11:40-12:00 |
Complete Robust Hybrid Systems Reachability (abstract) 20 min
1 Karlsruhe Institute of Technology
|
Location:
Grande Auditório
Session Chair:
Location:
Grande Auditório
| 14:00-14:15 |
Randomise Alone, Reach Together (abstract) 15 min
1 Institute of Science and Technology Austria
|
| 14:15-14:30 |
Decoupled Planning for Multiple Omega-Regular Objectives (abstract) 15 min
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
1 NTT Social Informatics Laboratories
2 Waseda University
|
| 14:45-15:00 |
Liquid Tree Automata (abstract) 15 min
1 Indian Institute of Technology Hyderabad
2 Purdue University
|
| 15:00-15:10 |
SemML 2.0: Synthesizing Controllers from LTL (abstract) 10 min
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
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
1 Dedaub
2 TU Wien
3 University of Gothenburg, Chalmers University of Technology
|
Session Chair:
Location:
B2.03
| 14:00-14:24 |
A new measure for dynamic leakage based on quantitative information flow (abstract) 24 min
1 UFMG and Macquarie University
2 UFMG
3 Macquarie University
|
| 14:24-14:48 |
Information Leakage Envelopes (abstract) 24 min
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
1 Institut Polytechnique de Paris
2 Macquarie University
3 ETS Montréal
4 Inria
5 Universidade Federal de Minas Gerais
|
Session Chair:
Location:
B1.04
| 14:00-14:30 |
Certified Intersection of Commutative Regular Expressions as Solutions of Systems of Linear Diophantine Equations (abstract) 30 min
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
1 INRIA
2 PQShield
|
| 15:00-15:30 |
Verification of the Garsia–Wachs Algorithm (abstract) 30 min
1 Hosei University
|
Session Chair:
Location:
B2.04
| 14:00-14:20 |
Accelerating Loops with Arrays (abstract) 20 min
1 RWTH Aachen University
|
| 14:20-14:40 |
Saving Craig in the Fluted Fragment (abstract) 20 min
1 Central European University
|
Session Chair:
Location:
B2.04
| 14:40-14:50 |
Presentation of the Best Paper Award (abstract) 10 min
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
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
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
1 Carnegie Mellon University
|
| 15:50-16:00 |
Presentation of the Herbrand Award (abstract) 10 min
1 Microsoft Research
2 University of Ottawa
3 Radboud University Nijmegen
4 University of Brasília
5 University of Iowa
6 University of Miami
|
Location:
Grande Auditório
Session Chair:
Location:
Grande Auditório
| 16:00-16:15 |
A-IC3: Learning-Guided Adaptive Inductive Generalization for Hardware Model Checking (abstract) 15 min
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
1 University College London
2 Imperial College London
|
| 16:30-16:45 |
Massively Parallel Mining of Specifications for Hardware Designs (abstract) 15 min
1 University of Edinburgh
|
| 16:45-17:00 |
A mechanised, bidirectional type system for bit-width determination in SystemVerilog (abstract) 15 min
1 École normale supérieure – PSL
2 Imperial College London
|
Session Chair:
Location:
B2.03
| 16:00-16:24 |
Formal Verification of Probing Security via Conditional Independence (abstract) 24 min
1 Waseda University
|
| 16:24-16:48 |
Triosecuris: Formally Verified Protection Against Speculative Control-Flow Hijacking (abstract) 24 min
1 MPI-SP
2 MPI-SP and Ruhr University Bochum
3 MPI-SP and Portland State University
|
Session Chair:
Location:
B1.04
| 16:30-17:00 |
Title: Fractional Separation Logic in Isabelle/LLVM (abstract) 30 min
1 University of Twente
|
| 17:00-17:30 |
Lazy Proof Automation for Separation Logic (abstract) 30 min
1 National University of Singapore
|
| 17:30-18:00 |
Formalizing a Hoare Calculus for Choreographic Programming (abstract) 30 min
1 IT University of Copenhagen
2 Independent Researcher
|
Location:
Pátio da Galé
Location:
Pátio da Galé
Location:
Pátio da Galé
Location:
Pátio da Galé
Location:
Pátio da Galé
Monday, 27 July 2026
Session Chair:
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
1 McGill University, Montreal, Canada
|
Session Chair:
Location:
B1.04
| 09:00-10:00 |
Nitro Isolation Engine: Formally Verifying a Production Hypervisor (abstract) 60 min
1 AWS
|
Location:
B2.03
| 09:00-10:00 |
Analyzing the Security of Privacy Preserving Systems Built from Ideal Cryptographic Functionalities (abstract) 60 min
1 ETH Zurich
|
Session Chair:
Location:
Grande Auditório
| 09:00-10:00 |
Deriving Test Oracles for Verification Infrastructure (abstract) 60 min
1 TU Wien, Austria
|
Location:
Grande Auditório
| 10:00-10:30 |
The CADE ATP System Competition (abstract) 30 min
1 University of Miami
|
| 10:30-11:00 |
The ProoVer 2026 Competition (abstract) 30 min
1 University of Lorraine & Inria
2 EPFL
|
Session Chair:
Location:
B2.03
| 10:30-10:54 |
Beyond the Finite Variant Property: Extending Symbolic Diffie-Hellman Group Models (abstract) 24 min
1 ETH Zürich
|
| 10:54-11:18 |
Tamarin Unchained: Handling User-Defined AC Operators (abstract) 24 min
1 Université de Lorraine, CNRS, Inria, LORIA
|
| 11:18-11:42 |
Incremental Fingerprinting in an Open World (abstract) 24 min
1 Radboud University
2 University of Oslo
|
| 11:42-12:06 |
Mind the Gap -- Connecting Protocol Representations in Squirrel (abstract) 24 min
1 Univ Rennes, CNRS, IRISA
|
| 12:06-12:30 |
Verifying and Monitoring the Lightweight Directory Access Protocol (LDAP) (abstract) 24 min
1 University of Bamenda
2 CISPA Helmholtz Center for Information Security
|
Session Chair:
Location:
Grande Auditório
| 10:30-10:45 |
Differentially Private Runtime Monitoring (abstract) 15 min
1 CISPA Helmholtz Center for Information Security
|
| 10:45-11:00 |
HyperLasso: Bounded Model Checking of ∀+∃+-Liveness Hyperproperties (abstract) 15 min
1 Universidade do Minho & INESC TEC
|
| 11:00-11:10 |
The Simulator’s Blueprint: Automata Learning from Cybersecurity Logs (abstract) 10 min
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
1 Michigan State University
|
Session Chair:
Location:
B1.04
| 11:00-11:30 |
Automated Verification of Robot Software Models with Assume-Guarantee Reasoning in Isabelle/HOL (abstract) 30 min
1 University of York
2 Université Paris-Saclay
|
| 11:30-12:00 |
Formally Verified Liveness with Multiparty Session Types in Rocq (abstract) 30 min
1 University of Edinburgh
2 University of Oxford
|
Session Chair:
Location:
B2.04
| 11:00-11:20 |
Unification of Deterministic Higher-Order Patterns (abstract) 20 min
1 University of Innsbruck
|
| 11:20-11:40 |
Automating proof search when equality is a logical connective (abstract) 20 min
1 Inria-Saclay & LIX
2 IPP
|
| 11:40-11:50 |
SMT-Based Deontic Reasoning for Aqvist Logics (abstract) 10 min
1 TU Wien
|
| 11:50-12:00 |
grind: An SMT-Inspired Tactic for Lean 4 (abstract) 10 min
1 Lean FRO
2 Amazon Web Services, and Lean FRO
|
Session Chair:
Location:
Grande Auditório
| 11:20-11:35 |
Improving Stability of SMT Solvers via Context-Driven Normalization (abstract) 15 min
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
1 Stanford University
|
| 11:50-12:05 |
String Solving with Stabilization and Transducers (abstract) 15 min
1 Brno University of Technology
2 Aalborg University
|
| 12:05-12:20 |
Lagrangian-Based Duality for Quantified SMT Algorithms (abstract) 15 min
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
1 Karlsruhe Institute of Technology
|
Location:
Grande Auditório
Session Chair:
Location:
Grande Auditório
| 14:00-14:15 |
Modular Reasoning about Object Relations (Distinguished Paper) (abstract) 15 min
1 ETH Zurich
|
| 14:15-14:30 |
Formally Verified Linear-Time Invertible Lexing (abstract) 15 min
1 EPFL
|
| 14:30-14:45 |
Automating Bitvector and Finite Field Equivalence Proofs in Lean (abstract) 15 min
1 Stanford University
2 Galois, Inc.
|
| 14:45-15:00 |
The Cooperating Proof Calculus: Comprehensive Proofs for an SMT Solver (abstract) 15 min
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
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
1 National University of Singapore
2 Neapolis University Pafos
|
| 15:20-15:30 |
Automatic Heap-Memory Diagrams for Separation-Logic Proofs (abstract) 10 min
1 EPFL
|
Session Chair:
Location:
B2.03
| 14:00-14:24 |
Are ideal functionalities really ideal? (abstract) 24 min
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
1 University of Warsaw and IDEAS Institute
2 University of Warsaw
3 UCSD
|
| 14:48-15:12 |
Mechanizing Nested Hybrid Arguments (abstract) 24 min
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
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
1 Masaryk University
2 Tallinn University of Technology, Input Output
|
Session Chair:
Location:
B1.04
| 14:00-14:30 |
ProofWala: A Framework for Multilingual Proof Data Synthesis and Theorem-Proving (abstract) 30 min
1 University of Texas at Austin
2 New York University
|
| 14:30-15:00 |
Feedback & Synthesis in LLM-Assisted Termination Proofs (abstract) 30 min
1 Northeastern University
|
| 15:00-15:30 |
LeanArchitect: Automating Blueprint Generation for Humans and AI (abstract) 30 min
1 Carnegie Mellon University
2 University of Trento
|
Session Chair:
Location:
B2.04
| 14:00-14:20 |
A Unified Formalization of Context-Free Grammar Theory (abstract) 20 min
1 Technical University of Munich
2 AIST
|
| 14:20-14:40 |
Towards Term-based Verification of Diagrammatic Equivalence (abstract) 20 min
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
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
1 TU Wien
|
| 15:20-15:40 |
Semantics for Dependently-Typed Higher-Order Logic (abstract) 20 min
1 FAU Erlangen-Nürnberg
|
| 15:40-16:00 |
Growing HOLMS: A Verified Automated Prover for Grzegorczyk Logic in HOL Light (abstract) 20 min
1 Scuola Normale Superiore di Pisa
2 University of Florence
3 IMT School for Advanced Studies Lucca
|
Location:
Grande Auditório
Session Chair:
Location:
Grande Auditório
| 16:00-16:15 |
An L# Based Algorithm for Active Learning of Minimal Separating Automata (abstract) 15 min
1 Radboud University
|
| 16:15-16:30 |
Upper Bound for the Determinization of Emerson-Lei Automata: A One-Fin Approach (abstract) 15 min
1 ICTT and ISN Laboratory, Xidian University
|
| 16:30-16:45 |
SMT-Based Active Learning of Weighted Automata (abstract) 15 min
1 University College London
2 Cornell University
|
| 16:45-17:00 |
Compositional Verification of Timed Automata via Violation Assumptions (abstract) 15 min
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
1 University of Warsaw
|
| 17:15-17:30 |
Synthesizing POMDP Policies: Sampling Meets Model-checking via Learning (abstract) 15 min
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
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
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
|
Session Chair:
Location:
B2.04
| 16:30-16:50 |
Disproving (Positive) Almost-Sure Termination of Probabilistic Term Rewriting via Random Walks (abstract) 20 min
1 RWTH Aachen University
|
| 16:50-17:10 |
Complexity and Expressivity of the Uniform Fluted Fragment (abstract) 20 min
1 Central European University
|
| 17:10-17:30 |
Complexity of reasoning in Kleene algebra with sum-of-letters hypotheses (abstract) 20 min
1 Steklov Mathematical Institute of RAS
2 HSE University
|
| 17:30-17:50 |
Learning Computation Tree Logic with Neural Networks (abstract) 20 min
1 Université Libre de Bruxelles
2 TU Dortmund University
|
| 17:50-18:10 |
Toward Fast Automatic Verification of Textbook Proof Steps (abstract) 20 min
1 Charles University
|
| 18:10-18:20 |
Implementing Fuzzy OSF Logic Unification and Normalization (abstract) 10 min
1 University of Milano-Bicocca
|
| 18:20-18:30 |
Presentation of the Termination Competition (termCOMP) Results (abstract) 10 min
1 RWTH Aachen
2 University of Innsbruck
3 Université de La Réunion
4 National Institute of Informatics
5 ASW Saarland
|
Session Chair:
Location:
B2.03
| 16:30-16:54 |
Dolev-Yao Information Flow (abstract) 24 min
1 Technical University of Denmark
2 DTU
|
| 16:54-17:18 |
Partial Cast Calculus for Gradual Information Security (abstract) 24 min
1 Shenzhen University
2 Xidian University
|
| 17:18-17:42 |
Cryptographic Choreographies (abstract) 24 min
1 DTU
2 Technical University of Denmark
3 ITU
|
Session Chair:
Location:
B1.04
| 16:30-17:00 |
Formalizing the Bruck-Ryser-Chowla Theorem: Combinatorial Design Theory in Lean (abstract) 30 min
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
1 Massachusetts Institute of Technology
|
| 17:20-17:40 |
Formal Primal-Dual Algorithm Analysis (Short Paper) (abstract) 20 min
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
1 AI4REASON and University of Gothenburg
|
Location:
B1.04
| 18:00-19:00 |
Future of ITP Conference Series & Gen AI (discussion panel) (abstract) 60 min
1 Southampton
2 Munich
|
Session Chair:
Location:
Grande Auditório
| 18:00-19:00 |
Proof Against Attack: Can AI Help Build Software We Can Trust? (abstract) 60 min
1 Advanced Research and Invention Agency
|
Location:
Lago Lisboa
| 19:30-20:30 |
Social Event Sponsored by Renaissance Philantropy (abstract) 60 min
1 renaissancephilanthropy
|
Tuesday, 28 July 2026
Location:
Grande Auditório
| 08:45-10:00 |
Trustworthy Neuro-Symbolic Programming with Informal Specifications (abstract) 75 min
|
Location:
Grande Auditório
| 08:45-10:00 |
Trustworthy Neuro-Symbolic Programming with Informal Specifications (abstract) 75 min
|
Location:
Grande Auditório
| 08:45-10:00 |
Trustworthy Neuro-Symbolic Programming with Informal Specifications (abstract) 75 min
|
Location:
Grande Auditório
| 08:45-10:00 |
Trustworthy Neuro-Symbolic Programming with Informal Specifications (abstract) 75 min
|
Location:
Grande Auditório
| 08:45-10:00 |
Trustworthy Neuro-Symbolic Programming with Informal Specifications (abstract) 75 min
|
Location:
Grande Auditório
Session Chair:
Location:
Grande Auditório
| 10:30-10:45 |
VNN-LIB 2.0: Rigorous Foundations for Neural Network Verification (abstract) 15 min
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
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
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
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
1 Kyushu University
|
| 11:45-12:00 |
Quantifying Sensitivity for Tree Ensembles : A symbolic and compositional approach (abstract) 15 min
1 IIT Bombay
2 University of Toronto
|
| 12:00-12:15 |
Shields to Guarantee Probabilistic Safety in MDPs (abstract) 15 min
1 Radboud University
2 Brno University of Technology
|
| 12:15-12:25 |
A Neurosymbolic Approach to Natural Language Formalization and Verification (abstract) 10 min
1 Amazon Web Services
2 Amazon Web Services, University College London
3 University of Toronto
|
Session Chair:
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
1 The University of Edinburgh
2 University of Glasgow
|
| 10:54-11:18 |
Setup Protocols for Sender Anonymity (abstract) 24 min
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
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
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
1 INSA Centre Val de Loire, Inria
2 Lancaster University
3 Royal Holloway, University of London
|
Session Chair:
Location:
B1.04
| 11:00-11:30 |
Don't Sweat Interaction Trees: Proof-Guided Local Variable Lifting for Interaction Trees (abstract) 30 min
1 Portland State University
|
| 11:30-12:00 |
Bidirectional Interpolation for the Lambda-Calculus – Revisiting and Formalising Craig-Čubrić Interpolation (abstract) 30 min
1 Université Paris Cité, INRIA, CNRS, IRIF
2 Université Paris Cité, CNRS, INRIA, IRIF
|
Session Chair:
Location:
B2.04
| 11:00-11:20 |
Finite Model Finding in First-order Modal Logics (abstract) 20 min
1 University of Greifswald
2 University of Miami
|
| 11:20-11:40 |
Completeness of Synthesis under Realizability Assumptions using Superposition (abstract) 20 min
1 TU Wien
|
| 11:40-11:50 |
Hardware Model Checking Certification with Certifaiger and Cerbtora (abstract) 10 min
1 KU Leuven
2 Leiden University
|
| 11:50-12:00 |
Pgeon: Generating Tableau-Based Provers from Declarative Specifications of Logical Calculi (abstract) 10 min
1 LIRMM, Univ Montpellier, CNRS, Montpellier, France
|
Location:
Grande Auditório
Session Chair:
Location:
Grande Auditório
| 13:45-14:45 |
Invited talk by CAV Award awardees (abstract) 60 min
1 na
|
Session Chair:
Location:
B2.03
| 14:00-14:24 |
A Composable Game-Theoretic Framework for Blockchains (abstract) 24 min
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
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
1 Sapienza University of Rome
|
| 15:12-15:36 |
Revisiting Beimel-Weinreb Weighted Threshold Secret Sharing Schemes (abstract) 24 min
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
1 Lombard International (part of Utmost Group)
|
Session Chair:
Location:
B1.04
| 14:00-14:30 |
Enhancing Interactive Theorem Prover Error Messages with Hints (abstract) 30 min
1 Delft University of Technology
|
| 14:30-15:00 |
Formalization of a Realistic Verification-Condition Generator for an Intermediate Verification Language (abstract) 30 min
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
1 McMaster University
|
Session Chair:
Location:
B2.04
| 14:00-14:20 |
On Constructing Most General Solutions for Parametric Constraints (abstract) 20 min
1 University of Koblenz
|
| 14:20-14:40 |
Generating Theorems by Generating Proof Structures (abstract) 20 min
1 University of Potsdam
|
| 14:40-15:00 |
Beyond Eager Encodings: A Theory-Agnostic Approach to Theory-Lemma Enumeration in SMT (abstract) 20 min
1 University of Trento
2 Rice University
|
| 15:00-15:20 |
A Superposition Calculus for Separation Logic (abstract) 20 min
1 LMU Munich
2 CNRS LIG
|
| 15:20-15:40 |
Twitch: Learning Abstractions for Equational Theorem Proving (abstract) 20 min
1 Chalmers University of Technology
|
| 15:40-16:00 |
Tao’s Equational Proof Challenge Accepted (abstract) 20 min
1 Ludwig-Maximilians-Universität München
2 Carnegie Mellon University
|
Session Chair:
Location:
Grande Auditório
| 14:50-15:05 |
Liveness Proofs for Hardware Model Checking (Distinguished Paper) (abstract) 15 min
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
1 LMU Munich
|
| 15:20-15:30 |
KoAT: Automatic Complexity and Termination Analysis of Integer Programs (abstract) 10 min
1 RWTH Aachen University
|
Location:
Grande Auditório
Session Chair:
Location:
Grande Auditório
| 16:00-16:15 |
Sound and Precise Symbolic Automata Model for Stateful Software Systems (abstract) 15 min
1 Nanjing University
2 Zhejiang University
|
| 16:15-16:30 |
Automated Amortised Analysis of Skew Heaps and Leftist Heaps (abstract) 15 min
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
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
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
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
1 The University of Tokyo
|
Session Chair:
Location:
B2.04
| 16:30-16:50 |
An Applicative Multiset Path Order (abstract) 20 min
1 JAIST
|
| 16:50-17:00 |
The ARI Infrastructure for Automated Confluence Analysis (abstract) 10 min
1 JAIST
2 University of Innsbruck
|
Session Chair:
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
1 National Taiwan University
|
| 16:54-17:18 |
Towards Strong Certified Defense with Universal Asymmetric Randomization (abstract) 24 min
1 University of Connecticut
2 Cisco
3 Illinois Institute of Technology
|
| 17:18-17:42 |
LAP₂: Revisiting Laplace DP-SGD for High Dimensions via Majorization Theory (abstract) 24 min
1 Iowa State University
2 University of Connecticut
3 University of Kansas
|
Session Chair:
Location:
B1.04
| 16:30-16:50 |
A Lean Tactic for Normalizing Expressions in an Algebra over a Ring (Short Paper) (abstract) 20 min
1 University of Bonn
|
| 16:50-17:10 |
Lean on Vampire Proofs (Short Paper) (abstract) 20 min
1 TU Wien
2 University of Southampton
|
| 17:10-17:40 |
TableauxRocq: A Deep Embedding of Free-Variable Tableaux in Rocq (abstract) 30 min
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
1 University of Edinburgh
|
Location:
Grande Auditório
Location:
Pavilhão Carlos Lopes
Location:
Pavilhão Carlos Lopes
Location:
Pavilhão Carlos Lopes
Location:
Pavilhão Carlos Lopes
Location:
Pavilhão Carlos Lopes
Wednesday, 29 July 2026
Session Chair:
Location:
B2.04
| 09:00-10:00 |
Polynomial-time Deduction with Orthologic (abstract) 60 min
1 EPFL, Lausanne, Switzerland
|
Session Chair:
Location:
Grande Auditório
| 09:00-10:00 |
Formally Explaining Neural Networks (abstract) 60 min
1 Hebrew University of Jerusalem
|
Session Chair:
Location:
B1.04
| 09:00-10:00 |
Developing a quantum crypto theorem prover from scratch (abstract) 60 min
1 Aachen
|
Session Chair:
Location:
B2.03
| 09:00-09:24 |
On the design of Survivable Distributed Passwordless Authentication and Single Sign-On (abstract) 24 min
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
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
1 University of Sheffield
|
Location:
Grande Auditório
Session Chair:
Location:
Grande Auditório
| 10:30-10:45 |
Consistency-Based Software Diagnosis: Accuracy, Scalability, and Limitations (abstract) 15 min
1 TU Wien
2 Monash University
|
| 10:45-10:55 |
Show Me The Money: An Exercise in Proof-Driven Software Understanding (abstract) 10 min
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
1 LMU Munich
|
| 11:05-11:15 |
PyCHC: a Framework for Certified Horn Solving and CHC-based Design (abstract) 10 min
1 University of Lugano
2 Argot Collective
3 University of Groningen
|
Session Chair:
Location:
B2.03
| 11:00-11:24 |
A unified compositional view of attack tree metrics (abstract) 24 min
1 University of Twente
|
| 11:24-11:48 |
Active Cyber Defense Strategy through Multi-Agent Systems Verification (abstract) 24 min
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
1 University of Twente
|
Session Chair:
Location:
B1.04
| 11:00-11:30 |
Completing Almost Fair Simulations (abstract) 30 min
1 CISPA Helmholtz Center for Information Security
|
| 11:30-12:00 |
Certified Infinite Descent Criteria in Isabelle/HOL (abstract) 30 min
1 University of Sheffield
2 Ben-Gurion University of the Negev
3 Royal Holloway University of London
|
Session Chair:
Location:
B2.04
| 11:00-11:20 |
A General Approach for SMT Proof Skeletons (abstract) 20 min
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
1 Télécom SudParis
2 ensIIE
|
| 11:40-11:50 |
Checking Regular Expressions in cvc5 Proofs (abstract) 10 min
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
1 University of Iowa
2 Universidade Federal de Minas Gerais
3 Stanford University
|
Session Chair:
Location:
Grande Auditório
| 11:15-11:30 |
How Many Circuit Identities Are Needed to Generate All Others? (abstract) 15 min
1 Purdue University
2 Stony Brook University
|
| 11:30-11:45 |
A Practical Specification Language for Automatic Quantum Program Verification (abstract) 15 min
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
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
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
1 Aalborg University
|
| 12:25-12:35 |
Quokka#: Quantum Computing with #SAT (abstract) 10 min
1 Leiden University
2 Delft University of Technology, Leiden University
3 Delft University of Technology
|
Location:
Grande Auditório
Session Chair:
Location:
B2.04
| 13:30-13:50 |
The termination of Nielsen transformations applied to word equations with length constraints (abstract) 20 min
1 Carnegie Mellon University
2 Stanford University
|
| 13:50-14:10 |
Bringing closure to theory combination properties (abstract) 20 min
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
1 University of Lodz
|
| 14:30-14:50 |
Avoiding Big Integers: Parallel Multimodular Algebraic Verification of Arithmetic Circuits (abstract) 20 min
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
1 Max Planck Institute for Informatics
|
| 15:10-15:30 |
Verification of Configurable SRA Systems (abstract) 20 min
1 Fondazione Bruno Kessler
|
Session Chair:
Location:
Grande Auditório
| 14:00-14:15 |
Over-approximation of weakly-hard constraints for control systems verification (abstract) 15 min
1 Saarland University
|
| 14:15-14:30 |
Spatiotemporal Robustness of Temporal Logic Tasks using Multi-Objective Reasoning (abstract) 15 min
1 ETH Zürich
|
| 14:30-14:45 |
Best-Effort Safety Control of Multi-Mode Systems (abstract) 15 min
1 University of Naples, Italy
|
| 14:45-15:00 |
Perception with Guarantees: Certified Pose Estimation via Reachability Analysis (abstract) 15 min
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
1 University of Waterloo
|
| 15:15-15:30 |
Fast Computation of Conditional Probabilities in MDPs and Markov Chain Families (abstract) 15 min
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
1 NVIDIA
|
| 15:40-15:50 |
Caesar: A Deductive Verifier for Probabilistic Programs (abstract) 10 min
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
1 University of York
|
Session Chair:
Location:
B1.04
| 14:00-14:30 |
Formalizing Abstract Simplicial Complexes & Stellar Subdivisions in Lean (abstract) 30 min
1 University of Connecticut
2 Universität Regensburg
|
| 14:30-15:00 |
From Weierstraß to Dedekind: Formalising Foundations of Modular Forms (abstract) 30 min
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
1 Carnegie Mellon University
|
Session Chair:
Location:
B2.04
| 16:00-16:20 |
Proof Nets for PiL (abstract) 20 min
1 University of Southern Denmark
|
| 16:20-16:40 |
Ordered Adjoint Logic (abstract) 20 min
1 Carnegie Mellon University
|
| 16:40-17:00 |
A Complete Proof System for HyperLTL (abstract) 20 min
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
1 The Technion
2 Tel Aviv University
|
| 17:20-17:40 |
Uniform interpolation with constructive diamond (abstract) 20 min
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
1 IIT Bombay
2 University of California Berkeley
3 The Institute of Mathematical Sciences
|
Location:
Grande Auditório
Session Chair:
Location:
B1.04
| 16:30-17:00 |
Securing the Foundations of an Intermediate Language for Probabilistic Program Verification (abstract) 30 min
1 Technical University of Denmark
2 University of Oldenburg and Technical University of Denmark
|
| 17:00-17:30 |
Apply2Isar: Automatically Converting Isabelle/HOL Apply-Style Proofs to Structured Isar (abstract) 30 min
1 University of Iowa
2 Stanford University
|
| 17:30-18:00 |
String diagrams for monoidal categories, in Rocq (abstract) 30 min
1 ENS de Lyon
|