Search

Your search keyword '"BONATTI, PIERO ANDREA"' showing total 166 results
Start Over Author "BONATTI, PIERO ANDREA"
166 results on '"BONATTI, PIERO ANDREA"'

1. Optimizing the computation of overriding

Author

Bonatti, Piero Andrea, Petrova, Iliana Mineva, and Sauro, Luigi

Subjects
Computer Science - Artificial Intelligence
Abstract

We introduce optimization techniques for reasoning in DLN---a recently introduced family of nonmonotonic description logics whose characterizing features appear well-suited to model the applicative examples naturally arising in biomedical domains and semantic web access control policies. Such optimizations are validated experimentally on large KBs with more than 30K axioms. Speedups exceed 1 order of magnitude. For the first time, response times compatible with real-time reasoning are obtained with nonmonotonic KBs of this size.

Published
2015

2. Access and usage control for federations of knowledge graphs

Author

Universitat Politècnica de Catalunya. Departament de Ciències de la Computació, Universitat Politècnica de Catalunya. ALBCOM - Algorísmia, Bioinformàtica, Complexitat i Mètodes Formals, Bonatti, Piero Andrea, Champin, Pierre-Antoine, Dimou, Anastasia, Haase, Peter, Hartig, Olaf, Hose, Katja, Kirrane, Sabrina, Pasarella Sánchez, Ana Edelmira, Universitat Politècnica de Catalunya. Departament de Ciències de la Computació, Universitat Politècnica de Catalunya. ALBCOM - Algorísmia, Bioinformàtica, Complexitat i Mètodes Formals, Bonatti, Piero Andrea, Champin, Pierre-Antoine, Dimou, Anastasia, Haase, Peter, Hartig, Olaf, Hose, Katja, Kirrane, Sabrina, and Pasarella Sánchez, Ana Edelmira

Abstract

The European Union (EU) has introduced a number of regulations and directives that have a major impact on access to and usage of personal, corporate, and governmental data. The overarching goal of these legal acts is to provide legal certainty with respect to the provision and consumption of data, as well as clarifying usage rights and obligations., Postprint (published version)

Published
2024

4. Rule-Based Policy Representations and Reasoning

Author

Bonatti, Piero Andrea, De Coi, Juri Luca, Olmedilla, Daniel, Sauro, Luigi, Hutchison, David, Series editor, Kanade, Takeo, Series editor, Kittler, Josef, Series editor, Kleinberg, Jon M., Series editor, Mattern, Friedemann, Series editor, Mitchell, John C., Series editor, Naor, Moni, Series editor, Nierstrasz, Oscar, Series editor, Pandu Rangan, C., Series editor, Steffen, Bernhard, Series editor, Sudan, Madhu, Series editor, Terzopoulos, Demetri, Series editor, Tygar, Doug, Series editor, Vardi, Moshe Y., Series editor, Weikum, Gerhard, Series editor, Bry, François, editor, and Małuszyński, Jan, editor

Published
2009
Full Text
View/download PDF

5. Knowledge Graphs: New Directions for Knowledge Representation on the Semantic Web (Dagstuhl Seminar 18371)

Author

Bonatti, Piero Andrea, Decker, Stefan, Polleres, Axel, and Presutti, Valentina

Subjects
502050 Wirtschaftsinformatik, knowledge graphs, knowledge representation, linked data, ontologies, semantic web, 000 Computer science, knowledge, general works, 102001 Artificial intelligence, Computer Science, 102015 Information systems, 502050 Business informatics, 102015 Informationssysteme
Abstract

