(Best Paper Honorable Mention) A
Logical Characterization of the Preferred Models
of Logic Programs with Ordered Disjunction
(20 min.) Angelos
Charalambidis, Panos Rondogiannis and Antonis
Troumpoukis
Fixpoint Semantics for Recursive SHACL
(10 min.) Bart Bogaerts and
Maxime Jakubowski
Weighted Conditional EL Knowledge Bases with
integer weights: an ASP Approach (10
min.) Laura Giordano and Daniele
Theseider Dupre
Towards a Semantics for hybrid ASP systems
(10 min.) Pedro Cabalar,
Jorge Fandinno, Torsten Schaub and Philipp
Wanko
Refining the Semantics of Epistemic
Specifications (20 min.) Ezgi
Iraz Su
15:30 - 16:00. Break
16:00 - 16:45. John Alan Robinson 20-year
Test-of-Time Award Talk (Chair: Mirek
Truszczynski) [Video]
Ultimate Well-Founded and Stable Semantics for
Logic Programs with Aggregates (45
min.) Marc Denecker, Nikolay
Pelov, and Maurice Bruynooghe
16:45 - 17:30. Session 2 - Languages &
Implementations (Chair: Wolfgang
Faber) [Video]
FOLASP: FO(.) as Input Language for Answer Set
Solvers (20 min.) Kylian
Van Dessel, Jo Devriendt and Joost
Vennekens
Unifying Framework for Optimizations in CASP;
SMT; ILP (10 min.) Yuliya
Lierler
Natlog: a Lightweight Logic Programming
Language with a Neuro-symbolic Touch (20
min.) Paul Tarau
17:30 - 18:00. Break
18:00 - 19:00. Invited Talk
(Chair: Paul
Tarau) [Video]
Quantitative and Stream Extensions of Answer
Set Programming (20 min.) Rafael Kiesel
Determining Action Reversibility in STRIPS
Using Answer Set and Epistemic Logic Programming
(20 min.) Wolfgang Faber,
Michael Morak and Lukas Chrpa
I-DLV-SR: A Stream Reasoning System based on
I-DLV (20 min.) Francesco
Calimeri, Marco Manna, Elena Mastria, Maria
Concetta Morelli, Simona Perri and Jessica
Zangari
APIA: An Architecture for Policy-Aware
Intentional Agents (20 min.)
John Meyer and Daniela Inclezan
Reasoning over Streams of Events with
Temporally-Constrained Effects (10
min.) Periklis Mantenoglou, Manolis
Pitsikalis and Alexander Artikis
Reasoning on Multi-Relational Contextual
Hierarchies via Answer Set Programming with
Algebraic Measures (20 min.)
Loris Bozzato, Thomas Eiter and Rafael
Kiesel
Modal Logic S5 Satisfiability in Answer Set
Programming (20
min.) Mario Alviano, Sotiris
Batsakis and George Baryannis
Planning with Incomplete Information in
Quantified Answer Set Programming (20
min.) Jorge Fandinno, François
Laferriere, Javier Romero, Torsten Schaub
and Tran Cao Son
17:00 - 17:30. Break
17:30 - 19:00. Invited Talk and Panel
(Chair: David
S. Warren) [Video]
Non-ground Abductive Logic Programming with
Probabilistic Integrity Constraints (20
min.) Elena Bellodi, Marco
Gavanelli, Riccardo Zese, Evelina Lamma and
Fabrizio Riguzzi
Optimizing Probabilities in Probabilistic
Logic Programs (20 min.) Damiano Azzolini and Fabrizio
Riguzzi
An asymptotic analysis of probabilistic logic
programming, with implications for expressing
projective families of distributions (20
min.) Felix Weitkämper
Probabilistic Defeasible Logic Programming:
Towards Explainable and Tractable Query Answering
(10 min.) Mario
A. Leiva, Alejandro J. García, Paulo Shakarian
and Gerardo I. Simari
Syntactic Requirements for Well-defined Hybrid
Probabilistic Logic Programs (20
min.) Damiano Azzolini and
Fabrizio Riguzzi
15:30 - 16:00. Break
16:00 - 16:45. Alain Colmerauer 10-year
Test-of-Time Award Talk (Chair: Manuel
Hermenegildo) [Video]
The PITA System: Tabling and Answer
Subsumption for Reasoning under Uncertainty
(45 min.) Fabrizio
Riguzzi and Theresa Swift
Transformation-Enabled Precondition Inference
(20 min.) Bishoksan
Kafle, Graeme Gange, Peter Schachte, Harald
Sondergaard and Peter J. Stuckey
Solution Enumeration by Optimality in Answer
Set Programming (20 min.)
Jukka Pajunen and Tomi Janhunen
DMAPF: A Decentralized and Distributed Solver
for Multi-Agent Path Finding Problem with
Obstacles (20 min.) Poom
Pianpak and Tran Cao Son
Modeling and Solving Graph Synthesis Problems
Using SAT-Encoded Reachability Constraints in
Picat (20 min.) Neng-Fa
Zhou
An Answer Set Programming based framework for
High-Utility Pattern Mining extended with Facets
and Advanced Utility Functions (10
min.) Francesco Cauteruccio
and Giorgio Terracina
15:30 - 16:00. Break
16:00 - 17:30. Session 8 - Applications I
(Chair: Tran Cao
Son) [Video]
Refactoring the Whitby Intelligent Tutoring
System for Clean Architecture (20
min.) Paul Brown, Vania
Dimitrova, Glen Hart, Anthony Cohn and Paulo
Moura
Logic-Based Multi Agent System for Ethical
Monitoring and Evaluation in Dialogue Systems
(10 min.) Abeer Dyoub,
Stefania Costantini, Francesca A. Lisi and Ivan
Letteri
Automatically Generating Concurrent Programs
From Sequential Data Structure Knowledge using
Answer Set Programming (20
min.) Sarat Chandra
Varanasi, Neeraj Mittal and Gopal
Gupta
Geolog: Scalable Logic Programming on Spatial
Data (20 min.) Tobias
Grubenmann and Jens Lehmann
DiscASP: A Graph-based ASP System for Finding
Relevant Consistent Concepts with Applications to
Conversational Socialbots (20
min.) Fang Li, Huaduo Wang, Kinjal
Basu, Elmer Salazar and Gopal Gupta
Planning for an Efficient Implementation of
Hypothetical Bousi~Prolog (20
min.) Pascual Julian-Iranzo and
Fernando Sáenz-Pérez
(Best Paper Award and Best Student Paper
Award) Utilizing Treewidth for
Quantitative Reasoning on Epistemic Logic Programs
(20 min.) Viktor
Besin, Markus Hecher and Stefan
Woltran
Harnessing Incremental ASP Solving for
Reasoning in Assumption-Based Argumentation
(20 min.) Tuomo
Lehtonen, Johannes P. Wallner and Matti
Järvisalo
VeriFly: On-the-fly Assertion Checking via
Incrementality (tool paper) (20
min.) Miguel A. Sanchez-Ordaz,
Isabel Garcia-Contreras, Victor
Perez, Jose F. Morales, Pedro Lopez-Garcia and
Manuel V. Hermenegildo
15:30 - 16:00. Break
16:00 - 16:40. Session 10 - Recently Published
Research (Chair: Joaquin
Arias) [Video]
Semantics for Hybrid Probabilistic Logic
Programs with Function Symbols (10
min.) Damiano Azzolini,
Fabrizio Riguzzi and Evelina Lamma
Towards solving path planning in keyhole
neurosurgery with Answer Set Programming (10
min.) Valentina Corbetta,
Alice Segato, Jessica Zangari, Simona Perri,
Francesco Calimeri and Elena De Momi
Extended Abstract: Non-monotonic Logical
Reasoning and Deep Learning for Transparent
Decision Making in Robotics (10
min.) Mohan Sridharan, Tiago
Mota and Ales Leonardis
In Pursuit of an Efficient SAT Encoding for
the Hamiltonian Cycle Problem (10
min.) Neng-Fa Zhou
Here and There with Arithmetic (20
min.) Vladimir
Lifschitz
Verification of Locally Tight Programs
(10 min.) Jorge
Fandinno and Vladimir Lifschitz
A note on occur-check (20
min.) Wlodek
Drabent
A Logic Program Transformation for Strongly
Persistent Forgetting (10
min.) Felicidad Aguado, Pedro
Cabalar, Jorge Fandinno, Gilberto Pérez and
Concepción Vidal
Splitting a Logic Program Efficiently
(20 min.) Rachel
Ben-Eliyahu-Zohary
Knowledge-Based Stable Roommates Problem: A
Real-World Application (20
min.) Müge Fidan and Esra
Erdem
(Best Application Paper Award)
An ASP-based Solution to the Chemotherapy
Treatment Scheduling problem (20
min.) Carmine Dodaro, Giuseppe
Galatà, Andrea Grioni, Marco Maratea, Marco
Mochi and Ivan Porro
Combining deep learning and ASP-based models
for the semantic segmentation of medical images
(10 min.) Pierangela Bruno,
Francesco Calimeri, Cinzia Marte and Marco
Manna
Stable Marriage Problems: An Empirical
Comparison of ASP, CP, ILP, and Local Search
Methods (10 min.) Selin
Eyupoglu, Müge Fidan, Yavuz Gulesen, Ilayda
Begum Izci, Berkan Teber, Baturay Yilmaz, Ahmet
Alkan and Esra Erdem
