@article{AlbGavLam11-IA-IJ,
author = {Marco Alberti and Marco Gavanelli and Evelina Lamma and Fabrizio Riguzzi and Sergio Storari},
title = {Learning specifications of interaction protocols and business processes and proving their properties},
journal = {Intelligenza artificiale},
year = 2011,
volume = 5,
number = 1,
pages = {71--75},
month = feb,
doi = {10.3233/IA-2011-0006},
issn = {1724-8035},
abstract = {In this paper, we overview our recent research
activity concerning the induction of Logic Programming
specifications, and the proof of their properties via Abductive
Logic Programming. Both the inductive and abductive tools here
briefly described have been applied to respectively learn and verify
(properties of) interaction protocols in multi-agent systems, Web
service choreographies, careflows and business processes.},
pdf = {http://ml.unife.it/wp-content/uploads/Papers/AlbGavLam-IA08.pdf}
}
@article{WheAlb11-MM-IJ,
abstract = {One goal of normative multi-agent system theory is to formulate principles for normative system change that maintain the rule-like structure of norms and preserve links between norms and individual agent obligations. A central question raised by this problem is whether there is a framework for norm change that is at once specific enough to capture this rule-like behavior of norms, yet general enough to support a full battery of norm and obligation change operators. In this paper we propose an answer to this question by developing a bimodal logic for norms and obligations called NO . A key to our approach is that norms are treated as propositional formulas, and we provide some independent reasons for adopting this stance. Then we define norm change operations for a wide class of modal systems, including the class of NO systems, by constructing a class of modal revision operators that satisfy all the AGM postulates for revision, and constructing a class of modal contraction operators that satisfy all the AGM postulates for contraction. More generally, our approach yields an easily extendable framework within which to work out principles for a theory of normative system change.},
affiliation = {CENTRIA---Artificial Intelligence Center, Department of Computer Science, Universidade Nova de Lisboa, FCT/UNL, 2829-516 Caparica, Portugal},
author = {Wheeler, Gregory and Alberti, Marco},
issn = {0924-6495},
issue = {3},
journal = {Minds and Machines},
keyword = {Computer Science},
note = {10.1007/s11023-011-9243-1},
pages = {411-430},
publisher = {Springer Netherlands},
title = {NO Revision and NO Contraction},
url = {http://dx.doi.org/10.1007/s11023-011-9243-1},
volume = {21},
year = {2011},
bdsk-url-1 = {http://dx.doi.org/10.1007/s11023-011-9243-1}
}
@article{AlbCatChe11-IJWSR-IJ,
author = {Marco Alberti and Massimiliano Cattafi and Federico Chesani and Marco Gavanelli and Evelina Lamma and Paola Mello and Marco Montali and Paolo Torroni},
title = {A Computational Logic Application Framework for Service Discovery and Contracting},
journal = {International Journal of Web Services Research},
year = 2011,
volume = 8,
number = 3,
pages = {1--25},
abstract = {In Semantic Web technologies, searching for a service means identifying components that can potentially satisfy user needs in terms of inputs and outputs (discovery) and devise a fruitful interaction with the customer (contracting). In this paper, the authors present an application framework that encompasses both the discovery and the contracting steps in a unified search process. In particular, the authors accommodate service discovery by ontology-based reasoning and contracting by reasoning about behavioural interfaces, published in a formal language. To this purpose, the authors consider a formal approach grounded on Computational Logic. They define, illustrate, and evaluate a framework, called SCIFF Reasoning Engine (SRE), which can establish if a Semantic Web Service and a requester can fruitfully inter-operate, by computing a possible interaction plan based on the behavioural interfaces of both. The same operational machinery used for contracting can be used for runtime verification.}
}
@inproceedings{AlbGomGon11-CLIMA-IC,
author = {Marco Alberti and Ana Sofia Gomes and Ricardo Gon\c{c}alves and Jo{\~a}o Leite and Martin Slota},
title = {Normative Systems Represented as Hybrid Knowledge Bases},
year = 2011,
editor = {Jo{\~a}o Leite and
Paolo Torroni and
Thomas {\AA}gotnes and
Guido Boella and
Leon van der Torre},
booktitle = {Computational Logic in Multi-Agent Systems - 12th International Workshop, CLIMA XII, Barcelona, Spain, July 17-18, 2011. Proceedings},
pages = {330-346},
series = {Lecture Notes in Artificial Intelligence},
month = {July},
publisher = {Springer Verlag},
volume = 6814,
isbn = {978-3-642-22358-7},
ee = {http://dx.doi.org/10.1007/978-3-642-22359-4_23},
abstract = {Normative systems have been advocated as an effective tool to regulate
interaction in multi-agent systems.
Logic programming rules intuitively correspond to conditional norms,
and their semantics is based on the closed world assumption, which
allows default negation, often used in norms. However, there are cases
where the closed world assumption is clearly not adequate, and others
that require reasoning about unknown individuals, which is not
possible in logic programming.
On the other hand, description logics are based on the open world
assumption and support reasoning about unknown individuals, but
do not support default negation.
In this paper, we demonstrate the need for the aforementioned features
(closed and open world assumptions, and reasoning about unknown
individuals) in order to model human laws, with examples from the
Portuguese Penal Code. We advocate the use of hybrid knowledge bases
combining rules and ontologies, which provide the joint expressivity
of logic programming and description logics.
We define a normative scenario as the pair of a set of facts and a set
of norms, and give it a formal semantics by translation into an MKNF
knowledge base.
We describe the implementation of the language, which computes the
relevant consequences of given facts and norms, and use it to
establish the resulting sentence in a penal scenario.
}
}
@inproceedings{GavAlbLam11-CILC-NW,
author = {Marco Gavanelli and Marco Alberti and Evelina Lamma},
title = {Integration of abductive reasoning and constraint optimization in {SCIFF}},
booktitle = {Proceedings of the 26th Italian Conference on Computational Logic (CILC-2011)},
editor = {Fabio Fioravanti},
series = {CEUR Workshop Proceedings},
number = {810},
url = {http://ceur-ws.org/Vol-810/},
year = 2011,
address = {Pescara, Italy},
month = {September}
}
@inproceedings{AlbGavLam11-CILC-NW,
author = {Marco Alberti and Marco Gavanelli and Evelina Lamma},
title = {The {CHR}-based Implementation of the SCIFF Abductive System},
booktitle = {Proceedings of the 26th Italian Conference on Computational Logic (CILC-2011)},
editor = {Fabio Fioravanti},
series = {CEUR Workshop Proceedings},
number = {810},
url = {http://ceur-ws.org/Vol-810/},
year = 2011,
address = {Pescara, Italy},
month = {September}
}
This file was generated by bibtex2html 1.98.