Program for Friday, August 5th: Talk View

PROGRAM FOR FRIDAY, AUGUST 5TH: 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

09:00-10:30 DEI Special Event

09:00-10:30

Stream Reasoning with Deadlines

Periklis Mantenoglou, Manolis Pitsikalis, Alexander Artikis

09:00-10:30

Problem Decomposition and Multi-shot ASP Solving for Job-shop Scheduling

Mohammed El-Kholany, Martin Gebser, Konstantin Schekotihin

09:00-10:30

Efficient Knowledge Compilation Beyond Weighted Model Counting (Best Student Paper Award)

Rafael Kiesel, Pietro Totis, Angelika Kimmig

09:00-10:30

Verifying Catamorphism-Based Contracts using Constrained Horn Clauses

Emanuele De Angelis, Fabio Fioravanti, Alberto Pettorossi, Maurizio Proietti

09:00-10:30

Interpolants and Explicit Definitions in Extensions of the Description Logic EL

Marie Fortin, Boris Konev, Frank Wolter

09:00-10:30

Sticky Policies in OWL2: Extending PL with fixpoints and Transitive Closure

Piero Bonatti, Luigi Sauro

09:00-10:30

Pushing Optimal ABox Repair from EL Towards More Expressive Horn-DLs

Franz Baader, Francesco Kriegel

09:00-10:30

Querying Inconsistent Prioritized Data with ORBITS: Algorithms, Implementation, and Experiments

Meghyn Bienvenu, Camille Bourgaux

09:00-10:30

Forecasting Argumentation Frameworks

Benjamin Irwin, Antonio Rago, Francesca Toni

09:00-10:30

ALASPO: An Adaptive Large-Neighbourhood ASP Optimiser

T. Eiter, T. Geibinger, N. Higuera, N. Musliu, J. Oetsch, D. Stepanova

09:00-10:30

On the Relationship between Shy and Warded Datalog+/-

Teodoro Baldazzi, Luigi Bellomarini, Marco Favorito, Emanuel Sallinger

09:00-10:30

Chasing streams with existential rules

Jacopo Urbani, Markus Krötzsch, Thomas Eiter

09:00-10:00 Invited talk by Mikolaj Bojanczyk

09:00-10:30 Bryant Discoveries Day (BDD) event

09:15-10:30

Welcome

Marijana Lazić, Caterina Urban

09:15-10:30

Formal methods for Machine Learning

Rajeev Alur

10:00-10:30 Poster Session

11:00-12:30

Complexity of Minimum-Size Arc-Inconsistency Explanations

Christian Bessiere, Clément Carbonnel, Martin Cooper, Emmanuel Hebrard

11:00-12:30

Weisfeiler-Leman Invariant Promise Valued CSPs

Libor Barto, Silvia Butti

11:00-12:30

An Auditable Constraint Programming Solver

Stephan Gocht, Ciaran McCreesh, Jakob Nordström

11:00-12:30

A Portfolio-Based Approach to Select Efficient Variable Ordering Heuristics for Constraint Satisfaction

Hongbo Li, Yaling Wu, Minghao Yin, Zhanshan Li

11:00-12:30

Explaining Propagation for Gini and Spread with Variable Mean

Alexander Ek, Andreas Schutt, Peter J. Stuckey, Guido Tack

11:00-12:30

Structured Set Variable Domains in Bayesian Network Structure Learning

Fulya Trösser, Simon de Givry, George Katsirelos

11:00-12:30

Polynomial Termination over N is Undecidable

Fabian Mitterwallner, Aart Middeldorp

11:00-12:30

Compositional Confluence Criteria

Kiraku Shintani, Nao Hirokawa

11:00-12:30

Rewriting for monoidal closed categories

David Sprunger, Dan Ghica, Fabio Zanasi, Mario Alvarez-Picallo

11:00-12:00 Invited talk by Fabrizio Riguzzi: Probabilistic Logic Programming: Semantics, Inference and Learning

11:00-12:30

The More the Worst-Case-Merrier: A Generalized Condorcet Jury Theorem for Belief Fusion

Jonas Karge, Sebastian Rudolph

11:00-12:30

Region-Based Merging of Open-Domain Terminological Knowledge

Zied Bouraoui, Sébastien Konieczny, Thanh Ma, Nicolas Schwind, Ivan Varzinczak

11:00-12:30

Projection of Belief in the Presence of Nondeterministic Actions and Fallible Sensing

Jens Classen, James Delgrande

11:00-12:30

Inference with System W Satisfies Syntax Splitting

Jonas Haldimann, Christoph Beierle

11:00-12:30

Iterated Belief Change, Computationally

Kai Sauerwald, Christoph Beierle

11:00-12:30

Conservative Extensions for Existential Rules

Jean Christoph Jung, Carsten Lutz, Jerzy Marcinkowski

11:00-12:30

Revisiting Semiring Provenance for Datalog

Camille Bourgaux, Pierre Bourhis, Liat Peterfreund, Michaël Thomazo

11:00-12:30

Normalisations of Existential Rules: Not so Innocuous!

David Carral, Lucas Larroque, Marie-Laure Mugnier, Michaël Thomazo

11:00-12:30

On the Satisfiability of Context-free String Constraints with Subword Ordering

C. Aiswarya, Soumodev Mal, Prakash Saivasan

11:00-12:30

The complexity of soundness in workflow nets

Michael Blondin, Filip Mazowiecki, Philip Offtermatt

11:00-12:30

Lower Bounds for the Reachability Problem in Fixed Dimensional VASSes

Wojciech Czerwiński, Łukasz Orlikowski

11:00-12:30

Probabilistic Verification Beyond Context-Freeness

Guanyan Li, Andrzej Murawski, Luke Ong

11:00-12:30

Ramsey Quantifiers over Automatic Structures: Complexity and Applications to Verification

Pascal Bergsträßer, Moses Ganardi, Anthony W. Lin, Georg Zetzsche

11:00-12:30

The complexity of bidirected reachability in valence systems

Moses Ganardi, Rupak Majumdar, Georg Zetzsche

11:00-12:30

How to be an Abstraction Engineer

Natarajan Shankar

11:00-12:30

How to Give a Good (Research) Talk

Alexandra Silva

11:00-12:30

(BDD event)

Randal Bryant

11:00-12:30

Pedant: A Certifying DQBF Solver

Franz-Xaver Reichl, Friedrich Slivovsky

11:00-12:30

QBF Programming with the Modeling Language Bule

Jean Christoph Jung, Valentin Mayer-Eichberger, Abdallah Saffidine

11:00-12:30

OptiLog v2: Model, Solve, Tune And Run

Josep Alos, Carlos Ansótegui, Josep Maria Salvia, Eduard Torres Montiel

12:00-12:30

Rushing and Strolling among Answer Sets – Navigation Made Easy

Johannes Klaus Fichte, Sarah Alice Gaggl, Dominik Rusovac

12:00-12:30

Large-Neighbourhood Search for ASP Optimisation

T. Eiter, T. Geibinger, N. Higuera Ruiz, N. Musliu, J. Oetsch, D. Stepanova

14:00-15:30

Stateful Structural Operational Semantics

Sergey Goncharov, Stefan Milius, Lutz Schröder, Stelios Tsampas, Henning Urbat

14:00-15:30

A combinatorial approach to higher-order structure for polynomial functors

Marcelo Fiore, Zeinab Galal, Hugo Paquet

14:00-15:30

Galois connecting call-by-value and call-by-name

Dylan McDermott, Alan Mycroft

14:00-15:30

A Preliminary Data-driven Analysis of Common Errors Encountered by Novice Answer Set Programmers

Zach Hansen, Hanxiang Du, Rory Eckel, Justin Lugo, Wanli Xing, Yuanlin Zhang

14:00-15:30

On Model Reconciliation: How to Reconcile When Robot Does not Know Human’s Model?

Ho Tuan Dung, Tran Cao Son

14:00-15:30

An ASP approach for reasoning on neural networks under a finitely many-valued semantics for weighted conditional knowledge

Laura Giordano, Daniele Theseider Dupré

14:00-15:30

Efficient lifting of symmetry breaking constraints for complex combinatorial problems (Best Student Paper

Alice Tarzariol, Martin Gebser, Konstantin Schekotihin, Mark Law

14:00-15:00

From Non-monotonic Reasoning to Argumentation and Commonsense (Great Moments in KR Talk)

Anthony Hunter

14:00-15:30

Separating LREC from LFP

Anuj Dawar, Felipe Ferreira Santos

14:00-15:30

Reasonable Space for the Lambda-Calculus, Logarithmically

Beniamino Accattoli, Ugo Dal Lago, Gabriele Vanoni

14:00-15:30

Cyclic Implicit Complexity

Gianluca Curzi, Anupam Das

14:00-15:30

Identity testing for radical expressions

Nikhil Balaji, Klara Nosan, Mahsa Shirmohammadi, James Worrell

14:00-15:30

Complexity of Modular Circuits

Paweł Idziak, Piotr Kawałek, Jacek Krzaczkowski

14:00-15:30

Choiceless Polynomial Time with Witnessed Symmetric Choice

Moritz Lichter, Pascal Schweitzer

14:00-15:30

On Time and Space (of Humans)

Kristin Yvonne Rozier

14:00-15:30

From PhD to industry: A recent graduate’s perspective

Ilina Stoilkovska

14:00-15:30

QBF Merge Resolution is powerful but unnatural

Meena Mahajan, Gaurav Sood

14:00-15:30

Awards / Competition Results - I (with Live Broadcast)

Awards And Competitions

15:00-15:30

Discovering User-Interpretable Capabilities of Black-Box Planning Agents

Pulkit Verma, Shashank Rao Marpally, Siddharth Srivastava

15:00-15:30

Dynamic Deontic Logic for Permitted Announcements

Xu Li, Dov Gabbay, Réka Markovich

15:30-17:00

Learning Typed Rules over Knowledge Graphs

Hong Wu, Zhe Wang, Kewen Wang, Yi-Dong Shen

15:30-17:00

A Graph Neural Network Reasoner for Game Description Language

Alvaro Gunawan, Ji Ruan, Xiaowei Huang

15:30-17:00

Explaining Causal Models with Argumentation: the Case of Bi-variate Reinforcement

Antonio Rago, Pietro Baroni, Francesca Toni

15:30-16:30

On Dynamics in Structured Argumentation Formalisms

Anna Rapberger, Markus Ulbricht

15:30-16:30

Defining Defense and Defeat in Abstract Argumentation From Scratch -- A Generalizing Approach

Lydia Blümel, Markus Ulbricht

16:00-17:30 FSCD General Meeting

16:00-16:30

Determining Action Reversibility in STRIPS Using Answer Set Programming with Quantifiers

Wolfgang Faber, Michael Morak, Lukáš Chrpa

16:00-16:30

Solving a Multi-resource Partial-ordering Flexible Variant of the Job-shop Scheduling Problem with Hybrid

Giulia Francescutto, Konstantin Schekotihin, Mohammed M. S. El-Kholany

16:00-16:45

On Almost-Uniform Generation of SAT Solutions: The power of 3-wise independent hashing

Remi Delannoy, Kuldeep S. Meel

16:00-16:45

Smooth approximations and CSPs over finitely bounded homogeneous structures

Antoine Mottet, Michael Pinsker

16:00-16:45

A first-order completeness result about characteristic Boolean algebras in classical realizability

Guillaume Geoffroy

16:00-17:30 Panel (Clark Barrett, Orna Grumberg, Kristin Yvonne Rozier, Natarajan Shankar)

16:00-17:00

Awards and Competition - II (with Live Broadcast)

Matti Järvisalo

16:30-17:30 Panel: Past, Present and Future of Prolog

16:50-17:30 Award Session: Kleene award, LICS Test-of-Time award, Church award

17:00-17:30 Closing

17:00-17:30

KR 2022 Closing

Gabriele Kern-Isberner, Thomas Meyer

08:30-09:00 Coffee & Refreshments

10:30-11:00 Coffee Break

12:30-14:00 Lunch Break

15:30-16:00 Coffee Break