Logic and Random Discrete Structures (Dagstuhl Seminar 22061)
This report documents the program and the outcomes of Dagstuhl Seminar 22061 "Logic and Random Discrete Structures". The main topic of this seminar has been the analysis of large random discrete structures, such as trees, graphs, or permutations, from the perspective of mathematical logic. It has brought together both experts and junior researchers from a number of different areas where logic and random structures play a role, with the goal to establish new connections between such areas and to encourage interactions between foundational research and different application areas, including probabilistic databases.
combinatorics
complexity theory
logic
random structures
probabilistic databases
Theory of computation~Logic
Theory of computation~Complexity theory and logic
Mathematics of computing~Combinatorics
1-16
Regular Paper
Erich
Grädel
Erich Grädel
RWTH Aachen, DE
Phokion G.
Kolaitis
Phokion G. Kolaitis
University of California Santa Cruz and IBM Research, US
Marc
Noy
Marc Noy
UPC Barcelona Tech, ES
Matthias
Naaf
Matthias Naaf
RWTH Aachen, DE
10.4230/DagRep.12.2.1
Creative Commons Attribution 4.0 International license
https://creativecommons.org/licenses/by/4.0/legalcode