CILC 2023
Italian Conference on Computational Logic 2023

Table of Contents

• Preface
  Summary: There were 29 papers submitted for peer-review to this workshop. Out of these, 23 papers were accepted for this volume, 19 as regular papers and 4 as short papers.

Invited Talks

• Logic-Based Benders Decomposition: An Opportunity for Logic Programming Applications
  Marco Gavanelli
• Logic-based Learning of Interpretable Knowledge from Raw Data
  Alessandra M. Russo

Regular Papers

• Preferential Temporal Description Logics with Typicality and Weighted Knowledge Bases
  Mario Alviano, Laura Giordano, Daniele Theseider Dupré
• Advancements in xASP, an XAI System for Answer Set Programming
  Mario Alviano, Ly Ly Trieu, Tran Son, Marcello Balduccini
• ASPECT: Answer Set rePresentation as vEctor graphiCs in laTex
  Alessandro Bertagnon, Marco Gavanelli, Fabio Zanotti
• Temporal Probabilistic Argumentation Frameworks
  Stefano Bistarelli, Victor David, Francesco Santini, Carlo Taticchi
• A Brief History of Singlefold Diophantine Definitions
  Domenico Cantone, Luca Cuzziol, Eugenio G. Omodeo
• Continued Hereditarily Finite Sets Approximations
  Domenico Cantone, Eugenio G. Omodeo, Alberto Policriti
• Scheduling Periodic Treatments Via Answer Set Programming
  Simone Caruso, Carmine Dodaro, Giuseppe Galatà, Marco Maratea
• Set-Based Invariants over Polynomial Systems
  Alberto Casagrande, Alessandro Cimatti, Luca Dorigo, Carla Piazza, Stefano Tonetta
• Fast Prototyping of a Solver for Reduct-based ELP Semantics
  Stefania Costantini, Andrea Formisano
• Preference Management in Epistemic Logic L-DINF
  Stefania Costantini, Andrea Formisano, Valentina Pitoni
• Compilation-based Techniques for Evaluating Normal Logic Programs Under the Well-founded Semantics
  Andrea Cuteri, Giuseppe Mazzotta, Francesco Ricca
• Towards Explainable Data-to-text Generation
  Alessandro Dal Palù, Agostino Dovier, Andrea Formisano
• Graph-Theoretical Arguments in Support of a Quantum Declarative Manifesto
  Alex Della Schiava, Carla Piazza, Riccardo Romanello
• Exploring ILASP Through Logic Puzzles Modelling
  Talissa Dreossi
• A New Approach to Clausification for Intuitionistic Propositional Logic
  Camillo Fiorentini, Mauro Ferrari
• Proof Methods and Theorem Proving for Conditional Logics with Strong Centering
  Valentina Gliozzi, Gian Luca Pozzato, Alberto Valese
• Unlocking Historical Insights: Developing a Dataset from Historical Archives
  Laura Pandolfo, Luca Pulina
• An ASP Approach for the Synthesis of CNOT Minimal Quantum Circuits
  Carla Piazza, Riccardo Romanello, Robert Wille
• Operating Room Scheduling Via Answer Set Programming: The Case of ASL1 Liguria
  Marco Scanu, Marco Mochi, Carmine Dodaro, Giuseppe Galatà, Marco Maratea

Short Papers

• Domain-agnostic Procedural Content Generation Can Be Done Declaratively
  Denise Angilica, Stefano Germano, Giovambattista Ianni
• Verification of Prev-Free Communicating Datalog Programs
  Francesco Di Cosmo
• Introducing Weighted Prototypes in Description Logics for Defeasible Reasoning
  Gabriele Sacco, Loris Bozzato, Oliver Kutz
• Explainable Answer Set Programming for Legal Decision Support
  Daniele Theseider Dupré

Presented papers, published elsewhere

• Complexity and Scalability of Defeasible Reasoning in Many-valued Weighted DL Knowledge Bases
  Mario Alviano, Laura Giordano, Daniele Theseider Dupré
• On the Integration of Answer Set Programming in a Videogame Engine
  Denise Angilica, Giovambattista Ianni, Francesco Pacenza, Jessica Zangari
• Data Augmentation: a Combined Inductive-Deductive Approach Featuring Answer Set Programming
  Pierangela Bruno, Francesco Calimeri, Cinzia Marte, Simona Perri
• Multiple Query Satisfiability of Constrained Horn Clauses
  Emanuele De Angelis, Fabio Fioravanti, Alberto Pettorossi, Maurizio Proietti
• A Declarative Approach to Contrast Pattern Mining
  Francesca Alessandra Lisi, Gioacchino Sterlicchio
• Learning to Break Symmetries for Efficient Optimization in Answer Set Programming
  Alice Tarzariol, Martin Gebser, Konstantin Schekotihin, Mark Law