Modern computing increasingly takes advantage of large amounts of distributed data and knowledge. This is grounded on theoretical principles borrowing to several fields of computer science such as programming languages, data bases, structured documentation, logic and artificial intelligence. The goal of this course is to present some of them, the problems that they solve and those that they uncover. The course considers two perspectives on data and knowledge: interpretation (what they mean), analysis (what they reveal) and processing (how can they be traversed efficiently and transformed safely).
The course offers a semantic perspective on distributed knowledge. Distributed knowledge may come from data sources using different ontologies on the semantic web, autonomous software agents learning knowledge or social robots interacting with different interlocutors. The course adopts a synthetic view on these. It first presents principles of the semantics of knowledge representation (RDF, OWL). Ontology alignments are then introduced to reduce the heterogeneity between distributed knowledge and their exploitation for answering federated queries is presented. A practical way for cooperating agents to evolve their knowledge is cultural knowledge evolution that is then illustrated. Finally, the course defines dynamic epistemic logics as a way to model the communication of knowledge and beliefs.
The course also introduces a perspective on programming language foundations, algorithms and tools for processing structured information, and in particular tree-shaped data. It consists in an introduction to relevant theoretical tools with an application to NoSQL (not only SQL) and XML technologies in particular. Theories and algorithmic toolboxes such as fundamentals of tree automata and tree logics are introduced, with applications to practical problems found for extracting information. Applications include efficient query evaluation, memory-efficient validation of document streams, robust type-safe processing of documents, static analysis of expressive queries, and static type-checking of programs manipulating structured information. The course also aims at presenting challenges, important results, and open issues in the area.
Lectures are on Wednesday from 9h45 to 12h45 (most of the time in H202).
| Date | Title | Room | Lecturer |
| 27/09 | Core XML (XML, Schemas, Parsing) | H202 | PG |
| 04/10 | Programming with XML (Streaming Validation, XPath, XQuery) | H202 | PG |
| 18/10 | Foundations of XML Types (Tree Grammars, Tree Automata) | H202 | PG |
| 25/10 | Tree Logics (FO, MSO) | H202 | PG |
| 08/11 | Tree Logics continued (μ-calculus) | H202 | PG |
| 15/11 | H202 | PG | |
| 22/11 | Knowledge, web, agents, etc. | H202 | JE |
| 29/11 | Ontology networks | H202 | JE |
| 06/12 | Belief revision | H202 | JE |
| 13/12 | Distributed query evaluation | H202 | JE |
| 20/12 | Social and cultural knowledge evolution | H202 | JE |
| 10/01 | Logics of knowledge | H208 | JE |
Lecturer: Pierre Genevès
Slides and relevant teaching material are available from: http://pierre.geneves.net/teaching-mosig.html.
Lecturer: Jérôme Euzenat
This part of the course is now collected into its Separate page.
The lecture notes are the only document that you have to look at and they are available here.
The course is evaluated with two exams one after the first part and the other after the second. This aims at being sure that the students know what is expected from them. In addition here are some past exams. Example of such exams are provided in the corresponding parts.
In case of second chance exams, these are given online through a suited evaluation software.