Jörg Hoffmann

According to our database1, Jörg Hoffmann authored at least 144 papers between 1997 and 2019.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

2019
Strong Stubborn Set Pruning for Star-Topology Decoupled State Space Search.
J. Artif. Intell. Res., 2019

Towards automated network mitigation analysis.
Proceedings of the 34th ACM/SIGAPP Symposium on Applied Computing, 2019

Comparative Criteria for Partially Observable Contingent Planning.
Proceedings of the 18th International Conference on Autonomous Agents and MultiAgent Systems, 2019

Advanced Factoring Strategies for Decoupled Search Using Linear Programming.
Proceedings of the Twenty-Ninth International Conference on Automated Planning and Scheduling, 2019

On the Relation between Star-Topology Decoupling and Petri Net Unfolding.
Proceedings of the Twenty-Ninth International Conference on Automated Planning and Scheduling, 2019

Real-Time Planning as Decision-Making under Uncertainty.
Proceedings of the Thirty-Third AAAI Conference on Artificial Intelligence, 2019

Refining Abstraction Heuristics during Real-Time Planning.
Proceedings of the Thirty-Third AAAI Conference on Artificial Intelligence, 2019

2018
Web Service Composition.
Proceedings of the Encyclopedia of Social Network Analysis and Mining, 2nd Edition, 2018

Star-topology decoupled state space search.
Artif. Intell., 2018

Star-Topology Decoupling in SPIN.
Proceedings of the Model Checking Software - 25th International Symposium, 2018

LP Heuristics over Conjunctions: Compilation, Convergence, Nogood Learning.
Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence, 2018

Unchaining the Power of Partial Delete Relaxation, Part II: Finding Plans with Red-Black State Space Search.
Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence, 2018

Formally Reasoning about the Cost and Efficacy of Securing the Email Infrastructure.
Proceedings of the 2018 IEEE European Symposium on Security and Privacy, 2018

On Stubborn Sets and Planning with Resources.
Proceedings of the Twenty-Eighth International Conference on Automated Planning and Scheduling, 2018

Simulated Penetration Testing as Contingent Planning.
Proceedings of the Twenty-Eighth International Conference on Automated Planning and Scheduling, 2018

Compiling Probabilistic Model Checking into Probabilistic Planning.
Proceedings of the Twenty-Eighth International Conference on Automated Planning and Scheduling, 2018

Stackelberg Planning: Towards Effective Leader-Follower State Space Search.
Proceedings of the Thirty-Second AAAI Conference on Artificial Intelligence, 2018

2017
State space search nogood learning: Online refinement of critical-path dead-end detectors in planning.
Artif. Intell., 2017

Symbolic Leaf Representation in Decoupled Search.
Proceedings of the Tenth International Symposium on Combinatorial Search, 2017

Ranking Conjunctions for Partial Delete Relaxation Heuristics in Planning.
Proceedings of the Tenth International Symposium on Combinatorial Search, 2017

Search and Learn: On Dead-End Detectors, the Traps they Set, and Trap Learning.
Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence, 2017

Beyond Forks: Finding and Ranking Star Factorings for Decoupled Search.
Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence, 2017

Critical-Path Dead-End Detection versus NoGoods: Offline Equivalence and Online Learning.
Proceedings of the Twenty-Seventh International Conference on Automated Planning and Scheduling, 2017

Beyond Red-Black Planning: Limited-Memory State Variables.
Proceedings of the Twenty-Seventh International Conference on Automated Planning and Scheduling, 2017

Symmetry Breaking in Star-Topology Decoupled Search.
Proceedings of the Twenty-Seventh International Conference on Automated Planning and Scheduling, 2017

Complete Local Search: Boosting Hill-Climbing through Online Relaxation Refinement.
Proceedings of the Twenty-Seventh International Conference on Automated Planning and Scheduling, 2017

2016
Search Challenges in Natural Language Generation with Complex Optimization Objectives.
KI, 2016

Goal Probability Analysis in Probabilistic Planning: Exploring and Enhancing the State of the Art.
J. Artif. Intell. Res., 2016

