author = {Marco Alberti and Federico Chesani},
  title = {The computational behaviour of the {SCIFF} abductive proof procedure and the {SOCS-SI} system},
  journal = {Intelligenza Artificiale},
  year = 2005,
  volume = {II},
  number = 3,
  pages = {45--51},
  month = {September},
  issn = {1724-8035},
  abstract = {The high computational cost of abduction has limited the application
of this powerful and expressive formalism to practical cases.

SCIFF is an abductive proof procedure used for verifying the
compliance of agent behaviour to interaction protocols in multi-agent
systems; SCIFF has been integrated in SOCS-SI, a system able to
observe the agent interaction, pass it to SCIFF for the reasoning
process and to display in a GUI the results of the SCIFF

In order to assess the applicability of SCIFF and SOCS-SI to
practical cases, we have evaluated qualitatively and experimentally
(not yet formally) their computational behaviour, concerning
limitations and scalability. In this paper we show the results of
the analysis.}
  author = {Marco Alberti and Federico Chesani and Marco Gavanelli and Alessio Guerri and Evelina Lamma and Paola Mello and Paolo Torroni},
  title = {Expressing Interaction in Combinatorial Auction through Social Integrity Constraints},
  journal = {Intelligenza Artificiale},
  year = {2005},
  pages = {22--29},
  volume = {{II}},
  number = {1},
  abstract = {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 {\em
trust}: in order for an agent system to be used, the users must
{\em 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.},
  issn = {1724-8035},
  url = {}

This file was generated by bibtex2html 1.98.