On the public citation graph

Improving Delete Relaxation Heuristics Through Explicitly Represented Conjunctions

0 signed · 54 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/3-540-63912-8_88openalex-snapshot
Combining the expressivity of UCPOP with the efficiency of Graphplan
inferredcites →https://doi.org/10.1016/0004-3702(94)90081-7openalex-snapshot
The computational complexity of propositional STRIPS planning
inferredcites →https://doi.org/10.1016/s0004-3702(01)00108-4openalex-snapshot
Planning as heuristic search
inferredcites →https://doi.org/10.1609/aimag.v21i4.1536openalex-snapshot
Admissible heuristics for optimal planning
inferredcites →https://doi.org/10.1609/icaps.v19i1.13342openalex-snapshot
Enhancing the Context-Enhanced Additive Heuristic with Precedence Constraints
inferredcites →https://doi.org/10.1609/icaps.v19i1.13364openalex-snapshot
Improving Planning Performance Using Low-Conflict Relaxed Plans
inferredcites →https://doi.org/10.1609/icaps.v19i1.13370openalex-snapshot
Landmarks, Critical Paths and Abstractions: What's the Difference Anyway?
inferredcites →https://doi.org/10.1609/icaps.v19i1.13379openalex-snapshot
Automatic Derivation of Memoryless Policies and Finite-State Controllers Using Classical Planners
inferredcites →https://doi.org/10.1609/icaps.v19i1.13384openalex-snapshot
hm(P) = h1(Pm): Alternative Characterisations of the Generalisation From hmax To hm
inferredcites →https://doi.org/10.1609/icaps.v22i1.13496openalex-snapshot
Semi-Relaxed Plan Heuristics
inferredcites →https://doi.org/10.1609/icaps.v22i1.13511openalex-snapshot
Incremental Lower Bounds for Additive Cost Planning Problems
inferredcites →https://doi.org/10.1609/icaps.v23i1.13548openalex-snapshot
Who Said We Need to Relax All Variables?
inferredcites →https://doi.org/10.1613/jair.1183openalex-snapshot
Planning Through Stochastic Local Search and Temporal Action Graphs in LPG
inferredcites →https://doi.org/10.1613/jair.855openalex-snapshot
The FF Planning System: Fast Plan Generation Through Heuristic Search
inferredcites →https://doi.org/10.3233/978-1-58603-891-5-588openalex-snapshot
Heuristics for Planning with Action Costs Revisited
inferredcites →https://doi.org/10.3233/978-1-60750-606-5-329openalex-snapshot
Strengthening Landmark Heuristics via Hitting Sets
inferredcites →https://doi.org/10.3233/978-1-60750-606-5-335openalex-snapshot
Sound and Complete Landmarks for And/Or Graphs
inferredcites →https://doi.org/10.3233/978-1-61499-419-0-765openalex-snapshot
Optimal Planning in the Presence of Conditional Effects: Extending LM-Cut with Context Splitting

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/s10514-018-9703-zopenalex-snapshot
AMPLE: an anytime planning and execution framework for dynamic and uncertain problems in robotics
inferred← citeshttps://doi.org/10.1007/s13218-015-0409-5openalex-snapshot
Search Challenges in Natural Language Generation with Complex Optimization Objectives
inferred← citeshttps://doi.org/10.1016/j.artint.2014.12.008openalex-snapshot
Red–black planning: A new systematic approach to partial delete relaxation
inferred← citeshttps://doi.org/10.1016/j.artint.2016.12.002openalex-snapshot
State space search nogood learning: Online refinement of critical-path dead-end detectors in planning
inferred← citeshttps://doi.org/10.1016/j.artint.2022.103789openalex-snapshot
Gradient-based mixed planning with symbolic and numeric action parameters
inferred← citeshttps://doi.org/10.1109/ictai50040.2020.00025openalex-snapshot
Configurable Heuristic Adaptation for Improving Best First Search in AI Planning
inferred← citeshttps://doi.org/10.1142/s2301385021500151openalex-snapshot
A Survey of Motion and Task Planning Techniques for Unmanned Multicopter Systems
inferred← citeshttps://doi.org/10.11606/d.45.2017.tde-04072017-095306openalex-snapshot
Planejamento probabilístico com becos sem saída
inferred← citeshttps://doi.org/10.1515/9783111386690-004openalex-snapshot
513 Planen
inferred← citeshttps://doi.org/10.1609/aaai.v30i1.10062openalex-snapshot
Towards Clause-Learning State Space Search: Learning to Recognize Dead-Ends
inferred← citeshttps://doi.org/10.1609/aaai.v32i1.12093openalex-snapshot
Semi-Black Box: Rapid Development of Planning Based Solutions
inferred← citeshttps://doi.org/10.1609/icaps.v25i1.13702openalex-snapshot
Explicit Conjunctions without Compilation: Computing hFF(PiC) in Polynomial Time
inferred← citeshttps://doi.org/10.1609/icaps.v27i1.13801openalex-snapshot
Complete Local Search: Boosting Hill-Climbing through Online Relaxation Refinement
inferred← citeshttps://doi.org/10.1609/icaps.v27i1.13805openalex-snapshot
Beyond Red-Black Planning: Limited-Memory State Variables
inferred← citeshttps://doi.org/10.1609/icaps.v27i1.13818openalex-snapshot
Unsolvability Certificates for Classical Planning
inferred← citeshttps://doi.org/10.1609/icaps.v27i1.13819openalex-snapshot
Adapting Novelty to Classical Planning as Heuristic Search
inferred← citeshttps://doi.org/10.1609/icaps.v28i1.13899openalex-snapshot
A Proof System for Unsolvable Planning Tasks
inferred← citeshttps://doi.org/10.1609/icaps.v30i1.6652openalex-snapshot
A Novel Lookahead Strategy for Delete Relaxation Heuristics in Greedy Best-First Search
inferred← citeshttps://doi.org/10.1609/icaps.v34i1.31478openalex-snapshot
Towards Feasible Higher-Dimensional Potential Heuristics
inferred← citeshttps://doi.org/10.1609/socs.v6i1.18349openalex-snapshot
Red-Black Planning: A New Tractability Analysis and Heuristic Function
inferred← citeshttps://doi.org/10.1609/socs.v7i1.18391openalex-snapshot
Partial Delete Relaxation, Unchained: On Intractable Red-Black Planning and Its Applications
inferred← citeshttps://doi.org/10.1609/socs.v8i1.18430openalex-snapshot
Ranking Conjunctions for Partial Delete Relaxation Heuristics in Planning
inferred← citeshttps://doi.org/10.1609/socs.v9i1.18447openalex-snapshot
Online Refinement of Cartesian Abstraction Heuristics
inferred← citeshttps://doi.org/10.1609/socs.v9i1.18460openalex-snapshot
Making Hill-Climbing Great Again through Online Relaxation Refinement and Novelty Pruning
inferred← citeshttps://doi.org/10.1613/jair.1.11217openalex-snapshot
Counterexample-Guided Cartesian Abstraction Refinement for Classical Planning
inferred← citeshttps://doi.org/10.1613/jair.1.13153openalex-snapshot
Online Relaxation Refinement for Satisficing Planning: On Partial Delete Relaxation, Complete Hill-Climbing, and Novelty Pruning
inferred← citeshttps://doi.org/10.1613/jair.4936openalex-snapshot
On a Practical, Integer-Linear Programming Model for Delete-Free Tasks and its Use as a Heuristic for Cost-Optimal Planning
inferred← citeshttps://doi.org/10.1613/jair.5057openalex-snapshot
Combining the Delete Relaxation with Critical-Path Heuristics: A Direct Characterization
inferred← citeshttps://doi.org/10.24963/ijcai.2017/612openalex-snapshot
Landmarks for Numeric Planning Problems
inferred← citeshttps://doi.org/10.24963/ijcai.2017/738openalex-snapshot
Towards Certified Unsolvability in Classical Planning
inferred← citeshttps://doi.org/10.24963/ijcai.2018/660openalex-snapshot
Unchaining the Power of Partial Delete Relaxation, Part II: Finding Plans with Red-Black State Space Search
inferred← citeshttps://doi.org/10.24963/ijcai.2018/672openalex-snapshot
LP Heuristics over Conjunctions: Compilation, Convergence, Nogood Learning
inferred← citeshttps://doi.org/10.24963/ijcai.2021/567openalex-snapshot
Polynomial-Time in PDDL Input Size: Making the Delete Relaxation Feasible for Lifted Planning
inferred← citeshttps://doi.org/10.24963/ijcai.2021/576openalex-snapshot
The Fewer the Merrier: Pruning Preferred Operators with Novelty
inferred← citeshttps://doi.org/10.24963/ijcai.2023/782openalex-snapshot
Gradient-Based Mixed Planning with Symbolic and Numeric Action Parameters (Extended Abstract)
inferred← citeshttps://doi.org/10.5451/unibas-ep45249openalex-snapshot
Correlation Complexity of Classical Planning Domains
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.