Combining the Delete Relaxation with Critical-Path Heuristics: A Direct Characterization.
J. Artif. Intell. Res., 2016

Partial Delete Relaxation, Unchained: On Intractable Red-Black Planning and Its Applications.
Proceedings of the Ninth Annual Symposium on Combinatorial Search, 2016

On State-Dominance Criteria in Fork-Decoupled Search.
Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence, 2016

Decoupled Strong Stubborn Sets.
Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence, 2016

From OpenCCG to AI Planning: Detecting Infeasible Edges in Sentence Generation.
Proceedings of the COLING 2016, 2016

Revisiting Goal Probability Analysis in Probabilistic Planning.
Proceedings of the Twenty-Sixth International Conference on Automated Planning and Scheduling, 2016

Practical Undoability Checking via Contingent Planning.
Proceedings of the Twenty-Sixth International Conference on Automated Planning and Scheduling, 2016

Towards Clause-Learning State Space Search: Learning to Recognize Dead-Ends.
Proceedings of the Thirtieth AAAI Conference on Artificial Intelligence, 2016

2015
Red-black planning: A new systematic approach to partial delete relaxation.
Artif. Intell., 2015

From Fork Decoupling to Star-Topology Decoupling.
Proceedings of the Eighth Annual Symposium on Combinatorial Search, 2015

Red-Black Planning: A New Tractability Analysis and Heuristic Function.
Proceedings of the Eighth Annual Symposium on Combinatorial Search, 2015

PriCL: Creating a Precedent, a Framework for Reasoning about Privacy Case Law.
Proceedings of the Principles of Security and Trust - 4th International Conference, 2015

Simulation-Based Admissible Dominance Pruning.
Proceedings of the Twenty-Fourth International Joint Conference on Artificial Intelligence, 2015

Beating LM-Cut with hmax (Sometimes): Fork-Decoupled State Space Search.
Proceedings of the Twenty-Fifth International Conference on Automated Planning and Scheduling, 2015

Journal Track Paper Abstracts.
Proceedings of the Twenty-Fifth International Conference on Automated Planning and Scheduling, 2015

Explicit Conjunctions without Compilation: Computing hFF(PiC) in Polynomial Time.
Proceedings of the Twenty-Fifth International Conference on Automated Planning and Scheduling, 2015

Simulated Penetration Testing: From "Dijkstra" to "Turing Test++".
Proceedings of the Twenty-Fifth International Conference on Automated Planning and Scheduling, 2015

2014
Web Service Composition.
Encyclopedia of Social Network Analysis and Mining, 2014

BDD Ordering Heuristics for Classical Planning.
J. Artif. Intell. Res., 2014

Improving Delete Relaxation Heuristics Through Explicitly Represented Conjunctions.
J. Artif. Intell. Res., 2014

Merge-and-Shrink Abstraction: A Method for Generating Lower Bounds in Factored State Spaces.
J. ACM, 2014

Learning Pruning Rules for Heuristic Search Planning.
Proceedings of the ECAI 2014 - 21st European Conference on Artificial Intelligence, 18-22 August 2014, Prague, Czech Republic, 2014

"Distance"? Who Cares? Tailoring Merge-and-Shrink Heuristics to Detect Unsolvability.
Proceedings of the ECAI 2014 - 21st European Conference on Artificial Intelligence, 18-22 August 2014, Prague, Czech Republic, 2014

Improved Features for Runtime Prediction of Domain-Independent Planners.
Proceedings of the Twenty-Fourth International Conference on Automated Planning and Scheduling, 2014

Optimizing Planning Domains by Automatic Action Schema Splitting.
Proceedings of the Twenty-Fourth International Conference on Automated Planning and Scheduling, 2014

2013
Red-Black Relaxed Plan Heuristics Reloaded.
Proceedings of the Sixth Annual Symposium on Combinatorial Search, 2013

Translating Single-Player GDL into PDDL.
Proceedings of the KI 2013: Advances in Artificial Intelligence, 2013

