Jörg Hoffmann 0001
143 publications
13 venues
H Index 33
Affiliation
Saarland University, Department of Computer Science, Saarbr cken, GermanyINRIA, Nancy, France
SAP Research Karlsruhe, Germany
University of Innsbruck, Semantic Technology Institute, Austria
Cornell University, Ithaca, NY, USA
Max Planck Institute for Computer Science, Saarbr cken, Germany
University of Freiburg, Department of Computer Science, Germany
Links
| Name | Venue | Year | citations |
|---|---|---|---|
Probabilistic Safety Verification of Neural Policies via Predicate Abstraction.
|
AAAI | 2026 | 0 |
| An Operator-Centric Trustable Decision-Making Tool for Planning Ground Logistic Operations of Beluga Aircraft.
|
ECAI | 2025 | 0 |
| Policy Safety Testing in Non-Deterministic Planning: Fuzzing, Test Oracles, Fault Analysis.
|
ECAI | 2025 | 0 |
| Is This a Good Decision? Action Optimality Checking in Classical Planning.
|
ECAI | 2025 | 0 |
| Decision-Focused Learning to Predict Action Costs for Planning.
|
ECAI | 2024 | 1 |
| Guiding GBFS through Learned Pairwise Rankings.
|
IJCAI | 2024 | 13 |
| New Fuzzing Biases for Action Policy Testing.
|
ICAPS | 2024 | 3 |
| Boosting optimal symbolic planning: Operator-potential heuristics.
|
Artificial Intelligence | 2024 | 0 |
| Iterative Oversubscription Planning with Goal-Conflict Explanations: Scaling Up Through Policy-Guidance Approximation.
|
ECAI | 2024 | 0 |
| Neural Action Policy Safety Verification: Applicablity Filtering.
|
ICAPS | 2024 | 0 |
| Safety Verification of Tree-Ensemble Policies via Predicate Abstraction.
|
ECAI | 2024 | 1 |
| Neural Policy Safety Verification via Predicate Abstraction: CEGAR.
|
AAAI | 2023 | 4 |
| A Landmark-Cut Heuristic for Lifted Optimal Planning.
|
ECAI | 2023 | 4 |
| Automatic Metamorphic Test Oracles for Action-Policy Testing.
|
ICAPS | 2023 | 8 |
| Lifted Stackelberg Planning.
|
ICAPS | 2023 | 1 |
| Specifying and Testing k-Safety Properties for Machine-Learning Models.
|
IJCAI | 2023 | 0 |
| Evaluating Plan-Property Dependencies: A Web-Based Platform and User Study.
|
ICAPS | 2022 | 10 |
| Landmark Heuristics for Lifted Classical Planning.
|
IJCAI | 2022 | 15 |
| Operator-Potential Heuristics for Symbolic Search.
|
AAAI | 2022 | 8 |
| Online Relaxation Refinement for Satisficing Planning: On Partial Delete Relaxation, Complete Hill-Climbing, and Novelty Pruning.
|
JAIR | 2022 | 3 |
| Neural Network Heuristic Functions for Classical Planning: Bootstrapping and Comparison to Other Methods.
|
ICAPS | 2022 | 18 |
| Debugging a Policy: Automatic Action-Policy Testing in AI Planning.
|
ICAPS | 2022 | 13 |
| Classical Planning with Avoid Conditions.
|
AAAI | 2022 | 2 |
| Operator-Potentials in Symbolic Search: From Forward to Bi-directional Search.
|
ICAPS | 2022 | 3 |
| Explaining Soft-Goal Conflicts through Constraint Relaxations.
|
IJCAI | 2022 | 5 |
| Neural Network Action Policy Verification via Predicate Abstraction.
|
ICAPS | 2022 | 8 |
| Merge and Shrink Abstractions for Temporal Planning.
|
ICAPS | 2022 | 2 |
| Pattern Selection Strategies for Pattern Databases in Probabilistic Planning.
|
ICAPS | 2022 | 4 |
| Neural Network Heuristic Functions: Taking Confidence into Account.
|
SOCS | 2022 | 6 |
| Expressivity of Planning with Horn Description Logic Ontologies.
|
AAAI | 2022 | 0 |
| Pattern Databases for Goal-Probability Maximization in Probabilistic Planning.
|
ICAPS | 2021 | 11 |
| Landmark Heuristics for Lifted Planning - Extended Abstract.
|
SOCS | 2021 | 4 |
| Learning Temporal Plan Preferences from Examples: An Empirical Study.
|
IJCAI | 2021 | 4 |
| Choosing the Initial State for Online Replanning.
|
AAAI | 2021 | 1 |
| Pattern Databases for Stochastic Shortest Path Problems.
|
SOCS | 2021 | 8 |
| Faster Stackelberg Planning via Symbolic Search and Information Sharing.
|
AAAI | 2021 | 8 |
| Custom-Design of FDR Encodings: The Case of Red-Black Planning.
|
IJCAI | 2021 | 3 |
| Polynomial-Time in PDDL Input Size: Making the Delete Relaxation Feasible for Lifted Planning.
|
IJCAI | 2021 | 33 |
| Making DL-Lite Planning Practical.
|
KR | 2021 | 0 |
| Neural Network Heuristics for Classical Planning: A Study of Hyperparameter Space.
|
ECAI | 2020 | 46 |
| Generating Instructions at Different Levels of Abstraction.
|
COLING | 2020 | 8 |
| Plan-Space Explanation via Plan-Property Dependencies: Faster Algorithms & More Powerful Properties.
|
IJCAI | 2020 | 22 |
| Let's Learn Their Language? A Case for Planning with Automata-Network Languages from Model Checking.
|
AAAI | 2020 | 11 |
| Bridging the Gap Between Probabilistic Model Checking and Probabilistic Planning: Survey, Compilations, and Empirical Comparison.
|
JAIR | 2020 | 10 |
| Beliefs We Can Believe in: Replacing Assumptions with Data in Real-Time Search.
|
AAAI | 2020 | 7 |
| A New Approach to Plan-Space Explanation: Analyzing Plan-Property Dependencies in Oversubscription Planning.
|
AAAI | 2020 | 53 |
| Applying Monte-Carlo Tree Search in HTN Planning.
|
SOCS | 2020 | 0 |
| Advanced Factoring Strategies for Decoupled Search Using Linear Programming.
|
ICAPS | 2019 | 2 |
| Comparative Criteria for Partially Observable Contingent Planning.
|
AAMAS | 2019 | 7 |
| On the Relation between Star-Topology Decoupling and Petri Net Unfolding.
|
ICAPS | 2019 | 4 |
| Real-Time Planning as Decision-Making under Uncertainty.
|
AAAI | 2019 | 5 |
| Strong Stubborn Set Pruning for Star-Topology Decoupled State Space Search.
|
JAIR | 2019 | 8 |
| Refining Abstraction Heuristics during Real-Time Planning.
|
AAAI | 2019 | 1 |
| Comparative criteria for partially observable contingent planning.
|
Autonomous Agents and Multi-Agent Systems | 2019 | 0 |
| LP Heuristics over Conjunctions: Compilation, Convergence, Nogood Learning.
|
IJCAI | 2018 | 4 |
| Stackelberg Planning: Towards Effective Leader-Follower State Space Search.
|
AAAI | 2018 | 31 |
| Unchaining the Power of Partial Delete Relaxation, Part II: Finding Plans with Red-Black State Space Search.
|
IJCAI | 2018 | 1 |
| Simulated Penetration Testing as Contingent Planning.
|
ICAPS | 2018 | 18 |
| Star-topology decoupled state space search.
|
Artificial Intelligence | 2018 | 30 |
| Compiling Probabilistic Model Checking into Probabilistic Planning.
|
ICAPS | 2018 | 8 |
| On Stubborn Sets and Planning with Resources.
|
ICAPS | 2018 | 5 |
| State space search nogood learning: Online refinement of critical-path dead-end detectors in planning.
|
Artificial Intelligence | 2017 | 26 |
| Beyond Forks: Finding and Ranking Star Factorings for Decoupled Search.
|
IJCAI | 2017 | 11 |
| Critical-Path Dead-End Detection versus NoGoods: Offline Equivalence and Online Learning.
|
ICAPS | 2017 | 1 |
| Complete Local Search: Boosting Hill-Climbing through Online Relaxation Refinement.
|
ICAPS | 2017 | 10 |
| Beyond Red-Black Planning: Limited-Memory State Variables.
|
ICAPS | 2017 | 3 |
| Symmetry Breaking in Star-Topology Decoupled Search.
|
ICAPS | 2017 | 17 |
| Search and Learn: On Dead-End Detectors, the Traps they Set, and Trap Learning.
|
IJCAI | 2017 | 11 |
| Symbolic Leaf Representation in Decoupled Search.
|
SOCS | 2017 | 0 |
| Ranking Conjunctions for Partial Delete Relaxation Heuristics in Planning.
|
SOCS | 2017 | 0 |
| From OpenCCG to AI Planning: Detecting Infeasible Edges in Sentence Generation.
|
COLING | 2016 | 2 |
| Revisiting Goal Probability Analysis in Probabilistic Planning.
|
ICAPS | 2016 | 19 |
| Practical Undoability Checking via Contingent Planning.
|
ICAPS | 2016 | 17 |
| Goal Probability Analysis in Probabilistic Planning: Exploring and Enhancing the State of the Art.
|
JAIR | 2016 | 4 |
| Combining the Delete Relaxation with Critical-Path Heuristics: A Direct Characterization.
|
JAIR | 2016 | 14 |
| Decoupled Strong Stubborn Sets.
|
IJCAI | 2016 | 11 |
| On State-Dominance Criteria in Fork-Decoupled Search.
|
IJCAI | 2016 | 12 |
| Towards Clause-Learning State Space Search: Learning to Recognize Dead-Ends.
|
AAAI | 2016 | 21 |
| Partial Delete Relaxation, Unchained: On Intractable Red-Black Planning and Its Applications.
|
SOCS | 2016 | 0 |
| Simulation-Based Admissible Dominance Pruning.
|
IJCAI | 2015 | 28 |
| Red-black planning: A new systematic approach to partial delete relaxation.
|
Artificial Intelligence | 2015 | 93 |
| Journal Track Paper Abstracts.
|
ICAPS | 2015 | 0 |
| From Fork Decoupling to Star-Topology Decoupling.
|
SOCS | 2015 | 11 |
| Simulated Penetration Testing: From "Dijkstra" to "Turing Test++".
|
ICAPS | 2015 | 106 |
| Red-Black Planning: A New Tractability Analysis and Heuristic Function.
|
SOCS | 2015 | 7 |
| Explicit Conjunctions without Compilation: Computing h
|
ICAPS | 2015 | 0 |
| Beating LM-Cut with h
|
ICAPS | 2015 | 0 |
| Improving Delete Relaxation Heuristics Through Explicitly Represented Conjunctions.
|
JAIR | 2014 | 48 |
| BDD Ordering Heuristics for Classical Planning.
|
JAIR | 2014 | 22 |
| "Distance"? Who Cares? Tailoring Merge-and-Shrink Heuristics to Detect Unsolvability.
|
ECAI | 2014 | 66 |
| Learning Pruning Rules for Heuristic Search Planning.
|
ECAI | 2014 | 16 |
| Optimizing Planning Domains by Automatic Action Schema Splitting.
|
ICAPS | 2014 | 43 |
| Improved Features for Runtime Prediction of Domain-Independent Planners.
|
ICAPS | 2014 | 55 |
| Red-Black Relaxed Plan Heuristics Reloaded.
|
SOCS | 2013 | 17 |
| Red-Black Relaxed Plan Heuristics.
|
AAAI | 2013 | 26 |
| What's in It for My BDD? On Causal Graphs and Variable Orders in Planning.
|
ICAPS | 2013 | 9 |
| Who Said We Need to Relax All Variables?
|
ICAPS | 2013 | 33 |
| Resource-Constrained Planning: A Monte Carlo Random Walk Approach.
|
ICAPS | 2012 | 66 |
| Semi-Relaxed Plan Heuristics.
|
AAAI | 2012 | 51 |
| POMDPs Make Better Hackers: Accounting for Uncertainty in Penetration Testing.
|
AAAI | 2012 | 101 |
| SAP Speaks PDDL: Exploiting a Software-Engineering Model for Planning in Business Process Management.
|
JAIR | 2012 | 37 |
| Semi-Relaxed Plan Heuristics.
|
ICAPS | 2012 | 0 |
| How to Relax a Bisimulation?
|
ICAPS | 2012 | 0 |
| Where Ignoring Delete Lists Works, Part II: Causal Graphs.
|
ICAPS | 2011 | 13 |
| Analyzing Search Topology Without Running Any Search: On the Connection Between Causal Graphs and h+.
|
JAIR | 2011 | 70 |
| Computing Perfect Heuristics in Polynomial Time: On Bisimulation and Merge-and-Shrink Abstraction in Optimal Planning.
|
IJCAI | 2011 | 0 |
| Brothers in Arms? On AI Planning and Cellular Automata.
|
ECAI | 2010 | 4 |
| Waking Up a Sleeping Rabbit: On Natural-Language Sentence Generation with FF.
|
ICAPS | 2010 | 34 |
| Improving Local Search for Resource-Constrained Planning.
|
SOCS | 2010 | 15 |
| SAP Speaks PDDL.
|
AAAI | 2010 | 24 |
| Message-Based Web Service Composition, Integrity Constraints, and Planning under Uncertainty: A New Connection.
|
JAIR | 2009 | 57 |
| Friends or Foes? On Planning as Satisfiability and Abstract CNF Encodings.
|
JAIR | 2009 | 14 |
| Enhancing the Context-Enhanced Additive Heuristic with Precedence Constraints.
|
ICAPS | 2009 | 23 |
| Towards Efficient Belief Update for Planning-Based Web Service Composition.
|
ECAI | 2008 | 8 |
| SWING: An Integrated Environment for Geospatial Semantic Web Services.
|
ESWC | 2008 | 24 |
| Semantic Annotation and Composition of Business Processes with Maestro.
|
ESWC | 2008 | 33 |
| Explicit-State Abstraction: A New Method for Generating Heuristic Functions.
|
AAAI | 2008 | 28 |
| Flexible Abstraction Heuristics for Optimal Sequential Planning.
|
ICAPS | 2007 | 281 |
| Web Service Composition as Planning, Revisited: In Between Background Theories and Initial State Uncertainty.
|
AAAI | 2007 | 77 |
| Probabilistic Planning via Heuristic Forward Search and Weighted Model Counting.
|
JAIR | 2007 | 113 |
| SAT Encodings of State-Space Reachability Problems in Numeric Domains.
|
IJCAI | 2007 | 45 |
| Short XORs for Model Counting: From Theory to Practice.
|
SAT | 2007 | 44 |
| From Sampling to Model Counting.
|
IJCAI | 2007 | 104 |
| Structure and Problem Hardness: Goal Asymmetry and DPLL Proofs in SAT-Based Planning.
|
ICAPS | 2006 | 20 |
| Friends or Foes? An AI Planning Perspective on Abstraction and Search.
|
ICAPS | 2006 | 22 |
| Engineering Benchmarks for Planning: the Domains Used in the Deterministic Part of IPC-4.
|
JAIR | 2006 | 79 |
| Fast Probabilistic Planning through Weighted Model Counting.
|
ICAPS | 2006 | 47 |
| Conformant planning via heuristic forward search: A new approach.
|
Artificial Intelligence | 2006 | 0 |
| Where 'Ignoring Delete Lists' Works: Local Search Topology in Planning Benchmarks.
|
JAIR | 2005 | 141 |
| Contingent Planning via Heuristic Forward Search witn Implicit Belief States.
|
ICAPS | 2005 | 231 |
| A Covering Problem for Hypercubes.
|
IJCAI | 2005 | 4 |
| The Deterministic Part of IPC-4: An Overview.
|
JAIR | 2005 | 188 |
| In defense of PDDL axioms.
|
Artificial Intelligence | 2005 | 0 |
| Conformant Planning via Heuristic Forward Search: A New Approach.
|
ICAPS | 2004 | 227 |
| Ordered Landmarks in Planning.
|
JAIR | 2004 | 0 |
| Branching Matters: Alternative Branching in Graphplan.
|
ICAPS | 2003 | 12 |
| The Metric-FF Planning System: Translating ''Ignoring Delete Lists'' to Numeric State Variables.
|
JAIR | 2003 | 524 |
| In Defense of PDDL Axioms.
|
IJCAI | 2003 | 188 |
| Extending FF to Numerical State Variables.
|
ECAI | 2002 | 123 |
| Local Search Topology in Planning Benchmarks: An Empirical Analysis.
|
IJCAI | 2001 | 87 |
| The FF Planning System: Fast Plan Generation Through Heuristic Search.
|
JAIR | 2001 | 0 |
| On Reasonable and Forced Goal Orderings and their Use in an Agenda-Driven Planning Algorithm.
|
JAIR | 2000 | 142 |
| A New Method to Index and Query Sets.
|
IJCAI | 1999 | 45 |