National conferences

Marco Gavanelli, Marco Alberti, and Evelina Lamma. Integration of abductive reasoning and constraint optimization in SCIFF. In Fabio Fioravanti, editor, Proceedings of the 26th Italian Conference on Computational Logic (CILC-2011), number 810 in CEUR Workshop Proceedings, Pescara, Italy, September 2011.

Marco Alberti, Marco Gavanelli, and Evelina Lamma. The CHR-based implementation of the sciff abductive system. In Fabio Fioravanti, editor, Proceedings of the 26th Italian Conference on Computational Logic (CILC-2011), number 810 in CEUR Workshop Proceedings, Pescara, Italy, September 2011.

Marco Alberti, Marco Gavanelli, and Evelina Lamma. Runtime addition of integrity constraints in SCIFF. In Wolfgang Faber and Nicola Leone, editors, Proceedings of the 25th Italian Conference on Computational Logic, volume 598 of CEUR workshop proceedings, 2010.

Marco Alberti, Massimiliano Cattafi, Marco Gavanelli, and Evelina Lamma. Exploiting semantic technology in computational logic-based service contracting. In Marco Gavanelli and Fabrizio Riguzzi, editors, CILC09: 24-esimo Convegno Italiano di Logica Computazionale, Ferrara, Italy, June 2009. GULP.

Dynamic composition of web services requires an automated step of contracting, i.e., the computation of a possibly fruitful interaction between two (or more) services, based on their policies and goals. In previous work, the SCIFF abductive logic language was used to represent the services' policies, and the associated proof procedure to perform the contracting.

In this paper, we build on that work in order to exploit the results of the Description Logics research area to represent domain specific knowledge, either by importing the knowledge encoded in an ontology into a SCIFF knowledge base, or by interfacing the SCIFF proof procedure to an existing ontological reasoner.

Marco Alberti, Massimiliano Cattafi, Marco Gavanelli, and Evelina Lamma. Exploiting semantic technology in computational logic-based service contracting. In Aldo Gangemi, Johannes Keizer, Valentina Presutti, and Heiko Stoermer, editors, SWAP 2008: 5th workshop on Semantic Web Applications and Perspectives, volume 426 of CEUR Workshop Proceedings, Rome, Italy, December 2008.

Keywords: Choreography, Computational Logic, Run-Time Verification, Web Services

Marco Alberti, Federico Chesani, Marco Gavanelli, Evelina Lamma, Paola Mello, Marco Montali, and Paolo Torroni. Policy-based reasoning for smart web service interaction. In Giovanni Tummarello, Paolo Bouquet, and Oreste Signore, editors, Proceedings of SWAP 2006, the 3rd Italian Semantic Web Workshop, Pisa, Italy, December 2006. CEUR Workshop Proceedings. available electronically at http://ceur-ws.org/Vol-201.

We present a vision of smart, goal-oriented web services that reason about other services' policies and evaluate the possibility of future interactions. We assume web services whose interface behaviour is specified in terms of reactive rules. Such rules can be made public, in order for other web services to answer the following question: “is it possible to inter-operate with a given web service and achieve a given goal?” In this article we focus on the underlying reasoning process, and we propose a declarative and operational abductive logic programming-based framework, called WAVe.

Federico Chesani, Anna Ciampolini, Paola Mello, Marco Montali, Paolo Torroni, Marco Alberti, and Sergio Storari. Protocol specification and verification by using computational logic. In Flavio Corradini, Flavio De Paoli, Emanuela Merelli, and Andrea Omicini, editors, WOA 2005: Dagli Oggetti agli Agenti. 6th AI*IA/TABOO Joint Workshop "From Objects to Agents": Simulation and Formal Analysis of Complex Systems, 14-16 November 2005, Camerino, MC, Italy, pages 184-192. Pitagora Editrice Bologna, 2005.

