Jörg Hoffmann 0001

95 publications

11 venues

H Index29


University of Innsbruck, Semantic Technology Institute, Austria
INRIA, Nancy, France
Saarland University, Department of Computer Science, Saarbrücken
Cornell University, Ithaca, NY, USA


Name Venue Year Citations
Computing Perfect Heuristics in Polynomial Time: On Bisimulation and Merge-and-Shrink Abstraction in Optimal Planning. IJCAI 2011 52
Message-Based Web Service Composition, Integrity Constraints, and Planning under Uncertainty: A New Connection. JAIR 2009 45
Stackelberg Planning: Towards Effective Leader-Follower State Space Search. AAAI 2018 5
Improving Local Search for Resource-Constrained Planning. SOCS 2010 8
On Reasonable and Forced Goal Orderings and their Use in an Agenda-Driven Planning Algorithm. JAIR 2000 114
Resource-Constrained Planning: A Monte Carlo Random Walk Approach. ICAPS 2012 44
Compiling Probabilistic Model Checking into Probabilistic Planning. ICAPS 2018 5
SAT Encodings of State-Space Reachability Problems in Numeric Domains. IJCAI 2007 35
Learning Pruning Rules for Heuristic Search Planning. ECAI 2014 6
Simulation-Based Admissible Dominance Pruning. IJCAI 2015 13
Web Service Composition as Planning, Revisited: In Between Background Theories and Initial State Uncertainty. AAAI 2007 64
Revisiting Goal Probability Analysis in Probabilistic Planning. ICAPS 2016 18
Beyond Forks: Finding and Ranking Star Factorings for Decoupled Search. IJCAI 2017 7
From OpenCCG to AI Planning: Detecting Infeasible Edges in Sentence Generation. COLING 2016 2
Complete Local Search: Boosting Hill-Climbing through Online Relaxation Refinement. ICAPS 2017 11
From Fork Decoupling to Star-Topology Decoupling. SOCS 2015 11
SWING: An Integrated Environment for Geospatial Semantic Web Services. ESWC 2008 15
Beyond Red-Black Planning: Limited-Memory State Variables. ICAPS 2017 2
Advanced Factoring Strategies for Decoupled Search Using Linear Programming. ICAPS 2019 0
Decoupled Strong Stubborn Sets. IJCAI 2016 11
Waking Up a Sleeping Rabbit: On Natural-Language Sentence Generation with FF. ICAPS 2010 23
Ordered Landmarks in Planning. JAIR 2004 241
Combining the Delete Relaxation with Critical-Path Heuristics: A Direct Characterization. JAIR 2016 9
On Stubborn Sets and Planning with Resources. ICAPS 2018 0
Flexible Abstraction Heuristics for Optimal Sequential Planning. ICAPS 2007 200
A New Method to Index and Query Sets. IJCAI 1999 28
Towards Clause-Learning State Space Search: Learning to Recognize Dead-Ends. AAAI 2016 16
Where 'Ignoring Delete Lists' Works: Local Search Topology in Planning Benchmarks. JAIR 2005 13
The Deterministic Part of IPC-4: An Overview. JAIR 2005 124
Simulated Penetration Testing: From "Dijkstra" to "Turing Test++". ICAPS 2015 48
Extending FF to Numerical State Variables. ECAI 2002 74
Conformant Planning via Heuristic Forward Search: A New Approach. ICAPS 2004 155
Friends or Foes? On Planning as Satisfiability and Abstract CNF Encodings. JAIR 2009 10
Friends or Foes? An AI Planning Perspective on Abstraction and Search. ICAPS 2006 13
Simulated Penetration Testing as Contingent Planning. ICAPS 2018 3
SAP Speaks PDDL. AAAI 2010 17
Improving Delete Relaxation Heuristics Through Explicitly Represented Conjunctions. JAIR 2014 35
Ranking Conjunctions for Partial Delete Relaxation Heuristics in Planning. SOCS 2017 4
Goal Probability Analysis in Probabilistic Planning: Exploring and Enhancing the State of the Art. JAIR 2016 11
Probabilistic Planning via Heuristic Forward Search and Weighted Model Counting. JAIR 2007 59
Unchaining the Power of Partial Delete Relaxation, Part II: Finding Plans with Red-Black State Space Search. IJCAI 2018 1
A Covering Problem for Hypercubes. IJCAI 2005 2
Towards Efficient Belief Update for Planning-Based Web Service Composition. ECAI 2008 7
State space search nogood learning: Online refinement of critical-path dead-end detectors in planning. Artificial Intelligence 2017 12
Analyzing Search Topology Without Running Any Search: On the Connection Between Causal Graphs and h+. JAIR 2011 46
Fast Probabilistic Planning through Weighted Model Counting. ICAPS 2006 36
Brothers in Arms? On AI Planning and Cellular Automata. ECAI 2010 2
Red-Black Relaxed Plan Heuristics Reloaded. SOCS 2013 15
Local Search Topology in Planning Benchmarks: An Empirical Analysis. IJCAI 2001 71
Partial Delete Relaxation, Unchained: On Intractable Red-Black Planning and Its Applications. SOCS 2016 2
Comparative Criteria for Partially Observable Contingent Planning. AAMAS 2019 0
What's in It for My BDD? On Causal Graphs and Variable Orders in Planning. ICAPS 2013 5
Search and Learn: On Dead-End Detectors, the Traps they Set, and Trap Learning. IJCAI 2017 6
Red-black planning: A new systematic approach to partial delete relaxation. Artificial Intelligence 2015 52
Semantic Annotation and Composition of Business Processes with Maestro. ESWC 2008 23
Star-topology decoupled state space search. Artificial Intelligence 2018 8
On the Relation between Star-Topology Decoupling and Petri Net Unfolding. ICAPS 2019 1
Short XORs for Model Counting: From Theory to Practice. SAT 2007 20
Improved Features for Runtime Prediction of Domain-Independent Planners. ICAPS 2014 32
Critical-Path Dead-End Detection versus NoGoods: Offline Equivalence and Online Learning. ICAPS 2017 0
Semi-Relaxed Plan Heuristics. ICAPS 2012 39
Branching Matters: Alternative Branching in Graphplan. ICAPS 2003 11
SAP Speaks PDDL: Exploiting a Software-Engineering Model for Planning in Business Process Management. JAIR 2012 25
Journal Track Paper Abstracts. ICAPS 2015 0
From Sampling to Model Counting. IJCAI 2007 76
Red-Black Relaxed Plan Heuristics. AAAI 2013 21
Optimizing Planning Domains by Automatic Action Schema Splitting. ICAPS 2014 20
LP Heuristics over Conjunctions: Compilation, Convergence, Nogood Learning. IJCAI 2018 0
Who Said We Need to Relax All Variables? ICAPS 2013 31
How to Relax a Bisimulation? ICAPS 2012 13
In Defense of PDDL Axioms. IJCAI 2003 100
"Distance"? Who Cares? Tailoring Merge-and-Shrink Heuristics to Detect Unsolvability. ECAI 2014 45
Refining Abstraction Heuristics during Real-Time Planning. AAAI 2019 0
Symmetry Breaking in Star-Topology Decoupled Search. ICAPS 2017 9
Contingent Planning via Heuristic Forward Search witn Implicit Belief States. ICAPS 2005 143
Practical Undoability Checking via Contingent Planning. ICAPS 2016 4
Symbolic Leaf Representation in Decoupled Search. SOCS 2017 3
The FF Planning System: Fast Plan Generation Through Heuristic Search. JAIR 2001 1596
Enhancing the Context-Enhanced Additive Heuristic with Precedence Constraints. ICAPS 2009 23
POMDPs Make Better Hackers: Accounting for Uncertainty in Penetration Testing. AAAI 2012 37
The Metric-FF Planning System: Translating ''Ignoring Delete Lists'' to Numeric State Variables. JAIR 2003 50
Engineering Benchmarks for Planning: the Domains Used in the Deterministic Part of IPC-4. JAIR 2006 42
Structure and Problem Hardness: Goal Asymmetry and DPLL Proofs in SAT-Based Planning. ICAPS 2006 20
Explicit-State Abstraction: A New Method for Generating Heuristic Functions. AAAI 2008 18
BDD Ordering Heuristics for Classical Planning. JAIR 2014 12
Red-Black Planning: A New Tractability Analysis and Heuristic Function. SOCS 2015 5
Where Ignoring Delete Lists Works, Part II: Causal Graphs. ICAPS 2011 12
On State-Dominance Criteria in Fork-Decoupled Search. IJCAI 2016 7
Real-Time Planning as Decision-Making under Uncertainty. AAAI 2019 3
Strong Stubborn Set Pruning for Star-Topology Decoupled State Space Search. JAIR 2019 0
Beating LM-Cut with h ICAPS 2015 0
Explicit Conjunctions without Compilation: Computing h ICAPS 2015 0
Semi-Relaxed Plan Heuristics. AAAI 2012 0
Conformant planning via heuristic forward search: A new approach. Artificial Intelligence 2006 0
In defense of PDDL axioms. Artificial Intelligence 2005 0
Copyright ©2019 Universität Würzburg
Website created in context of the REGIO Project
Impressum | Privacy | FAQ