@inproceedings{AlbCheGav04-TAPOCS-IW,
author = {Marco Alberti and Federico Chesani and Marco Gavanelli and Evelina Lamma and Paola Mello and Paolo Torroni },
title = {A logic based approach to interaction design in open multi-agent systems},
booktitle = {13th {IEEE} International Workshops on Enabling Technologies: Infrastructure for Collaborative Enterprises ({WET ICE} 2004)},
year = {2004},
editor = {Martin Fredriksson and Rune Gustavsson and Alessandro Ricci and Andrea Omicini},
publisher = {IEEE Computer Society},
address = {Washington, DC, USA},
isbn = {0-7695-2183-5},
pages = {387-392},
doi = {http://dx.doi.org/10.1109/ENABL.2004.3},
month = sep,
abstract = {An important challenge posed by the design of open information
systems concerns the choice of suitable methods
to harness their complexity and to guarantee the correctness
of their behaviour. In recent times, logic programming
has been proposed as a powerful technology, formal and
declarative, for the specification and verification of agent
based and open systems. In this work, we focus on the interaction
design. We base our approach on a logic-based formalism,
which can be used to define the semantics of agent
communication languages and interaction protocols. We
advocate its use within a more general framework, drawing
a design methodology which encompasses the specification
of the interaction space and of its desired properties,
and their verification.},
url = {http://doi.ieeecomputersociety.org/10.1109/ENABL.2004.3},
pdf = {http://www-lia.deis.unibo.it/~pt/Publications/tapocs04.pdf}
}
@article{AlbGavLam03-DALT-IW,
author = {Marco Alberti and Marco Gavanelli and
Evelina Lamma and Paola Mello and Paolo Torroni},
title = {Modeling interactions using social integrity constraints: a resource sharing case study},
booktitle = {Declarative Agent Languages and Technologies, First International
Workshop, DALT 2003, Melbourne, Australia, July 15, 2003, Revised
Selected and Invited Papers},
year = {2004},
editor = {Jo{\~a}o Alexandre Leite and Andrea Omicini and Leon Sterling and Paolo Torroni},
address = {Melbourne, Australia},
publisher = {Springer Verlag},
journal = {Lecture Notes in Artificial Intelligence},
volume = {2990},
issn = {0302-9743},
pages = {243-262},
abstract = {This work is about interactions among computees of a
society, using a computational logic-based approach. Computees are
abstractions of the entities that populate global and open
computing environments. The society defines the allowed
interaction protocols, which on their turn are defined by means of
social integrity constraints. Using social integrity
constraints, it is possible to give a formal definition of
concepts such as violation, fulfillment, and social expectation.
This allows for the automatic verification of the social behaviour
of computees. In order to explain the ideas, we adopt as a running
example a resource exchange scenario.},
pdf = {http://centria.di.fct.unl.pt/~jleite/dalt03/papers/16.pdf},
note = {IF: 0.251}
}
@inproceedings{AlbLamGav05-NorMAS-IW,
author = {Marco Alberti and Evelina Lamma and Marco Gavanelli and Paola Mello and Giovanni Sartor and Paolo Torroni},
title = {Mapping Deontic Operators to Abductive Expectations},
booktitle = {Proceedings of the Symposium on Normative Multi-Agent Systems},
year = {2005},
month = apr # { 12-15},
url = {http://normas.di.unito.it/zope/aisb05/},
pdf = {http://normas.di.unito.it//zope/aisb05/papers/alberti},
isbn = {1 902956 47 6},
publisher = {The Society for the study of Artificial Intelligence and the Simulation of Behaviour},
address = {University of Hertfordshire, Hatfield, UK},
pages = {126--136},
abstract = {A number of approaches to agent society modeling can be found in the Multi-Agent Systems literature
which exploit (variants of) Deontic Logic. In this paper, after briefly mentioning related approaches,
we focus on the Computational Logic (CL) approach for society modeling developed within the UE
IST-2001-32530 Project (named SOCS), where obligations and prohibitions are mapped into abducible
predicates (respectively, positive and negative expectations), and norms ruling the behavior of members
are represented as abductive integrity constraints. We discuss how this abductive framework can deal
with Deontic Logic concepts, by introducing additional integrity constraints.}
}
@article{AlbCheGav05-GC-IW,
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}
}
@inproceedings{AlbCheGav06-ALPSWS-IW,
address = {Seattle, WA, USA},
author = {Marco Alberti and Federico Chesani and Marco Gavanelli and Evelina Lamma and Paola Mello and Marco Montali and Paolo Torroni},
booktitle = {Proceedings of the 1st International Workshop on Applications of Logic Programming in the Semantic Web and Semantic Web Services (ALPSWS 2006)},
month = {August},
pages = {87--102},
series = {CEUR Workshop Proceedings},
title = {Policy-based reasoning for smart web service interaction},
volume = 196,
year = 2006,
issn = {1613-0073},
abstract = { We present a vision of smart, goal-oriented web services
that reason about other services' policies and evaluate the
possibility of future interactions. To achieve our vision, we
propose a proof theoretic approach. We assume web services whose
interface behaviour 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.}
}
@inproceedings{AlbCheGav05-ESAW-IW,
author = {Marco Alberti and Federico Chesani and Marco Gavanelli and Evelina Lamma and Paola Mello and Paolo Torroni},
title = {Security protocols verification in Abductive Logic Programming: a case study},
booktitle = {Proceedings of 6th International Workshop "Engineering Societies in the Agents' World" (ESAW'05), October 26-28, 2005},
year = {2006},
series = {Lecture Notes on Artificial Intelligence},
publisher = {Springer-Verlag},
volume = {3963},
address = {Berlin Heidelberg},
editor = {O\u{g}uz Dikenelli and Marie-Pierre Gleizes and Alessandro Ricci },
organization = {Department of Computer Engineering Ege University},
url = {http://esaw05.ege.edu.tr/},
pages = {106-124},
abstract = {In this paper we present by a case study an approach to the
verification of security protocols based on Abductive Logic
Programming. We start from the perspective of open multi-agent
systems, where the internal architecture of the individual
system's components may not be completely specified, but it is
important to infer and prove properties about the overall system
behaviour. We take a formal approach based on Computational Logic,
to address verification at two orthogonal levels: `static'
verification of protocol properties (which can guarantee, at
design time, that some properties are a logical consequence of the
protocol), and `dynamic' verification of compliance of agent
communication (which checks, at runtime, that the agents do
actually follow the protocol). We adopt as a running example the
well-known Needham-Schroeder protocol. We first show how the
protocol can be specified in our previously developed SOCS-SI
framework, and then demonstrate the two types of verification.},
isbn = {3-540-34451-9},
issn = {0302-9743}
}
@inproceedings{AlbCheGav06-SWAP-IW,
author = {Marco Alberti and Federico Chesani and Marco Gavanelli and Evelina Lamma and Paola Mello and Marco Montali and Paolo Torroni},
title = {Policy-based Reasoning for Smart Web Service Interaction},
booktitle = {Proceedings of SWAP 2006, the 3rd Italian Semantic Web Workshop},
year = 2006,
editor = {Giovanni Tummarello and Paolo Bouquet and Oreste Signore},
address = {Pisa, Italy},
month = {December},
publisher = {CEUR Workshop Proceedings},
issn = {ISSN 1613-0073},
note = {available electronically at \url{http://ceur-ws.org/Vol-201}},
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 interface behaviour
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.}
}
@inproceedings{AlbCheGav07-HPSUA-IW,
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}
}
@inproceedings{AlbCatGav08-SWAP-IW,
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}
}
@inproceedings{AlbBelCot16-PLP-IW,
title = {Probabilistic Constraint Logic Theories},
author = {Marco Alberti and Elena Bellodi and Giuseppe Cota and Evelina Lamma and Fabrizio Riguzzi and Riccardo Zese},
pages = {15--28},
url = {http://ceur-ws.org/Vol-1661/#paper-02},
pdf = {http://ceur-ws.org/Vol-1661/paper-02.pdf},
booktitle = {Proceedings of the 3nd International Workshop on Probabilistic Logic Programming ({PLP})},
year = 2016,
editor = {Arjen Hommersom and
Samer Abdallah},
volume = 1661,
series = {CEUR Workshop Proceedings},
address = {Aachen, Germany},
issn = {1613-0073},
venue = {London, UK},
eventdate = {2016-09-03},
publisher = {Sun {SITE} Central Europe},
copyright = {by the authors},
abstract = {Probabilistic logic models are used ever more often to deal with
the uncertain relations typical of the real world.
However, these models usually require expensive inference procedures. Very recently the problem of identifying tractable
languages has come to the fore.
In this paper we consider the models used by the learning from interpretations
ILP setting, namely
sets of integrity constraints, and propose a probabilistic version
of them. A semantics in the style of the distribution semantics is adopted, where each integrity constraint is annotated with a probability.
These probabilistic constraint logic models assign a probability of being positive to interpretations. This probability can be computed
in a time that is logarithmic in the
number of ground instantiations of violated constraints.
This formalism can be used as the target language in learning systems and
for declaratively specifying the behavior of a system.
In the latter case, inference corresponds to computing the probability of compliance
of a system's behavior to the model.
},
keywords = {
Probabilistic Logic Programming, Distribution Semantics, Constraint Logic
Theories},
scopus = {2-s2.0-84987763948}
}
@inproceedings{AlbLamRig17-PLP-IW,
author = {Marco Alberti and Evelina Lamma and Fabrizio Riguzzi and Riccardo Zese},
title = {A Distribution Semantics for non-{DL}-Safe Probabilistic Hybrid Knowledge Bases},
booktitle = {4th International Workshop on Probabilistic logic programming, PLP 2017},
editor = {Christian {Theil Have} and Riccardo Zese},
year = {2017},
pdf = {http://ceur-ws.org/Vol-1916/paper4.pdf},
volume = 1916,
series = {CEUR Workshop Proceedings},
address = {Aachen, Germany},
issn = {1613-0073},
publisher = {Sun {SITE} Central Europe},
pages = {40-50},
scopus = {2-s2.0-85030093850},
abstract = {Logic Programming languages and Description Logics are
based on different domain closure assumptions, closed and the open
world assumption, respectively. Since many domains require both these
assumptions, the combination of LP and DL have become of foremost importance.
An especially successful approach is based on Minimal Knowledge
with Negation as Failure (MKNF), whose semantics is used to de fine
Hybrid KBs, composed of logic programming rules and description logic
axioms. Following such idea, we have proposed an approach for de fining
DL-safe Probabilistic Hybrid Knowledge Bases, where each disjunct in
the head of LP clauses and each DL axiom is annotated with a probability
value, following the well known distribution semantics. In this paper,
we show that this semantics can be unintuitive for non-DL-safe PHKBs,
and we propose a new semantics that coincides with the previous one if
the PHKB is DL-safe.},
keywords = {Hybrid Knowledge Bases, MKNF, Distribution Semantics}
}
@inproceedings{RigLamAlb17-URANIA-IW,
title = {Probabilistic Logic Programming for Natural Language Processing },
author = {Fabrizio Riguzzi and Evelina Lamma and Marco Alberti and Elena Bellodi and Riccardo Zese and Giuseppe Cota},
pages = {30--37},
url = {http://ceur-ws.org/Vol-1802/},
pdf = {http://ceur-ws.org/Vol-1802/paper4.pdf},
booktitle = {{URANIA} 2016,
Deep Understanding and Reasoning: A Challenge for Next-generation Intelligent Agents,
Proceedings of the {AI*IA} Workshop on Deep Understanding and Reasoning: A Challenge for Next-generation Intelligent Agents 2016
co-located with 15th International Conference of the Italian Association for Artificial Intelligence ({AIxIA} 2016)},
year = 2017,
editor = {Federico Chesani and Paola Mello and Michela Milano},
volume = 1802,
series = {CEUR Workshop Proceedings},
address = {Aachen, Germany},
issn = {1613-0073},
venue = {Genova, Italy},
eventdate = {2016-11-28},
publisher = {Sun {SITE} Central Europe},
copyright = {by the authors},
abstract = {The ambition of Artificial Intelligence is to solve problems without human intervention. Often the problem description is given in human (natural) language. Therefore it is crucial to find an automatic way to understand a text written by a human. The research field concerned with the interactions between computers and natural languages is known under the name of Natural Language Processing (NLP), one of the most studied fields of Artificial Intelligence.
In this paper we show that Probabilistic Logic Programming (PLP) is a suitable approach for NLP in various scenarios. For this purpose we use \texttt{cplint} on SWISH, a web application for Probabilistic Logic Programming. \texttt{cplint} on SWISH allows users to perform inference and learning with the framework \texttt{cplint} using just a web browser, with the computation performed on the server.},
keywords = {Probabilistic Logic Programming, Probabilistic Logical Inference, Natural Language Processing},
scopus = {2-s2.0-85015943369}
}
This file was generated by bibtex2html 1.98.