2026 Jörg Hoffmann: Computer Science Researcher – H-Index, Publications & Awards

Discipline name	D-Index	World Ranking	Current World Ranking	National Ranking	Current National Ranking	Publications	Citations
Computer Science	45	7080	6875	342	331	215	11173

Research.com Recognitions

2021 - Fellow of the Association for the Advancement of Artificial Intelligence (AAAI) For significant contributions to AI planning and related areas, particularly in the design and analysis of heuristic functions and other search methods.

Overview

Jörg Hoffmann is affiliated with Saarland University in Germany and has contributed extensively to the field of computer science, with a specific focus on artificial intelligence. Their research spans multiple subfields including artificial intelligence, software, computational theory and mathematics, computer networks and communications, and strategy and management.

The main topics of Hoffmann's work include:

AI-based Problem Solving and Planning
Logic, Reasoning, and Knowledge
Adversarial Robustness in Machine Learning
Machine Learning and Algorithms
Formal Methods in Verification
Semantic Web and Ontologies
Constraint Satisfaction and Optimization

Several of Hoffmann's recent papers highlight ongoing research contributions in AI and formal methods. These include:

"A New Approach to Plan-Space Explanation: Analyzing Plan-Property Dependencies in Oversubscription Planning," 2020, Proceedings of the AAAI Conference on Artificial Intelligence
"Artificial Intelligence and Intellectual Property Law - Position Statement of the Max Planck Institute for Innovation and Competition of 9 April 2021 on the Current Debate," 2021, SSRN Electronic Journal
"Bridging the Gap Between Probabilistic Model Checking and Probabilistic Planning: Survey, Compilations, and Empirical Comparison," 2020, Journal of Artificial Intelligence Research
"Analyzing neural network behavior through deep statistical model checking," 2022, International Journal on Software Tools for Technology Transfer
"Faster Stackelberg Planning via Symbolic Search and Information Sharing," 2021, Proceedings of the AAAI Conference on Artificial Intelligence

Hoffmann has published frequently in a range of venues, especially in conferences and journals related to artificial intelligence and automated planning, including:

Proceedings of the International Conference on Automated Planning and Scheduling
Zenodo (CERN European Organization for Nuclear Research)
Proceedings of the International Symposium on Combinatorial Search
Proceedings of the AAAI Conference on Artificial Intelligence
SSRN Electronic Journal

Collaboration is a significant aspect of Hoffmann's academic profile. Frequent coauthors include:

Marcel Steinmetz
Timo P. Gros
Michaela Klauck
Daniel Höller
Holger Hermanns

Hoffmann's work has been recognized through awards such as being named a Fellow of the Association for the Advancement of Artificial Intelligence (AAAI) in 2021, acknowledging contributions to AI planning and heuristic search methods.

Best Publications

The FF planning system: fast plan generation through heuristic search

Jörg Hoffmann;Bernhard Nebel

2781
Citations
The metric-FF planning system: translating Ignoring delete lists to numeric state variables

Jörg Hoffmann

722
Citations
Ordered landmarks in planning

Jörg Hoffmann;Julie Porteous;Laura Sebastia

430
Citations
Extending Planning Graphs to an ADL Subset

Jana Koehler;Bernhard Nebel;Jörg Hoffmann;Yannis Dimopoulos

423
Citations
Flexible abstraction heuristics for optimal sequential planning

Malte Helmert;Patrik Haslum;Jorg Hoffmann

336
Citations
Conformant planning via heuristic forward search: a new approach

Jörg Hoffmann;Ronen I. Brafman

287
Citations
Contingent planning via heuristic forward search with implicit belief states

Jörg Hoffmann;Ronen I. Brafman

268
Citations
Conformant planning via heuristic forward search: a new approach

Ronen I. Brafman;Jörg Hoffmann

244
Citations
Contingent Planning via Heuristic Forward Search with Implicit Belief States

Jörg Hoffmann;Ronen Brafman;Susanne Biundo;Karen Meyers

242
Citations
In defense of PDDL axioms

Sylvie Thiébaux;Jörg Hoffmann;Bernhard Nebel

230
Citations
Where Ignoring delete lists works: local search topology in planning benchmarks

Jörg Hoffmann

191
Citations
The deterministic part of IPC-4: an overview

Jörg Hoffmann;Stefan Edelkamp

189
Citations
Merge-and-Shrink Abstraction: A Method for Generating Lower Bounds in Factored State Spaces

Malte Helmert;Patrik Haslum;Jörg Hoffmann;Raz Nissim

178
Citations
On reasonable and forced goal orderings and their use in an agenda-driven planning algorithm

Jana Koehler;Jörg Hoffmann

173
Citations
Detecting Regulatory Compliance for Business Process Models through Semantic Annotations

Guido Governatori;Jörg Hoffmann;Shazia Wasim Sadiq;Ingo Weber

146
Citations
Beyond soundness: on the verification of semantic business process models

Ingo Weber;Jörg Hoffmann;Jan Mendling

137
Citations
Extending FF to numerical state variables

Jorg Hoffmann

137
Citations
Local search topology in planning benchmarks: an empirical analysis

Jörg Hoffmann

129
Citations
A Heuristic for Domain Independent Planning and Its Use in an Enforced Hill-Climbing Algorithm

Jörg Hoffmann

121
Citations
Probabilistic planning via heuristic forward search and weighted model counting

Carmel Domshlak;Jörg Hoffmann

114
Citations

Frequent Co-Authors

Ingo Weber Technical University of Berlin

Carmel Domshlak Technion – Israel Institute of Technology

Bart Selman Cornell University

Carla P. Gomes Cornell University

Bernhard Nebel University of Freiburg

Malte Helmert University of Basel

Jana Koehler German Research Centre for Artificial Intelligence

Ronen I. Brafman Ben-Gurion University of the Negev

Holger Hermanns Saarland University

Derek Long King's College London

External Links

Personal website of Jörg Hoffmann Google Scholar page

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

Related Online Degrees & Career Pathways

Exploring Computer Science in the USA opens doors to a variety of related online degrees and evolving career pathways. For students interested in justice systems and technology, an affordable alternative is the cheapest online criminal justice degree, which can prepare graduates for roles in cybercrime investigation and law enforcement.

Those with a knack for numbers may consider an accredited online accounting degree, offering skills in both technology and financial analysis. As data-driven jobs grow rapidly, pursuing the cheapest masters in data science can provide advanced expertise in analytics, AI, and machine learning.

Additionally, tech-savvy individuals interested in project management and infrastructure will benefit from an accelerated construction management degree online. Online pathways make it easier to transition or advance careers without stepping away from your current commitments.