Het Institute for Logic, Language and Computation (ILLC), een interdisciplinair onderzoeksinstituut van de Faculteiten FGw en FNWI, is op zoek naar een gedreven en enthousiaste professional om ons team van het bedrijfsbureau te versterken. Ben jij klaar voor een uitdagende positie waarin je kunt floreren in een unieke, interfacultaire en internationale omgeving? Als je goed kunt samenwerken en een passie hebt voor dynamiek, dan is deze positie wellicht perfect voor jou!

A fully funded three-year PhD or postdoc position (E-13 on the German TV-L scale, full time, no teaching obligation) is available at the Theoretical Computer Science lab of Friedrich-Alexander-Universität Erlangen-Nürnberg (FAU), Germany, with starting date between now and April 2024. The position is affiliated with a large interdisciplinary project involving FAU labs in computer science, linguistics, and law, funded by the German Federal Chamber of Notaries (Bundesnotarkammer). The project is aimed at providing automated support for notarial procedures using methods from formal logic, machine learning, and computational linguistics.

The position at the Theoretical Computer Science lab, supervised by Lutz Schröder, is concerned with formal logical modelling and reasoning. We are thus looking for a candidate with an MSc or PhD in computer science or mathematics, ideally with a background in logic, in particular modal or description logics.

Dr. Bart Bogaerts (AI lab, Vrije Universiteit Brussel) is looking for talented PhD students and PostDocs to join the CertiFOX team. You will work on an exciting project in which we will bring certifying algorithms (proof logging) from low-level languages (such as SAT, where this approach is notoriously succesful) to high-level modelling languages. The grand goal we will work towards is to get end-to-end guarantees of correctness of runs of combinatorial optimization engines, all the way from human-readable input specifications to the produced answers.

Proof-theoretic semantics (P-tS) offers a practical foundation for the meaning of logical theories that is grounded inference — that is, reasoning — rather than the abstract structures of model theory. It lies within the philosophical position known as inferentialism. As such, P-tS offers an alternative foundation for mathematical logic that places reasoning at the heart of meaning. P-tS has two primary variants: Dummett-Prawitz validity, closely related to Brouwer-Heyting-Kolmogorov semantics, and base-extension semantics, which can be seen as bridge to model-theoretic semantics. Base-extension semantics will be the primary focus of this project, with the Dummett-Prawitz view also relevant.

This studentship (intersecting informatics, mathematics, philosophy) will address giving proof-theoretic semantics to non-classical logics, developing the necessary abstract mathematical meta-theory and exploring the significance of inferentialist semantics, and its mathematical realization, for systems verification. This latter aspect will build directly on connections between the proof-theoretic foundations of logic programming and base-extension semantics recently established at UCL. Connections to simulation modelling and its inferentialist interpretation may be explored.

The student will work with Prof. David Pym (Computer Science and Philosophy), Dr. Elaine Pimentel (Computer Science), and Prof. Tim Button (Philosophy), and be based in the Programming Principles, Logic, and Verification group.

The Department for Computing Science at the Universität Oldenburg School of Computing Science, Business Administration, Economics, and Law (School II) seeks applications for a Professorship (m/f/x) in Explainable and Safe AI (salary scale W2), commencing as soon as possible.

The ERC Synergy Grant POCOCOP (Polynomial-time computation: opening the black boxes in constraint problems) is offering 1 Postdoc and 2 PhD positions at Charles University, Prague. The goal of the project is to systematically explore polynomial-time tractability in the field of constraint satisfaction and its extensions, in particular promise CSPs, valued CSPs, and CSPs over infinite domains. The project is jointly led by three principal investigators: Manuel Bodirsky (TU Dres den), Michael Pinsker (TU Vienna), and Libor Barto (Charles University, Prague). Successful candidates will be based at Prague, but collaborate with the other two groups intensively.