The increasingly pervasive nature of the Web, expanding to devices and things in everyday life, along with new trends in Artificial Intelligence call for new paradigms and a new look on Knowledge Representation and Processing at scale for the Semantic Web. The emerging, but still to be concretely shaped concept of "Knowledge Graphs" provides an excellent unifying metaphor for this current status of Semantic Web research. More than two decades of Semantic Web research provides a solid basis and a promising technology and standards stack to interlink data, ontologies and knowledge on the Web. However, neither are applications for Knowledge Graphs as such limited to Linked Open Data, nor are instantiations of Knowledge Graphs in enterprises - while often inspired by - limited to the core Semantic Web stack. This report documents the program and the outcomes of Dagstuhl Seminar 18371 "Knowledge Graphs: New Directions for Knowledge Representation on the Semantic Web", where a group of experts from academia and industry discussed fundamental questions around these topics for a week in early September 2018, including the following: what are knowledge graphs? Which applications do we see to emerge? Which open research questions still need be addressed and which technology gaps still need to be closed?

Published
2019

7. Natural Language Processing and Knowledge Graphs

Author

Groth, Paul, Navigli, Roberto, Nuzzolese, Andrea Giovanni, van Erp, Marieke, de Melo, Gerard, Bonatti, Piero Andrea, Decker, Stefan, Polleres, Axel, Presutti, Valentina, and Digital Humanities

Published
2019

8. Foundations

Author

d'Amato, Claudia, Kirrane, Sabrina, Bonatti, Piero, Rudolph, Sebastian, Krötzsch, Markus, van Erp, Marieke, Zimmerman, Antoine, Bonatti, Piero Andrea, Decker, Stefan, Polleres, Axel, Presutti, Valentina, and Digital Humanities

Published
2019

10. A Lightweight Defeasible Description Logic in Depth: Quantification in Rational Reasoning and Beyond

Author

Turhan, Anni-Yasmin, Bonatti, Piero Andrea, Technische Universität Dresden, Pensel, Maximilian, Turhan, Anni-Yasmin, Bonatti, Piero Andrea, Technische Universität Dresden, and Pensel, Maximilian

Abstract

Description Logics (DLs) are increasingly successful knowledge representation formalisms, useful for any application requiring implicit derivation of knowledge from explicitly known facts. A prominent example domain benefiting from these formalisms since the 1990s is the biomedical field. This area contributes an intangible amount of facts and relations between low- and high-level concepts such as the constitution of cells or interactions between studied illnesses, their symptoms and remedies. DLs are well-suited for handling large formal knowledge repositories and computing inferable coherences throughout such data, relying on their well-founded first-order semantics. In particular, DLs of reduced expressivity have proven a tremendous worth for handling large ontologies due to their computational tractability. In spite of these assets and prevailing influence, classical DLs are not well-suited to adequately model some of the most intuitive forms of reasoning. The capability for abductive reasoning is imperative for any field subjected to incomplete knowledge and the motivation to complete it with typical expectations. When such default expectations receive contradicting evidence, an abductive formalism is able to retract previously drawn, conflicting conclusions. Common examples often include human reasoning or a default characterisation of properties in biology, such as the normal arrangement of organs in the human body. Treatment of such defeasible knowledge must be aware of exceptional cases - such as a human suffering from the congenital condition situs inversus - and therefore accommodate for the ability to retract defeasible conclusions in a non-monotonic fashion. Specifically tailored non-monotonic semantics have been continuously investigated for DLs in the past 30 years. A particularly promising approach, is rooted in the research by Kraus, Lehmann and Magidor for preferential (propositional) logics and Rational Closure (RC). The biggest advantages of RC a

Published
2019

11. Knowledge Graphs: New Directions for Knowledge Representation on the Semantic Web (Dagstuhl Seminar 18371)

Author

Piero Andrea Bonatti and Stefan Decker and Axel Polleres and Valentina Presutti, Bonatti, Piero Andrea, Decker, Stefan, Polleres, Axel, Presutti, Valentina, Piero Andrea Bonatti and Stefan Decker and Axel Polleres and Valentina Presutti, Bonatti, Piero Andrea, Decker, Stefan, Polleres, Axel, and Presutti, Valentina

Abstract