What's in It for My BDD? On Causal Graphs and Variable Orders in Planning.
Proceedings of the Twenty-Third International Conference on Automated Planning and Scheduling, 2013

Who Said We Need to Relax All Variables?
Proceedings of the Twenty-Third International Conference on Automated Planning and Scheduling, 2013

Red-Black Relaxed Plan Heuristics.
Proceedings of the Twenty-Seventh AAAI Conference on Artificial Intelligence, 2013

2012
SAP Speaks PDDL: Exploiting a Software-Engineering Model for Planning in Business Process Management.
J. Artif. Intell. Res., 2012

On compliance checking for clausal constraints in annotated process models.
Information Systems Frontiers, 2012

Resource-Constrained Planning: A Monte Carlo Random Walk Approach.
Proceedings of the Twenty-Second International Conference on Automated Planning and Scheduling, 2012

Semi-Relaxed Plan Heuristics.
Proceedings of the Twenty-Second International Conference on Automated Planning and Scheduling, 2012

How to Relax a Bisimulation?
Proceedings of the Twenty-Second International Conference on Automated Planning and Scheduling, 2012

POMDPs Make Better Hackers: Accounting for Uncertainty in Penetration Testing.
Proceedings of the Twenty-Sixth AAAI Conference on Artificial Intelligence, 2012

Semi-Relaxed Plan Heuristics.
Proceedings of the Twenty-Sixth AAAI Conference on Artificial Intelligence, 2012

Semantic Web Services Fundamentals.
Proceedings of the Handbook of Service Description - USDL and Its Methods, 2012

2011
A Caching Technique for Optimizing Automated Service Discovery.
Int. J. Semantic Computing, 2011

Functional description of geoprocessing services as conjunctive datalog queries.
GeoInformatica, 2011

Everything You Always Wanted to Know about Planning - (But Were Afraid to Ask).
Proceedings of the KI 2011: Advances in Artificial Intelligence, 2011

Computing Perfect Heuristics in Polynomial Time: On Bisimulation and Merge-and-Shrink Abstraction in Optimal Planning.
Proceedings of the IJCAI 2011, 2011

Where Ignoring Delete Lists Works, Part II: Causal Graphs.
Proceedings of the 21st International Conference on Automated Planning and Scheduling, 2011

2010
Beyond soundness: on the verification of semantic business process models.
Distributed and Parallel Databases, 2010

Improving Local Search for Resource-Constrained Planning.
Proceedings of the Third Annual Symposium on Combinatorial Search, 2010

Brothers in Arms? On AI Planning and Cellular Automata.
Proceedings of the ECAI 2010, 2010

Waking Up a Sleeping Rabbit: On Natural-Language Sentence Generation with FF.
Proceedings of the 20th International Conference on Automated Planning and Scheduling, 2010

SAP Speaks PDDL.
Proceedings of the Twenty-Fourth AAAI Conference on Artificial Intelligence, 2010

2009
Message-Based Web Service Composition, Integrity Constraints, and Planning under Uncertainty: A New Connection.
J. Artif. Intell. Res., 2009

Friends or Foes? On Planning as Satisfiability and Abstract CNF Encodings.
J. Artif. Intell. Res., 2009

Composing Services for Third-party Service Delivery.
Proceedings of the IEEE International Conference on Web Services, 2009

Ontology Design for Information Integration in Disaster Management.
Proceedings of the Informatik 2009: Im Focus das Leben, 2009

Ontology-Based Integration of Sensor Web Services in Disaster Management.
Proceedings of the GeoSpatial Semantics, Third International Conference, 2009

Supporting Execution-Level Business Process Modeling with Semantic Technologies.
Proceedings of the Database Systems for Advanced Applications, 2009

Enhancing the Context-Enhanced Additive Heuristic with Precedence Constraints.
Proceedings of the 19th International Conference on Automated Planning and Scheduling, 2009

2008
Fast Directed Model Checking Via Russian Doll Abstraction.
Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2008

Relaxation Refinement: A New Method to Generate Heuristic Functions.
Proceedings of the Model Checking and Artificial Intelligence, 5th International Workshop, 2008

