Free University of Bozen · Bolzano - Welcome - Computer Science
Back to department main page
Please choose a picture.
Seamless integration of teaching, research and applications An innovative, integrated approach forms the core framework of the teaching, research and practical applications of the Faculty.

Our study programmes evolve naturally from our research activities, so that students of all levels have opportunity to work directly on software development projects that have real-world impact for business, the public, and the international research community.
Our teaching offer comprises all three levels of studies: Bachelor, Master and PhD. Our jewel in the crown are our European Masters degrees, which foresee periods of study at partner universities and a double degree.

We are particualrly committed to research. An excellent infrastructure and an international and dynamic teaching body create the ideal environment for this and our research projects are internationally recognised and financed through national and European funds, with frequent contributions from local companies and public institutions.

Our strong focus on research does not make us neglect real-world applications. Our Faculty works in close collaboration with local entities, organises common endeavours and addresses actual demands of enterprises, local government and schools.

Friday, 31 October 2014 -
Sunday, 30 November 2014
11:00 - 12:30 h
A Survey of the Data Complexity of Consistent Query Answering Under Key Constraints - A KRDB SeminarExternal eventsThis talk adopts a very elementary representation of uncertainty. A relational database is called uncertain if it can violate primary key constraints. A repair of an uncertain database is obtained by selecting a maximal number of tuples without selecting two distinct tuples of the same relation that agree on their primary key. For any Boolean query q, CERTAINTY(q) is the problem that takes an uncertain database db on input, and asks whether q is true in every repair of db. The complexity of these problems has been particularly studied for q ranging over the class of Boolean conjunctive queries. A research challenge is to solve the following complexity classification task: given q, determine whether CERTAINTY(q) belongs to complexity classes FO, P, or coNP- complete.Room 102, Dominikanerplatz 3 - Piazza Domenicani, 3, 39100 Bozen-BolzanoProf. Jef Wijsen, Universite´ de Mons
Faculty of Computer Science - Secretariat
Dominikanerplatz 3 - piazza Domenicani, 3I - 39100 Bozen-Bolzano
T: +39 0471 016000F: +39 0471
Opening hours:Mon and Wed
10:00 - 12:00
Tue and Thu
14:00 - 16:00
© UniBz