Jörg Hoffmann 0001

114 publications

13 venues

H Index 32


Saarland University, Department of Computer Science, Saarbr cken, Germany
INRIA, 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


Name Venue Year citations
Online Relaxation Refinement for Satisficing Planning: On Partial Delete Relaxation, Complete Hill-Climbing, and Novelty Pruning. JAIR 2022 0
Polynomial-Time in PDDL Input Size: Making the Delete Relaxation Feasible for Lifted Planning. IJCAI 2021 1
Learning Temporal Plan Preferences from Examples: An Empirical Study. IJCAI 2021 1
Faster Stackelberg Planning via Symbolic Search and Information Sharing. AAAI 2021 1
Landmark Heuristics for Lifted Planning - Extended Abstract. SOCS 2021 0
Pattern Databases for Goal-Probability Maximization in Probabilistic Planning. ICAPS 2021 1
Custom-Design of FDR Encodings: The Case of Red-Black Planning. IJCAI 2021 0
Pattern Databases for Stochastic Shortest Path Problems. SOCS 2021 0
Choosing the Initial State for Online Replanning. AAAI 2021 0
Making DL-Lite Planning Practical. KR 2021 0
Beliefs We Can Believe in: Replacing Assumptions with Data in Real-Time Search. AAAI 2020 5
Neural Network Heuristics for Classical Planning: A Study of Hyperparameter Space. ECAI 2020 13
Plan-Space Explanation via Plan-Property Dependencies: Faster Algorithms & More Powerful Properties. IJCAI 2020 8
Applying Monte-Carlo Tree Search in HTN Planning. SOCS 2020 1
A New Approach to Plan-Space Explanation: Analyzing Plan-Property Dependencies in Oversubscription Planning. AAAI 2020 22
Generating Instructions at Different Levels of Abstraction. COLING 2020 2
Bridging the Gap Between Probabilistic Model Checking and Probabilistic Planning: Survey, Compilations, and Empirical Comparison. JAIR 2020 2
Let's Learn Their Language? A Case for Planning with Automata-Network Languages from Model Checking. AAAI 2020 3
Comparative Criteria for Partially Observable Contingent Planning. AAMAS 2019 3
On the Relation between Star-Topology Decoupling and Petri Net Unfolding. ICAPS 2019 3
Strong Stubborn Set Pruning for Star-Topology Decoupled State Space Search. JAIR 2019 5
Real-Time Planning as Decision-Making under Uncertainty. AAAI 2019 5
Advanced Factoring Strategies for Decoupled Search Using Linear Programming. ICAPS 2019 0
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
Star-topology decoupled state space search. Artificial Intelligence 2018 15
Compiling Probabilistic Model Checking into Probabilistic Planning. ICAPS 2018 6
On Stubborn Sets and Planning with Resources. ICAPS 2018 3
Unchaining the Power of Partial Delete Relaxation, Part II: Finding Plans with Red-Black State Space Search. IJCAI 2018 1
LP Heuristics over Conjunctions: Compilation, Convergence, Nogood Learning. IJCAI 2018 2
Stackelberg Planning: Towards Effective Leader-Follower State Space Search. AAAI 2018 17
Simulated Penetration Testing as Contingent Planning. ICAPS 2018 8
Beyond Red-Black Planning: Limited-Memory State Variables. ICAPS 2017 3
Search and Learn: On Dead-End Detectors, the Traps they Set, and Trap Learning. IJCAI 2017 8
Beyond Forks: Finding and Ranking Star Factorings for Decoupled Search. IJCAI 2017 9
Symbolic Leaf Representation in Decoupled Search. SOCS 2017 3
Symmetry Breaking in Star-Topology Decoupled Search. ICAPS 2017 13
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 12
Ranking Conjunctions for Partial Delete Relaxation Heuristics in Planning. SOCS 2017 5
State space search nogood learning: Online refinement of critical-path dead-end detectors in planning. Artificial Intelligence 2017 18
Partial Delete Relaxation, Unchained: On Intractable Red-Black Planning and Its Applications. SOCS 2016 3
Combining the Delete Relaxation with Critical-Path Heuristics: A Direct Characterization. JAIR 2016 12
Revisiting Goal Probability Analysis in Probabilistic Planning. ICAPS 2016 20
On State-Dominance Criteria in Fork-Decoupled Search. IJCAI 2016 9
Practical Undoability Checking via Contingent Planning. ICAPS 2016 11
Goal Probability Analysis in Probabilistic Planning: Exploring and Enhancing the State of the Art. JAIR 2016 24
Towards Clause-Learning State Space Search: Learning to Recognize Dead-Ends. AAAI 2016 19
Decoupled Strong Stubborn Sets. IJCAI 2016 11
From OpenCCG to AI Planning: Detecting Infeasible Edges in Sentence Generation. COLING 2016 3
From Fork Decoupling to Star-Topology Decoupling. SOCS 2015 12
Simulation-Based Admissible Dominance Pruning. IJCAI 2015 21
Red-Black Planning: A New Tractability Analysis and Heuristic Function. SOCS 2015 6
Journal Track Paper Abstracts. ICAPS 2015 0
Simulated Penetration Testing: From "Dijkstra" to "Turing Test++". ICAPS 2015 66
Red-black planning: A new systematic approach to partial delete relaxation. Artificial Intelligence 2015 75
Explicit Conjunctions without Compilation: Computing h ICAPS 2015 0
Beating LM-Cut with h ICAPS 2015 0
Improved Features for Runtime Prediction of Domain-Independent Planners. ICAPS 2014 45
Optimizing Planning Domains by Automatic Action Schema Splitting. ICAPS 2014 32
"Distance"? Who Cares? Tailoring Merge-and-Shrink Heuristics to Detect Unsolvability. ECAI 2014 54
Learning Pruning Rules for Heuristic Search Planning. ECAI 2014 10
Improving Delete Relaxation Heuristics Through Explicitly Represented Conjunctions. JAIR 2014 45
BDD Ordering Heuristics for Classical Planning. JAIR 2014 19
Red-Black Relaxed Plan Heuristics Reloaded. SOCS 2013 18
Who Said We Need to Relax All Variables? ICAPS 2013 36
What's in It for My BDD? On Causal Graphs and Variable Orders in Planning. ICAPS 2013 7
Red-Black Relaxed Plan Heuristics. AAAI 2013 28
Resource-Constrained Planning: A Monte Carlo Random Walk Approach. ICAPS 2012 60
Semi-Relaxed Plan Heuristics. ICAPS 2012 53
POMDPs Make Better Hackers: Accounting for Uncertainty in Penetration Testing. AAAI 2012 52
SAP Speaks PDDL: Exploiting a Software-Engineering Model for Planning in Business Process Management. JAIR 2012 34
How to Relax a Bisimulation? ICAPS 2012 15
Semi-Relaxed Plan Heuristics. AAAI 2012 0
Analyzing Search Topology Without Running Any Search: On the Connection Between Causal Graphs and h+. JAIR 2011 63
Where Ignoring Delete Lists Works, Part II: Causal Graphs. ICAPS 2011 14
Computing Perfect Heuristics in Polynomial Time: On Bisimulation and Merge-and-Shrink Abstraction in Optimal Planning. IJCAI 2011 63
Waking Up a Sleeping Rabbit: On Natural-Language Sentence Generation with FF. ICAPS 2010 30
Improving Local Search for Resource-Constrained Planning. SOCS 2010 14
SAP Speaks PDDL. AAAI 2010 26
Brothers in Arms? On AI Planning and Cellular Automata. ECAI 2010 3
Message-Based Web Service Composition, Integrity Constraints, and Planning under Uncertainty: A New Connection. JAIR 2009 56
Enhancing the Context-Enhanced Additive Heuristic with Precedence Constraints. ICAPS 2009 25
Friends or Foes? On Planning as Satisfiability and Abstract CNF Encodings. JAIR 2009 11
Towards Efficient Belief Update for Planning-Based Web Service Composition. ECAI 2008 8
SWING: An Integrated Environment for Geospatial Semantic Web Services. ESWC 2008 22
Explicit-State Abstraction: A New Method for Generating Heuristic Functions. AAAI 2008 26
Semantic Annotation and Composition of Business Processes with Maestro. ESWC 2008 30
Web Service Composition as Planning, Revisited: In Between Background Theories and Initial State Uncertainty. AAAI 2007 79
From Sampling to Model Counting. IJCAI 2007 95
Probabilistic Planning via Heuristic Forward Search and Weighted Model Counting. JAIR 2007 2
Flexible Abstraction Heuristics for Optimal Sequential Planning. ICAPS 2007 265
Short XORs for Model Counting: From Theory to Practice. SAT 2007 41
SAT Encodings of State-Space Reachability Problems in Numeric Domains. IJCAI 2007 44
Friends or Foes? An AI Planning Perspective on Abstraction and Search. ICAPS 2006 17
Engineering Benchmarks for Planning: the Domains Used in the Deterministic Part of IPC-4. JAIR 2006 69
Fast Probabilistic Planning through Weighted Model Counting. ICAPS 2006 44
Structure and Problem Hardness: Goal Asymmetry and DPLL Proofs in SAT-Based Planning. ICAPS 2006 20
Conformant planning via heuristic forward search: A new approach. Artificial Intelligence 2006 0
The Deterministic Part of IPC-4: An Overview. JAIR 2005 166
Contingent Planning via Heuristic Forward Search witn Implicit Belief States. ICAPS 2005 212
Where 'Ignoring Delete Lists' Works: Local Search Topology in Planning Benchmarks. JAIR 2005 91
A Covering Problem for Hypercubes. IJCAI 2005 3
In defense of PDDL axioms. Artificial Intelligence 2005 0
Ordered Landmarks in Planning. JAIR 2004 350
Conformant Planning via Heuristic Forward Search: A New Approach. ICAPS 2004 214
In Defense of PDDL Axioms. IJCAI 2003 160
The Metric-FF Planning System: Translating ''Ignoring Delete Lists'' to Numeric State Variables. JAIR 2003 354
Branching Matters: Alternative Branching in Graphplan. ICAPS 2003 13
Extending FF to Numerical State Variables. ECAI 2002 111
The FF Planning System: Fast Plan Generation Through Heuristic Search. JAIR 2001 2142
Local Search Topology in Planning Benchmarks: An Empirical Analysis. IJCAI 2001 90
On Reasonable and Forced Goal Orderings and their Use in an Agenda-Driven Planning Algorithm. JAIR 2000 0
A New Method to Index and Query Sets. IJCAI 1999 40
Copyright ©2019 Universität Würzburg

Impressum | Privacy | FAQ