author = {Giacomo Gamberoni and Evelina Lamma and Fabrizio Riguzzi and  Sergio Storari and Stefano Volinia},
  title = {Bayesian Networks Learning for Gene Expression Datasets},
  booktitle = {Advances in Intelligent Data Analysis VI: 6th International Symposium on Intelligent Data Analysis, {IDA} 2005, Madrid, Spain, \September\  8-10, 2005. Proceedings},
  year = {2005},
  publisher = {Springer Verlag},
  address = {Heidelberg, \Germany},
  month = sep,
  series = {Lecture Notes in Computer Science},
  volume = {3646},
  note = {The original publication is available at \url{http://www.springerlink.com}},
  pages = {109--120},
  isbn = {3-540-28795-7},
  issn = {0302-9743},
  doi = {10.1007/11552253_11},
  http = {http://dx.medra.org/10.1007/11552253_11},
  pdf = {http://ml.unife.it/wp-content/uploads/Papers/GamLamRig-IDA05.pdf},
  copyright = {Springer}
  key = 001,
  author = {Marco Alberti And Marco Gavanelli And Evelina Lamma And  Paola Mello And Michela Milano},
  title = {A {CHR}-based implementation of known arc-consistency},
  journal = {Theory and Practice of Logic Programming},
  year = 2005,
  volume = 5,
  number = {4/5},
  pages = {419-440},
  month = jul,
  http = {http://journals.cambridge.org/action/displayIssue?jid=TLP&volumeId=5&issueId=4-5},
  doi = {http://dx.doi.org/10.1017/S147106840500236X},
  abstract = {  In classical CLP(FD) systems, domains of variables are completely
  known at the beginning of the constraint propagation process.
  However, in systems interacting with an external environment, this
  assumption may lead to waste of computation time, or even to
  obsolescence of the acquired data at the time of use.

  For such cases, the Interactive Constraint Satisfaction Problem
  (ICSP) model has been proposed as an extension of the CSP model, to
  make it possible to start constraint propagation even when domains are
  not fully known, performing acquisition of domain elements only when
  necessary and without the need to restart propagation after every

  In this paper, we present a two sorted CLP language to express and
  solve ICSPs, and its implementation in the Constraint Handling Rules
  (CHR) language, a declarative language particularly suitable for
  high level implementation of constraint solvers.},
  issn = {1471-0684},
  note = {IF: 1.372}
  author = {Marco Alberti and Marco Gavanelli and Evelina Lamma and Paola Mello and Paolo Torroni},
  title = {Abduction with hypotheses confirmation},
  booktitle = {IJCAI-05 Proceedings of the Nineteenth International Joint Conference on Artificial Intelligence},
  year = {2005},
  editor = {Fausto Giunchiglia},
  pages = {1545--1546},
  publisher = {Professional Book Center},
  address = {USA},
  isbn = {0-938075-93-4},
  url = {http://www.ing.unife.it/docenti/MarcoGavanelli/publications/poster-ijcai05.ppt},
  pdf = {http://ijcai.org/papers/post-0385.pdf}
  author = {Marco Alberti and Marco Gavanelli and Evelina Lamma and Paola Mello and Paolo Torroni},
  title = {The \textit{S}{CIFF} abductive proof-procedure},
  booktitle = {AI*IA 2005: Advances in Artificial Intelligence: 9th Congress of the Italian Association for Artificial Intelligence, Milan, Italy, September 21-32, 2005. Proceedings},
  year = {2005},
  editor = {Stefania Bandini and Sara Manzoni},
  journal = {Lecture Notes in Artificial Intelligence},
  address = {Berlin},
  publisher = {Springer Verlag},
  pages = {135-147},
  volume = {3673},
  issn = {0302-9743},
  abstract = {We propose an operational framework which builds on the classical
understanding of abductive reasoning in logic programming, and
extends it in several directions. The new features include the
ability to reason with a dynamic knowledge base, where new facts
can be added anytime, the ability to generate expectations about
such new facts occurring in the future (forecasting), and the
process of confirmation/disconfirmation of such expectations.},
  note = {IF: 0.302}
  author = {Marco Alberti and Federico Chesani and Marco Gavanelli and Evelina Lamma and Paola Mello and Paolo Torroni},
  title = {The {SOCS} Computational Logic Approach to the Specification and Verification of Agent Societies},
  booktitle = {Global Computing: {IST/FET} International Workshop, GC 2004 Rovereto, Italy, March 9-12, 2004 Revised Selected Papers},
  year = {2005},
  issn = {0302-9743},
  month = feb,
  editor = {Corrado Priami and Paola Quaglia},
  journal = {Lecture Notes in Computer Science},
  doi = {10.1007/b103251},
  publisher = {Springer Verlag},
  address = {Berlin, Germany},
  abstract = {This article summarises part of the work done during the first
two years of the SOCS project, with respect to the task of
modelling interaction amongst CL-based agents. It describes the
SOCS social model: an agent interaction specification and
verification framework equipped with a declarative and
operational semantics, expressed in terms of abduction. The
operational counterpart of the proposed framework has been
implemented and integrated in SOCS-SI, a tool that can be used
for on-the-fly verification of agent compliance with respect to
specified protocols.},
  pages = {314 - 339},
  volume = 3267,
  note = {IF: 0.402}
  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 = {http://ia.di.uniba.it/}

This file was generated by bibtex2html 1.98.