CILC 2019
Italian Conference on Computational Logic

Table of Contents

• Preface
  
  
• Committees
  
  

Tutorials

• The SATisfiability problem and its impact 1
  Agostino Dovier
• Multi-Agent Epistemic Planning 2
  Enrico Pontelli
• Model Checking: The Interval Way 3
  Angelo Montanari

Session 1: Analysis and Verification of Programs

• The Blame Game for Property-based Testing 4-13
  Alberto Momigliano, Mario Ornaghi

Session 2a: Knowledge Representation and Reasoning Languages

• Augmenting Knowledge Representation and Reasoning Languages with Customizable Metalogic Features 14-29
  Stefania Costantini, Andrea Formisano
• Towards a Forensic Event Ontology to Assist Video Surveillance-based Vandalism Detection 30-47
  Faranak Sobhani, Umberto Straccia
• Event Detection from Video Using Answer Set Programing 48-58
  Abdullah Khan, Luciano Serafini, Loris Bozzato, Beatrice Lazzerini
• An Ontology for Legacy Data on Ancient Ceramics of the Plain of Catania 59-67
  Roldolfo Brancato, Marianna Nicolosi-Asmundo, Grazia Pagano, Daniele Francesco Santamaria, Salvatore Ucchino
• Strengthening the Rational Closure for Description Logics: An Overview 68-81
  Laura Giordano, Valentina Gliozzi

Session 2b: Computational Logics and Formal Methods in AI

• Logics in Machine Learning and Data Mining: Achievements and Open Issues 82-88
  Francesca Alessandra Lisi
• Simple and Effective Sign Consistency Using Interval Arithmetic 89-103
  Federico Bergenti, Stefania Monica
• Does Every Recursively Enumerable Set Admit a Finite-Fold Diophantine Representation? 104-122
  Domenico Cantone, Alberto Casagrande, Francesco Fabris, Eugenio Omodeo
• Polynomial-Time Satisfiability Tests for Boolean Fragments of Set Theory 123-137
  Domenico Cantone, Andrea De Domenico, Pietro Maugeri, Eugenio Omodeo

Ambassador Talk

• DigForASP: A European Cooperation Network for Logic-based AI in Digital Forensics 138-146
  Stefania Costantini, Francesca Alessandra Lisi, Raffaele Olivieri

Session 3: Tools and Applications

• PEAR: a Tool for Reasoning About Scenarios and Probabilities in Description Logics of Typicality (short paper) 147-156
  Gian Luca Pozzato, Gabriele Soriano
• GOCCIOLA: Generating New Knowledge by Combining Concepts in Description Logics of Typicality (short paper) 157-166
  Antonio Lieto, Federico Perrone, Gian Luca Pozzato
• Empowering ASPQ to Win in QBFEval 2018 167-178
  Bernardo Cuteri, Carmine Dodaro, Francesco Ricca
• Towards the Generation of the "Perfect" Log Using Abductive Logic Programming 179-192
  Federico Chesani, Chiara Di Francescomarino, Chiara Ghidini, Daniela Loreti, Fabrizo Maria Maggi, Paola Mello, Marco Montali, Vasyl Skydanienko, Sergio Tessaris
• A Tool For Ranking Arguments Through Voting-Games Power Indexes 193-201
  Stefano Bistarelli, Francesco Faloci, Francesco Santini, Carlo Taticchi
• KRaider: a Crawler for Linked Data 202-216
  Giuseppe Cota, Fabrizio Riguzzi, Riccardo Zese, Evelina Lamma

Session 4a: Multi-Agent Systems

• Reasoning about Memory Management in Resource-Bounded Agents 217-228
  Stefania Costantini, Valentina Pitoni
• Timed Trace Expressions 229-241
  Luca Ciccone, Angelo Ferrando, Davide Ancona, Viviana Mascardi
• Non-Well-Founded Set Based Multi-Agent Epistemic Action Language 242-259
  Francesco Fabiano, Idriss Riouak, Agostino Dovier, Enrico Pontelli

Session 4b: Databases

• FO Queries Strongly Distributing over Components in Arbitrary Cardinality 260-268
  Francesco Di Cosmo
• An Infrastructure for Multi-shot Reasoning with Incremental Grounding 269-278
  Giovambattista Ianni, Francesco Pacenza, Jessica Zangari

Session 5: Answer Sets

• Computing Modular Paracoherent Answer Sets: Preliminary Result 279-288
  Bernardo Cuteri, Carmine Dodaro, Francesco Ricca
• Debugging of Answer Set Programs Using Paracoherent Reasoning 289-299
  Bernardo Cuteri, Carmine Dodaro, Francesco Ricca
• Learning Answer Set Programming Rules For Ethical Machines 300-315
  Abeer Dyoub, Stefania Costantini, Francesca Alessandra Lisi
• Towards Distributed Computation of Answer Sets 316-326
  Marco De Bortoli, Federico Igne, Pietro Totis, Agostino Dovier, Enrico Pontelli
• Evolution of Algorithm Portfolio for Solving Strategies 327-341
  Alice Tarzariol

CILC 2019 also featured presentations of the following papers:

• Epistemic Answer Set Programming: A New Perspective
  Ezgi Iraz Su
• Extending ALC with the power-set construct
  Laura Giordano, Alberto Policriti
• Accountable Protocols in Abductive Logic Programming
  Marco Gavanelli, Marco Alberti, Evelina Lamma
• Model Completeness, Covers and Superposition (Abridged Version)
  Diego Calvanese, Silvio Ghilardi, Alessandro Gianola, Marco Montali, Andrey Rivkin
• An Ontology to Improve the First Aid Service Quality
  Lorenzo De Lauretis, Stefania Costantini
• Proving Properties of Sorting Programs: A Case Study in Horn Clause Verification
  Emanuele De Angelis, Fabio Fioravanti, Alberto Pettorossi, Maurizio Proietti
• An ASP-based Approach for Optimizing DLV Evaluation
  Carlo Allocca, Francesco Calimeri, Roberta Costabile, Alessio Fiorentino, Nicola Leone, Marco Manna, Simona Perri, Jessica Zangari
• Large Scale DLV: Preliminary Results
  Nicola Leone, Carlo Allocca, Mario Alviano, Francesco Calimeri, Cristina Civili, Roberta Costabile, Bernardo Cuteri, Alessio Fiorentino, Davide Fuscà, Stefano Germano, Giovanni Laboccetta, Marco Manna, Simona Perri, Kristian Reale, Francesco Ricca, Pierfrancesco Veltri, Jessica Zangari
• A Process Algebra for (Delimited) Persistent Stochastic Non-Interference
  Andrea Marin, Carla Piazza, Sabina Rossi
• Accountability, Responsibility and Robustness in Agent Organizations
  Matteo Baldoni, Cristina Baroglio, Roberto Micalizio