TU Wien Informatics

20 Years

VCLA International Student Awards 2019 - Extended submission deadline

  • 2019-03-18
  • Studies
  • Helmuth Veith Stipend
  • VCLA
  • Women in Informatics
  • Students

Master and Undergraduate students are encouraged to submit their scientific works across the spectrum of Logic and Computer Science. Deadline: March 25, 2019

The VCLA International Student Awards aim to recognize and support students all over the world for their outstanding scientific works in the field of Logic and Computer Science in two categories: • Outstanding Master Thesis Award • Outstanding Undergraduate Research Award

The award is dedicated to the memory of Helmut Veith, the brilliant computer scientist who tragically passed away in March 2016, and aims to carry on his commitment to promoting young talent and promising researchers in these areas. Another piece of Veith´s legacy, besides Vienna Center for Logic and Algorithms, is the Helmut Veith Stipend for Female Master´s Students at TU Wien, Austria. Its mission is to honour the legacy of Helmut Veith in serving the field of Computer science at TU Wien and the society at large by identifying, and supporting the female talents who possess the curiosity in the research fields of the late scholar.


• Outstanding Master Thesis Award: 1200 EUR • Outstanding Undergraduate Research (Bachelor) Award: 800 EUR • The winners will be invited to present their work at an award ceremony in Vienna, Austria in the autumn 2019


The degree must have been awarded between November 15th, 2017, and December 31st, 2018, (inclusive). Students who obtained their degree at TU Wien are excluded from the nomination.


Computational Logic, covering theoretical and mathematical foundations such as proof theory, model theory, computability theory, Boolean satisfiability (SAT), QBF, constraint satisfaction, satisfiability modulo theories, automated deduction (resolution, refutation, theorem proving), non-classical logics (substructural logics, multi-valued logics, deontic logics, modal and temporal logics). Algorithms and Computational Complexity, including design and analysis of discrete algorithms, complexity analysis, algorithmic lower bounds, parameterized and exact algorithms, decomposition methods, approximation algorithms, randomized algorithms, algorithm engineering, as well as algorithmic game theory, computational social choice, parallel algorithms, and distributed algorithms. Databases and Artificial Intelligence, concerned with logical methods for modeling, storing, and drawing inferences from data and knowledge. This includes subjects like query languages based on logical concepts (Datalog, variants of SQL, XML, and SPARQL), novel database-theoretical methods (schema mappings, information extraction and integration), logic programming, knowledge representation and reasoning (ontologies, answer-set programming, belief change, inconsistency handling, argumentation, planning). Verification, concerned with logical methods and automated tools for reasoning about the behavior and correctness of complex state-based systems such as software and hardware designs as well as hybrid systems. This ranges from model checking, program analysis and abstraction to new interdisciplinary areas such as fault localization, program repair, program synthesis, and the analysis of biological systems.


Extended submission deadline: March 25, 2019 (AoE)


Ezio Bartocci Wolfgang Dvořák Ekaterina Fokina Robert Ganian (committee co-chair) Maximilian Jaroschek Roman Kuznets Martin Lackner Bjoern Lellmann Magdalena Ortiz (general chair) Matteo Pascucci Revantha Ramanayake (committee co-chair) Christoph Redl Peter Schüller Sebastian Skritek Friedrich Slivovsky Bhore Sujoy Johannes Wallner Antonius Weinzierl

NOMINATION REQUIRENMENTS AND THE WEBSITE https://logic-cs.at/award-call-2019/



Curious about our other news? Subscribe to our news feed, calendar, or newsletter, or follow us on social media.

Note: This is one of the thousands of items we imported from the old website. We’re in the process of reviewing each and every one, but if you notice something strange about this particular one, please let us know. — Thanks!