Programma

Presentazione del libro A 25-Year Perspective on Logic Programming

Agostino Dovier, Enrico Pontelli

11:30 - 12:00: "CLP-based Protein Fragment Assembly" Alessandro Dal Palù, Agostino Dovier, Federico Fogolari, Enrico Pontelli

12:00 - 12:30: "Runtime Addition of Integrity Constraints in SCIFF" Marco Alberti, Marco Gavanelli, Evelina Lamma

12:30 - 13:00: "Autonomous Agents Coordination: Action Description Languages Meet CLP(FD) and Linda" Agostino Dovier, Andrea Formisano, Enrico Pontelli

13:00 - 13:30: "Constraints among Commitments: Regulative Specification of Interaction Protocols" Matteo Baldoni, Cristina Baroglio, Elisa Marengo

The Role of Logics and Logic Programming in Semantic Web Standards (OWL2, RIF, SPARQL1.1)

Axel Polleres

Slides (PDF)

In this tutorial, we will give an overview of the new W3C standards OWL2 and RIF and their interplay with the query language SPARQL, particularly the new version of SPARQL, SPARQL 1.1 currently being worked on in W3C.

As we will see, fragments of these standards can be reduced to fragments of Logic Programming, and practical systems consuming these Web languages can be developed on top of engines such as DLV.

16:30 - 17:00: "A Transformation Strategy for Verifying Logic Programs on Infinite Lists" Alberto Pettorossi, Maurizio Proietti, Valerio Senni (versione aggiornata)

17:00 - 17:30: "Generalization Strategies for the Verification of Infinite State Systems" Fabio Fioravanti, Alberto Pettorossi, Maurizio Proietti, Valerio Senni (versione aggiornata)

17:30 - 18:00: "Trattamento del Linguaggio Naturale Tramite Prolog: un Approccio Promettente per Generare Istituzioni Virtuali da Testi Scritti" Michele Bozzano, Angela Locoro, Maurizio Martelli, Viviana Mascardi

Why even old AI-folks get very excited about Answer Set Programming

Gerhard Friedrich

Slides (PDF)

Twenty years ago, when my project group first tried to use Datalog to solve configuration tasks for a large international company, it failed even for the simplest of cases because of excessive runtime. Other approaches like description logic were not even able to express the problem.

However, times have changed dramatically and the success of Answer Set Programming (ASP) has been underlined by many prominent success stories. So the question is not if ASP will be successful in solving practical problems but rather whether it can become the major knowledge representation language.

In order to answer this question I will investigate three classical problem domains of Artificial Intelligence: (1) diagnosis-from-first principles and repair which has recently been applied to self-healing processes and web services, (2) configuration, and (3) recommender systems.

I will show that ASP allows these problems to be represented very simply and that ASP provides reasoning services which closely fit the original problem specifications. However, there is still work for the ASP community. Based on long-standing experience in developing real-world knowledge-based systems I will pinpoint open issues which deserve further investigation in order to expand the applicability of ASP.

Concluding, ASP reasoning systems provide the knowledge representation and processing environments that many AI-folks have waited a long time for.

11:30 - 12:00: "Reasoning About Typicality in Preferential Description Logics: Preferential vs Rational Entailment" Laura Giordano, Valentina Gliozzi, Nicola Olivetti, Gian Luca Pozzato

12:00 - 12:30: "A Constructive Conditional Logic for Access Control" Valerio Genovese, Laura Giordano, Valentina Gliozzi, Gian Luca Pozzato

12:30 - 13:00: "Dual Tableau-based Decision Procedures for Some Relational Logics" Domenico Cantone, Marianna Nicolosi Asmundo, Ewa Orłowska

13:00 - 13:30: "A Decision Procedure for a Two-sorted Extension of Multi-Level Syllogistic with the Cartesian Product and Some Map Constructs" Domenico Cantone, Cristiano Longo, Marianna Nicolosi Asmundo

L'escursione ci porta sull'altopiano della Sila, con una visita al Parco Nazionale della Sila e la cena sociale presso il ristorante La Tavernetta.

Itinerario dettagliato (PDF).

Nonmonotonic Tools for Argumentation

Gerhard Brewka

Slides (PDF)

In argumentation, the question whether a (pro)position p is accepted or not is decided by constructing and possibly weighing arguments pro and con p. The arguments are generated from a – possibly inconsistent and/or defeasible – knowledge base. Several nonmonotonic tools have been developed which abstract away from the specific content of the arguments and focus on particular services, for instance for conflict solving among arguments.

The most popular example of such a tool are Dung’s argumentation frameworks (AFs) which define a "calculus of opposition" and are probably the simplest nonmonotonic systems available. Given a set of arguments with an attack relation among them, AFs come with different semantics, where a semantics specifies which subsets of the arguments are acceptable. The different semantics represent different intuitions how to select arguments, as well as different degrees of skepticism.

In the talk I will present abstract dialectical frameworks (ADFs), a powerful generalization of AFs where nodes in the argument graph, rather than having an implicit acceptance condition, come with an explicit boolean function specifying when the node is to be accepted based on the status of its parents. This allows us to represent support in addition to attack, and to express flexible ways of taking pro and con arguments into account.

We illustrate the usefulness of ADFs by reconstructing Carneades argument evaluation structures (CAES). Carneades, developed by Gordon, Prakken and Walton, is an influential and widely cited argumentation system, motivated by the needs of legal argumentation. It covers relevant aspects such as burden of proof, proof standards and the like. We show how CAES can be reconstructed as ADFs. This not only demonstrates the generality of ADFs. It also allows us to lift a restriction of CAES to acyclic sets of arguments and provides the generalized systems with the standard semantics developed by Dung.

11:30 - 12:00: "Optimized Encodings for Consistent Query Answering via ASP from Different Perspectives" Marco Manna, Francesco Ricca, Giorgio Terracina

12:00 - 12:30: "Towards Translating Natural Language Sentences into ASP" Stefania Costantini, Alessio Paolucci

12:30 - 13:00: "Parallel Instantiation in DLV" Simona Perri, Francesco Ricca, Marco Sirianni

13:00 - 13:30: "Reasoning about Actions with Temporal Answer Sets" Laura Giordano, Alberto Martelli, Daniele Theseider Dupré

15:00 - 15:30: "An Extended Semantics for Logic Programs with Annotated Disjunctions and its Efficient Implementation" Fabrizio Riguzzi, Terrance Swift

15:30 - 16:00: "Probabilistic Logic-Based Process Mining" Elena Bellodi, Fabrizio Riguzzi, Evelina Lamma

16:30 - 17:00: "Solving Weighted Argumentation Frameworks with Soft Constraints" Stefano Bistarelli, Daniele Pirolandi, Francesco Santini

17:00 - 17:15: "Evoluzioni di Ontologie in Frame Logic" Francesco Mele, Antonio Sorgente, Giuseppe Vettigli

17:15 - 17:30: "A Visual Interface for Drawing ASP Programs" Onofrio Febbraro, Kristian Reale, Francesco Ricca

17:30 - 17:45: "Team-building with Answer Set Programming in the Gioia-Tauro Seaport" Giovanni Grasso, Salvatore Iiritano, Vincenzino Lio, Francesco Ricca, Francesco Scalise