Program for Wednesday, August 3rd: Talk View

PROGRAM FOR WEDNESDAY, AUGUST 3RD: TALK VIEW

Days:

previous day

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

09:00-10:00

All Questions Answered

Donald Knuth

09:00-10:30

An Analysis of Tennenbaum's Theorem in Constructive Type Theory

Marc Hermes, Dominik Kirst

09:00-10:30

Constructing Unprejudiced Extensional Type Theories with Choices via Modalities

Liron Cohen, Vincent Rahli

09:00-10:30

Division by two, in homotopy type theory

Samuel Mimram, Émile Oleon

09:00-10:30

On Syntactic Forgetting under Uniform Equivalence

Ricardo Gonçalves, Tomi Janhunen, Matthias Knorr, João Leite

09:00-10:30

Abduction in Probabilistic Logic Programs

D. Azzolini, E. Bellodi, S. Ferilli, F. Riguzzi, R. Zese

09:00-10:30

DeepStochLog: Neural Stochastic Logic Programming

Thomas Winters, Giuseppe Marra, Robin Manhaeve, Luc De Raedt

09:00-10:30

Transforming Gringo Rules into Formulas in a Natural Way

Vladimir Lifschitz

09:00-10:30

On Paraconsistent Belief Revision: the Case of Priest’s Logic of Paradox

Nicolas Schwind, Sebastien Konieczny, Ramon Pino Perez

09:00-10:30

Model Reconciliation in Logic Programs

Tran Cao Son, Van Nguyen, Stylianos Loukas Vasileiou, William Yeoh

09:00-09:30 Report Back on Dagstuhl Perspectives Workshop: Current and Future Challenges in Knowledge Representation and Reasoning

09:00-10:30

Varieties of quantitative algebras and their monads

Jiri Adamek

09:00-10:30

Beyond Nonexpansive Operations in Quantitative Algebraic Reasoning

Matteo Mio, Ralph Sarkis, Valeria Vignudelli

09:00-10:30

