Prof. Dr. Pierre-Yves Schobbens, University of Namur
Pierre-Yves Schobbens graduated in Philosophy in 1982, in Applied Mathematics and Economy in 1983, in Computer Science in 1984, magna cum laude from Univ. Cath. de Louvain, Belgium. He first worked there as researcher in the team of Prof. Sintzoff, on Formal Methods in Software Engineering, and Artificial Intelligence. He received grants for research stays at the Univ. of Passau and at the "Laboratoire d'Informatique Fondamentale et d'Intelligence Artificielle" (LIFIA, Grenoble where he took part in the development of the executable algebraic specification language LPG.
He obtained his Ph.D. in Computer Science in 1992, with a thesis entitled "Exceptions in Algebraic Specifications" showing applications of non-monotonic reasoning to software specification. He then worked as a Senior Researcher at CNRS in the "Centre de Recherche en Informatique de Nancy (CRIN)". He is currently Professor in Artificial Intelligence at the Univ. of Namur (FUNDP).
He set up the HCM Network "Medicis" (on methodology for specifications) and the Esprit WG "ModelAge" (on the agent paradigm). He is the leader of the Namur team of the projects «CAT» (Walloon Region), Esprit WG «Aspire», Esprit WG «Fireworks», European-Canadian «Cooperative IS », «Renoir» Network. He is (co-)author of 37 papers, 1 book, editor of 4 proceedings.
His research interests include extensions of algebraic specifications towards agent- and object-oriented concepts (concurrency and inheritance), non-monotonic reasoning, formal requirements specifications, tool support for these activities.
C. Lafontaine, Y. Ledru , P.-Y. Schobbens. An experiment in formal software development: using the B theorem prover on a VDM case study. In Proceedings 12th International Conference on Software Engineering (ICSE-12) , Nice, France, IEEE CS, pp. 34-42, March 1990. Long version in Comm. ACM, Vol 34 n.5, May 1991, translated in Informatie, Vol. 35 n.6, June 1993.
P.-Y. Schobbens. Exceptions for Algebraic Specifications: On the meaning of "but". In Proceedings of the Sixth International Workshop on Software Specification and Design (IWSSD-6), October 1991. IEEE Computer Society Press. Long version in Science of Computer Programming 20(1-2), North-Holland March/April 1993.
H. Andreka, M. Ryan , P.-Y. Schobbens. Laws of Generalised Priority Operators. Abstract in Proc. of the Intl. Workshop on Information Systems - Correctness and Reusability (ISCORE'94), R. Wieringa, R. Feenstra (Eds.), World Scientific Publishers, 1995.
M. Ryan , P.-Y. Schobbens. Belief Revision and Verisimilitude. Notre-Dame Journal of Formal Logic, 36(1), 1995.
M. Ryan , P.-Y. Schobbens, O. Rodrigues. Counterfactuals and Updates as Inverse Modalities. In TARK'96: 6th Int. Conf. on Theoretical Aspects of Rationality and Knowledge, Yoav Shoham (ed.), Morgan Kaufmann, 1996, pages 163--173. Long version in the Journal of Logic, Language and Information 6(2): 123-146, Kluwer, April 1997.
Jean-Francois Raskin and Pierre-Yves Schobbens. Real-Time Logics: Fictitious Clock as an Abstraction of Dense Time. In Proc. Third International Workshop on Tools and Algorithms for the Construction and Analysis of Systems (TACAS97), Lecture Notes in Computer Science (LNCS), Springer, 1997.
Jean-Francois Raskin and Pierre-Yves Schobbens. State Clock Logic: A Decidable Real-Time Logic. In Proc. International Workshop on Real-time and Hybrid Systems (HART'97), Lecture Notes in Computer Science (LNCS), Springer, 1997.
Tom Henzinger, Jean-Francois Raskin and Pierre-Yves Schobbens. The Regular Real-Time Languages. In Proceedings of the 25th International Conference on Automata, Languages, and Programming (ICALP98), Lecture Notes in Computer Science (LNCS). Springer, 1998.
Send questions and comments to