author = {
 Evelina Lamma and Paola Mello and Fabrizio Riguzzi and Sergio Storari},
  title = {Applying Inductive Logic Programming to Process  Mining},
  booktitle = {Proceedings of the 17th International Conference on Inductive Logic Programming},
  year = {2008},
  publisher = {Springer},
  abstract = {The management of business processes has recently received a lot of attention. One of the most interesting problems is the description of a process model in a language that allows the checking of the compliance of a process execution (or trace) to the model. In this paper we propose a language  for the representation of process models that is inspired to the SCIFF language and is an extension of clausal logic. 
A process model is represented in the language as a set of integrity constraints that allow conjunctive formulas as disjuncts in the head.
We present an approach for inducing these models from data: we define a subsumption relation for the integrity constraints, we define a refinement operator and we adapt the algorithm ICL to the problem of learning such formulas. The system has been applied to the problem of inducing the model of a sealed bid auction and of the NetBill protocol. The data used for learning and testing were randomly generated from correct models of the processes.},
  keywords = {Process Mining, Learning from Interpretations, Business Processes, Interaction Protocols},
  series = {Lecture Notes in Artificial Intelligence},
  volume = {4894},
  note = {The original publication is available at \url{http://www.springerlink.com}},
  pages = {132--146},
  pdf = {http://ml.unife.it/wp-content/uploads/Papers/LamMelRigSto-ILP07.pdf},
  doi = {10.1007/978-3-540-78469-2_16},
  url = {http://link.springer.com/chapter/10.1007%2F978-3-540-78469-2_16},
  address = {Heidelberg, \Germany},
  copyright = {Springer}
  key = 005,
  author = {Marco Alberti and Federico Chesani and Marco Gavanelli and Evelina Lamma and Paola Mello and Paolo Torroni},
  title = {Verifiable Agent Interaction in Abductive Logic Programming: the \emph{S}{CIFF} Framework},
  journal = {ACM Transactions on Computational Logic (TOCL)},
  year = 2008,
  volume = 9,
  number = 4,
  issn = { 1529-3785},
  abstract = {SCIFF is a framework thought to specify and verify interaction in
  open agent societies.  The SCIFF language is equipped with a
  semantics based on abductive logic programming; SCIFF's operational
  component is a new abductive logic programming proof-procedure, also
  named SCIFF, for reasoning with expectations in dynamic
  environments.  In this paper we present the declarative and
  operational semantics of the SCIFF language, the termination,
  soundness and completeness results of the SCIFF proof procedure,
  and we demonstrate SCIFF's possible application in the multi-agent
  note = {IF: 2.766}
  key = 004,
  author = {Marco Alberti and Federico Chesani and Marco Gavanelli and Evelina Lamma and Paola Mello and Marco Montali and Paolo Torroni},
  title = {Expressing and Verifying Business Contracts with Abductive Logic Programming},
  journal = {International Journal of Electronic Commerce},
  abstract = {In this article, we propose to adopt the SCIFF abductive logic language to specify business contracts, and show how its proof procedures are useful to verify contract execution and fulfilment. SCIFF is a declarative language based on abductive logic programming, which accommodates forward rules, predicate definitions, and constraints over finite domain variables. Its declarative semantics is abductive, and can be related to that of deontic operators; its operational specification is the sound and complete SCIFF proof procedure, defined as a set of transition rules, which has been implemented and integrated into a reasoning and verification tool. A variation of the SCIFF proof-procedure (g-SCIFF) can be used for static verification of contract properties.
We demonstrate the use of the SCIFF language for business contract specification and verification, in a concrete scenario. In order to accommodate integration of SCIFF with architectures for business contract, we also propose an encoding of SCIFF contract rules in RuleML.
  issn = {1086-4415},
  doi = {10.2753/JEC1086-4415120401},
  volume = 12,
  number = 4,
  pages = {9--38},
  year = 2008,
  month = {Summer},
  keywords = {Abductive logic programming, business contracts, declarative specifications, g-SCIFF, SCIFF, runtime verification, static verification},
  note = {IF: 1.366}
  author = {Marco Alberti and Federico Chesani and Marco Gavanelli and Evelina Lamma and Paola Mello},
  title = {Abduction in the context of  a reasoning process: the SCIFF framework},
  booktitle = {Reasoning, Rationality and Probability},
  publisher = {Center for the Study of Language and Information, Stanford University},
  year = 2008,
  pages = {271--287},
  editor = {Maria Carla Galavotti and Roberto Scazzieri and Patrick Suppes},
  address = {Stanford, California},
  isbn = { 978-157586557-7}
  author = {Marco Montali and Marco Alberti and Federico Chesani and 
	Marco Gavanelli and	Evelina Lamma and	Paola Mello and Paolo Torroni},
  title = {Verification from declarative specifications using Logic Programming},
  booktitle = {Logic Programming, 24th International Conference, ICLP 2008},
  year = 2008,
  editor = {Maria Garcia de la Banda and Enrico Pontelli},
  publisher = {Springer-Verlag},
  series = {Lecture Notes in Computer Science},
  volume = 5366,
  pages = {440-454},
  doi = {10.1007/978-3-540-89982-2_39},
  keywords = {Abductive Logic Programming, SCIFF, g-SCIFF, declarative specifications, formal verification, DecSerFlow, business process management},
  abstract = {In recent years, the declarative programming philosophy has had a visible impact on new emerging disciplines, such as heterogeneous multi-agent systems and flexible business processes. We address the problem of formal verification for systems specified using declarative languages, focusing in particular on the Business Process Management field. We propose a verification method based on the g-SCIFF abductive logic programming proof procedure and evaluate our method empirically, by comparing its performance with that of other verification frameworks.},
  pdf = {http://www-lia.deis.unibo.it/Research/TechReport/lia08004.pdf},
  url = {http://www.springerlink.com/content/26658n2069251841/},
  issn = {0302-9743},
  isbn = {978-3-540-89981-5}
  author = {Marco Gavanelli and Marco Alberti and Evelina Lamma},
  title = {Integrating Abduction and Constraint Optimization in Constraint Handling Rules},
  booktitle = {ECAI 2008: 18th European Conference on Artificial Intelligence},
  year = {2008},
  editor = {Malik Ghallab and Constantine D. Spyropoulos
  	and Nikos Fakotakis and Nikos Avouris},
  month = {July},
  publisher = {IOS press},
  pages = {903--904},
  doi = {10.3233/978-1-58603-891-5-903},
  url = {http://www.ece.upatras.gr/ecai2008/},
  keywords = {Abduction, Constraint Optimization, Logic and Constraint Programming, Logic Programming}
  author = {Marco Alberti and Massimiliano Cattafi and Marco Gavanelli and Evelina Lamma},
  title = {Exploiting Semantic Technology in Computational Logic-based
  Service Contracting},
  year = {2008},
  editor = {Aldo Gangemi and Johannes Keizer and Valentina Presutti and Heiko Stoermer },
  booktitle = {SWAP 2008: 5th workshop on Semantic Web Applications and Perspectives},
  month = {December},
  address = {Rome, Italy},
  url = {http://www.swapconf.it/2008/},
  series = {CEUR Workshop Proceedings},
  volume = {426},
  issn = {1613-0073},
  pdf = {http://sunsite.informatik.rwth-aachen.de/Publications/CEUR-WS/Vol-426/swap2008_submission_31.pdf},
  abstract = {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.},
  acceptrate = {25/47},
  keywords = {Choreography, Computational Logic, Run-Time Verification, Web Services}

This file was generated by bibtex2html 1.98.