Jörg Hoffmann

Orcid: 0000-0003-1590-5876

Affiliations:
  • Saarland University, Department of Computer Science, Saarbrücken, Germany (since 2012)
  • INRIA, Nancy, France (since 2009)
  • SAP Research Karlsruhe, Germany (since 2008)
  • University of Innsbruck, Semantic Technology Institute, Austria (former)
  • Cornell University, Ithaca, NY, USA (2006)
  • Max Planck Institute for Computer Science, Saarbrücken, Germany (2004 - 2006)
  • University of Freiburg, Department of Computer Science, Germany (PhD 2002)


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

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Guiding GBFS through Learned Pairwise Rankings.
Proceedings of the Thirty-Third International Joint Conference on Artificial Intelligence, 2024

Neural Action Policy Safety Verification: Applicablity Filtering.
Proceedings of the Thirty-Fourth International Conference on Automated Planning and Scheduling, 2024

New Fuzzing Biases for Action Policy Testing.
Proceedings of the Thirty-Fourth International Conference on Automated Planning and Scheduling, 2024

Decision-Focused Learning to Predict Action Costs for Planning.
Proceedings of the ECAI 2024 - 27th European Conference on Artificial Intelligence, 19-24 October 2024, Santiago de Compostela, Spain, 2024

Safety Verification of Tree-Ensemble Policies via Predicate Abstraction.
Proceedings of the ECAI 2024 - 27th European Conference on Artificial Intelligence, 19-24 October 2024, Santiago de Compostela, Spain, 2024

Iterative Oversubscription Planning with Goal-Conflict Explanations: Scaling Up Through Policy-Guidance Approximation.
Proceedings of the ECAI 2024 - 27th European Conference on Artificial Intelligence, 19-24 October 2024, Santiago de Compostela, Spain, 2024

2023
DSMC Evaluation Stages: Fostering Robust and Safe Behavior in Deep Reinforcement Learning - Extended Version.
ACM Trans. Model. Comput. Simul., October, 2023

Analyzing neural network behavior through deep statistical model checking.
Int. J. Softw. Tools Technol. Transf., June, 2023

Specifying and Testing k-Safety Properties for Machine-Learning Models.
Proceedings of the Thirty-Second International Joint Conference on Artificial Intelligence, 2023

A Landmark-Cut Heuristic for Lifted Optimal Planning.
Proceedings of the ECAI 2023 - 26th European Conference on Artificial Intelligence, September 30 - October 4, 2023, Kraków, Poland, 2023

Lifted Stackelberg Planning.
Proceedings of the Thirty-Third International Conference on Automated Planning and Scheduling, 2023

Automatic Metamorphic Test Oracles for Action-Policy Testing.
Proceedings of the Thirty-Third International Conference on Automated Planning and Scheduling, 2023

Neural Policy Safety Verification via Predicate Abstraction: CEGAR.
Proceedings of the Thirty-Seventh AAAI Conference on Artificial Intelligence, 2023

2022
Supplementary material to the paper "Expressivity of Planning with Horn Description Logic Ontologies".
Dataset, June, 2022

Supplementary material to the paper "Expressivity of Planning with Horn Description Logic Ontologies".
Dataset, June, 2022

Artifact for the Tool Paper: MoGym: Using Formal Models for Training and Verifying Decision-making Agents.
Dataset, May, 2022

PDDL Generators.
Dataset, March, 2022

Online Relaxation Refinement for Satisficing Planning: On Partial Delete Relaxation, Complete Hill-Climbing, and Novelty Pruning.
J. Artif. Intell. Res., 2022

Expressivity of Planning with Horn Description Logic Ontologies (Technical Report).
CoRR, 2022

Neural Network Heuristic Functions: Taking Confidence into Account.
Proceedings of the Fifteenth International Symposium on Combinatorial Search, 2022

Glyph-Based Visual Analysis of Q-Leaning Based Action Policy Ensembles on Racetrack.
Proceedings of the 26th International Conference Information Visualisation, 2022

Metamorphic relations via relaxations: an approach to obtain oracles for action-policy testing.
Proceedings of the ISSTA '22: 31st ACM SIGSOFT International Symposium on Software Testing and Analysis, Virtual Event, South Korea, July 18, 2022

Landmark Heuristics for Lifted Classical Planning.
Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence, 2022

Explaining Soft-Goal Conflicts through Constraint Relaxations.
Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence, 2022

Expressivity of Planning with Horn Description Logic Ontologies (Extended Abstract).
Proceedings of the 35th International Workshop on Description Logics (DL 2022) co-located with Federated Logic Conference (FLoC 2022), 2022

