Satisfiability Problems Professors and Supervisors in Austria

Szemerédi Endreمشاهده پروفایل

استاد

Graz University of TechnologyAustria

Endre Szemerédi is a Hungarian mathematician and computer scientist, currently serving as a Permanent Research Fellow at the Alfréd Rényi Institute of Mathematics (Hungarian Academy of Sciences) and holding the New Jersey Professor of Computer Science position at Rutgers University since 1986. His career spans prestigious institutions including Stanford, Caltech, and the Institute for Advanced Study. Expertise: Discrete mathematics, combinatorics, theoretical computer science, and number theory. Education: M.Sc. (1965, Eötvös Loránd University), Ph.D. (1970, Moscow State University under Israel Gelfand). Research legacy encompasses foundational contributions to combinatorics, graph theory, and computational complexity. His work on Hamiltonian cycles in random graphs , parallel sorting networks , and the Blow-up Lemma revolutionized extremal combinatorics and algorithm design. Scientific honors include: 2012 Abel Prize and Széchenyi Prize 2008 Rolf Schock Prize and Steele Prize 1982 Member of Hungarian Academy of Sciences , 2010 Member of US National Academy of Sciences 1975 Pólya Prize , 1973 Rényi Prize , multiple Grünwald Prizes .

پروفایل رسمی دانشگاه

Uwe Eglyمشاهده پروفایل

دانشیار

Vienna University of TechnologyAustria

Uwe Egly is an Associate Professor at the Department of Knowledge-Based Systems, Faculty of Informatics, Technische Universität Wien (TU Wien). His research focuses on automated reasoning, proof theory, knowledge representation, and computational logic, with a strong emphasis on quantified Boolean formulas (QBFs), argumentation frameworks, and applications of AI in engineering. He leads projects funded by the Austrian Science Fund (FWF) and the Vienna Science and Technology Fund (WWTF), including the Boolean project (2011–2019) and FAME (2011–2014). Egly is known for developing QBF solvers like DepQBF and contributing to SAT-solving techniques. He teaches courses such as Abstract Argumentation , Formal Methods in Computer Science , and Quantum Computing . His research interests span proof complexity, satisfiability checking, and AI-driven algorithms for path planning. He has advised numerous students on theses involving quantum algorithms, QBF solver optimizations, and argumentation frameworks. Egly’s work bridges theoretical computer science with practical applications, including contributions to deformation monitoring systems and circuit synthesis using SAT-based methods. He is involved in international workshops and conferences, such as SAT, FMCAD, and Dagstuhl Seminars, and has edited proceedings for events like SAT 2014 . His collaborations include projects on scenario-based testing of UML diagrams and semantics-aware model versioning. Egly’s interdisciplinary approach integrates logic, artificial intelligence, and computational methods to solve complex theoretical and applied problems.

پروفایل رسمی دانشگاه

Stefan Szeiderمشاهده پروفایل

استاد

Vienna University of TechnologyAustria

Stefan Szeider is a full professor and chair of the Algorithms and Complexity Group at the Faculty of Informatics, Technische Universität Wien (TU Wien). He also serves as a visiting scientist at UC Berkeley's Simons Institute for the Theory of Computing. His academic journey includes positions at the University of Durham (UK) and the University of Toronto (Canada), and he earned his Mathematics PhD from the University of Vienna in 2001. Dr. Szeider's research focuses on designing efficient algorithms for problems in Artificial Intelligence, automated reasoning, and combinatorial optimization. He leads several initiatives, including the Vienna Center for Logic and Algorithms (VCLA), and has secured funding from the ERC, EPSRC, FWF, and others. His Erdős number is 2, reflecting his collaborative network in mathematics and computer science. Key achievements include the first ERC Starting Grant awarded to an Austrian computer scientist (2009), and awards such as the Highlighted Paper Award at SAT 2023 and Best Paper at CP 2020. He advises numerous PhD students and postdocs, fostering the next generation of researchers in algorithms and complexity. Notable contributions extend beyond academia to public outreach, including initiatives like the 'Algorithms Think Differently' educational program and the 'Algorithms in 60 Seconds' video competition. His work bridges theoretical foundations and practical applications, influencing both academic and real-world computational challenges.

پروفایل رسمی دانشگاه

Markus Kirchwegerمشاهده پروفایل

پژوهشگر

