default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDPatrik Haslum
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c47]Ruiqi Li, Leyang Cui, Songtuan Lin, Patrik Haslum:
NaRuto: Automatically Acquiring Planning Models from Narrative Texts. AAAI 2024: 20194-20202- [c46]Pascal Bercher, Patrik Haslum, Christian Muise:
A Survey on Plan Optimization. IJCAI 2024: 7941-7950 - 2023
- [j15]Patrik Haslum, Ryan Xiao Wang
:
Maximisation of Admissible Multi-Objective Heuristics. J. Artif. Intell. Res. 78: 619-639 (2023) - [c45]Ruiqi Li, Patrik Haslum, Leyang Cui:
Towards Learning Action Models from Narrative Text Through Extraction and Ordering of Structured Events. AI (2) 2023: 16-27 - [c44]Ruiqi Li, Patrik Haslum, Leyang Cui:
EDeR: Towards Understanding Dependency Relations Between Events. EMNLP 2023: 14969-14983 - [i6]Ruiqi Li, Patrik Haslum, Leyang Cui:
EDeR: A Dataset for Exploring Dependency Relations Between Events. CoRR abs/2304.01612 (2023) - [i5]Ruiqi Li, Leyang Cui, Songtuan Lin, Patrik Haslum:
Automated Action Model Acquisition from Narrative Texts. CoRR abs/2307.10247 (2023) - [i4]Alban Grastien, Patrik Haslum, Sylvie Thiébaux:
A More General Theory of Diagnosis from First Principles. CoRR abs/2309.16180 (2023) - 2022
- [c43]Florian Geißer, Patrik Haslum, Sylvie Thiébaux, Felipe W. Trevizan:
Admissible Heuristics for Multi-Objective Planning. ICAPS 2022: 100-109 - 2021
- [c42]Ruiqi Li, Hua Hua, Patrik Haslum, Jochen Renz:
Unsupervised Novelty Characterization in Physical Environments Using Qualitative Spatial Relations. KR 2021: 454-464 - 2020
- [j14]Enrico Scala, Patrik Haslum, Sylvie Thiébaux, Miquel Ramírez:
Subgoaling Techniques for Satisficing and Optimal Numeric Planning. J. Artif. Intell. Res. 68: 691-752 (2020)
2010 – 2019
- 2019
- [b2]Patrik Haslum, Nir Lipovetzky, Daniele Magazzeni, Christian Muise:
An Introduction to the Planning Domain Definition Language. Synthesis Lectures on Artificial Intelligence and Machine Learning, Morgan & Claypool Publishers 2019, ISBN 978-3-031-00456-8 - [j13]Jing Cui, Patrik Haslum:
Dynamic Controllability of Controllable Conditional Temporal Problems with Uncertainty. J. Artif. Intell. Res. 64: 445-495 (2019) - [c41]Franc Ivankovic, Dan Gordon, Patrik Haslum:
Planning with Global State Constraints and State-Dependent Action Costs. ICAPS 2019: 232-236 - 2018
- [j12]Patrik Haslum, Franc Ivankovic, Miquel Ramírez, Dan Gordon, Sylvie Thiébaux, Vikas Shivashankar, Dana S. Nau:
Extending Classical Planning with State Constraints: Heuristics and Search for Optimal Planning. J. Artif. Intell. Res. 62: 373-431 (2018) - [c40]Tony Allard, Charles Gretton, Patrik Haslum:
A TIL-Relaxed Heuristic for Planning with Time Windows. ICAPS 2018: 2-10 - [c39]Dongxu Li, Enrico Scala, Patrik Haslum, Sergiy Bogomolov:
Effect-Abstraction Based Relaxation for Linear Numeric Planning. IJCAI 2018: 4787-4793 - [c38]Felipe W. Trevizan, Sylvie Thiébaux, Patrik Haslum:
Operator Counting Heuristics for Probabilistic Planning. IJCAI 2018: 5384-5388 - 2017
- [j11]Peng Yu, Brian Charles Williams, Cheng Fang, Jing Cui, Patrik Haslum:
Resolving Over-Constrained Temporal Problems with Uncertainty through Conflict-Directed Relaxation. J. Artif. Intell. Res. 60: 425-490 (2017) - [c37]Jing Cui, Patrik Haslum:
Dynamic Controllability of Controllable Conditional Temporal Problems with Uncertainty. ICAPS 2017: 61-69 - [c36]Felipe W. Trevizan, Sylvie Thiébaux, Patrik Haslum:
Occupation Measure Heuristics for Probabilistic Planning. ICAPS 2017: 306-315 - [c35]Enrico Scala, Patrik Haslum, Daniele Magazzeni, Sylvie Thiébaux:
Landmarks for Numeric Planning Problems. IJCAI 2017: 4384-4390 - [i3]Miquel Ramírez, Enrico Scala, Patrik Haslum, Sylvie Thiébaux:
Numerical Integration and Dynamic Discretization in Heuristic Search Planning over Hybrid Domains. CoRR abs/1703.04232 (2017) - 2016
- [c34]Jeanette Daum, Álvaro Torralba, Jörg Hoffmann, Patrik Haslum, Ingo Weber:
Practical Undoability Checking via Contingent Planning. ICAPS 2016: 106-114 - [c33]Enrico Scala, Miquel Ramírez, Patrik Haslum, Sylvie Thiébaux:
Numeric Planning with Disjunctive Global Constraints via SMT. ICAPS 2016: 276-284 - [c32]Enrico Scala, Patrik Haslum, Sylvie Thiébaux, Miquel Ramírez:
Interval-Based Relaxation for General Numeric Planning. ECAI 2016: 655-663 - [c31]Enrico Scala, Patrik Haslum, Sylvie Thiébaux:
Heuristics for Numeric Planning via Subgoaling. IJCAI 2016: 3228-3234 - 2015
- [j10]Fazlul Hasan Siddiqui, Patrik Haslum:
Continuing Plan Quality Optimisation. J. Artif. Intell. Res. 54: 369-435 (2015) - [c30]Jing Cui, Peng Yu, Cheng Fang, Patrik Haslum, Brian Charles Williams:
Optimising Bounds in Simple Temporal Networks with Uncertainty under Dynamic Controllability Constraints. ICAPS 2015: 52-60 - [c29]Erez Karpas, David Wang, Brian Charles Williams, Patrik Haslum:
Temporal Landmarks: What Must Happen, and When. ICAPS 2015: 138-146 - [c28]Franc Ivankovic, Patrik Haslum:
Optimal Planning with Axioms. IJCAI 2015: 1580-1586 - [e1]Ronen I. Brafman, Carmel Domshlak, Patrik Haslum, Shlomo Zilberstein:
Proceedings of the Twenty-Fifth International Conference on Automated Planning and Scheduling, ICAPS 2015, Jerusalem, Israel, June 7-11, 2015. AAAI Press 2015, ISBN 978-1-57735-731-5 [contents] - 2014
- [j9]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) - [j8]Emil Ragip Keyder, Jörg Hoffmann, Patrik Haslum:
Improving Delete Relaxation Heuristics Through Explicitly Represented Conjunctions. J. Artif. Intell. Res. 50: 487-533 (2014) - [j7]Blai Bonet, Patrik Haslum, Victor Khomenko, Sylvie Thiébaux, Walter Vogler:
Recent advances in unfolding technique. Theor. Comput. Sci. 551: 84-101 (2014) - [c27]Franc Ivankovic, Patrik Haslum, Sylvie Thiébaux, Vikas Shivashankar, Dana S. Nau:
Optimal Planning with Global Numerical State Constraints. ICAPS 2014 - [i2]Patrik Haslum:
Narrative Planning: Compilations to Classical Planning. CoRR abs/1401.5856 (2014) - 2013
- [c26]Patrik Haslum:
Heuristics for Bounded-Cost Search. ICAPS 2013 - [c25]Patrik Haslum, Malte Helmert, Anders Jonsson:
Safe, Strong, and Tractable Relevance Analysis for Planning. ICAPS 2013 - [c24]Patrik Haslum:
Optimal Delete-Relaxed (and Semi-Relaxed) Planning with Conditional Effects. IJCAI 2013: 2291-2297 - [c23]Fazlul Hasan Siddiqui, Patrik Haslum:
Plan Quality Optimisation via Block Decomposition. IJCAI 2013: 2387-2393 - 2012
- [j6]Vikas Agrawal, Jorge A. Baier, Kostas E. Bekris, Yiling Chen, Artur S. d'Avila Garcez, Pascal Hitzler, Patrik Haslum, Dietmar Jannach, Edith Law, Freddy Lécué, Luís C. Lamb, Cynthia Matuszek, Héctor Palacios, Biplav Srivastava, Lokendra Shastri, Nathan R. Sturtevant, Roni Stern, Stefanie Tellex, Stavros Vassos:
Reports of the AAAI 2012 Conference Workshops. AI Mag. 33(4): 119- (2012) - [j5]Patrik Haslum:
Narrative Planning: Compilations to Classical Planning. J. Artif. Intell. Res. 44: 383-395 (2012) - [c22]Emil Ragip Keyder, Jörg Hoffmann, Patrik Haslum:
Semi-Relaxed Plan Heuristics. AAAI 2012: 2126-2128 - [c21]Patrik Haslum:
Incremental Lower Bounds for Additive Cost Planning Problems. ICAPS 2012 - [c20]Patrik Haslum, John K. Slaney, Sylvie Thiébaux:
Minimal Landmarks for Optimal Delete-Free Planning. ICAPS 2012 - [c19]Emil Ragip Keyder, Jörg Hoffmann, Patrik Haslum:
Semi-Relaxed Plan Heuristics. ICAPS 2012 - [c18]Fazlul Hasan Siddiqui, Patrik Haslum:
Block-Structured Plan Deordering. Australasian Conference on Artificial Intelligence 2012: 803-814 - [c17]Alban Grastien, Patrik Haslum, Sylvie Thiébaux:
Conflict-Based Diagnosis of Discrete Event Systems: Theory and Practice. KR 2012 - 2011
- [c16]Debdeep Banerjee, Patrik Haslum:
Partial-Order Support-Link Scheduling. ICAPS 2011 - [i1]Patrik Haslum:
Improving Heuristics Through Relaxed Search - An Analysis of TP4 and HSP*a in the 2004 Planning Competition. CoRR abs/1109.5750 (2011) - 2010
- [c15]Eric Fabre, Loïg Jezequel, Patrik Haslum, Sylvie Thiébaux:
Cost-Optimal Factored Planning: Promises and Pitfalls. ICAPS 2010: 65-72 - [c14]Andreas Bauer, Patrik Haslum:
LTL Goal Specifications Revisited. ECAI 2010: 881-886
2000 – 2009
- 2009
- [j4]Alfonso Gerevini, Patrik Haslum, Derek Long, Alessandro Saetti, Yannis Dimopoulos:
Deterministic planning in the fifth international planning competition: PDDL3 and experimental evaluation of the planners. Artif. Intell. 173(5-6): 619-668 (2009) - [c13]Patrik Haslum:
hm(P) = h1(Pm): Alternative Characterisations of the Generalisation From hmax To hm. ICAPS 2009 - 2008
- [j3]Blai Bonet, Patrik Haslum, Sarah L. Hickmott, Sylvie Thiébaux:
Directed Unfolding of Petri Nets. Trans. Petri Nets Other Model. Concurr. 1: 172-198 (2008) - [c12]Malte Helmert, Patrik Haslum, Jörg Hoffmann:
Explicit-State Abstraction: A New Method for Generating Heuristic Functions. AAAI 2008: 1547-1550 - [c11]Patrik Haslum:
A New Approach to Tractable Planning. ICAPS 2008: 132-139 - 2007
- [c10]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 - [c9]Malte Helmert, Patrik Haslum, Jörg Hoffmann:
Flexible Abstraction Heuristics for Optimal Sequential Planning. ICAPS 2007: 176-183 - [c8]Patrik Haslum:
Reducing Accidental Complexity in Planning Problems. IJCAI 2007: 1898-1903 - 2006
- [b1]Patrik Haslum:
Admissible Heuristics for Automated Planning. Linköping University, Sweden, 2006 - [j2]Patrik Haslum:
Improving Heuristics Through Relaxed Search - An Analysis of TP4 and HSP*a in the 2004 Planning Competition. J. Artif. Intell. Res. 25: 233-267 (2006) - 2005
- [c7]Patrik Haslum, Blai Bonet, Hector Geffner:
New Admissible Heuristics for Domain-Independent Planning. AAAI 2005: 1163-1168 - 2004
- [c6]Patrick Doherty, Patrik Haslum, Fredrik Heintz, T. Merz, Per Nyblom, T. Persson, B. Wingman:
A Distributed Architecture for Autonomous Unmanned Aerial Vehicle Experimentation. DARS 2004: 233-242 - [c5]Patrik Haslum:
Improving Heuristics Through Search. ECAI 2004: 1031-1032 - 2000
- [j1]Peter Jonsson, Patrik Haslum, Christer Bäckström:
Towards efficient universal planning: A randomized approach. Artif. Intell. 117(1): 1-29 (2000) - [c4]Patrik Haslum, Hector Geffner:
Admissible Heuristics for Optimal Planning. AIPS 2000: 140-149 - [c3]Patrik Haslum, Peter Jonsson:
Planning with Reduced Operator Sets. AIPS 2000: 150-158 - [c2]Jonas Kvarnström, Patrick Doherty, Patrik Haslum:
Extending TALplanner with Concurrency and Resources. ECAI 2000: 501-505
1990 – 1999
- 1999
- [c1]Patrik Haslum, Peter Jonsson:
Some Results on the Complexity of Planning with Incomplete Information. ECP 1999: 308-318
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 2024-10-21 20:33 CEST 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:
