PROGRAM
Days: Monday, September 1st Tuesday, September 2nd Wednesday, September 3rd Thursday, September 4th
Monday, September 1st
View this program: with abstractssession overviewtalk overview
09:10-10:30 Session 1: Invited Talk + Special Track
09:10 | Logic for Safe Reinforcement Learning (abstract) |
10:10 | Reinforcement Learning Meets Logic Programming: Towards Explainable AI (abstract) |
10:30-11:00Coffee Break
11:00-12:30 Session 2: Propositional Reasoning, QBF, and Satisfiability Problems - 1/2
11:00 | Exact Approaches for the Diverse Satisfiability Problem (abstract) |
11:20 | Maximum Satisfiability Formulations for Nonlinear Integer Programming (abstract) |
11:40 | Inclusion with repetitions and Boolean constants -- implication problems revisited (abstract) |
12:00 | On Extracting Legal Arguments (abstract) |
12:20 | Interpolating Parametric Array Theories (abstract) |
12:30-14:00Lunch Break
14:00-15:30 Session 3: Non-monotonic Reasoning and Belief Change + Description Logics
14:00 | Comparing Dialectical Systems: Contradiction and Counterexample in Iterated Belief Revision (abstract) |
14:20 | Extending Defeasibility for Propositional Standpoint Logics (abstract) |
14:40 | Towards Practicable Defeasible Reasoning for ABoxes (abstract) |
15:00 | Closure-Based Tractable Possibilistic Inference from Partially Ordered DL-Lite Ontologies (abstract) |
15:20 | The InfOCF Library for Reasoning With Conditional Belief Bases (abstract) |
15:30-16:00Coffee Break
16:00-16:40 Session 4: Deontic Reasoning
16:00 | GL-based calculi for PCL and its deontic cousin (abstract) |
16:20 | Dual Scale Detachment (abstract) |
16:40-17:30 Session 5: Special Track
16:40 | Formal Explanations of Black-Box Ranking Functions (abstract) |
17:00 | Why this and not that? A Logic-based Framework for Contrastive Explanations (abstract) |
17:20 | A Uniform Language for Safety, Robustness and Explainability (abstract) |
Tuesday, September 2nd
View this program: with abstractssession overviewtalk overview
09:10-10:30 Session 6: Invited Talk + Deontic Reasoning
09:10 | Tackling Semantics-Aware Machine Learning and Explanations for Knowledge Graph Refinement (abstract) |
10:10 | deon-B: A language for Well-Founded Deontic Planning (abstract) |
10:30-11:00Coffee Break
11:00-12:20 Session 7: Argumentation
11:00 | On the Sensitivity of Extension Semantics to Similarity (abstract) |
11:20 | SCC-recursiveness in infinite argumentation (abstract) |
11:40 | Completing Structured Arguments in Assumption-based Argumentation (abstract) |
12:00 | Axiomatics of Restricted Choices by Linear Orders of Sets with Minimum as Fallback (abstract) |
12:20-14:00Lunch Break
14:00-15:30 Session 8: Propositional Reasoning, QBF, and Satisfiability Problems - 2/2
14:00 | AxSAT - Bringing Axioms to SAT Planning (abstract) |
14:20 | Enhancing Query Efficiency for d-DNNF Representations Through Preprocessing (abstract) |
14:40 | Explanations of Unsatisfiability Beyond Minimal Subsets (abstract) |
15:00 | Refinement-Based Enumeration of QBF Solutions (abstract) |
15:20 | Refined Notions of QBF Equivalences (abstract) |
15:30-16:00Coffee Break
16:00-17:40 Session 9: Higher-order and Non-classical Logics
16:00 | Strongly First Order Disjunctive Embedded Dependencies in Team Semantics (abstract) |
16:20 | A Kripke Semantics for Intuitionistic Lukasiewicz Logic with Weak Excluded Middle (abstract) |
16:40 | From Modal Ockham Algebras to Modal Berman Variety: Relational Semantics and Kripke-Completeness (abstract) |
17:00 | On a Second-Order Version of Russellian Theory of Definite Descriptions (abstract) |
17:20 | Deciding Non-Fregean Identities: A Dual Tableau Approach (abstract) |
Wednesday, September 3rd
View this program: with abstractssession overviewtalk overview
09:10-10:30 Session 10: Invited Talk + Belief Change
09:10 | It is Possible! Distance Semantics for Modal Belief Revision (abstract) |
10:10 | Lockean beliefs that are deductively closed and minimal change (abstract) |
10:30-11:00Coffee Break
11:00-12:30 Session 11: Logic Programming and Answer Set Programming
11:00 | Lazy Atom Discovery in Compilation-Based ASP Solving (abstract) |
11:20 | Encoding Action Reversibility In Planning Using Quantified ASP and Bule (abstract) |
11:40 | DIRT: a Literature-Based Benchmark Suite for Grounders (abstract) |
12:00 | Generalizing the Syntax of Terms in Mini-gringo (abstract) |
12:20 | An Experiment with Anthem: Semantic Equivalence of Tiling Programs (abstract) |
12:30-14:00Lunch Break
Thursday, September 4th
View this program: with abstractssession overviewtalk overview
09:30-10:30 Session 12: Temporal Reasoning
09:30 | A framework for computing upper bounds in passive learning settings (abstract) |
09:50 | On Temporal References via Definite Descriptions in First-Order Monadic Logic of Order (abstract) |
10:10 | Alternating-Time Temporal Logic with Default Actions (abstract) |
11:00-12:20 Session 13: Constraint Satisfaction and Optimization + Probability
11:00 | Engineering and Evaluating Multi-objective Pseudo-boolean Optimizers (abstract) |
11:20 | Unsupervised Automata Learning via Discrete Optimization (abstract) |
11:40 | Finding short tree-like unit refutations in UTVPI Constraint Systems (abstract) |
12:00 | Exposure and Hiding: Approaching the Objective Probability and Hiding the Secret in Zero-Knowledge Proof (abstract) |
12:30-14:00Lunch Break