Vienna University of TechnologyAustria

Markus Kirchweger is a PreDoc Researcher at the Department of Algorithms and Complexity, Faculty of Informatics, Technische Universität Wien. His work spans Satisfiability (SAT) solving, graph theory, and combinatorial optimization, with a focus on symmetry breaking and SAT modulo theories. Research Interests: Developing SAT-based frameworks for graph generation and enumeration Dynamic symmetry breaking in combinatorial problem encodings Integrating user propagators into CDCL solvers Applying SAT techniques to conjectures like Erdős-Faber-Lovász and Rota’s Basis Co-certificate learning and shortest common supersequence optimization Projects: INCR (2021–2024), REVEAL-AI (2020–2024), SLIM (2019–2024), ASK-SAT (2024–2027).

پروفایل رسمی دانشگاه

Gábor Tardosمشاهده پروفایل

استاد

Graz University of TechnologyAustria

Gábor Tardos is a Hungarian mathematician and computer scientist with a career spanning esteemed institutions such as the Alfréd Rényi Institute of Mathematics (since 1991) and Simon Fraser University (2005–2013). He currently holds a professorship at Central European University and leads the Lendület cryptography research group at Rényi Institute. His work bridges discrete mathematics, computer science, and complexity theory. Key fields of interest: Discrete and computational geometry Cryptography Extremal combinatorics Complexity theory Major scientific contributions include probabilistic fingerprinting codes, advancements in the Lovász local lemma, and combinatorial geometry breakthroughs. His awards include the 2020 Gödel Prize and Lendület Grant. He serves as an editor for journals such as Order and Combinatorica .

پروفایل رسمی دانشگاه

Friedrich Slivovskyمشاهده پروفایل

پژوهشگر

Vienna University of TechnologyAustria

Friedrich Slivovsky is a researcher at the Institute of Logic and Computation within the Faculty of Informatics at Technische Universität Wien (Vienna University of Technology). His work focuses on theoretical and practical aspects of computational logic, with particular expertise in Quantified Boolean Formulas (QBFs), Propositional Model Counting (#SAT), and Knowledge Compilation. His research interests span the theoretical foundations and practical applications of computational logic. Slivovsky investigates the complexity of logical reasoning problems, develops efficient algorithms for solving them, and creates practical tools that implement these theoretical advances. His work bridges the gap between theoretical computer science and practical applications in areas like hardware verification, artificial intelligence, and electronic design automation. Analysis of his publication trends reveals a consistent focus on QBF solving techniques, with increasing emphasis on circuit minimization, proof complexity, and practical solver engineering. His recent work (2023-2024) shows a strong focus on circuit minimization techniques, combining QBF and SAT approaches to solve complex optimization problems in hardware design. Earlier work (2019-2021) emphasized dependency schemes, certification methods, and theoretical foundations of QBF solving. Slivovsky leads several significant software projects that have become important tools in the computational logic community: Qute : A dependency learning QBF solver with GitHub repository showing active development (latest commit December 2024) Unique : A preprocessor for (D)QBF that computes unique Skolem and Herbrand functions Pedant : A certifying DQBF solver These projects demonstrate his commitment to translating theoretical advances into practical tools that benefit the broader research community.

پروفایل رسمی دانشگاه

Thomas Eiterمشاهده پروفایل

استاد

Vienna University of TechnologyAustria

Thomas Eiter is a Professor at TU Wien's Institute of Logic and Computation. His research focuses on declarative programming paradigms, knowledge representation, and artificial intelligence. He leads projects in neurosymbolic systems, answer set programming (ASP), and stream reasoning, with applications in visual question answering, scheduling optimization, and semantic scene generation. Eiter has contributed to foundational work in ASP semantics, computational complexity, and hybrid reasoning frameworks. His work bridges logical formalisms with practical AI challenges, emphasizing explainability and scalability. Projects like ALASPO and neurosymbolic integration showcase his focus on advancing both theoretical and applied aspects of AI. Projects: HumanE AI Network, WASP, REWERSE Research Themes: Neurosymbolic AI, Answer Set Programming, Stream Reasoning Notable achievements include pioneering work on semiring-based reasoning frameworks and developing efficient ASP solvers like Alpha. His contributions span over 471 publications, emphasizing interdisciplinary applications in computer vision, robotics, and automated planning.

پروفایل رسمی دانشگاه