World's Best Scientists 2026 revealed!

D-Index & Metrics

Computer Science

D-Index
30
Citations
6040
World Ranking
13899
National Ranking
671

Overview

Gert Smolka is affiliated with Saarland University in Germany and specializes in the field of Computer Science. Their research spans several subfields including Artificial Intelligence and Computational Theory and Mathematics.

The main topics of their work focus on areas such as:

  • Logic, programming, and type systems
  • Formal Methods in Verification
  • Logic, Reasoning, and Knowledge

Gert Smolka has contributed to academic literature with papers published in well-known venues within the computer science community. Recent publications include:

  • "A history of the Oz multiparadigm language" (2020), published in Proceedings of the ACM on Programming Languages
  • "A Mechanised Proof of the Time Invariance Thesis for the Weak Call-By-Value λ-Calculus" (2021), published by Leibniz-Zentrum für Informatik (Schloss Dagstuhl)

Frequent co-authors who have collaborated with Gert Smolka include:

  • Yannick Forster
  • Fabian Kunze
  • Maximilian Wuttke
  • Peter Van Roy
  • Seif Haridi

Publication venues where their work has commonly appeared are:

  • Leibniz-Zentrum für Informatik (Schloss Dagstuhl)
  • Proceedings of the ACM on Programming Languages

Their body of work is firmly rooted in theoretical and applied aspects of computer science, particularly addressing verification methods and formal logic systems. This places Gert Smolka in a research context that combines rigorous mathematical frameworks with practical programming paradigms.

Best Publications

  • Attributive concept descriptions with complements

    Manfred Schmidt-Schaubß;Gert Smolka

  • The Oz Programming Model

    G. Smolka

  • Feature-constraint logics for unification grammars

    Gert Smolka

  • A Feature Logic with Subsorts

    Gert Smolka

  • Records for logic programming

    Gert Smolka;Ralf Treinen

  • The Oz Programming Model

    Gert Smolka

  • Order-Sorted Equational Computation

    Gert Smolka;Werner Nutt;Joseph A. Goguen;José Meseguer

  • Mobile objects in distributed Oz

    Peter Van Roy;Seif Haridi;Per Brand;Gert Smolka

  • A feature constraint system for logic programming with entailment

    Hassan Aït-Kaci;Andreas Podelski;Gert Smolka

  • Principles and Practice of Constraint Programming-CP97

    Gert Smolka

  • A concurrent lambda calculus with futures

    J. Niehren;J. Schwinghammer;G. Smolka

  • Object-Oriented Concurrent Constraint Programming in Oz

    Gert Smolka;Martin Henz;Jörg Würtz

  • Basic narrowing revisited

    Werner Nutt;Pierre Réty;Gert Smolka

  • Representation and reasoning with attributive descriptions

    B. Nebel;G. Smolka

  • Inheritance hierarchies: Semantics and unification

    Gert Smolka;Hassan Ait-Kaci

  • Oz—A Programming Language for Multi-Agent Systems

    Martin Henz;Gert Smolka;Jorg Wurtz

  • Oz: a programming language for multi-agent systems

    Martin Henz;Gert Smolka;Jorg Wurtz

  • Order-sorted unification

    Jose Meseguer;Joseph A. Goguen;Gert Smolka

  • The Definition of Kernel Oz

    Gert Smolka

  • Autosubst: Reasoning with de Bruijn Terms and Parallel Substitutions

    Steven Schäfer;Tobias Tebbi;Gert Smolka

  • Encapsulated Search and Constraint Programming in Oz

    Christian Schulte;Gert Smolka;Jörg Würtz

  • Efficient logic variables for distributed computing

    Seif Haridi;Peter Van Roy;Per Brand;Michael Mehl

  • Encapsulated search for higher-order concurrent constraint programming

    Christian Schulte;Gert Smolka

  • A Feature-Based Constraint System for Logic Programming with Entailment.

    Hassan Aït-Kaci;Andreas Podelski;Gert Smolka

Frequent Co-Authors

Bernhard Nebel
Bernhard Nebel University of Freiburg
Seif Haridi
Seif Haridi Royal Institute of Technology
Werner Nutt
Werner Nutt Free University of Bozen-Bolzano
Andreas Podelski
Andreas Podelski University of Freiburg
Rolf Backofen
Rolf Backofen University of Freiburg
Franz Baader
Franz Baader TU Dresden
Joseph A. Goguen
Joseph A. Goguen University of California, San Diego
José Meseguer
José Meseguer University of Illinois at Urbana-Champaign
Moritz Hardt
Moritz Hardt Max Planck Institute for Intelligent Systems

If you think any of the details on this page are incorrect, let us know.

Report an issue

We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below:

Related Online Degrees & Career Pathways

Exploring Computer Science in the USA opens the door to a variety of educational and career options, especially with the rise of flexible online degrees. Students concerned about academic history often ask, "will grad schools accept low gpa?" Thankfully, many accredited online programs offer accessible pathways, even for those with less-than-perfect GPAs.

For those eager to accelerate their careers, consider pursuing the fastest computer science degree programs. These allow students to complete high-quality coursework in a shorter time frame, providing a faster route into the tech industry.

Career opportunities go beyond software or IT. With a computer science background, you might ask, "what can you get with an environmental science degree?" There is increasing demand for professionals who combine tech and environmental expertise, opening paths in data analysis, sustainability, and more.

If you’re passionate about environmental innovation, explore a practical environmental engineer degree online. This is a dynamic field at the intersection of technology and sustainability, offering meaningful work with global impact.

Best Scientists Citing Gert Smolka

Trending Scientists