The aim is to explore existing formalisms for knowledge representation and then to concentrate on description logics. We present syntaxes, semantics, reasonings and possible applications.
This part aims to formally introduce the notion of constraint, especially through constraint logic programming, as well as to provide some algorithms and techniques used in constraint programming. The following points will be looked at:
Language:
Constraint domains
Constraint programming, semantics of constraint logic programs
Examples of constraint domains: finite domains, real and rationnals, types, calendars.
Enumeration heuristics (choice of variables and values).
Skills This course allow students to acquire fundamentals in models, knowledge representation and reasoning. These are important prerequisite for tackling numerous research problems.
Methodological skills:
Being able to define problems requiring advanced techniques in knowloedge representation and data modelling.
Being able to identify appropriate algorithmic approaches that will serve as a base for proposing solutions to specific problems.
Technical skills:
Formal tools
Algorithms
References:
F. Baader, D. Calvanese, D. McGuiness, D. Nardi, P.-P. Schneider. The Description Logic Handbook: Theory, Implementation and Applications. Cambridge University Press.
J. Chomicki and G. Saake. Logics for Databases and Information Systems. Kluwer, 1998
K.R. Apt. Principles of Constraint Programming. Cambridge University Press (2003).
J. Jaffar, M. Maher, K. Marriott, and P.J. Stuckey. The semantics of constraint logic programs. In Journal of Logic Programming, 37(1--3):1--46, 1998.
12. Fiches intervenants du Master Professionnel et du Master Recherche mention Informatique
