Time	Session	August 2	August 3	August 4	August 5
09:00–09:30	1	Opening (15 min) RPR (15 min) Markus Hecher: Treewidth-aware Reductions of Normal ASP to SAT– Is Normal ASP Harder than SAT after All?	(CP Knuth) 6 RPR Talks 13 min+ 2 questions! Ricardo Gonçalves, Tomi Janhunen, Matthias Knorr and João Leite: On Syntactic Forgetting under Uniform Equivalence Damiano Azzolini, Elena Bellodi, Stefano Ferilli, Fabrizio Riguzzi and Riccardo Zese: Abduction in Probabilistic Logic Programs Thomas Winters, Giuseppe Marra, Robin Manhaeve and Luc De Raedt: DeepStochLog: Neural Stochastic Logic Programming Vladimir Lifschitz: Transforming Gringo Rules into Formulas in a Natural Way Nicolas Schwind, Sebastien Konieczny and Ramon Pino Perez: On Paraconsistent Belief Revision: the Case of Priest’s Logic of Paradox Tran Cao Son, Van Nguyen, Stylianos Loukas Vasileiou and William Yeoh: Model Reconciliation in Logic Programs	Manuel Hermenegildo 50th anniversary of the birth of Prolog: Some reflections on Prolog's Evolution, Status, and Future	Periklis Mantenoglou, Manolis Pitsikalis and Alexander Artikis Stream Reasoning with Deadlines Mohammed El-Kholany, Martin Gebser and Konstantin Schekotihin Problem Decomposition and Multi-shot ASP Solving for Job-shop Scheduling Rafael Kiesel, Pietro Totis and Angelika Kimmig Efficient Knowledge Compilation Beyond Weighted Model Counting (best student paper) Emanuele De Angelis, Fabio Fioravanti, Alberto Pettorossi and Maurizio Proietti Verifying Catamorphism-Based Contracts using Constrained Horn Clauses
09:30–10:00		4 RPR Talks 13 min+ 2 questions Victor Verreet, Vincent Derkinderen, Pedro Zuidberg Dos Martires and Luc De Raedt: Inference and Learning with Model Uncertainty in Probabilistic Logic Programs Jesse Heyninck, Ricardo Gonçalves, Matthias Knorr and João Leite: Tractable Reasoning using Logic Programs with Intensional Concepts Joaquin Arias, Manuel Carro, Zhuo Chen and Gopal Gupta: Modeling and Reasoning in Event Calculus using Goal-Directed Constraint Answer Set Programming (Extended Abstract) Mohimenul Kabir, Flavio Everardo, Ankit Shukla, Johannes K. Fichte, Markus Hecher and Kuldeep S. Meel: ApproxASP – A Scalable Approximate Answer Set Counter
10:00–10:30				2 RPR Talks 13 min+ 2 questions Zhe Wang, Peng Xiao, Kewen Wang, Zhiqiang Zhuang and Hai Wan: Efficient Datalog Rewriting for Query Answering in TGD Ontologies Fang Li, Elmer Salazar and Gopal Gupta: Graph-based Interpretation of Normal Logic Programs
10:30–11:00	Coffe
11:00–11:30	2	Catuscia Palamidessi FLOC Keynote	Angelos Charalambidis, Christos Nomikos and Panos Rondogiannis Strong Equivalence of Logic Programs with Ordered Disjunction: a Logical Perspective Vladimir Lifschitz Strong Equivalence of Logic Programs with Counting Linde Vanbesien, Maurice Bruynooghe and Marc Denecker Analyzing Semantics of Aggregate Answer Set Programming Using Approximation Fixpoint Theory Giovanni Amendola, Bernardo Cuteri, Francesco Ricca and Mirek Truszczynski Solving Problems in PH with ASP(Q)	Michael Hanus From Logic to Functional Logic Programs Georg Gottlob, Matthias Lanzinger and Stefano Sferrazza MV-Datalog+/-: Effective Rule-based Reasoning with Uncertain Observations (best paper) Joachim Niehren, Rustam Azimov and Sylvain Salvati Jumping Evaluation of Nested Regular Path Queries Huaduo Wang and Gopal Gupta FOLD-RM: A Scalable and Efficient Inductive Learning Algorithm for Multi-Category Classification of Mixed Data	Fabrizio Riguzzi: Probabilistic Logic Programming: Semantics, Inference and Learning Invited talk 3
11:30–12:00
12:00–12:30					2 RPR Talks 13 min+ 2 questions Johannes Klaus Fichte, Sarah Alice Gaggl and Dominik Rusovac: Rushing and Strolling among Answer Sets – Navigation Made Easy Thomas Eiter, Tobias Geibinger, Nelson Higuera Ruiz, Nysret Musliu, Johannes Oetsch and Daria Stepanova: Large-Neighbourhood Search for ASP Optimisation
12:30–13:00	Lunch
13:00–13:30
13:30–14:00
14:00–14:30	3	Theresa Swift: Two Languages, One System:Tightly Connecting XSB Prolog and Python Invited Talk 1	Simon Marynissen and Bart Bogaerts Tree-Like Justification Systems are Consistent Simon Marynissen, Bart Bogaerts, Marc Denecker and Jesse Heyninck Nested Justification Systems Marco Alberti, Riccardo Zese, Fabrizio Riguzzi and Evelina Lamma An Iterative Fixpoint Semantics for MKNF Hybrid Knowledge Bases with Function Symbols Spencer Killen and Jia-Huai You A Fixpoint Characterization of Three-Valued Disjunctive Hybrid MKNF Knowledge Bases	TTA-20 Francois Bry, Sebastian Schaffert: Simulation Unification: A Tentative Test of Time Analysis TTA-10 Torsten Schaub, Max Ostrowski	Zach Hansen, Hanxiang Du, Rory Eckel, Justin Lugo, Wanli Xing and Yuanlin Zhang A Preliminary Data-driven Analysis of Common Errors Encountered by Novice Answer Set Programmers Ho Tuan Dung and Tran Cao Son On Model Reconciliation: How to Reconcile When Robot Does not Know Human’s Model? Laura Giordano and Daniele Theseider Dupré An ASP approach for reasoning on neural networks under a finitely many-valued semantics for weighted conditional knowledge bases Alice Tarzariol, Martin Gebser, Konstantin Schekotihin and Mark Law Efficient lifting of symmetry breaking constraints for complex combinatorial problems (best student paper)
14:30–15:00
15:00–15:30		2 RPR Talks 13 min+ 2 questions Michele Fraccaroli, Evelina Lamma and Fabrizio Riguzzi:Exploiting Parameters Learning for Hyper-parameters Optimization in Deep Neural Networks Rocio Gomez, Heather Riley and Mohan Sridharan:What do you really want to do? Towards a Theory of Intentions for Human-Robot Collaboration		2 RPR Talks 13 min+ 2 questions Francesco Chiariello, Fabrizio Maria Maggi and Fabio Patrizi: ASP-Based Declarative Process Mining Tomi Janhunen: Implementing Stable-Unstable Semantics with ASPTOOLS and Clingo
15:30–16:00	Coffe
16:00–16:30	4	David Geleßus and Michael Leuschel Making ProB compatible with SICStus and SWI-Prolog (best application paper) Joaquin Arias, Seppo Törmá, Manuel Carro and Gopal Gupta Building Information Modeling using Constraint Logic Programming Paul Tarau A Gaze into the Internal Logic of Graph Neural Networks, with Logic Paul Tarau Abductive Reasoning in Intuitionistic Propositional Logic via Theorem Synthesis	2 RPR Talks 13 min+ 2 questions Kristian Reale, Francesco Calimeri, Nicola Leone, Simona Perri and Francesco Ricca: Applications of Answer Set Programming to Smart Devices and Large Scale Reasoning Pierre Tassel and Mohamed Rbaia: A Multi-shot ASP Encoding for the Aircraft Routing and Maintenance Planning Problem	Orna Kupferman FLOC Plenary	Thomas Eiter, Nelson Higuera, Johannes Oetsch and Michael Pritz A Neuro-Symbolic ASP Pipeline for Visual Question Answering Yuheng Wang, Giorgian Borca-Tasciuc, Nikhil Goel, Paul Fodor and Michael Kifer Knowledge Authoring with Factual English
16:30–17:00			Panel: Past, Present and Future of Prolog		4 (remaining) RPR talks Wolfgang Faber, Michael Morak and Lukáš Chrpa: Determining Action Reversibility in STRIPS Using Answer Set Programming with Quantifiers Joaquin Arias, Manuel Carro and Gopal Gupta: Towards Dynamic Consistency Checking in Goal-directed Predicate Answer Set Programming Giulia Francescutto, Konstantin Schekotihin and Mohammed M. S. El-Kholany: Solving a Multi-resource Partial-ordering Flexible Variant of the Job-shop Scheduling Problem with Hybrid ASP
17:00–17:30
17:30–18:00	Outside of sessions	FLOC Francesca Rossi: Thinking Fast and Slow in AI
18:00–18:30