Conférences  >  Informatique  >  Théorie de l'information, fondations de l'informatique  >  Allemagne

Hausdorff Research Institute for Mathematics (HIM)

The trimester program aims to bring together experts, postdocs, and students in computer science and certain areas in mathematics (analysis, probability, and combinatorics) in order to learn about some challenging open problems recently raised in computer science, to use and invent necessary new tools and techniques in mathematics to solve these challenging problems, and vice versa to learn and further extend methods developed in computer science to develop new directions in mathematics motivated by questions in computer science. The core topics of the trimester program would be: learning theory, complexity of classical and quantum algorithms, vector valued functions on the hypercube, complex Hypercontractivity, polynomial inequalities on the hypercube, and discrete approximation theory on the hamming cube.

Analyse,    Cours et évènements pour étudiants en mathématiques

Schloss Dagstuhl - Leibniz-Zentrum für Informatik

Computational Complexity is concerned with the resources that are required for algorithms to detect properties of combinatorial objects and structures. It has often proven true that the best way to argue about these combinatorial objects is by establishing a connection (perhaps approximate) to a more well-behaved algebraic setting. Indeed, many of the deepest and most powerful results in Computational Complexity rely on algebraic proof techniques.

The aim of the COMMA conference is to bring together researchers interested in computational models of argument and the representation of argumentation structures in natural language texts, including the problem of automatically discovering argumentation in text or speech. In addition to the main conference track, there will be thematically-focused workshops, system demonstrations, and a summer school with courses on current topics of argumentation.

Schloss Dagstuhl - Leibniz-Zentrum für Informatik

The problem of deciding whether a propositional formula is satisfiable (SAT) is one of the most fundamental problems in computer science, both theoretically and practically. Due to its practical implications, intensive research has been performed on how to solve SAT problems in an automated fashion, and SAT solving is now a ubiquitous tool to solve many hard problems, both from industry and mathematics. SAT is also increasingly being applied in logics that are not decidable, particularly in the context of first-order theorem proving. Here, fast SAT solvers are used for reasoning sub-tasks and for guiding the theorem provers. The main aim of this Dagstuhl Seminar is to bring together researchers from different areas of activity on SAT and researchers that work in the field of first-order theorem proving so that they can communicate state-of-the-art advances and embark on a systematic interaction that will enhance the synergy between the different areas.

The Hausdorff Research Institute for Mathematics (HIM)

Harmonic analysis on the hypercube has long found exciting applications in theoretical computer science, in areas as diverse as learning theory, voting theory, and computational complexity theory. And TCS has also inspired challenging new questions in analysis, often leading to new perspectives on familiar topics. Indeed, this connection is only deepening as quantum computing, machine learning, and other areas of TCS expand to spaces beyond the hypercube. Talks in this workshop will focus on such connections recently uncovered, techniques in use today, and conjectures old and new. We hope it can also be an invitation to the topic for a harmonic analysis audience, thanks to additional introductory talks scheduled.

The Hausdorff Research Institute for Mathematics (HIM)

This workshop brings together leading experts in Boolean analysis, information theory, and lattices to explore the forefront of these disciplines through the talks and discussions about intriguing open problems, recent resolutions, and the evolution of innovative ideas, approaches, and techniques.

Schloss Dagstuhl - Leibniz-Zentrum für Informatik GmbH

Logic and learning are central to Computer Science, and in particular to AI-related research. Already Alan Turing envisioned in his 1950 “Computing Machinery and Intelligence” paper a combination of statistical (ab initio) machine learning and an “unemotional” symbolic language such as logic. The combination of logic and learning has received new impetus from the spectacular success of deep learning systems. The goal of this Dagstuhl Seminar is to bring together researchers from various communities related to utilizing logical constraints in deep learning and to create bridges between them via the exchange of ideas.

Réseaux de neurones et intelligence artificielle, apprentissage automatique,    Mise en œuvre et applications de l'intelligence artificielle

Schloss Dagstuhl - Leibniz-Zentrum für Informatik GmbH

Semirings are fundamental algebraic structures that in recent times have found a number of applications to computer science, especially in the areas of databases and automata. On the side of databases, commercial query languages, such as SQL, use bag semantics, instead of set semantics, to evaluate relational database queries, which means that the semiring of the natural numbers is used to annotate tuples in the input and output relations. More generally, the annotations can be values in some fixed semiring; this gives a common generalization of both set semantics and bag semantics of database queries, and also makes it possible to model other situations in which one is interested, e.g., in the probability or the reliability of an answer. Furthermore, semirings of polynomials have been successfully used to carry out a rigorous study of provenance in databases. On the side of automata, semirings are used to define weighted automata, which are nondeterministic finite automata augmented with values from a semiring as weights on the transitions. These weights may model, e.g., the cost involved when executing a transition, the amount of resources or time needed for this, or the probability or reliability of its successful execution. Weighted automata have found numerous applications to natural language processing, speech recognition, and algorithms for digital image compression. These applications have inspired numerous investigations in the logic-in-computer-science community.

Génie logiciel,    Conception et gestion des bases de données, Moteurs de recherche et extraction de connaissances à pa

Mathematisches Forschungsinstitut Oberwolfach (MFO, Oberwolfach Research Institute for Mathematics)

Mathematisches Forschungsinstitut Oberwolfach (MFO, Oberwolfach Research Institute for Mathematics)

Théorie des graphes et combinatoire,    Statistique, Théorie des jeux