The increasingly pervasive nature of the Web, expanding to devices and things in everyday life, along with new trends in Artificial Intelligence call for new paradigms and a new look on Knowledge Representation and Processing at scale for the Semantic Web. The emerging, but still to be concretely shaped concept of "Knowledge Graphs" provides an excellent unifying metaphor for this current status of Semantic Web research. More than two decades of Semantic Web research provides a solid basis and a promising technology and standards stack to interlink data, ontologies and knowledge on the Web. However, neither are applications for Knowledge Graphs as such limited to Linked Open Data, nor are instantiations of Knowledge Graphs in enterprises - while often inspired by - limited to the core Semantic Web stack. This report documents the program and the outcomes of Dagstuhl Seminar 18371 "Knowledge Graphs: New Directions for Knowledge Representation on the Semantic Web", where a group of experts from academia and industry discussed fundamental questions around these topics for a week in early September 2018, including the following: what are knowledge graphs? Which applications do we see to emerge? Which open research questions still need be addressed and which technology gaps still need to be closed?

Published
2019
Full Text
View/download PDF

12. Generalized Agent-mediated Procurement Auctions

Author

BONATTI, PIERO ANDREA, FAELLA, MARCO, GALDI, CLEMENTE, SAURO, LUIGI, Catholijn M. Jonker and Stacy Marsella and John Thangarajah and Karl Tuyls, Bonatti, PIERO ANDREA, Faella, Marco, Galdi, Clemente, and Sauro, Luigi

Subjects
auctions, partial orders, preference relations
Abstract

Procurement auctions (where the auctioneer needs a service and bidders offer it at their own conditions) are an appealing method for on-line service selection. They can improve service features and cost by exploiting the competition between different service providers. Software agents, acting on behalf of human users and organizations, are essential in making such auctions practical and usable. Since conveying user preferences to the agents in a faithful and complete way is virtually impossible, we advocate an approximate approach, where only partial preferences are formalized, and users pick their choice from a short list of options selected by the agents by means of those partial preferences. Another peculiarity of our scenarios is that there may be no contracts with null utility for a given bidder. These features affect the classical, desirable properties of standard auction mechanisms. We prove some impossibility results concerning truthfulness and (a qualitative analogue of) revenue. Then, we investigate a novel auction mechanism that is "almost" truthful in the sense that any strategic deviation from truthfulness has limited impact on the auctioneer's revenue.

Published
2016

13. Optimized Construction of Secure Knowledge-Base Views

Author

BONATTI, PIERO ANDREA, PETROVA, ILIANA MINEVA, SAURO, LUIGI, Piero A. Bonatti, Iliana Petrova, Luigi Sauro, Bonatti, PIERO ANDREA, Petrova, ILIANA MINEVA, and Sauro, Luigi

Abstract

In this paper we examine a confidentiality framework for constructing safe KB views with respect to the object-level and the meta-level background knowledge that users may exploit to reconstruct secrets. In particular, we will present a first implementation of our framework equipped with several optimization techniques that are assessed experimentally in a concrete e-health scenario.

Published
2015
Full Text
View/download PDF

17. Reactive policies for the semantic web

Author

BONATTI, PIERO ANDREA, P. Kaerger, D. Olmedilla, L. Aroyo, G. Antoniou, E. Hyvönen, A. ten Teije, H. Stuckenschmidt, L. Cabral, T. Tudorache, Bonatti, PIERO ANDREA, P., Kaerger, and D., Olmedilla

Published
2010

19. EL with Default Attributes and Overriding

Author

FAELLA, MARCO, BONATTI, PIERO ANDREA, SAURO, LUIGI, Patel-Schneider P.F., Pan Y., Hitzler P., Mika P., Zhang L., Pan J.Z., Horrocks I., Glimm B., Faella, Marco, Bonatti, PIERO ANDREA, and Sauro, Luigi

Subjects
non-monotonic logic, description logic, circumscription
Published
2010

21. Composing normal programs with function symbols

Author

BASELICE, SABRINA, BONATTI, PIERO ANDREA, M. G. de la Banda, E. Pontelli, Baselice, Sabrina, and Bonatti, PIERO ANDREA