The aim of this paper is to report on some preliminary results obtained in the context of the MASSIVE research project (http://www.di.unito.it/massive/) relating the formal specification and verification of protocols in some different application field. A protocol is a way to express the right behavior of entities involved in a (possibly complex and distributed) process. The formalism to be used for protocol description should be as intuitive as possible, but it should be also formally defined, in order to allow formal checks both on the features of the protocol itself (e.g. termination), and also on the execution of it. To this purpose, we will show some results obtained by exploiting the SOCS-SI logic-based framework for the specification and the verification of protocols in various applicative fields such as electronic commerce, medicine and e-learning. We will also present a new graphical notation to express medical guidelines, which could be automatically translated into the SOCS formalism.

Marco Alberti, Evelina Lamma, Marco Gavanelli, Paola Mello, Giovanni Sartor, and Paolo Torroni. Mapping deontic operators to abductive expectations. In Proceedings of the Symposium on Normative Multi-Agent Systems, pages 126-136, University of Hertfordshire, Hatfield, UK, April 12-15 2005. The Society for the study of Artificial Intelligence and the Simulation of Behaviour.

A number of approaches to agent society modeling can be found in the Multi-Agent Systems literature which exploit (variants of) Deontic Logic. In this paper, after briefly mentioning related approaches, we focus on the Computational Logic (CL) approach for society modeling developed within the UE IST-2001-32530 Project (named SOCS), where obligations and prohibitions are mapped into abducible predicates (respectively, positive and negative expectations), and norms ruling the behavior of members are represented as abductive integrity constraints. We discuss how this abductive framework can deal with Deontic Logic concepts, by introducing additional integrity constraints.

Marco Alberti, Federico Chesani, Marco Gavanelli, Alessio Guerri, Evelina Lamma, Paola Mello, and Paolo Torroni. Expressing interaction in combinatorial auction through social integrity constraints. In Alfredo Milani, editor, Conferenza Italiana sui Sistemi Intelligenti, page 80, Perugia (Italy), sep 2004. AI*IA, SIREN, GIPR, Morlacchi Editore.

Combinatorial Auctions are an attractive application of intelligent agents; their applications are countless and are shown to provide good revenues. On the other hand, one of the issues they raise is the computational complexity of the solving process (the Winner Determination Problem, WDP), that delayed their practical use. Recently, efficient solvers have been applied to the WDP, so the framework starts to be viable.

A second issue, common to many other agent systems, is trust: in order for an agent system to be used, the users must trust both their representative and the other agents inhabiting the society: malicious agents must be found, and their violations discovered. The SOCS project addresses such issues, and provided a language, the social integrity constraints, for defining the allowed interaction moves, together with a proof procedure able to detect violations.

In this paper we show how to write a protocol for the combinatorial auctions by using social integrity constraints. In the devised protocol, the auctioneer interacts with an external solver for the winner determination problem.

Marco Alberti, Evelina Lamma, Marco Gavanelli, Paola Mello, Giovanni Sartor, and Paolo Torroni. Towards a mapping of deontic logic onto an abductive framework. In Alfredo Milani, editor, Conferenza Italiana sui Sistemi Intelligenti, page 79, Perugia (Italy), sep 2004. AI*IA, SIREN, GIPR, Morlacchi Editore.

Marco Alberti, Marco Gavanelli, Evelina Lamma, Paola Mello, and Paolo Torroni. An abductive interpretation for open agent societies. In A. Cappelli and F. Turini, editors, AI*IA 2003: Advances in Artificial Intelligence: 8th Congress of the Italian Association for Artificial Intelligence Pisa, Italy, September 23-26, 2003 Proceedings, volume 2829 of Lecture Notes in Artificial Intelligence, pages 287-299, Pisa, Italy, September 23-26 2003. Springer Verlag.

The focus of this work is on the interactions among (possibly heterogeneous) agents that form an open society, and on the definition of a computational logic-based architecture for agent interaction. We propose a model where the society defines the allowed interaction protocols, which determine the “socially” allowed agent interaction patterns. The semantics of protocols can be defined by means of social integrity constraints. The main advantages of this approach are in the design of societies of agents, and in the possibility to detect undesirable behavior. In the paper, we present the model for societies ruled by protocols expressed as integrity constraints, and its declarative semantics. A sketch of the operational counterpart is also given.

Pubblicazioni