Towards Scalable Web Service Composition with Partial Matches.
Proceedings of the 2008 IEEE International Conference on Web Services (ICWS 2008), 2008

Combining Scalability and Expressivity in the Automatic Composition of Semantic Web Services.
Proceedings of the Eighth International Conference on Web Engineering, 2008

Semantic Annotation and Composition of Business Processes with Maestro.
Proceedings of the Semantic Web: Research and Applications, 2008

SWING: An Integrated Environment for Geospatial Semantic Web Services.
Proceedings of the Semantic Web: Research and Applications, 2008

Beyond Soundness: On the Semantic Consistency of Executable Process Models.
Proceedings of the ECOWS 2008, 2008

Towards Efficient Belief Update for Planning-Based Web Service Composition.
Proceedings of the ECAI 2008, 2008

Detecting Regulatory Compliance for Business Process Models through Semantic Annotations.
Proceedings of the Business Process Management Workshops, 2008

Explicit-State Abstraction: A New Method for Generating Heuristic Functions.
Proceedings of the Twenty-Third AAAI Conference on Artificial Intelligence, 2008

2007
Probabilistic Planning via Heuristic Forward Search and Weighted Model Counting.
J. Artif. Intell. Res., 2007

Uppaal/DMC- Abstraction-Based Heuristics for Directed Model Checking.
Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2007

A Caching Mechanism for Semantic Web Service Discovery.
Proceedings of the Semantic Web, 2007

Sampling and Soundness: Can We Have Both?
Proceedings of the First International Workshop Workshop "New forms of reasoning for the Semantic Web: scalable, 2007

Short XORs for Model Counting: From Theory to Practice.
Proceedings of the Theory and Applications of Satisfiability Testing, 2007

SAT Encodings of State-Space Reachability Problems in Numeric Domains.
Proceedings of the IJCAI 2007, 2007

From Sampling to Model Counting.
Proceedings of the IJCAI 2007, 2007

Integrating Discovery and Automated Composition: from Semantic Requirements to Executable Code.
Proceedings of the 2007 IEEE International Conference on Web Services (ICWS 2007), 2007

Towards a Methodology for Semantic Business Process Modeling and Configuration.
Proceedings of the Service-Oriented Computing, 2007

Scalable Web Service Composition with Partial Matches.
Proceedings of the KWEPSY 2007 Knowledge Web PhD Symposium 2007, 2007

Flexible Abstraction Heuristics for Optimal Sequential Planning.
Proceedings of the Seventeenth International Conference on Automated Planning and Scheduling, 2007

Web Service Composition as Planning, Revisited: In Between Background Theories and Initial State Uncertainty.
Proceedings of the Twenty-Second AAAI Conference on Artificial Intelligence, 2007

Polynomial-Time Reasoning for Semantic Web Service Composition.
Proceedings of the 2007 IEEE International Conference on Services Computing, 2007

2006
KI 2007: Call for Tutorials.
KI, 2006

Engineering Benchmarks for Planning: the Domains Used in the Deterministic Part of IPC-4.
J. Artif. Intell. Res., 2006

Conformant planning via heuristic forward search: A new approach.
Artif. Intell., 2006

A Semantically Enabled Service Oriented Architecture.
Proceedings of the Web Intelligence Meets Brain Informatics, 2006

Adapting an AI Planning Heuristic for Directed Model Checking.
Proceedings of the Model Checking Software, 13th International SPIN Workshop, Vienna, Austria, March 30, 2006

Using Predicate Abstraction to Generate Heuristic Functions in UPPAAL.
Proceedings of the Model Checking and Artificial Intelligence, 4th Workshop, 2006

Friends or Foes? An AI Planning Perspective on Abstraction and Search.
Proceedings of the Sixteenth International Conference on Automated Planning and Scheduling, 2006

Structure and Problem Hardness: Goal Asymmetry and DPLL Proofs in SAT-Based Planning.
Proceedings of the Sixteenth International Conference on Automated Planning and Scheduling, 2006

Fast Probabilistic Planning through Weighted Model Counting.
Proceedings of the Sixteenth International Conference on Automated Planning and Scheduling, 2006

