Program for Sunday, July 31st: Talk View

PROGRAM FOR SUNDAY, JULY 31ST: TALK VIEW

Days:

next day

all days

View: with abstracts session overview

8:30

9:00

9:30

10:00

10:30

11:00

11:30

12:00

12:30

13:00

13:30

14:00

14:30

15:00

15:30

16:00

16:30

17:00

17:30

18:00

18:30

19:00

19:30

20:00

20:30

21:00

21:30

22:00

22:30

09:00-10:30

Tutorial: Belief Change, Ontology Repair and Evolution (Part 1)

Renata Wassermann

09:00-10:00

Decidability Questions beyond Satisfiability for First-order Modal Logics

Frank Wolter

09:00-10:30

DatalogMTL

Przemysław Wałęga

09:00-10:30

Why Robust Natural Language Understanding is a Challenge

Casadio, Komendantskaya, Rieser, Daggitt, Kienitz, Arnaboldi, Kokke

09:00-10:30

An Abstraction-Refinement Approach to Verifying Convolutional Neural Networks

Matan Ostrovsky, Clark Barrett, Guy Katz

09:00-10:30

Neural Networks in Imandra: Matrix Representation as a Verification Choice

Remi Desmartin, Grant Passmore, Ekaterina Komendantskaya

09:00-10:30

Inversion and Determinization in Term Rewriting

Naoki Nishida

09:00-10:30

RLooP (the Rewriting List of open Problems)

Jörg Endrullis

09:00-10:30

Why and how to teach logic for CS undergraduates

Johann Makowsky

09:00-10:30

How to teach logic for CS-undergraduate? Step-by-step!

Elena Bunina

09:00-09:40

Constraint modelling and solving: Learning from observing people

Ruth Hoffmann

09:00-10:30

Welcome and Introduction

Sebastian Ordyniak

09:00-10:30

TBA

Saket Saurabh

09:00-09:50

On the unusual effectiveness of automata in logic

Pierre Wolper

09:00-10:30

Embedding Quantitative Properties of Call-by-Name and Call-by-Value into Call-by-Push-Value

Delia Kesner

09:00-10:30

The essence of type-theoretic elaboration

Anja Petković Komel

09:00-10:30

Invited Talk: Explaining and Arguing with Facts and Rules

Fabio Cozman

09:00-10:30

Using Abstraction for Interpretable Robot Programs in Stochastic Domains

Till Hofmann, Vaishak Belle

09:15-10:30

First-Order Logic Workbook

Kľuka et.al

09:15-10:30

Towards Graphical Feedback in the DiMo Learning Tool

Maurice Herwig, Norbert Hundeshagen, Martin Lange

09:15-10:30

Iltis: Teaching Logic in the Web

Fabian Vehlken

09:15-10:30

Experiences on Online Teaching of Formal Methods to Systems Engineering Students

Muhammad Usama Sardar

09:15-10:30

DOMtutor -- Competitive Programming as Teaching Tool

Tobias Meggendorfer

09:30-10:30

Exact Separation Logic

Philippa Gardner

09:30-10:30

Transforming Text to (and from) XML

Akihisa Yamada

09:40-10:30

Solving XCSP3 constraint problems using tools from software verification

Martin Mariusz Lester

09:40-10:30

Constraint-based Part-of-Speech Tagging

Neng-Fa Zhou

09:50-10:30

Data Path Queries over Embedded Graph Databases

Anthony Widjaja Lin

09:50-10:30

LTLf Synthesis as AND-OR Graph Search: Knowledge Compilation at Work

Shufang Zhu

09:50-10:30

Towards Combination of Logic and Calculus for Near-Optimal Planning in Relational Hybrid Systems

Mikhail Soutchanski

09:50-10:30

SAT-based Reasoning Techniques for LTL over Finite and Infinite Traces

Jianwen Li

10:00-10:30

Are Bundles Good Deals for FOML?

Mo Liu

10:30-12:00

Two Results on Separation Logic With Theory Reasoning

Mnacho Echenim, Nicolas Peltier

10:30-12:00

Labelled Tableaux for Linear Time Bunched Implication Logic

Daniel Mery, Didier Galmiche

10:30-12:00

On the Expressiveness of a Logic of Separated Relations

Radu Iosif, Florian Zuleger

10:35-10:45 Opening