MoGym: Using Formal Models for Training and Verifying Decision-making Agents.
Proceedings of the Computer Aided Verification - 34th International Conference, 2022

Neural Network Action Policy Verification via Predicate Abstraction.
Proceedings of the Thirty-Second International Conference on Automated Planning and Scheduling, 2022

Debugging a Policy: Automatic Action-Policy Testing in AI Planning.
Proceedings of the Thirty-Second International Conference on Automated Planning and Scheduling, 2022

Pattern Selection Strategies for Pattern Databases in Probabilistic Planning.
Proceedings of the Thirty-Second International Conference on Automated Planning and Scheduling, 2022

Operator-Potentials in Symbolic Search: From Forward to Bi-directional Search.
Proceedings of the Thirty-Second International Conference on Automated Planning and Scheduling, 2022

Neural Network Heuristic Functions for Classical Planning: Bootstrapping and Comparison to Other Methods.
Proceedings of the Thirty-Second International Conference on Automated Planning and Scheduling, 2022

Evaluating Plan-Property Dependencies: A Web-Based Platform and User Study.
Proceedings of the Thirty-Second International Conference on Automated Planning and Scheduling, 2022

Merge and Shrink Abstractions for Temporal Planning.
Proceedings of the Thirty-Second International Conference on Automated Planning and Scheduling, 2022

Classical Planning with Avoid Conditions.
Proceedings of the Thirty-Sixth AAAI Conference on Artificial Intelligence, 2022

Operator-Potential Heuristics for Symbolic Search.
Proceedings of the Thirty-Sixth AAAI Conference on Artificial Intelligence, 2022

Expressivity of Planning with Horn Description Logic Ontologies.
Proceedings of the Thirty-Sixth AAAI Conference on Artificial Intelligence, 2022

2021
Supplementary Material to "Making DL-Lite Planning Practical".
Dataset, November, 2021

Supplementary Material to "Making DL-Lite Planning Practical".
Dataset, November, 2021

Landmark Heuristics for Lifted Planning - Extended Abstract.
Proceedings of the Fourteenth International Symposium on Combinatorial Search, 2021

Pattern Databases for Stochastic Shortest Path Problems.
Proceedings of the Fourteenth International Symposium on Combinatorial Search, 2021

DSMC Evaluation Stages: Fostering Robust and Safe Behavior in Deep Reinforcement Learning.
Proceedings of the Quantitative Evaluation of Systems - 18th International Conference, 2021

Making DL-Lite Planning Practical.
Proceedings of the 18th International Conference on Principles of Knowledge Representation and Reasoning, 2021

Learning Temporal Plan Preferences from Examples: An Empirical Study.
Proceedings of the Thirtieth International Joint Conference on Artificial Intelligence, 2021

Polynomial-Time in PDDL Input Size: Making the Delete Relaxation Feasible for Lifted Planning.
Proceedings of the Thirtieth International Joint Conference on Artificial Intelligence, 2021

Custom-Design of FDR Encodings: The Case of Red-Black Planning.
Proceedings of the Thirtieth International Joint Conference on Artificial Intelligence, 2021

Why Do I Have to Take Over Control? Evaluating Safe Handovers with Advance Notice and Explanations in HAD.
Proceedings of the ICMI '21: International Conference on Multimodal Interaction, 2021

Making DL-Lite Planning Practical (Extended Abstract).
Proceedings of the 34th International Workshop on Description Logics (DL 2021) part of Bratislava Knowledge September (BAKS 2021), 2021

Model Checking ømega-Regular Properties with Decoupled Search.
Proceedings of the Computer Aided Verification - 33rd International Conference, 2021

Automated Safety Verification of Programs Invoking Neural Networks.
Proceedings of the Computer Aided Verification - 33rd International Conference, 2021

Pattern Databases for Goal-Probability Maximization in Probabilistic Planning.
Proceedings of the Thirty-First International Conference on Automated Planning and Scheduling, 2021

Faster Stackelberg Planning via Symbolic Search and Information Sharing.
Proceedings of the Thirty-Fifth AAAI Conference on Artificial Intelligence, 2021

Choosing the Initial State for Online Replanning.
Proceedings of the Thirty-Fifth AAAI Conference on Artificial Intelligence, 2021

2020
Bridging the Gap Between Probabilistic Model Checking and Probabilistic Planning: Survey, Compilations, and Empirical Comparison.
J. Artif. Intell. Res., 2020

Iterative Planning with Plan-Space Explanations: A Tool and User Study.
CoRR, 2020

