default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMalte Helmert
Person information
- affiliation: University of Basel, Switzerland
- affiliation: University of Freiburg, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j11]Odd Erik Gundersen, Malte Helmert, Holger Hoos:
Improving Reproducibility in AI Research: Four Mechanisms Adopted by JAIR. J. Artif. Intell. Res. 81: 1019-1041 (2024)- [c119]Songtuan Lin, Conny Olz, Malte Helmert, Pascal Bercher:
On the Computational Complexity of Plan Verification, (Bounded) Plan-Optimality Verification, and Bounded Plan Existence. AAAI 2024: 20203-20211 - [c118]Simon Dold, Malte Helmert:
Novelty vs. Potential Heuristics: A Comparison of Hardness Measures for Satisficing Planning. AAAI 2024: 20692-20699 - [c117]Clemens Büchner, Patrick Ferber, Jendrik Seipp, Malte Helmert:
Abstraction Heuristics for Factored Tasks. ICAPS 2024: 40-49 - [c116]Augusto B. Corrêa, Giuseppe De Giacomo, Malte Helmert, Sasha Rubin:
Planning with Object Creation. ICAPS 2024: 104-113 - [c115]Simon Dold, Malte Helmert:
Higher-Dimensional Potential Heuristics: Lower Bound Criterion and Connection to Correlation Complexity. ICAPS 2024: 151-161 - [c114]Claudia Grundke, Gabriele Röger, Malte Helmert:
Formal Representations of Classical Planning Domains. ICAPS 2024: 239-248 - 2023
- [c113]Clemens Büchner, Thomas Keller, Salomé Eriksson, Malte Helmert
:
Landmark Progression in Heuristic Search. ICAPS 2023: 70-79 - [c112]Augusto B. Corrêa, Markus Hecher, Malte Helmert, Davide Mario Longo, Florian Pommerening, Stefan Woltran:
Grounding Planning Tasks Using Tree Decompositions and Iterated Solving. ICAPS 2023: 100-108 - [c111]Daniel Gnad, Malte Helmert, Peter Jonsson, Alexander Shleyfman:
Planning over Integers: Compilations and Undecidability. ICAPS 2023: 148-152 - [c110]Raphael Kreft, Clemens Büchner, Silvan Sievers, Malte Helmert:
Computing Domain Abstractions for Optimal Classical Planning with Counterexample-Guided Abstraction Refinement. ICAPS 2023: 221-226 - 2022
- [c109]Augusto B. Corrêa, Florian Pommerening, Malte Helmert, Guillem Francès:
The FF Heuristic for Lifted Classical Planning. AAAI 2022: 9716-9723 - [c108]Remo Christen, Salomé Eriksson, Florian Pommerening, Malte Helmert:
Detecting Unsolvability Based on Separating Functions. ICAPS 2022: 44-52 - [c107]Malte Helmert, Silvan Sievers, Alexander Rovner, Augusto B. Corrêa:
On the Complexity of Heuristic Synthesis for Satisficing Classical Planning: Potential Heuristics and Beyond. ICAPS 2022: 124-133 - [c106]Patrick Ferber, Florian Geißer, Felipe W. Trevizan, Malte Helmert, Jörg Hoffmann:
Neural Network Heuristic Functions for Classical Planning: Bootstrapping and Comparison to Other Methods. ICAPS 2022: 583-587 - [c105]Michael Katz, Gabriele Röger, Malte Helmert:
On Producing Shortest Cost-Optimal Plans. SOCS 2022: 100-108 - 2021
- [j10]Silvan Sievers, Malte Helmert:
Merge-and-Shrink: A Compositional Theory of Transformations of Factored Transition Systems. J. Artif. Intell. Res. 71: 781-883 (2021) - [c104]Jendrik Seipp, Thomas Keller, Malte Helmert:
Saturated Post-hoc Optimization for Classical Planning. AAAI 2021: 11947-11953 - [c103]Clemens Büchner, Thomas Keller, Malte Helmert:
Exploiting Cyclic Dependencies in Landmark Heuristics. ICAPS 2021: 65-73 - [c102]Augusto B. Corrêa, Guillem Francès, Florian Pommerening, Malte Helmert:
Delete-Relaxation Heuristics for Lifted Classical Planning. ICAPS 2021: 94-102 - [c101]Florian Pommerening, Thomas Keller, Valentina Halasi, Jendrik Seipp, Silvan Sievers, Malte Helmert:
Dantzig-Wolfe Decomposition for Cost Partitioning. ICAPS 2021: 271-280 - 2020
- [j9]Jendrik Seipp, Thomas Keller, Malte Helmert:
Saturated Cost Partitioning for Optimal Classical Planning. J. Artif. Intell. Res. 67: 129-167 (2020) - [c100]Augusto B. Corrêa, Florian Pommerening, Malte Helmert, Guillem Francès:
Lifted Successor Generation Using Query Optimization Techniques. ICAPS 2020: 80-89 - [c99]Salomé Eriksson, Malte Helmert:
Certified Unsolvability for SAT Planning with Property Directed Reachability. ICAPS 2020: 90-100 - [c98]Jendrik Seipp, Samuel von Allmen, Malte Helmert:
Incremental Search for Counterexample-Guided Cartesian Abstraction Refinement. ICAPS 2020: 244-248 - [c97]Patrick Ferber, Malte Helmert, Jörg Hoffmann:
Neural Network Heuristics for Classical Planning: A Study of Hyperparameter Space. ECAI 2020: 2346-2353 - [c96]Silvan Sievers, Florian Pommerening, Thomas Keller, Malte Helmert:
Cost-Partitioned Merge-and-Shrink Heuristics for Optimal Classical Planning. IJCAI 2020: 4152-4160 - [c95]Florian Pommerening, Gabriele Röger, Malte Helmert, Hadrien Cambazard, Louis-Martin Rousseau, Domenico Salvagnin:
Lagrangian Decomposition for Classical Planning (Extended Abstract). IJCAI 2020: 4770-4774 - [c94]Gabriele Röger, Malte Helmert, Jendrik Seipp, Silvan Sievers:
An Atom-Centric Perspective on Stubborn Sets. SOCS 2020: 57-65 - [c93]Nathan R. Sturtevant, Malte Helmert:
A Guide to Budgeted Tree Search. SOCS 2020: 75-81 - [p1]Jörg Hoffmann, Malte Helmert, Daniel Gnad, Florian Pommerening:
Planen. Handbuch der Künstlichen Intelligenz 2020: 395-428
2010 – 2019
- 2019
- [c92]Florian Pommerening, Gabriele Röger, Malte Helmert, Hadrien Cambazard, Louis-Martin Rousseau, Domenico Salvagnin:
Lagrangian Decomposition for Optimal Cost Partitioning. ICAPS 2019: 338-347 - [c91]Alexander Rovner, Silvan Sievers, Malte Helmert:
Counterexample-Guided Abstraction Refinement for Pattern Selection in Optimal Classical Planning. ICAPS 2019: 362-367 - [c90]Jendrik Seipp, Malte Helmert:
Subset-Saturated Cost Partitioning for Optimal Classical Planning. ICAPS 2019: 391-400 - [c89]Malte Helmert, Tor Lattimore, Levi H. S. Lelis, Laurent Orseau, Nathan R. Sturtevant:
Iterative Budgeted Exponential Search. IJCAI 2019: 1249-1257 - [i6]Nathan R. Sturtevant, Malte Helmert:
Exponential-Binary State-Space Search. CoRR abs/1906.02912 (2019) - [i5]Malte Helmert, Tor Lattimore, Levi H. S. Lelis, Laurent Orseau, Nathan R. Sturtevant:
Iterative Budgeted Exponential Search. CoRR abs/1907.13062 (2019) - [i4]Florian Pommerening, Malte Helmert, Blai Bonet:
Higher-Dimensional Potential Heuristics for Optimal Classical Planning. CoRR abs/1909.12142 (2019) - 2018
- [j8]Jendrik Seipp, Malte Helmert:
Counterexample-Guided Cartesian Abstraction Refinement for Classical Planning. J. Artif. Intell. Res. 62: 535-577 (2018) - [c88]Salomé Eriksson, Gabriele Röger, Malte Helmert:
A Proof System for Unsolvable Planning Tasks. ICAPS 2018: 65-73 - [c87]Manuel Heusner, Thomas Keller, Malte Helmert:
Best-Case and Worst-Case Behavior of Greedy Best-First Search. IJCAI 2018: 1463-1470 - [c86]Salomé Eriksson, Gabriele Röger, Malte Helmert:
Inductive Certificates of Unsolvability for Domain-Independent Planning. IJCAI 2018: 5244-5248 - [c85]Manuel Heusner, Thomas Keller, Malte Helmert:
Search Progress and Potentially Expanded States in Greedy Best-First Search. IJCAI 2018: 5269-5273 - 2017
- [c84]Nathan R. Sturtevant, Ariel Felner, Malte Helmert:
Value Compression of Pattern Databases. AAAI 2017: 912-918 - [c83]Florian Pommerening, Malte Helmert, Blai Bonet:
Higher-Dimensional Potential Heuristics for Optimal Classical Planning. AAAI 2017: 3636-3643 - [c82]Jendrik Seipp, Thomas Keller, Malte Helmert:
Narrowing the Gap Between Saturated and Optimal Cost Partitioning for Classical Planning. AAAI 2017: 3651-3657 - [c81]Salomé Eriksson, Gabriele Röger, Malte Helmert:
Unsolvability Certificates for Classical Planning. ICAPS 2017: 88-97 - [c80]Florian Pommerening, Malte Helmert, Blai Bonet:
Abstraction Heuristics, Cost Partitioning and Network Flows. ICAPS 2017: 228-232 - [c79]Jendrik Seipp, Thomas Keller, Malte Helmert:
A Comparison of Cost Partitioning Algorithms for Optimal Classical Planning. ICAPS 2017: 259-268 - [c78]Manuel Heusner, Thomas Keller, Malte Helmert:
Understanding the Search Behaviour of Greedy Best-First Search. SOCS 2017: 47-55 - [c77]Gerald Paul, Gabriele Röger, Thomas Keller, Malte Helmert:
Optimal Solutions to Large Logistics Planning Domain Problems. SOCS 2017: 73-81 - [c76]Silvan Sievers, Martin Wehrle, Malte Helmert, Michael Katz:
Strengthening Canonical Pattern Databases with Structural Symmetries. SOCS 2017: 91-99 - [c75]Malte Helmert, Nathan R. Sturtevant, Ariel Felner:
On Variable Dependencies and Compressed Pattern Databases. SOCS 2017: 129-133 - 2016
- [c74]Silvan Sievers, Martin Wehrle, Malte Helmert:
An Analysis of Merge Strategies for Merge-and-Shrink Heuristics. ICAPS 2016: 294-298 - [c73]Jendrik Seipp, Florian Pommerening, Gabriele Röger, Malte Helmert:
Correlation Complexity of Classical Planning Domains. IJCAI 2016: 3242-3250 - [c72]Martin Wehrle, Silvan Sievers, Malte Helmert:
Graph-Based Factorization of Classical Planning Problems. IJCAI 2016: 3286-3292 - [c71]Gerald Paul, Malte Helmert:
Optimal Solitaire Game Solutions Using A* Search and Deadlock Analysis. SOCS 2016: 135-136 - [e3]Gerhard Friedrich, Malte Helmert, Franz Wotawa:
KI 2016: Advances in Artificial Intelligence - 39th Annual German Conference on AI, Klagenfurt, Austria, September 26-30, 2016, Proceedings. Lecture Notes in Computer Science 9904, Springer 2016, ISBN 978-3-319-46072-7 [contents] - 2015
- [c70]Florian Pommerening, Malte Helmert, Gabriele Röger, Jendrik Seipp:
From Non-Negative to General Operator Cost Partitioning. AAAI 2015: 3335-3341 - [c69]Jendrik Seipp, Silvan Sievers, Malte Helmert, Frank Hutter:
Automatic Configuration of Sequential Planning Portfolios. AAAI 2015: 3364-3370 - [c68]Alexander Shleyfman, Michael Katz, Malte Helmert, Silvan Sievers, Martin Wehrle:
Heuristics and Symmetries in Classical Planning. AAAI 2015: 3371-3377 - [c67]Silvan Sievers, Martin Wehrle, Malte Helmert, Alexander Shleyfman, Michael Katz:
Factored Symmetries for Merge-and-Shrink Abstractions. AAAI 2015: 3378-3385 - [c66]Malte Helmert, Gabriele Röger, Silvan Sievers:
On the Expressive Power of Non-Linear Merge-and-Shrink Representations. ICAPS 2015: 106-114 - [c65]Florian Pommerening, Malte Helmert:
A Normal Form for Classical Planning Tasks. ICAPS 2015: 188-192 - [c64]Jendrik Seipp, Florian Pommerening, Malte Helmert:
New Optimization Functions for Potential Heuristics. ICAPS 2015: 193-201 - [c63]Martin Wehrle, Malte Helmert, Alexander Shleyfman, Michael Katz:
Integrating Partial Order Reduction and Symmetry Elimination for Cost-Optimal Classical Planning. IJCAI 2015: 1712-1718 - [c62]Florian Pommerening, Gabriele Röger, Malte Helmert, Blai Bonet:
Heuristics for Cost-Optimal Classical Planning Based on Linear Programming. IJCAI 2015: 4303-4309 - [c61]Silvan Sievers, Malte Helmert:
A Doppelkopf Player Based on UCT. KI 2015: 151-165 - [c60]Silvan Sievers, Martin Wehrle, Malte Helmert, Michael Katz:
An Empirical Case Study on Symmetry Handling in Cost-Optimal Planning as Heuristic Search. KI 2015: 166-180 - 2014
- [j7]Malte Helmert, Patrik Haslum, Jörg Hoffmann, Raz Nissim:
Merge-and-Shrink Abstraction: A Method for Generating Lower Bounds in Factored State Spaces. J. ACM 61(3): 16:1-16:63 (2014) - [c59]Silvan Sievers, Martin Wehrle, Malte Helmert:
Generalized Label Reduction for Merge-and-Shrink Heuristics. AAAI 2014: 2358-2366 - [c58]Manuel Heusner, Martin Wehrle, Florian Pommerening, Malte Helmert:
Under-Approximation Refinement for Classical Planning. ICAPS 2014 - [c57]Florian Pommerening, Gabriele Röger, Malte Helmert, Blai Bonet:
LP-Based Heuristics for Cost-Optimal Planning. ICAPS 2014 - [c56]Jendrik Seipp, Malte Helmert:
Diverse and Additive Cartesian Abstraction Heuristics. ICAPS 2014 - [c55]Martin Wehrle, Malte Helmert:
Efficient Stubborn Sets: Generalized Algorithms and Selection Strategies. ICAPS 2014 - [c54]Gabriele Röger, Florian Pommerening, Malte Helmert:
Optimal Planning in the Presence of Conditional Effects: Extending LM-Cut with Context Splitting. ECAI 2014: 765-770 - [c53]Silvan Sievers, Martin Wehrle, Malte Helmert:
Bounded Intention Planning Revisited. ECAI 2014: 1097-1098 - [c52]Nathan R. Sturtevant, Ariel Felner, Malte Helmert:
Exploiting the Rubik's Cube 12-Edge PDB by Combining Partial Pattern Databases and Bloom Filters. SOCS 2014: 175-183 - [i3]Jörg Hoffmann, Piergiorgio Bertoli, Malte Helmert, Marco Pistore:
Message-Based Web Service Composition, Integrity Constraints, and Planning under Uncertainty: A New Connection. CoRR abs/1401.3470 (2014) - 2013
- [j6]Carlos Linares López, Sergio Jiménez Celorrio, Malte Helmert:
Automating the evaluation of planning systems. AI Commun. 26(4): 331-354 (2013) - [c51]Jendrik Seipp, Malte Helmert:
Additive Counterexample-Guided Cartesian Abstraction Refinement. AAAI (Late-Breaking Developments) 2013 - [c50]Thomas Keller, Malte Helmert:
Trial-Based Heuristic Tree Search for Finite Horizon MDPs. ICAPS 2013 - [c49]Patrick Eyerich, Malte Helmert:
Stronger Abstraction Heuristics Through Perimeter Search. ICAPS 2013 - [c48]Patrik Haslum, Malte Helmert, Anders Jonsson:
Safe, Strong, and Tractable Relevance Analysis for Planning. ICAPS 2013 - [c47]Florian Pommerening, Malte Helmert:
Incremental LM-Cut. ICAPS 2013 - [c46]Jendrik Seipp, Malte Helmert:
Counterexample-Guided Cartesian Abstraction Refinement. ICAPS 2013 - [c45]Martin Wehrle, Malte Helmert, Yusra Alkhazraji, Robert Mattmüller:
The Relative Pruning Power of Strong Stubborn Sets and Expansion Core. ICAPS 2013 - [c44]Florian Pommerening, Gabriele Röger, Malte Helmert:
Getting the Most Out of Pattern Databases for Classical Planning. IJCAI 2013: 2357-2364 - [c43]Malte Helmert, Gabriele Röger:
SoCS 2013 Organization. SOCS 2013 - [c42]Malte Helmert, Gabriele Röger:
Preface. SOCS 2013 - [e2]Malte Helmert, Gabriele Röger:
Proceedings of the Sixth Annual Symposium on Combinatorial Search, SOCS 2013, Leavenworth, Washington, USA, July 11-13, 2013. AAAI Press 2013, ISBN 978-1-57735-584-7 [contents] - 2012
- [c41]Gabriele Röger, Malte Helmert:
Non-Optimal Multi-Agent Pathfinding Is Solved (Since 1984). MAPF@AAAI 2012 - [c40]Michael Katz, Jörg Hoffmann, Malte Helmert:
How to Relax a Bisimulation? ICAPS 2012 - [c39]Florian Pommerening, Malte Helmert:
Optimal Planning for Delete-Free Tasks with Incremental LM-Cut. ICAPS 2012 - [c38]Jendrik Seipp, Manuel Braun, Johannes Garimort, Malte Helmert:
Learning Portfolios of Automatically Tuned Planners. ICAPS 2012 - [c37]Martin Wehrle, Malte Helmert:
About Partial Order Reduction in Planning and Computer Aided Verification. ICAPS 2012 - [c36]Yusra Alkhazraji, Martin Wehrle, Robert Mattmüller, Malte Helmert:
A Stubborn Set Algorithm for Optimal Planning. ECAI 2012: 891-892 - [c35]Silvan Sievers, Manuela Ortlieb, Malte Helmert:
Efficient Implementation of Pattern Database Heuristics for Classical Planning. SOCS 2012: 49-56 - [c34]Jordan Tyler Thayer, J. Benton, Malte Helmert:
Better Parameter-Free Anytime Search by Minimizing Time Between Solutions. SOCS 2012: 120-128 - [c33]Gabriele Röger, Malte Helmert:
Non-Optimal Multi-Agent Pathfinding is Solved (Since 1984). SOCS 2012: 173-174 - 2011
- [c32]Raz Nissim, Jörg Hoffmann, Malte Helmert:
Computing Perfect Heuristics in Polynomial Time: On Bisimulation and Merge-and-Shrink Abstraction in Optimal Planning. IJCAI 2011: 1983-1990 - [e1]Fahiem Bacchus, Carmel Domshlak, Stefan Edelkamp, Malte Helmert:
Proceedings of the 21st International Conference on Automated Planning and Scheduling, ICAPS 2011, Freiburg, Germany June 11-16, 2011. AAAI 2011 [contents] - [i2]Malte Helmert:
The Fast Downward Planning System. CoRR abs/1109.6051 (2011) - 2010
- [c31]Patrick Eyerich, Thomas Keller, Malte Helmert:
High-Quality Policies for the Canadian Traveler's Problem. AAAI 2010: 51-58 - [c30]Robert Mattmüller, Manuela Ortlieb, Malte Helmert, Pascal Bercher:
Pattern Database Heuristics for Fully Observable Nondeterministic Planning. ICAPS 2010: 105-112 - [c29]Malte Helmert, Hauke Lasinger:
The Scanalyzer Domain: Greenhouse Logistics as a Planning Problem. ICAPS 2010: 234-237 - [c28]Gabriele Röger, Malte Helmert:
The More, the Merrier: Combining Heuristic Estimators for Satisficing Planning. ICAPS 2010: 246-249 - [c27]Blai Bonet, Malte Helmert:
Strengthening Landmark Heuristics via Hitting Sets. ECAI 2010: 329-334 - [c26]Emil Keyder, Silvia Richter, Malte Helmert:
Sound and Complete Landmarks for And/Or Graphs. ECAI 2010: 335-340 - [c25]Malte Helmert, Gabriele Röger:
Relative-Order Abstractions for the Pancake Problem. ECAI 2010: 745-750 - [c24]Malte Helmert:
Landmark Heuristics for the Pancake Problem. SOCS 2010: 109-110 - [c23]Patrick Eyerich, Thomas Keller, Malte Helmert:
High-Quality Policies for the Canadian Traveler's Problem. SOCS 2010: 147-148
2000 – 2009
- 2009
- [j5]Malte Helmert:
Concise finite-domain representations for PDDL planning tasks. Artif. Intell. 173(5-6): 503-535 (2009) - [j4]Jörg Hoffmann, Piergiorgio Bertoli, Malte Helmert, Marco Pistore:
Message-Based Web Service Composition, Integrity Constraints, and Planning under Uncertainty: A New Connection. J. Artif. Intell. Res. 35: 49-117 (2009) - [c22]Dunbo Cai, Jörg Hoffmann, Malte Helmert:
Enhancing the Context-Enhanced Additive Heuristic with Precedence Constraints. ICAPS 2009 - [c21]Malte Helmert, Carmel Domshlak:
Landmarks, Critical Paths and Abstractions: What's the Difference Anyway? ICAPS 2009 - [c20]Silvia Richter, Malte Helmert:
Preferred Operators and Deferred Evaluation in Satisficing Planning. ICAPS 2009 - [c19]Christoph Betz, Malte Helmert:
Planning with h + in Theory and Practice. KI 2009: 9-16 - [c18]Martin Wehrle, Malte Helmert:
The Causal Graph Revisited for Directed Model Checking. SAS 2009: 86-101 - [i1]Malte Helmert, Carmel Domshlak:
Landmarks, Critical Paths and Abstractions: What's the Difference Anyway? Graph Search Engineering 2009 - 2008
- [b1]Malte Helmert:
Understanding Planning Tasks: Domain Complexity and Heuristic Decomposition. University of Freiburg, Lecture Notes in Computer Science 4929, Springer 2008, ISBN 978-3-540-77722-9, pp. 1-270 - [c17]Malte Helmert, Robert Mattmüller:
Accuracy of Admissible Heuristic Functions in Selected Planning Domains. AAAI 2008: 938-943 - [c16]Malte Helmert, Gabriele Röger:
How Good is Almost Perfect?. AAAI 2008: 944-949 - [c15]Silvia Richter, Malte Helmert, Matthias Westphal:
Landmarks Revisited. AAAI 2008: 975-982 - [c14]Malte Helmert, Patrik Haslum, Jörg Hoffmann:
Explicit-State Abstraction: A New Method for Generating Heuristic Functions. AAAI 2008: 1547-1550 - [c13]Malte Helmert, Hector Geffner:
Unifying the Causal Graph and Additive Heuristics. ICAPS 2008: 140-147 - [c12]Gabriele Röger, Malte Helmert, Bernhard Nebel:
On the Relative Expressiveness of ADL and Golog: The Last Piece in the Puzzle. KR 2008: 544-550 - 2007
- [c11]Patrik Haslum, Adi Botea, Malte Helmert, Blai Bonet, Sven Koenig:
Domain-Independent Construction of Pattern Database Heuristics for Cost-Optimal Planning. AAAI 2007: 1007-1012 - [c10]Malte Helmert, Patrik Haslum, Jörg Hoffmann:
Flexible Abstraction Heuristics for Optimal Sequential Planning. ICAPS 2007: 176-183 - [c9]Silvia Richter, Malte Helmert, Charles Gretton:
A Stochastic Local Search Approach to Vertex Cover. KI 2007: 412-426 - 2006
- [j3]Malte Helmert:
The Fast Downward Planning System. J. Artif. Intell. Res. 26: 191-246 (2006) - [c8]Malte Helmert:
New Complexity Results for Classical Planning Benchmarks. ICAPS 2006: 52-62 - [c7]Malte Helmert, Robert Mattmüller, Sven Schewe:
Selective Approaches for Solving Weak Games. ATVA 2006: 200-214 - [c6]Sebastian Kupferschmid, Malte Helmert:
A Skat Player Based on Monte-Carlo Simulation. Computers and Games 2006: 135-147 - [c5]Malte Helmert, Robert Mattmüller, Gabriele Röger:
Aproximation Properties of Planning Benchmarks. ECAI 2006: 585-589 - 2004
- [c4]Malte Helmert:
A Planning Heuristic Based on Causal Graph Analysis. ICAPS 2004: 161-170 - 2003
- [j2]Malte Helmert:
Complexity results for standard benchmark domains in planning. Artif. Intell. 143(2): 219-262 (2003) - 2002
- [c3]Malte Helmert:
Decidability and Undecidability Results for Planning with Numerical State Variables. AIPS 2002: 44-53 - [c2]Malte Helmert:
Decidability and Undecidability Results for Planning with Numerical State Variables. PuK 2002 - 2001
- [j1]Stefan Edelkamp, Malte Helmert:
MIPS: The Model-Checking Integrated Planning System. AI Mag. 22(3): 67-72 (2001)
1990 – 1999
- 1999
- [c1]Stefan Edelkamp, Malte Helmert:
Exhibiting Knowledge in Planning Problems to Minimize State Encoding Length. ECP 1999: 135-147
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-21 00:18 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