2005
The Deterministic Part of IPC-4: An Overview.
J. Artif. Intell. Res., 2005

Where 'Ignoring Delete Lists' Works: Local Search Topology in Planning Benchmarks.
J. Artif. Intell. Res., 2005

A Covering Problem for Hypercubes.
Proceedings of the IJCAI-05, Proceedings of the Nineteenth International Joint Conference on Artificial Intelligence, Edinburgh, Scotland, UK, July 30, 2005

Contingent Planning via Heuristic Forward Search witn Implicit Belief States.
Proceedings of the Fifteenth International Conference on Automated Planning and Scheduling (ICAPS 2005), 2005

2004
Utilizing Problem Structure in Planning: A Local Search Approach.
KI, 2004

Ordered Landmarks in Planning.
J. Artif. Intell. Res., 2004

Bounded Model Checking and Inductive Verification of Hybrid Discrete-continuous Systems.
Proceedings of the Methoden und Beschreibungssprachen zur Modellierung und Verifikation von Schaltungen und Systemen (MBMV), 2004

Applying Automatic Planning Systems to Airport Ground-Traffic Control - A Feasibility Study.
Proceedings of the KI 2004: Advances in Artificial Intelligence, 2004

Conformant Planning via Heuristic Forward Search: A New Approach.
Proceedings of the Fourteenth International Conference on Automated Planning and Scheduling (ICAPS 2004), 2004

2003
The Metric-FF Planning System: Translating ''Ignoring Delete Lists'' to Numeric State Variables.
J. Artif. Intell. Res., 2003

In Defense of PDDL Axioms.
Proceedings of the IJCAI-03, 2003

Branching Matters: Alternative Branching in Graphplan.
Proceedings of the Thirteenth International Conference on Automated Planning and Scheduling (ICAPS 2003), 2003

Utilizing Problem Structure in Planning, A Local Search Approach
Lecture Notes in Computer Science 2854, Springer, ISBN: 3-540-20259-5, 2003

2002
Local Search Topology in Planning Benchmarks: A Theoretical Analysis.
Proceedings of the Proceedings Workshop Planen und Konfigurieren (PuK-2002), 2002

Extending FF to Numerical State Variables.
Proceedings of the 15th Eureopean Conference on Artificial Intelligence, 2002

Local Search Topology in Planning Benchmarks: A Theoretical Analysis.
Proceedings of the Sixth International Conference on Artificial Intelligence Planning Systems, 2002

2001
An Overview of Recent Algorithms for AI Planning.
KI, 2001

Der zweite internationale Wettbewerb für Planungssysteme.
KI, 2001

The FF Planning System: Fast Plan Generation Through Heuristic Search.
J. Artif. Intell. Res., 2001

FF: The Fast-Forward Planning System.
AI Magazine, 2001

Local Search Topology in Planning Benchmarks: An Empirical Analysis.
Proceedings of the Seventeenth International Joint Conference on Artificial Intelligence, 2001

2000
On Reasonable and Forced Goal Orderings and their Use in an Agenda-Driven Planning Algorithm.
J. Artif. Intell. Res., 2000

The AIPS-98 Planning Competition.
AI Magazine, 2000

On the Instantiation of ADL Operators Involving Arbitrary First-Order Formulas.
Proceedings of the 14th Workshop "New Results in Planning, 2000

A Heuristic for Domain Independent Planning and its Use in an Enforced Hill-climbing Algorithm.
Proceedings of the 14th Workshop "New Results in Planning, 2000

A Heuristic for Domain Independent Planning and Its Use in an Enforced Hill-Climbing Algorithm.
Proceedings of the Foundations of Intelligent Systems, 12th International Symposium, 2000

1999
Planen mit Zielagendas.
Proceedings of the Proceedings PuK 99, 1999

A New Method to Index and Query Sets.
Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence, 1999

1997
Extending Planning Graphs to an ADL Subset.
Proceedings of the Recent Advances in AI Planning, 4th European Conference on Planning, 1997


  Loading...