Logo Università degli Studi di Milano



 
 
News  

March 20, 2019: Daniele Porello: Social Mechanisms for Aggregating Ontologies

Social Mechanisms for Aggregating Ontologies

"Seminars of Logic" organized by the Logic Group of the Department of Philosophy "Piero Martinetti"

Daniele Porello - Institute for Cognitive Sciences and Technologies CNR

Social Mechanisms for Aggregating Ontologies



March 20, 2019, h. 16:30-18:30.

Room Enzo Paci, Directorate of the Department of Philosopy, Via Festa del Perdono 7.

Abstract

We present a methodology for integrating formal ontologies developed by dierent agents based on Social Choice Theory (SCT). SCT studies the procedures for aggregating individual stances into a collectively fair stance and applies to problems such as voting, resource allocation and negotiation, judgment aggregation. We view the problem of aggregating ontologies as a form of voting on the axioms and statements of the ontology, then we are interested in obtaining a collective ontology that rejects the agents' views as much as possible. Naive merging of ontologies is of course prone to inconsistency, therefore we need to balance the individual contributions with the consistency of the resulting collective ontology. We develop this approach as follows. Firstly, we discuss the suitable procedures for integrating ontologies and we study their social choice theoretic properties. Secondly, we discuss the computational complexity of the problems involved (e.g. winner determination, manipulation, safety). Finally, we instantiate this view by a concrete methodology for developing (and possibly repairing) collective ontologies.


ORGANIZERS
The Logic Group, Department of Philosophy, University of Milan
www.filosofia.unimi.it/logic

CONTACT
marcello.dagostino@unimi.it - www.filosofia.unimi.it/dagostino

 

The Lecture will be held in English.
Participation is strongly recommended to students of the Doctoral School in Philosophy and Human Sciences.

Everyone interested is welcome to attend.

20 March 2019
Back to top