10:45-12:30

Constrained Default Logic Programming

Shutao Zhang, Zhizheng Zhang, Jun Shen

10:45-12:30

On the generalization of learnt constraints in ASP solving for temporal domains

Javier Romero, Torsten Schaub, Klaus Strauch

10:45-12:30

Conflict Handling in Product Configuration using Answer Set Programming

Konstantin Herud, Joachim Baumeister, Orkunt Sabuncu, Torsten Schaub

10:45-12:30

Hard Variants of Stable Marriage Problems: An Empirical Comparison of ASP with Other Computing

Esra Erdem

11:00-12:30

Tutorial: Belief Change, Ontology Repair and Evolution (Part 2)

Renata Wassermann

11:00-12:00

Terminating sequent calculi for decidable fragments of FOML

Eugenio Orlandelli

11:00-12:30

DatalogMTL

Przemysław Wałęga

11:00-12:30

Tableaunoir: an online blackboard for teaching formal methods and making slides

Francois Schwarzentruber

11:00-12:30

Teaching Concurrency with pseuCo Book

Felix Freiberger

11:00-12:30

Teaching Formal Languages with Iltis - A Preview

Marko Schmellenkamp

11:00-12:30

Automata Tutor

Maximilian Weininger

11:00-12:30

Visualization of structural operational semantics over programs of simple imperative language.

Ján Perháč, Vitalii Tsimbolynets

11:00-12:30

Tight Neural Network Verification via Semidefinite Relaxations and Linear Reformulations

Jianglin Lan, Yang Zheng, Alessio Lomuscio

11:00-12:30

A Cascade of Checkers for Run-time Certification of Local Robustness

Ravi Mangal, Corina Pasareanu

11:00-12:30

RoMA: a Method for Neural Network Robustness Measurement and Assessment

Natan Levy, Guy Katz

11:00-12:30

TBA

Kristina Sojakova

11:00-12:30

Elementary Simplicial Collapses in Cubical Agda

Maximilian Doré

11:00-12:30

Quantitative Weak Linearisation

Sandra Alves

11:00-12:30

The International School on Rewriting

Waldmann, Blanqui, Dundua, Marti-Oliet, Rocha, Zantema, Middeldorp

11:00-12:30

Building Optimal Decision Trees

Peter Stuckey

11:00-12:30

SAT-Based Induction of Explainable Decision Trees

Andre Schidler

11:00-12:30

Position Paper: Mathematical Logic through Python

Yannai A. Gonczarowski, Noam Nisan

11:00-12:30

Whom to teach logic?

Edward A. Hirsch

11:00-12:30

A portfolio-based analysis method for competition results

Nguyen Dang

11:00-12:30

Efficiently Explaining CSPs with Unsatisfiable Subset Optimization (extended abstract)

Emilio Gamba, Bart Bogaerts, Tias Guns

11:00-12:30

Automatic Generation of Dominance Breaking Nogoods for Constraint Optimization

Jimmy H. M. Lee, Allen Z. Zhong

11:00-12:30

Parameterized Approximations and CSPs

Hadas Shachnai

11:00-12:30

Kemeny Rank Aggregation: Width Measure and Diversity Notion

Emmanuel Arrighi

11:00-11:30

Formal Aspects of Strategic Reasoning in MAS

Aniello Murano

11:00-11:30

Checking Legal Contracts - On a Not So Usual Application of Mechanized Logic

Alan Khoja, Martin Kölbl, Stefan Leue, Rüdiger Wilhelmi

11:00-11:30

Modelling with Reconfigurable Communication Interfaces

Nir Piterman

11:00-12:30

Program Equivalence in a Typed Probabilistic Call-by-Need Functional Language

David Sabel, Manfred Schmidt-Schauss

11:00-12:30

A Machine-Checked Formalisation of Erlang Modules

György Sághi, Péter Bereczky, Dániel Horpácsi

11:00-12:30

Extending a Lemma Generation Approach for Rewriting Induction on Logically Constrained Term Rewriting

Kasper Hagens, Cynthia Kop, Wouter Brozius

11:00-12:30

Monoidal Width -- Extended Abstract

Elena Di Lavore, Pawel Sobocinski

11:00-12:30

Hypertrace Logic

Ana Oliveira Da Costa

11:00-12:30

