Google Groups no longer supports new Usenet posts or subscriptions. Historical content remains viewable.
Dismiss

VCLA International Student Awards 2018 - Deadline March 25 AoE

1 view
Skip to first unread message

Vienna Center for Logic and Algorithms

unread,
Mar 21, 2018, 3:45:23 PM3/21/18
to
Dear members, and friends of comuptation!

I am approaching you to inquire, if you could pass on the information on our yearly VCLA International Awards, organized here at TU Wien, Austria?

*VCLA International Student Awards recognizing the outstanding Bachelor (or equivalent) and Master Theses across the spectrum of Logic and Computer Science.
*The degree must have been awarded between November 15th 2015 and December 31st 2017.

The call for Nominations
The Vienna Center for Logic and Algorithms of TU Wien (Vienna University of Technology), calls for the nomination of authors of outstanding theses and scientific works in the field of Logic and Computer Science, in the following two categories:
• Outstanding Master Thesis Award
• Outstanding Undergraduate Thesis Award (Bachelor thesis or equivalent, 1st cycle of the Bologna process)

The main areas of interest are:
• Computational Logic, covering theoretical and mathematical foundations such as proof theory, model theory, computability theory, algorithmic lower and upper bounds, 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), computational complexity and algorithms (complexity analysis, parameterized and exact algorithms, decomposition methods).
• 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.
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.

Award
The Outstanding Master Thesis Award is accompanied by a prize of € 1200, and the Outstanding Undergraduate Research Award by a prize of € 800.
Additionally, the winners will be invited to present their work at an award ceremony during the Federated Logic Conference (FLoC) 2018 in Oxford.

Eligibility
The degree must have been awarded between November 15th 2015 and December 31st 2017. Students who obtained the degree at TU Wien are excluded from the nomination.

Important dates
Submission deadline (extended): March 25, 2018 (Anywhere on Earth)
Notification of decision: End of May 2018
Award ceremony: July 2018 (during FLoC 2018, details to be announced)

Nomination Procedures
For nomination instructions, please visit http://logic-cs.at/award-call-2018/
Kindly address all inquiries to aw...@logic-cs.at

VCLA Award Committee
Federico Aschieri
Paolo Baldi
Ezio Bartocci
Johannes Fichte
Ekaterina Fokina
Robert Ganian (committee co-chair)
Yazmin A. Ibanez-Garcia
Roman Kuznets
Bjoern Lellmann
Nysret Musliu
Michael Morak
Martin Nöllenburg
Sebastian Ordyniak
Magdalena Ortiz (general chair)
Revantha Ramanayake (committee co-chair)
Martin Suda
Friedrich Slivovsky

*Please excuse possible multiple copies of this message

0 new messages