Events Search and Views Navigation

Event Views Navigation

Today

16 Jun

Praktiker:innen-Seminar in Kooperation mit der Arbeiterkammer Kärnten

Veranstaltungsort: HS 4 und Livestream (Campus Uni Klagenfurt)

Vorträge:Konkurrenzbeschränkungen und Nebenbeschäftigungsverbote im aufrechten Arbeitsverhältnis(Postdoc-Ass. Mag. Dr. Thomas Pfalz, Universität Klagenfurt)Schlichtungsklauseln in Arbeitsvertrag, Betriebsvereinbarung und Kollektivvertrag(Dr.in Felicia Kain, Wirtschaftsuniversität Wien)Ausbildungskostenrückersatzklauseln – Neuerungen in Lehre und Judikatur(Dr. Ernst Eypeltauer, Rechtsanwalt in Linz)*Schiller, Wallenstein (Triologie), Die Piccolomini 4. Aufzug

16 Jun

Antidiskriminierung/ Anti-discrimination

Veranstaltungsort: online: https://classroom.aau.at/b/sab-pnu-vaa-zm8

12:00-12:30:Vor dem Gesetz sind alle gleich. Aber stimmt das? Was ist Diskriminierung, Belästigung, Mobbing oder Stalking und wie bist du davor geschützt? Wir sehen uns an, was die Uni gegen Ungleichbehandlung tun kann.Zugangslink: https://classroom.aau.at/b/sab-pnu-vaa-zm8Eure Peer-Tutor:innen---12:30-13:00:Everyone is equal before the law. But is that true? What is discrimination, harassment, bullying, or stalking, and how are you protected from it? We take a look at what the university can do to combat unequal treatment. Access link: https://classroom.aau.at/b/sab-pnu-vaa-zm8Your peer tutors

16 Jun

Beyond NP: Reasoning with Quantified Boolean Formulas

Veranstaltungsort: S.2.69

As the prototypical NP-complete problem SAT, the decision problem of propositional logic, is considered to be hard. Despite this hardness, SAT is very successfully applied in many practical domains, because very powerful reasoning techniques are available. There are, however, problems that cannot be efficiently encoded in SAT. For such problems, formalisms with decision problems beyond NP are necessary. One of such formalisms are quantified Boolean formulas (QBFs), the extension of propositional logic with existential and universal quantifiers over the Boolean variables. The QBF decision problem is PSPACE-complete, making QBF well suitable for encoding and solving many problems from formal verification, synthesis, and artificial intelligence. In this talk, we give a short tour through recent developments in QBF solving.