Concrete categories and higher-order recursion (with applications including probability, differentiability, and full

Cristina Matache, Sean Moss, Sam Staton

09:00-10:30

Probability monads with submonads of deterministic states

Sean Moss, Paolo Perrone

09:00-10:30

Monoidal Streams for Dataflow Programming

Elena Di Lavore, Giovanni de Felice, Mario Román

09:00-10:30

Partitions and Ewens Distributions in element-free Probability Theory

Bart Jacobs

09:00-10:30

Quantified CDCL with Universal Resolution

Friedrich Slivovsky

09:00-10:30

Relating existing powerful proof systems for QBF

Leroy Chew, Marijn Heule

09:00-10:30

Quantifier Elimination in Stochastic Boolean Satisfiability

Hao-Ren Wang, Kuan-Hua Tu, Jie-Hong Roland Jiang, Christoph Scholl

09:30-10:30 D&I Session

11:00-12:30

Computing relaxations for the three-dimensional stable matching problem with cyclic preferences

Ágnes Cseh, Guillaume Escamocher, Luis Quesada

11:00-12:30

Understanding how people approach constraint modelling and solving

Ruth Hoffmann, Xu Zhu, Özgür Akgün, Miguel Nacenta

11:00-12:30

Large Neighborhood Search for Robust Solutions for Constraint Satisfaction Problems with Ordered

Jheisson Lopez, Alejandro Arbelaez, Laura Climent

11:00-12:30

Scheduling the Equipment Maintenance of an Electric Power Transmission Network using Constraint

Louis Popovic, Alain Côté, Mohamed Gaha, Franklin Nguewouo, Quentin Cappart

11:00-12:30

Solving the Constrained Single-Row Facility Layout Problem with Decision Diagrams

Vianney Coppé, Xavier Gillard, Pierre Schaus

11:00-12:30

Modeling and Solving Parallel Machine Scheduling with Contamination Constraints in the Agricultural

Felix Winter, Sebastian Meiswinkel, Nysret Musliu, Daniel Walkiewicz

11:00-12:30

Type-Based Termination for Futures

Siva Somayyajula, Frank Pfenning

11:00-12:30

Addition and differentiation of ZX-diagrams

Emmanuel Jeandel, Simon Perdrix, Margarita Veshchezerova

11:00-12:30

Strong Equivalence of Logic Programs with Ordered Disjunction: a Logical Perspective

Angelos Charalambidis, Christos Nomikos, Panos Rondogiannis

11:00-12:30

Strong Equivalence of Logic Programs with Counting

Vladimir Lifschitz

11:00-12:30

Analyzing Semantics of Aggregate Answer Set Programming Using Approximation Fixpoint Theory

Linde Vanbesien, Maurice Bruynooghe, Marc Denecker

11:00-12:30

Solving Problems in PH with ASP(Q)

Giovanni Amendola, Bernardo Cuteri, Francesco Ricca, Mirek Truszczynski

11:00-12:30

Neural-Probabilistic Answer Set Programming

A. Skryagin, W. Stammer, D. Ochs, D. Dhami, K. Kersting

11:00-12:30

Faithful Approaches to Rule Learning

David Tena Cucala, Bernardo Cuenca Grau, Boris Motik

11:00-12:30

Looking Inside the Black-Box: Logic-based Explanations for Neural Networks

João Ferreira, Manuel de Sousa Ribeiro, Ricardo Gonçalves, Joao Leite

11:00-12:30

On Paraconsistent Belief Revision in LP (Extended Abstract)

Nicolas Schwind, Sébastien Konieczny, Ramón Pino Pérez

11:00-12:30

A conditional, a fuzzy and a probabilistic interpretation of self-organising maps (Abstract)

Laura Giordano, Valentina Gliozzi, Daniele Theseider Dupre

11:00-12:30

Influence-Driven Explanations for Bayesian Network Classifiers

Emanuele Albini, Antonio Rago, Pietro Baroni, Francesca Toni

11:00-12:30

Lifting Symmetry Breaking Constraints with Inductive Logic Programming

Alice Tarzariol, Martin Gebser, Konstantin Schekotihin

11:00-12:30

Abstract Argumentation with Markov Networks (Extended Abstract)

Nico Potyka

11:00-12:30

Interpreting Neural Networks as Quantitative Argumentation Frameworks (Extended Abstract)

Nico Potyka

11:00-12:30

An Axiomatic Approach to Revising Preferences (Extended Abstract)

Adrian Haret, Johannes Wallner

11:00-12:30

Simulating Multiwinner Voting Rules in Judgment Aggregation

Julian Chingoma, Ulle Endriss, Ronald de Haan

11:00-12:30

Abstractions for the local-time semantics of timed automata: a foundation for partial-order methods

R. Govind, Frédéric Herbreteau, B Srivathsan, Igor Walukiewicz

11:00-12:30

The boundedness and zero isolation problems for weighted automata over nonnegative rationals

W. Czerwiński, E. Lefaucheux, F. Mazowiecki, D. Purser, M. Whiteland

11:00-12:30

Efficient Construction of Reversible Transducers from Regular Transducer Expressions

Luc Dartois, Paul Gastin, Govind R, Krishna S

11:00-12:30

Active learning for sound negotiations

Anca Muscholl, Igor Walukiewicz

11:00-12:30

Stochastic Games with Synchronizing Objectives

Laurent Doyen

11:00-12:30

Characterizing Positionality in Games of Infinite Duration over Infinite Graphs

Pierre Ohlmann

11:00-12:30

A SAT Attack on Rota's Basis Conjecture

Markus Kirchweger, Manfred Scheucher, Stefan Szeider

11:00-12:30

The packing chromatic number of the infinite square grid is at least 14

Bernardo Subercaseaux, Marijn Heule

11:00-12:30

Migrating Solver State

Armin Biere, Md Solimul Chowdhury, Benjamin Kiesl, Marijn Heule, Michael Whalen

12:30-14:00 Doctoral Consortium Mentor Lunch

14:00-15:30

Peel-and-Bound: Generating Stronger Relaxed Bounds with Multivalued Decision Diagrams

Isaac Rudich, Quentin Cappart, Louis-Martin Rousseau

14:00-15:30

Exploiting Functional Constraints in Generating Dominance Breaking Nogoods for Constraint

Jimmy H. M. Lee, Allen Z. Zhong

14:00-15:30

Doctoral Research Award

Hélène Verhaeghe

14:00-15:30

Restricting tree grammars with term rewriting

Jan Bessai, Lukasz Czajka, Felix Laarmann, Jakob Rehof

14:00-15:30

On Lookaheads in Regular Expressions with Backreferences

Nariyoshi Chida, Tachio Terauchi

14:00-15:30

Certified Decision Procedures for Two-Counter Machines

Andrej Dudenhefner

14:00-15:30

Tree-Like Justification Systems are Consistent

Simon Marynissen, Bart Bogaerts

14:00-15:30

Nested Justification Systems

Simon Marynissen, Bart Bogaerts, Marc Denecker, Jesse Heyninck

14:00-15:30

An Iterative Fixpoint Semantics for MKNF Hybrid Knowledge Bases with Function Symbols

Marco Alberti, Riccardo Zese, Fabrizio Riguzzi, Evelina Lamma

14:00-15:30

A Fixpoint Characterization of Three-Valued Disjunctive Hybrid MKNF Knowledge Bases

Spencer Killen, Jia-Huai You

14:00-15:30

Sum-Product Loop Programming: From Probabilistic Circuits to Loop Programming

Viktor Pfanschilling, Hikaru Shindo, Devendra Singh Dhami, Kristian Kersting

14:00-15:30

Learning generalized policies without supervision using GNNs

Simon Ståhlberg, Blai Bonet, Hector Geffner

14:00-15:30

Embed2Sym - Scalable Neuro-Symbolic Reasoning via Clustered Embeddings

Yaniv Aspis, Krysia Broda, Jorge Lobo, Alessandra Russo

14:00-15:30

Solving Lam's Problem via SAT and Isomorph-Free Exhaustive Generation

Curtis Bright, Kevin K. H. Cheung, Brett Stevens, Ilias Kotsireas, Vijay Ganesh

14:00-15:30

Rushing and Strolling among Answer Sets -- Navigation Made Easy (Extended Abstract)

Dominik Rusovac, Sarah Alice Gaggl, Johannes K. Fichte

14:00-15:30

A General Framework for Stable Roommates Problems using Answer Set Programming

Esra Erdem, Müge Fidan, David Manlove, Patrick Prosser

14:00-15:30

Reasoning about Cardinal Directions between 3-Dimensional Extended Objects using Answer Set

Yusuf Izmirlioglu, Esra Erdem

14:00-15:30

Hybrid Conditional Planning for Robotic Applications (Extended Abstract)

Ahmed Nouman, Volkan Patoglu, Esra Erdem

14:00-15:30

LACE: A Logical Approach to Collective Entity Resolution

Meghyn Bienvenu, Gianluca Cima, Victor Gutierrez-Basulto

14:00-15:30

Rule Learning over Knowledge Graphs with Genetic Logic Programming

Lianlong Wu, Emanuel Sallinger, Evgeny Sherkhonov, Sahar Vahdati, Georg Gottlob

14:00-15:00 Invited Talk by Amal Ahmed: Semantic Intermediate Representations for the Working Metatheoretician

14:00-15:30

Tight Bounds for Tseitin Formulas

Dmitry Itsykson, Artur Riazanov, Petr Smirnov

14:00-15:30

A generalization of the Satisfiability Coding Lemma and its applications

Milan Mosse, Harry Sha, Li-Yang Tan

14:00-15:30

On the Parallel Parameterized Complexity of MaxSAT Variants

Max Bannach, Malte Skambath, Till Tantau

15:00-15:30 Linear Recurrences and Skolem Problem

16:00-17:30

Early Career Award

Kuldeep S. Meel

16:00-17:30

Strategies for Asymptotic Normalization

Claudia Faggian, Giulio Guerrieri

16:00-17:30

Solvability for Generalized Applications

Delia Kesner, Loïc Peyrot

16:00-17:30

Normalization without syntax

Willem Heijltjes, Dominic Hughes, Lutz Straßburger

16:00-17:30

A Neuro-Symbolic ASP Pipeline for Visual Question Answering

Thomas Eiter, Nelson Higuera, Johannes Oetsch, Michael Pritz

16:00-17:30

Knowledge Authoring with Factual English

Yuheng Wang, Giorgian Borca-Tasciuc, Nikhil Goel, Paul Fodor, Michael Kifer

16:00-17:30

Applications of Answer Set Programming to Smart Devices and Large Scale Reasoning

Kristian Reale, Francesco Calimeri, Nicola Leone, Simona Perri, Francesco Ricca

16:00-17:30

Modeling and Reasoning in Event Calculus using Goal-Directed Constraint Answer Set Programming (Extended

Joaquin Arias, Manuel Carro, Zhuo Chen, Gopal Gupta

16:00-17:30

A Multi-shot ASP Encoding for the Aircraft Routing and Maintenance Planning Problem

Pierre Tassel, Mohamed Rbaia

16:00-17:00

Probabilities, Reasoning, and Argumentation

Ulrike Hahn

16:00-17:30 Poster Session

16:00-17:30 Session 61F

16:00-17:30 The Olympic Games Session (Block 1)

16:00-17:30

Proofs for Propositional Model Counting

Valentin Roland, Johannes K. Fichte, Markus Hecher

16:00-17:30

A New Exact Solver for (Weighted) Max#SAT

Gilles Audemard, Jean Marie Lagniez, Marie Miceli

16:00-17:30

Weighted Model Counting with Twin-Width

Robert Ganian, Filip Pokrývka, André Schidler, Kirill Simonov, Stefan Szeider

17:00-18:00

Compound conditionals as random quantities and Boolean algebras

Tommaso Flaminio, Angelo Gilio, Lluis Godo, Giuseppe Sanfilippo

17:00-18:00

A General Framework for Modelling Conditional Reasoning - Preliminary Report

Giovanni Casini, Umberto Straccia

17:00-18:00

Act for Your Duties but Maintain Your Rights

Shufang Zhu, Giuseppe De Giacomo

17:00-18:00

Epistemic Actions: Comparing Multi-agent Belief Bases with Action Models

Emiliano Lorini, Elise Perrotin, Francois Schwarzentruber

08:30-09:00 Coffee & Refreshments

10:30-11:00 Coffee Break

12:30-14:00 Lunch Break

15:30-16:00 Coffee Break

18:30-20:30 Walking tour (at Haifa)