A goal-oriented proof system for epistemic modal logic

Alba Cuenca

11:00-12:30

A Mixed Linear and Graded Logic-Extended Abstract

Harley Eades Iii, Victoria Vollmer, Daniel Marshall, Dominic Orchard

11:00-12:30

Explaining Description Logic Entailments in Practice with Evee and Evonne

C. Alrabbaa, S. Borgwardt, T. Friese, P. Koopmann, J. Méndez, A. Popovič

11:00-12:30

Finding Good Proofs for Answers to Conjunctive Queries Mediated by Lightweight Ontologies (Extended

Christian Alrabbaa, Stefan Borgwardt, Patrick Koopmann, Alisa Kovtunova

11:00-12:30

An API for DL Abduction Solvers

Zuzana Hlávková, Martin Homola, Patrick Koopmann, Júlia Pukancová

11:00-12:30

Modular Provenance in Multi-Context Systems

Matthias Knorr, Carlos Viegas Damásio, Ricardo Gonçalves, Joao Leite

11:35-12:05

On the Extraordinary Effectiveness of Logic in Strategic Reasoning

Giuseppe Perelli

11:35-12:05

Automated Synthesis of Mechanisms

Munyque Mittelmann, Bastien Maubert, Aniello Murano, Laurent Perrussel

11:35-12:05

Synthesis of plans for teams of manufacturing robots

Natasha Alechina

12:10-12:40

The Quantified Reflection Calculus as a Modal Logic

Ana de Almeida Borges, Joost J. Joosten

12:10-12:40

That's All I know: On the Effectiveness of Logic in Game Theory

Joe Halpern

12:10-12:40

Between Determinism and Nondeterminism

Thomas Henzinger

12:10-12:40

A Short Talk Proposal for the VardiFest "On the Not So Unusual Effectiveness of Logic"

Sandeep Shukla

12:30-12:40

MCP: Capturing Big Data by Satisfiability

Miki Hermann, Gernot Salzer

14:00-15:00

Functional correctness specifications for concurrent data structures: Logical Atomicity in Iris

Ralf Jung

14:00-15:30

A Semantics For Probabilistic Answer Set Programs With Incomplete Stochastic Knowledge

David Tuckey, Krysia Broda, Alessandra Russo

14:00-15:30

plingo: A system for probabilistic reasoning in clingo based on lpmln

S. Hahn, T. Janhunen, R. Kaminski, J. Romero, N. Ruehling, T. Schaub

14:00-15:30

Automatic Synthesis of Boolean Networks from Biological Knowledge and Data

Athénaïs Vaginay, Taha Boukhobza, Malika Smail-Tabbone

14:00-15:30

ASP in Industry, here and there

Torsten Schaub

14:00-15:30

Tutorial: Hybrid Temporal Situation Calculus for Planning with Continuous Processes: Semantics

Mikhail Soutchanski

14:00-14:30

Forward Guarded Fragment: A tamed higher-arity extension of ALC

Bartosz Bednarczyk

14:00-15:00

LogInd, a tool for supporting students in mastering structural induction

Josje Lodder, Bastiaan Heeren, Johan Jeuring, Ben de Vries

14:00-15:00

Prooffold: a prototype for displaying structured proofs

Francois Schwarzentruber

14:00-15:00

Formal Methods Online: Sequent Calculus Verifier (SeCaV)

Asta Halkjær From, Frederik Krogsdal Jacobsen, Jørgen Villadsen

14:00-15:00

SIVA: Simulation and visualization of the DL tableau algorithm

Peter Paulovics, Júlia Pukancová, Martin Homola

14:00-15:30

VNN-COMP 2022

Mark Müller, Christopher Brix

14:00-15:30

Towards computing cohomology of dependent abelian groups

Felix Cherubini

14:00-15:30

A Library of Monoidal Categories for Display and Univalence

Benedikt Ahrens, Ralph Matthes, Kobe Wullaert

14:00-15:30

The internal AB axioms

Jarl G. Taxerås Flaten

14:00-15:30

A Rate-Distortion Framework for Explaining Model Decisions and Application to CartoonX

Ron Levie

14:00-15:30

The Exciting Theory of Formal Explanations

Bernardo Subercaseaux

14:00-15:30

Undergraduate Logic Teaching in Computing: Why, What, How?

Roger Villemaire

14:00-15:30

Introducing Logic by Stealth to Computer Science Students

Liam O'Reilly, Faron Moller

14:00-14:40

A Constraint-Based Tool for Generating Benchmark Instances

Nguyen Dang

14:00-15:30

Towards higher order proof complexity

Arnold Beckman, Sam Buss, Anupam Das

14:00-15:30

Proof complexity of CSP

Azza Gaysin

14:00-15:30

Proof complexity of natural formulas via communication arguments

Dmitry Itsykson, Artur Riazanov

14:00-15:30

Resolving Inconsistency of Linear Equations

George Osipov

14:00-15:30

Towards Tractable QSAT for Structural Parameters Below Treewidth

Friedrich Slivovsky

14:00-15:30

Learning Small Decision Trees

Giacomo Paesani

14:00-14:30 Welcome Session

14:00-14:50

The Joy of Automata

Rajeev Alur

14:00-15:30

On Reducing Non-Occurrence of Specified Runtime Errors to All-Path Reachability Problems of Constrained

Misaki Kojima, Naoki Nishida

14:00-15:30

On Transforming Rewriting-Induction Proofs for Logical-Connective-Free Sequents into Cyclic Proofs

Shujun Zhang, Naoki Nishida

14:00-15:30

On Transforming Imperative Programs into Logically Constrained Term Rewrite Systems via Injective Functions from Configurations to

Naoki Nishida, Misaki Kojima, Takumi Kato

14:00-15:30

A normalized edit distance on finite and infinite words

Dana Fisman

14:00-15:30

Automated Logic-Based Reasoning for Analyzing Prime Video Code

Stoilkovska et.al

14:00-15:30

On interactive explanations as reasoning

Guilherme Paulino-Passos, Francesca Toni

14:00-15:30

Should counterfactual explanations always be data instances?

Junqi Jiang, Antonio Rago, Francesca Toni

14:00-15:30

Dialogue-Based Explanations of Reasoning in Rule-based Systems

Yifan Xu, Clare Dixon, Louise Dennis, Joe Collenette

14:00-15:30

Clustering-Based Approaches for Symbolic Knowledge Extraction

Federico Sabbatini, Roberta Calegari

14:30-15:30

From Modal Logic to Fluted logic

Ian Pratt-Hartman

14:30-15:30

Recursive Session Logical Relations

Stephanie Balzer

14:40-17:15 Modelling Competition

14:50-15:30

Automata-Based Quantitative Reasoning

Suguman Bansal

14:50-15:30

LTLf Synthesis Under Environment Specifications

Antonio Di Stasio

14:50-15:30

Boolean Synthesis via Decision Diagrams

Lucas Martinelli Tabajara

14:50-15:30

Strategy synthesis for Global Window PCTL

Benjamin Bordais, Damien Busatto-Gaston, Shibashis Guha, Jean-Francois Raskin

15:00-16:30

Proving Logical Atomicity using Lock Invariants

R. Sharma, S. Wang, A. Oey, A. Evdokimova, L. Beringer, W. Mansky

15:00-16:30

Deciding Separation Logic with Heap Lists

Wanyun Sun, Zhilin Wu, Mihaela Sighireanu

15:00-16:30

Polishing a Rough Diamond: An Enhanced Separation Logic for Heap Space under Garbage Collection

Alexandre Moine, Arthur Charguéraud, François Pottier

16:00-17:30

Computing H-Partitions in ASP and Datalog

Chloé Capon, Nicolas Lecomte, Jef Wijsen

16:00-17:30

Translating Definitions into the Language of Logic Programming: A Case Study

Vladimir Lifschitz

16:00-17:30

A normative model of explanation for binary classification legal AI and its implementation on causal explanations of Answer Set

Evan Iatrou

16:00-17:30

Assumable Answer Set Programming

Zhizheng Zhang

16:00-17:30

Tutorial: Hybrid Temporal Situation Calculus for Planning with Continuous Processes: Semantics

Mikhail Soutchanski

16:00-16:30

Decidable Fragments of Term Modal Logic

Anantha Padmanabha

16:00-17:00

Counter-Example Guided Neural Network Compression Refinement (CEG4N)

J.B. Pereira Matos Júnior, L.C. Cordeiro, E. Manino, X. Song, I. Bessa

16:00-17:00

Goal-Aware RSS for Complex Scenarios via Program Logic

Ichiro Hasuo

16:00-17:30

Internal languages of diagrams of ∞-toposes

Taichi Uemura

16:00-17:30

An Experiment with 2LTT Features in Agda

Elif Uskuplu

16:00-17:30 Session 19F

16:00-17:30

Verification of Binarized Neural Networks: Challenges and Opportunities

Nina Narodytska

16:00-17:30

Verification of Realistic Neural Networks

Mark Niklas Müller

16:00-17:30

Logic for CS Undergraduates: A Sketch

Dennis Hamilton

16:00-17:30

Logic for Students of Modern Artificial Intelligence

Reinhard Kahle

16:00-17:30

Strong proof systems based on algebraic circuits

Edward Hirsch

16:00-17:30

On combinatorial principles coming from semi-algebraic proof systems

Ilario Bonacina

16:00-17:00

The Tournament Fixing Problem

Meirav Zehavi

16:00-17:30

Copromotion and Taylor Approximation (Work in Progress)

Marie Kerjean, Jean-Simon Lemay

16:00-17:30

Denotational semantics driven simplicial homology?

Davide Barbarossa

16:00-17:30

Bottom-Up Sequentialization of Unit-Free MALL Proof Nets

Rémi Di Guardia, Olivier Laurent

16:00-16:40

Logic and Languages for Representation Learning

Hector Geffner

16:00-16:40

Natural Autoencoding

Irun Cohen, Assaf Marron

16:00-16:40

From Logic to Neurosymbolic AI

Luis Lamb

16:00-16:40

An Epistemic Logic for modelling Cooperative Agents

Stefania Costantini, Andrea Formisano, Valentina Pitoni

16:00-17:30

Towards Corecursion Without Corecursion in Coq

Vlad Rusu, David Nowak

16:00-17:30

Towards a Refactoring Tool for Dependently-Typed Programs (work in progress)

Christopher Brown, Adam Barwell, Simon Thompson, Susmit Sarkar, Edwin Brady

16:00-17:30

Refactoring Steps for P4 (work in progress)

Péter Hegyi, Dániel Lukács, Máté Tejfel

16:00-17:00

Fixed-Template Promise Model Checking Problems

Kristina Asimi, Libor Barto, Silvia Butti

16:00-17:00

Two Dimensional Bounded Model Checking for Unbounded Client-Server Systems

Ramchandra Phawade, Tephilla Prince, Sheerazuddin S

16:00-17:00

A note on Türing 1936

Paola Cattabriga

16:00-18:00

Invited Talk: Explanation Generation in Applications of Answer Set Programming

Esra Erdem

16:00-18:00

Explaining Soft-Goal Conflicts through Constraint Relaxations

Rebecca Eifler, Jeremy Frank, Joerg Hoffmann

16:00-18:00

Stepwise Explanations of Unsatisfiable Constraint Programs (Extended abstract)

Ignace Bleukx, Emilio Gamba, Bart Bogaerts, Tias Guns

16:45-17:05

On the Effectiveness of Logic in Algorithmic Graph Theory

Martin Charles Golumbic

16:45-17:05

Computability and Complexity over Finite Unordered Structures; e.g., Graphs (1979-1982)

David Harel

17:00-17:30

Report on SL-COMP

Mihaela Sighireanu

17:00-17:45 Session 21B

17:10-18:00

On how the past illuminates the future

Orna Kupferman

17:15-18:15 Discussion and Open Problems

17:30-18:30

Correct Causal Inference in Probabilistic Logic Programming

Kilian Rueckschloss

17:30-18:30

A Casual Perspective on AI Deception

Francis Rhys Ward

17:30-18:30

Epistemic Logic Programs: a Novel Perspective and some Extensions

Stefania Costantini, Andrea Formisano

17:30-18:00 discussion and outlook

17:30-19:00

The Herbrand Manifesto: Thinking Inside the Box

Michael Genesereth, Vinay Chaudhri

17:30-19:00

Teaching logic to CS undergraduates

Thomas Schwentick, Thomas Zeume

20:00-22:30 Reception for Speakers only at Makowsky's residence

08:30-09:00 Coffee & Refreshments

10:30-11:00 Coffee Break

12:30-14:00 Lunch Break

15:30-16:00 Coffee Break