Subjects
Infinite domain, Answer Set Programming, Nonmonotonic reasoning
Abstract

Tecniche per comporre programmi logici con buone proprieta' computazionali in mod da preservare tali proprieta'.

Published
2008

28. The Complexity of Enriched μ-Calculi

Author

BONATTI, PIERO ANDREA, MURANO, ANIELLO, LUTZ C, VARDI M. Y., M. Bugliesi, B. Preneel, V. Sassone, I. Wegener, Bonatti, PIERO ANDREA, Murano, Aniello, Lutz, C, and Vardi, M. Y.

Published
2006

29. Advanced Policy Explanations on the Web

Author

BONATTI, PIERO ANDREA, DANIEL OLMEDILLA, JOACHIM PEER, G. Brewka, S. Coradeschi, A. Perini, P. Traverso, Bonatti, PIERO ANDREA, Daniel, Olmedilla, and Joachim, Peer

Published
2006

30. On Optimal Service Selection

Author

BONATTI, PIERO ANDREA, FESTA, PAOLA, A. Ellis, T. Hagino, Bonatti, PIERO ANDREA, and Festa, Paola

Subjects
Service Matchmaking, Automatic Service Composition, Service Selection Problem, Nonfunctional Properties, Facility Location Problem
Abstract

While many works have been devoted to service matchmaking and modeling nonfunctional properties, the problem of matching service requests to oers in an optimal way has not yet been extensively studied. In this paper we formalize three kinds of optimal service selection problems, based on dierent criteria. Then we study their complexity and implement solutions. We prove that one-time costs make the optimal selection problem computationally hard; in the absence of these costs the problem can be solved in polynomial time. We designed and implemented both exact and heuristic (suboptimal) algorithms for the hard case, and carried out a preliminary experimental evaluation with interesting results.

Published
2005

34. On the undecidability of logics with nominals, recursion and counting

Author

BONATTI, PIERO ANDREA, PERON, ADRIANO, Bonatti, PIERO ANDREA, and Peron, Adriano

Abstract

The evolution of Description Logics (DLs) and Propositional Dynamic Logics produced a hierarchy of decidable logics with multiple maximal elements. It would be desirable to combine different maximal logics into one super-logic, but then inference may turn out to be undecidable. Then it is important to characterize the decidability threshold for these logics. In this perspective, an interesting open question pointed out by Sattler and Vardi is whether inference in a hybrid mu-calculus with restricted forms of graded modalities is decidable, and which complexity class it belongs to. In this paper we improve a previous result and prove that this calculus and the corresponding DL mu-ALCIO_fa are undecidable. We show also that nested fixpoints are not necessary for undecidability.

Published
2004

36. Secure Agents

Author

BONATTI, PIERO ANDREA, KRAUS S, SUBRAHMANIAN V. S., Bonatti, PIERO ANDREA, Kraus, S, and Subrahmanian, V. S.

Published
2003

39. Towards Flexible Credential Negotiation Protocols

Author

BONATTI, PIERO ANDREA, S. De Capitani di Vimercati, P. Samarati, B. Christianson, B. Crispo, J.A. Malcolm, M. Roe, Bonatti, PIERO ANDREA, S., De Capitani di Vimercati, and P., Samarati

Published
2003

48. Heterogenous Active Agents

Author

SUBRAHMANIAN V. S, DIX J, EITER T, KRAUS S, OZCAN F, ROSS R., BONATTI, PIERO ANDREA, Subrahmanian, V. S., Bonatti, PIERO ANDREA, Dix, J, Eiter, T, Kraus, S, Ozcan, F, and Ross, R.

Published
2000

50. A Multi-Similarity Algebra

Author

S. Adali, M. L. Sapino, V. S. Subrahmanian, BONATTI, PIERO ANDREA, L. M. Haas, A. Tiwary, S., Adali, Bonatti, PIERO ANDREA, M. L., Sapino, and V. S., Subrahmanian

Published
1998

Catalog

Books, media, physical & digital resources
See catalog results