Safe Handover in Mixed-Initiative Control for Cyber-Physical Systems.
CoRR, 2020

Tracking the Race Between Deep Reinforcement Learning and Imitation Learning - Extended Version.
CoRR, 2020

Lab Conditions for Research on Explainable Automated Decisions.
Proceedings of the Trustworthy AI - Integrating Learning, Optimization and Reasoning, 2020

Applying Monte-Carlo Tree Search in HTN Planning.
Proceedings of the Thirteenth International Symposium on Combinatorial Search, 2020

MC-Saar-Instruct: a Platform for Minecraft Instruction Giving Agents.
Proceedings of the 21th Annual Meeting of the Special Interest Group on Discourse and Dialogue, 2020

Tracking the Race Between Deep Reinforcement Learning and Imitation Learning.
Proceedings of the Quantitative Evaluation of Systems - 17th International Conference, 2020

TraceVis: Towards Visualization for Deep Statistical Model Checking.
Proceedings of the Leveraging Applications of Formal Methods, Verification and Validation: Tools and Trends, 2020

Towards Dynamic Dependable Systems Through Evidence-Based Continuous Certification.
Proceedings of the Leveraging Applications of Formal Methods, Verification and Validation: Engineering Principles, 2020

Plan-Space Explanation via Plan-Property Dependencies: Faster Algorithms & More Powerful Properties.
Proceedings of the Twenty-Ninth International Joint Conference on Artificial Intelligence, 2020

Deep Statistical Model Checking.
Proceedings of the Formal Techniques for Distributed Objects, Components, and Systems, 2020

Neural Network Heuristics for Classical Planning: A Study of Hyperparameter Space.
Proceedings of the ECAI 2020 - 24th European Conference on Artificial Intelligence, 29 August-8 September 2020, Santiago de Compostela, Spain, August 29 - September 8, 2020, 2020

Generating Instructions at Different Levels of Abstraction.
Proceedings of the 28th International Conference on Computational Linguistics, 2020

Let's Learn Their Language? A Case for Planning with Automata-Network Languages from Model Checking.
Proceedings of the Thirty-Fourth AAAI Conference on Artificial Intelligence, 2020

Beliefs We Can Believe in: Replacing Assumptions with Data in Real-Time Search.
Proceedings of the Thirty-Fourth AAAI Conference on Artificial Intelligence, 2020

A New Approach to Plan-Space Explanation: Analyzing Plan-Property Dependencies in Oversubscription Planning.
Proceedings of the Thirty-Fourth AAAI Conference on Artificial Intelligence, 2020

Planen.
Proceedings of the Handbuch der Künstlichen Intelligenz, 6. Auflage, 2020

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

Comparative criteria for partially observable contingent planning.
Auton. Agents Multi Agent Syst., 2019

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

Explainable AI Planning (XAIP): Overview and the Case of Contrastive Explanation (Extended Abstract).
Proceedings of the Reasoning Web. Explainable Artificial Intelligence, 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
Simulated Penetration Testing and Mitigation Analysis.
CoRR, 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.
Künstliche Intell., 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 h<sup>max</sup> (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 h<sup>FF</sup>(Pi<sup>C</sup>) 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
Les POMDP font de meilleurs hackers: Tenir compte de l'incertitude dans les tests de penetration.
CoRR, 2013

Penetration Testing == POMDP Solving?
CoRR, 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.
Inf. Syst. Frontiers, 2012

Resource-Constrained Planning: A Monte Carlo Random Walk Approach.
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
Analyzing Search Topology Without Running Any Search: On the Connection Between Causal Graphs and h+.
J. Artif. Intell. Res., 2011

A Caching Technique for Optimizing Automated Service Discovery.
Int. J. Semantic Comput., 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 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 39. Jahrestagung der Gesellschaft für Informatik, Im Focus das Leben, INFORMATIK 2009, Lübeck, Germany, September 28, 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
Structure and Problem Hardness: Goal Asymmetry and DPLL Proofs in SAT-Based Planning.
Log. Methods Comput. Sci., 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.
Künstliche Intell., 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

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

In defense of PDDL axioms.
Artif. Intell., 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.
Künstliche Intell., 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

2003
The Metric-FF Planning System: Translating ''Ignoring Delete Lists'' to Numeric State Variables.
J. Artif. Intell. Res., 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 European Conference on Artificial Intelligence, 2002

2001
An Overview of Recent Algorithms for AI Planning.
Künstliche Intell., 2001

Der zweite internationale Wettbewerb für Planungssysteme.
Künstliche Intell., 2001

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

FF: The Fast-Forward Planning System.
AI Mag., 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 Mag., 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 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...