author = {
 Evelina Lamma and Paola Mello and Marco Montali and Fabrizio Riguzzi and Sergio Storari},
  title = {Inducing Declarative Logic-Based Models from Labeled Traces},
  booktitle = {Proceedings of the 5th International Conference on Business Process Management},
  year = {2007},
  publisher = {Springer},
  series = {Lecture Notes in Computer Science},
  pdf = {http://ml.unife.it/wp-content/uploads/Papers/LamMelMon-BPM07.pdf},
  http = {http://link.springer.com/chapter/10.1007%2F978-3-540-75183-0_25},
  doi = {10.1007/978-3-540-75183-0_25},
  volume = {4714},
  pages = {344--359},
  address = {Heidelberg, \Germany},
  copyright = {Springer},
  note = {The original publication is available at \url{http://www.springerlink.com}}
  author = {
 Evelina Lamma and Fabrizio Riguzzi and Sergio Storari and Paola Mello and Marco Montali  },
  title = {Learning DecSerFlow Models  from Labeled Traces},
  booktitle = {Proceedings of the 1st International Workshop on the Induction of Process Models},
  year = {2007},
  pdf = {http://ml.unife.it/wp-content/uploads/Papers/LamRigStoMelMon-IPM07.pdf},
  abstract = {We present the system DecMiner that induces DecSerFlow models from positive and negative traces. The approach we follow consists in first inducing SCIFF constraints and then converting them into DecSerFlow ones.
  keywords = {Process mining, Process verification and validation, Logic Programming, DecSerFlow, Careflow}
  author = {
Giacomo Gamberoni and Evelina Lamma and Fabrizio Riguzzi and Sergio Storari and Chiara Scapoli },
  title = {Combining APRIORI and Bootstrap Techniques for Marker Analysis},
  booktitle = {Proceedings of the Workshop Data Mining in Functional Genomics and Proteomics: Current Trends and Future Directions},
  year = {2007},
  pdf = {http://ml.unife.it/wp-content/uploads/Papers/GamLamRigScaSto-DMFG07.pdf},
  abstract = {In genetic studies, complex diseases are often analyzed searching for
marker patterns that play a significant role in the susceptibility to the
In this paper we consider a dataset regarding periodontitis, that includes the analysis of nine genetic markers for 148 individuals.
We analyze these data by using a novel subgroup discovering algorithm, named APRIORI-B, that is based on APRIORI and bootstrap techniques. This algorithm can use different metrics for rule selection.
Experiments conducted by using as rule metrics novelty and confirmation, confirmed some previous results published on periodontitis.},
  keywords = {Data Mining, Functional Genomics, Marker Analysis, Periodontitis}
  author = {Marco Alberti and Federico Chesani and Davide Daolio and
  Marco Gavanelli and Evelina Lamma and Paola Mello and Paolo
  title = {Specification and Verification of Agent Interaction Protocols
  in a Logic-based System},
  journal = {Scalable Computing: Practice and Experience},
  year = 2007,
  volume = 8,
  number = 1,
  pages = {1-13},
  month = {March},
  abstract = {A number of information systems can be described as a set of
interacting entities, which must follow interaction protocols. These
protocols determine the behaviour and the properties of the overall
system, hence it is of the uttermost importance that the entities
behave in a conformant manner.
A typical case is that of multi-agent systems, composed of a
plurality of agents without a centralized control. Compliance to
protocols can be hardwired in agent programs; however, this requires
that only ``certified'' agents interact. In open systems, composed
of autonomous and heterogeneous entities whose internal structure
is, in general, not accessible (open agent societies being, again, a
prominent example) interaction protocols should be specified in
terms of the \textit{observable} behaviour, and compliance should be
verified by an external entity.

In this paper, we propose a Java-Prolog-CHR system for
verification of compliance of computational entities to protocols
specified in a logic-based formalism (\textit{Social Integrity
Constraints}). We also show the application of the formalism and the
system to the specification and verification of three different
scenarios: two specifications show the feasibility of our approach
in the context of Multi Agent Systems (FIPA Contract-Net Protocol
and Semi-Open societies), while a third specification applies to the
specification of a lower level protocol (Open-Connection phase of
the TCP protocol).},
  issn = {1895-1767}
  author = {Marco Alberti and Federico Chesani and Marco Gavanelli and Evelina Lamma and Paola Mello and
  	Marco Montali and Sergio Storari and Paolo Torroni},
  title = {A Computational Logic-based Approach to Verification of {IT} Systems},
  booktitle = {Proceedings of the $14^{th}$ Annual Workshop of HP Software University Association,
  	Hosted by the Leibniz Computing Center and the Munich Network Management Team, July 8--11, 2007},
  year = {2007},
  editor = {H.-G. Hegering and H. Reiser and M. Schiffers and Th. Nebe},
  pages = {115--125},
  organization = {HP Software University Association},
  publisher = {Infonomics-Consulting},
  address = {Stuttgart, Germany},
  month = jul,
  isbn = {978-3-00-021690-9},
  url = {http://www.hp.com/go/hpsua/},
  http = {http://www.amazon.com/Proceedings-Workshop-Software-University-Association/dp/3000216901/ref=sr_11_1/104-8624695-3441506?ie=UTF8&qid=1189352518&sr=11-1}
  author = {Marco Alberti and Federico Chesani and Marco Gavanelli
 and Evelina Lamma and Paola Mello and Marco Montali and Paolo Torroni},
  title = {A rule-based approach for reasoning about collaboration between smart Web services},
  booktitle = {Proceedings of the 1st International Conference on Web Reasoning and Rule Systems (RR)},
  pages = {279--288},
  year = 2007,
  editor = {Massimo Marchiori and Jeff Z. Pan and Christian de Sainte Marie},
  volume = 4524,
  series = {Lecture Notes in Artificial Intelligence},
  address = {Innsbruck},
  month = {June},
  publisher = {Springer-Verlag},
  issn = {0302-9743},
  isbn = {978-3-540-72981-5},
  abstract = {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 behavioural interface
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. We show how this framework can be
used for a-priori verification of web services interaction.}
  author = {Marco Alberti and Federico Chesani and Marco Gavanelli
 and Evelina Lamma and Paola Mello and Marco Montali and Paolo Torroni},
  title = {Web service contracting: specification and reasoning with SCIFF},
  booktitle = {Proceedings of the 4th European Semantic Web Conference (ESWC)},
  pages = {68--83},
  year = 2007,
  editor = {Enrico Franconi and Michael Kifer  and Wolfgang May},
  volume = 4519,
  series = {Lecture Notes in Artificial Intelligence},
  address = {Innsbruck},
  month = {June},
  issn = {0302-9743},
  isbn = {978-3-540-72666-1},
  publisher = {Springer-Verlag},
  abstract = {The semantic web vision will facilitate automation of many tasks,
including the location and dynamic reconfiguration of web services. In
this article, we are concerned with a specific stage of web service
location, called, by some authors,  contracting. We address
contracting both at the operational level and at the semantic level. We
present a framework encompassing communication and reasoning, in which web
services exchange and evaluate goals and policies. Policies represent
behavioural interfaces. The reasoning procedure at the core of the
framework is based on the abductive logic programming SCIFF
proof-procedure. We describe the framework, show by examples how to
formalise policies in the declarative language of SCIFF, and give the
framework a model-theoretic and a sound proof-theoretic semantics.}

This file was generated by bibtex2html 1.98.