Program

The program will be available in due time.

Invited Speakers


Klaus-Dieter Schewe

Klaus-Dieter Schewe studied mathematics and computer science at the University of Bonn, Germany. Originally he worked in group representation theory, which was also the field of his Ph.D. After some years in industry he returned to academia working in software engineering, knowledge representation, database theory and rigorous methods, bringing these diverse fields together. His particular interest is on mathematical and logical foundations, semantics and expressiveness. He investigated methods for consistency enforcement, contributed to many results in dependency theory for complex-value databases (together with Sali, Link and Hartmann), developed a thorough methodology for the design and development of web information systems (together with Thalheim), created a client-centric middleware for cloud computing (together with Bosa and others), and developed a theory of knowledge patterns for entity resolution (together with Qing Wang). He developed behavioural theories for unbounded parallel and reflective algorithms (together with Ferrarotti, Wang and Tec) and for concurrent systems (together with Börger), with which he contributed to the foundations of rigorous methods. Recently, he linked this research to descriptive complexity theory. He graduated in Pure Mathematics at University of Bonn, received a Ph.D. 1985 from University of Bonn in Mathematics, and later in 1995 received his D.Sc. from Brandenburg Technical University in Theoretical Computer Science. He was Chair of Information Systems at Massey University Director of the Information Science Research Centre in New Zealand, and Scientific Director of the Software Competence Center Hagenberg in Austria. In September 2019 he joined the University of Illinois at Urbana Champaign Institute of Zhejiang University at the International Campus in Haining, China.
Computation on Structures - Behavioural Theory, Logic and Complexity
Database theory is closely linked to finite model theory. Each relational database defines a finite relational structure, and queries as well as database transformations are computations on these structures. Furthermore, descriptive complexity theory provides many links between the expressiveness of logics concerning queries and common space/time complexity classes. Examples are the celebrated results by Fagin concerning the capture of NP by existential second-order logic and by Immerman/Vardi concerning the capture of PTIME by first-order logic plus inflationary fixed-point over ordered structures. Another related development is provided by behavioural theories of classes of algorithms and proofs that these are captured by variants of abstract state machines, which operate on isomorphism classes of structures. Such theories with purely logical definitions of classes of computations of interest have been developed for sequential, parallel, concurrent and reflective algorithms. Therefore, we will argue for a shift of paradigm making computations on structures as provided by abstract state machines the standard model of computation with the advantage that computations on arbitrary levels of abstraction are enabled. Behavioural theories provide the means for logical characterisation of classes of computations, and also the logical characterisation of complexity in connection with the capture of complexity classes by specific classes of abstract state machines seems possible and adequate. We will provide evidence for the rationale of this shift.

Further Invited Speakers to be announced.